Graph-theoretic concepts in computer science. 30th international workshop, WG 2004, Bad Honnef, Germany, June 21--23, 2004. Revised papers. (Q2488055)

The articles of this volume will be reviewed individually. The preceding workshop has been reviewed (see Zbl 1029.00043). Indexed articles: \textit{Corneil, Derek G.}, Lexicographic breadth first search -- a survey, 1-19 [Zbl 1112.68414] \textit{Wattenhofer, Roger}, Wireless networking: Graph theory unplugged, 20-32 [Zbl 1112.68432] \textit{Nakano, Shin-ichi; Uno, Takeaki}, Constant time generation of trees with specified diameter, 33-45 [Zbl 1112.68426] \textit{Cornelsen, Sabine; Di Stefano, Gabriele}, Treelike comparability graphs: Characterization, recognition, and applications, 46-57 [Zbl 1112.68415] \textit{Fiala, Jiří; Golovach, Petr A.; Kratochvíl, Jan}, Elegant distance constrained labelings of trees, 58-67 [Zbl 1112.68419] \textit{Dragan, Feodor F.; Yan, Chenyu; Corneil, Derek G.}, Collective tree spanners and routing in AT-free related graphs, 68-80 [Zbl 1112.68417] \textit{Bodlaender, Hans L.; Koster, Arie M. C. A.}, On the maximum cardinality search lower bound for treewidth, 81-92 [Zbl 1112.68409] \textit{Crespelle, Christophe; Paul, Christophe}, Fully-dynamic recognition algorithm and certificate for directed cographs, 93-104 [Zbl 1112.68416] \textit{Nikolopoulos, Stavros D.; Palios, Leonidas}, Recognizing HHD-free and Welsh-Powell opposition graphs, 105-116 [Zbl 1112.68428] \textit{Fouquet, Jean-Luc; Habib, Michel; de Montgolfier, Fabien; Vanherpe, Jean-Marie}, Bimodular decomposition of bipartite graphs, 117-128 [Zbl 1112.68421] \textit{Rao, Michaël}, Coloring a graph using split decomposition, 129-141 [Zbl 1112.68430] \textit{Grandoni, Fabrizio; Italiano, Giuseppe F.}, Decremental clique problem, 142-153 [Zbl 1112.68422] \textit{Sawitzki, Daniel}, A symbolic approach to the all-pairs shortest-paths problem, 154-167 [Zbl 1112.68431] \textit{Moreno, Eduardo; Matamala, Martín}, Minimal de Bruijn sequence in a language with forbidden substrings, 168-176 [Zbl 1112.68425] \textit{Baader, Franz}, A graph-theoretic generalization of the least common subsumer and the most specific concept in the description logic \(\mathcal{EL}\), 177-188 [Zbl 1112.68407] \textit{Broersma, Hajo J.; Paulusma, Daniel; Smit, Gerard J. M.; Vlaardingerbroek, Frank; Woeginger, Gerhard J.}, The computational complexity of the minimum weight processor assignment problem, 189-200 [Zbl 1112.68411] \textit{Apollonio, Nicola; Caramia, Massimiliano; Italiano, Giuseppe F.}, A stochastic location problem with applications to tele-diagnostic, 201-213 [Zbl 1112.68406] \textit{Nieberg, Tim; Hurink, Johann; Kern, Walter}, A robust PTAS for maximum weight independent sets in unit disk graphs, 214-221 [Zbl 1112.68427] \textit{Goldengorin, Boris; Sierksma, Gerard; Turkensteen, Marcel}, Tolerance based algorithms for the ATSP, 222-234 [Zbl 1112.90376] \textit{Fellows, Mike; Heggernes, Pinar; Rosamond, Frances; Sloper, Christian; Telle, Jan Arne}, Finding \(k\) disjoint triangles in an arbitrary graph, 235-244 [Zbl 1112.68418] \textit{Fomin, Fedor V.; Kratsch, Dieter; Woeginger, Gerhard J.}, Exact (exponential) algorithms for the dominating set problem, 245-256 [Zbl 1112.68420] \textit{Chor, Benny; Fellows, Mike; Juedes, David}, Linear kernels in linear time, or how to save \(k\) colors in \(O(n^{2})\) steps, 257-269 [Zbl 1112.68412] \textit{Bonichon, Nicolas; Gavoille, Cyril; Hanusse, Nicolas; Poulalhon, Dominique; Schaeffer, Gilles}, Planar graphs, via well-orderly maps and trees, 270-284 [Zbl 1112.68410] \textit{Brimkov, Valentin E.; Barneva, Reneta P.; Klette, Reinhard; Straight, Joseph}, Efficient computation of the Lovász theta function for a class of circulant graphs, 285-295 [Zbl 1112.94311] \textit{Golin, Mordecai J.; Leung, Yiu Cho}, Unhooking circulant graphs: A combinatorial method for counting spanning trees and other parameters, 296-307 [Zbl 1112.05312] \textit{Chen, Zhi-Zhong; Tsukiji, Tatsuie}, Computing bounded-degree phylogenetic roots of disconnected graphs, 308-319 [Zbl 1112.92332] \textit{Rahman, Md. Saidur; Miura, Kazuyuki; Nishizeki, Takao}, Octagonal drawings of plane graphs with prescribed face areas, 320-331 [Zbl 1112.68429] \textit{Baur, Michael; Brandes, Ulrik}, Crossing reduction in circular layouts, 332-343 [Zbl 1112.68408] \textit{Costa Dourado, Mitre; Protti, Fábio; Szwarcfiter, Jayme Luiz}, Characterization and recognition of generalized clique-Helly graphs, 344-354 [Zbl 1112.05321] \textit{Conforti, Michele; Galluccio, Anna; Proietti, Guido}, Edge-connectivity augmentation and network matrices, 355-364 [Zbl 1112.68413] \textit{Ito, Takehiro; Zhou, Xiao; Nishizeki, Takao}, Partitioning a weighted graph to connected subgraphs of almost uniform size, 365-376 [Zbl 1112.68423] \textit{de Werra, Dominique; Demange, Marc; Monnot, Jerome; Paschos, Vangelis Th.}, The hypocoloring problem: Complexity and approximability results when the chromatic number is small, 377-388 [Zbl 1112.68433] \textit{Bietenhader, Thomas; Okamoto, Yoshio}, Core stability of minimum coloring games, 389-401 [Zbl 1112.91305]