Graph-theoretic concepts in computer science. 28th international workshop, WG 2002, Český Krumlov, Czech Republic, June 13--15, 2002. Revised papers
The articles of this volume will be reviewed individually. The preceding workshop has been reviewed (see Zbl 0983.00052). Indexed articles: \textit{Berry, Anne; Blair, Jean R. S.; Heggernes, Pinar}, Maximum cardinality search for computing minimal triangulations, 1-12 [Zbl 1022.68088] \textit{Błażewicz, Jacek; Formanowicz, Piotr; Kasprzak, Marta; Schuurman, Petra; Woeginger, Gerhard J.}, DNA sequencing, Eulerian graphs, and the exact perfect matching problem, 13-24 [Zbl 1022.68089] \textit{Bodini, Olivier}, On the minimum size of a contraction-universal tree, 25-34 [Zbl 1024.05020] \textit{Bonichon, Nicolas; Le Saëc, Bertrand; Mosbah, Mohamed}, Optimal area algorithm for planar polyline drawings, 35-46 [Zbl 1022.68593] \textit{Brandenburg, Franz J.}, Cycles in generalized networks, 47-56 [Zbl 1022.90035] \textit{Brandstädt, Andreas; Dragan, Feodor F.; Le, Hoàng-Oanh; Mosca, Raffaele}, New graph classes of bounded clique-width, 57-67 [Zbl 1022.68090] \textit{Broersma, Hajo; Fomin, Fedor V.; Nešetřil, Jaroslav; Woeginger, Gerhard J.}, More about subcolorings, 68-79 [Zbl 1024.05024] \textit{Cournier, Alain}, Search in indecomposable graphs, 80-91 [Zbl 1022.68595] \textit{Dantas, Simone; de Figueiredo, Celina M. H.; Faria, Luerbio}, On the complexity of \((k,l)\)-graph sandwich problems, 92-101 [Zbl 1022.68091] \textit{Demange, Marc; Paschos, Vangelis Th.}, Algorithms and models for the on-line vertex-covering. (Extended abstract), 102-113 [Zbl 1022.68596] \textit{Demange, Marc; de Werra, D.; Monnot, J.; Paschos, Vangelis Th.}, Weighted node coloring: When stable sets are expensive, 114-125 [Zbl 1022.68092] \textit{Díaz, Josep; Serna, Maria; Thilikos, Dimitrios M.}, The complexity of restrictive \(H\)-coloring, 126-137 [Zbl 1022.68093] \textit{Diks, Krzysztof; Kowalik, Lukasz; Kurowski, Maciej}, A new 3-color criterion for planar graphs. (Extended abstract), 138-149 [Zbl 1022.05500] \textit{Dourisboure, Yon}, An additive stretched routing scheme for chordal graphs, 150-163 [Zbl 1022.68597] \textit{Dvořák, Zdeněk; Kára, Jan; Král', Daniel; Pangrác, Ondřej}, Complexity of pattern coloring of cycle systems, 164-175 [Zbl 1022.68598] \textit{van den Eijkhof, Frank; Bodlaender, Hans L.}, Safe reduction rules for weighted treewidth, 176-185 [Zbl 1022.68604] \textit{Fernau, Henning}, Graph separator algorithms: A refined analysis, 186-197 [Zbl 1022.68094] \textit{Fiala, Jiří; Heggernes, Pinar; Kristiansen, Petter; Telle, Jan Arne}, Generalized \(H\)-coloring and \(H\)-covering of trees, 198-210 [Zbl 1022.68095] \textit{Fomin, Fedor V.; Matamala, Martín; Rapaport, Ivan}, The complexity of approximating the oriented diameter of chordal graphs. (Extended abstract), 211-222 [Zbl 1022.68599] \textit{Fotakis, D. A.; Nikoletseas, S. E.; Papadopoulou, V. G.; Spirakis, P. G.}, Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies, 223-234 [Zbl 1022.68096] \textit{Hasunuma, Toru}, Completely independent spanning trees in maximal planar graphs, 235-245 [Zbl 1022.68600] \textit{Healy, Patrick; Nikolov, Nikola S.}, Facets of the directed acyclic graph layering polytope, 246-257 [Zbl 1022.68098] \textit{Hemaspaandra, Edith; Rothe, Jörg; Spakowski, Holger}, Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP, 258-269 [Zbl 1022.68099] \textit{Ishihara, Hajime; Khoussainov, Bakhadyr}, Complexity of some infinite games played on finite graphs, 270-281 [Zbl 1022.68086] \textit{Kloks, Ton; Lee, C. M.; Liu, Jiping}, New algorithms for \(k\)-face cover, \(k\)-feedback vertex set, and \(k\)-disjoint cycles on plane and planar graphs, 282-295 [Zbl 1022.68100] \textit{Koren, Yehuda; Harel, David}, A multi-scale algorithm for the linear arrangement problem, 296-309 [Zbl 1022.68601] \textit{Kratochvíl, Jan; Tuza, Zsolt; Voigt, Margit}, On the \(b\)-chromatic number of graphs, 310-320 [Zbl 1024.05026] \textit{Krumke, Sven Oliver; Marathe, Madhav V.; Poensgen, Diana; Ravi, S. S.; Wirth, Hans-Christoph}, Budgeted maximum graph coverage, 321-332 [Zbl 1022.90036] \textit{Krumke, Sven Oliver; Poensgen, Diana}, Online call admission in optical networks with larger demands, 333-344 [Zbl 1022.90500] \textit{Lari, Isabella; Ricca, Federica; Scozzari, Andrea}, The forest wrapping problem on outerplanar graphs, 345-354 [Zbl 1022.68101] \textit{Nikolopoulos, Stavros D.; Palios, Leonidas}, On the recognition of \(P_4\)-comparability graphs, 355-366 [Zbl 1022.68602] \textit{Rahman, Md. Saidur; Nishizeki, Takao}, Bend-minimum orthogonal drawings of plane 3-graphs. (Extended abstract), 367-378 [Zbl 1022.68603] \textit{Shamir, Ron; Sharan, Roded; Tsur, Dekel}, Cluster graph modification problems, 379-390 [Zbl 1022.68104] \textit{Sýkora, O.; Székely, L. A.; Vrt'o, I.}, Two counterexamples in graph drawing, 391-398 [Zbl 1022.68105] \textit{Vikas, Narayan}, Connected and loosely connected list homomorphisms, 399-412 [Zbl 1022.68106] \textit{Wanka, Rolf}, Any load-balancing regimen for evolving tree computations on circulant graphs is asymptotically optimal, 413-420 [Zbl 1022.68605]
scientific article; zbMATH DE number 1931990