WG 2004 : graph-theoretic concepts in computer science (Bad Honnef, 21-23 June 2004, revised papers)Hromkovic, Juraj; Nagl, Manfred; Westfechtel, Bernhard et al.Lecture notes in computer science. 2004, issn 0302-9743, isbn 3-540-24132-9, XI, 404 p, isbn 3-540-24132-9Conference Proceedings

Coloring a graph using split decompositionRAO, Michaël.Lecture notes in computer science. 2004, pp 129-141, issn 0302-9743, isbn 3-540-24132-9, 13 p.Conference Paper

Crossing reduction in circular layoutsBAUR, Michael; BRANDES, Ulrik.Lecture notes in computer science. 2004, pp 332-343, issn 0302-9743, isbn 3-540-24132-9, 12 p.Conference Paper

Tolerance based algorithms for the ATSPGOLDENGORINL, Boris; SIERKSMA, Gerard; TURKENSTEEN, Marcel et al.Lecture notes in computer science. 2004, pp 222-234, issn 0302-9743, isbn 3-540-24132-9, 13 p.Conference Paper

Decremental clique problemGRANDONI, Fabrizio; ITALIANO, Giuseppe F.Lecture notes in computer science. 2004, pp 142-153, issn 0302-9743, isbn 3-540-24132-9, 12 p.Conference Paper

Edge-connectivity augmentation and network matricesCONFORTI, Michele; GALLUCCIO, Anna; PROIETTI, Guido et al.Lecture notes in computer science. 2004, pp 355-364, issn 0302-9743, isbn 3-540-24132-9, 10 p.Conference Paper

Core stability of minimum coloring gamesBIETENHADER, Thomas; OKAMOTO, Yoshio.Lecture notes in computer science. 2004, pp 389-401, issn 0302-9743, isbn 3-540-24132-9, 13 p.Conference Paper

A graph-theoretic generalization of the least common subsumer and the most specific concept in the description logic εLBAADER, Franz.Lecture notes in computer science. 2004, pp 177-188, issn 0302-9743, isbn 3-540-24132-9, 12 p.Conference Paper

Finding k disjoint triangles in an arbitrary graphFELLOWS, Mike; HEGGERNES, Pinar; ROSAMOND, Frances et al.Lecture notes in computer science. 2004, pp 235-244, issn 0302-9743, isbn 3-540-24132-9, 10 p.Conference Paper

Computing bounded-degree phylogenetic roots of disconnected graphsCHEN, Zhi-Zhong; TSUKIJI, Tatsuie.Lecture notes in computer science. 2004, pp 308-319, issn 0302-9743, isbn 3-540-24132-9, 12 p.Conference Paper

Constant time generation of trees with specified diameterNAKANO, Shin-Ichi; UNO, Takeaki.Lecture notes in computer science. 2004, pp 33-45, issn 0302-9743, isbn 3-540-24132-9, 13 p.Conference Paper

Fully-dynamic recognition algorithm and certificate for directed cographsCRESPELLE, Christophe; PAUL, Christophe.Lecture notes in computer science. 2004, pp 93-104, issn 0302-9743, isbn 3-540-24132-9, 12 p.Conference Paper

Linear kernels in linear time, or how to save k colors in O(n²) stepsCHOR, Benny; FELLOWS, Mike; JUEDES, David et al.Lecture notes in computer science. 2004, pp 257-269, issn 0302-9743, isbn 3-540-24132-9, 13 p.Conference Paper

A robust PTAS for maximum weight independent sets in unit disk graphsNIEBERG, Tim; HURINK, Johann; KERN, Walter et al.Lecture notes in computer science. 2004, pp 214-221, issn 0302-9743, isbn 3-540-24132-9, 8 p.Conference Paper

A symbolic approach to the all-pairs shortest-paths problemSAWITZKI, Daniel.Lecture notes in computer science. 2004, pp 154-167, issn 0302-9743, isbn 3-540-24132-9, 14 p.Conference Paper

Recognizing HHD-free and welsh-powell opposition graphsNIKOLOPOULOS, Stavros D; PALIOS, Leonidas.Lecture notes in computer science. 2004, pp 105-116, issn 0302-9743, isbn 3-540-24132-9, 12 p.Conference Paper

The hypocoloring problem: Complexity and approximability results when the chromatic number is smallDE WERRA, Dominique; DEMANGE, Marc; MONNOT, Jerome et al.Lecture notes in computer science. 2004, pp 377-388, issn 0302-9743, isbn 3-540-24132-9, 12 p.Conference Paper

On the Maximum Cardinality Search lower bound for treewidthBODLAENDER, Hans L; KOSTER, Arie M. C. A.Lecture notes in computer science. 2004, pp 81-92, issn 0302-9743, isbn 3-540-24132-9, 12 p.Conference Paper

Exact (exponential) algorithms for the dominating set problemFOMIN, Fedor V; KRATSCH, Dieter; WOEGINGER, Gerhard J et al.Lecture notes in computer science. 2004, pp 245-256, issn 0302-9743, isbn 3-540-24132-9, 12 p.Conference Paper

Planar graphs, via well-orderly maps and treesBONICHON, Nicolas; GAVOILLE, Cyril; HANUSSE, Nicolas et al.Lecture notes in computer science. 2004, pp 270-284, issn 0302-9743, isbn 3-540-24132-9, 15 p.Conference Paper

Octagonal drawings of plane graphs with prescribed face areasSAIDUR RAHMAN, Md; MIURA, Kazuyuki; NISHIZEKI, Takao et al.Lecture notes in computer science. 2004, pp 320-331, issn 0302-9743, isbn 3-540-24132-9, 12 p.Conference Paper

Treelike comparability graphs: Characterization, recognition, and applicationsCORNELSEN, Sabine; DI STEFANO, Gabriele.Lecture notes in computer science. 2004, pp 46-57, issn 0302-9743, isbn 3-540-24132-9, 12 p.Conference Paper

Unhooking circulant graphs: A combinatorial method for counting spanning trees and other parametersGOLIN, Mordecai J; YIU CHO LEUNG.Lecture notes in computer science. 2004, pp 296-307, issn 0302-9743, isbn 3-540-24132-9, 12 p.Conference Paper

WG 2003 : graph-theoretic concepts in computer science (Elspeet, 19-21 June 2003, revised papers)Bodlaender, Hans L.Lecture notes in computer science. 2003, issn 0302-9743, isbn 3-540-20452-0, XI, 386 p, isbn 3-540-20452-0Conference Proceedings

Minimum flow time graph orderingARBIB, Claudio; FLAMMINI, Michele; MARINELLI, Fabrizio et al.Lecture notes in computer science. 2003, pp 23-33, issn 0302-9743, isbn 3-540-20452-0, 11 p.Conference Paper