@incollection{Berry-Blair-Heggernes/02,
AUTHOR = {Berry, Anne and Blair, Jean R.S. and Heggernes, Pinar},
TITLE = {Maximum cardinality search for computing minimal triangulations},
BOOKTITLE = {Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2002 ({\v{C}}esk{\'y} Krumlov, Czech Republic, June 13-15, 2002)},
SERIES = {LNCS},
VOLUME = {2573},
PAGES = {1-12},
YEAR = {2002},
EDITOR = {Ku{\v{c}}era, Lud{\v{e}}k},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Blazewicz-Formanowicz-Kasprzak-Schuurman-Woeginger/02,
AUTHOR = {B{\l}a{\.z}ewicz, Jacek and Formanowicz, Piotr and Kasprzak, Marta and Schuurman, Petra and Woeginger, Gerhard J.},
TITLE = {DNA sequencing, Eulerian graphs},
BOOKTITLE = {Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2002 ({\v{C}}esk{\'y} Krumlov, Czech Republic, June 13-15, 2002)},
SERIES = {LNCS},
VOLUME = {2573},
PAGES = {13-24},
YEAR = {2002},
EDITOR = {Ku{\v{c}}era, Lud{\v{e}}k},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Bodini/02,
AUTHOR = {Bodini, Olivier},
TITLE = {On the minimum size of a contraction-universal tree},
BOOKTITLE = {Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2002 ({\v{C}}esk{\'y} Krumlov, Czech Republic, June 13-15, 2002)},
SERIES = {LNCS},
VOLUME = {2573},
PAGES = {25-34},
YEAR = {2002},
EDITOR = {Ku{\v{c}}era, Lud{\v{e}}k},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Bonichon-Le_Saec-Mosbah/02a,
AUTHOR = {Bonichon, Nicolas and Le Sa{\"e}c, Bertrand and Mosbah, Mohamed},
TITLE = {Optimal area algorithm for planar polyline drawings},
BOOKTITLE = {Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2002 ({\v{C}}esk{\'y} Krumlov, Czech Republic, June 13-15, 2002)},
SERIES = {LNCS},
VOLUME = {2573},
PAGES = {35-46},
YEAR = {2002},
EDITOR = {Ku{\v{c}}era, Lud{\v{e}}k},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Brandenburg/02a,
AUTHOR = {Brandenburg, Franz J.},
TITLE = {Cycles in generalized networks},
BOOKTITLE = {Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2002 ({\v{C}}esk{\'y} Krumlov, Czech Republic, June 13-15, 2002)},
SERIES = {LNCS},
VOLUME = {2573},
PAGES = {47-56},
YEAR = {2002},
EDITOR = {Ku{\v{c}}era, Lud{\v{e}}k},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Hong Kong-London-Milan-Paris-Tokyo},
NOTE = {see Erratum in LNCS, Vol. 2880, 2003, 383},
}
@incollection{Brandstadt-Dragan-Le-Mosca/02,
AUTHOR = {Brandst{\"a}dt, Andreas and Dragan, Feodor F. and Le, Ho{\`a}ng-Oanh and Mosca, Raffaele},
TITLE = {New graph classes of bounded clique-width},
BOOKTITLE = {Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2002 ({\v{C}}esk{\'y} Krumlov, Czech Republic, June 13-15, 2002)},
SERIES = {LNCS},
VOLUME = {2573},
PAGES = {57-67},
YEAR = {2002},
EDITOR = {Ku{\v{c}}era, Lud{\v{e}}k},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Broersma-Fomin-Nesetril-Woeginger/02,
AUTHOR = {Broersma, Hajo and Fomin, Fedor V. and Ne{\v{s}}et{\v{r}}il, Jaroslav and Woeginger, Gerhard J.},
TITLE = {More about subcolorings},
BOOKTITLE = {Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2002 ({\v{C}}esk{\'y} Krumlov, Czech Republic, June 13-15, 2002)},
SERIES = {LNCS},
VOLUME = {2573},
PAGES = {68-79},
YEAR = {2002},
EDITOR = {Ku{\v{c}}era, Lud{\v{e}}k},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Cournier/02,
AUTHOR = {Cournier, Alain},
TITLE = {Search in indecomposable graphs},
BOOKTITLE = {Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2002 ({\v{C}}esk{\'y} Krumlov, Czech Republic, June 13-15, 2002)},
SERIES = {LNCS},
VOLUME = {2573},
PAGES = {80-91},
YEAR = {2002},
EDITOR = {Ku{\v{c}}era, Lud{\v{e}}k},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Dantas-Figueiredo-Faria/02,
AUTHOR = {Dantas, Simone and Figueiredo, Celina M.H. de and Faria, Luerbio},
TITLE = {On the complexity of $(k,l)$-graph sandwich problems},
BOOKTITLE = {Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2002 ({\v{C}}esk{\'y} Krumlov, Czech Republic, June 13-15, 2002)},
SERIES = {LNCS},
VOLUME = {2573},
PAGES = {92-101},
YEAR = {2002},
EDITOR = {Ku{\v{c}}era, Lud{\v{e}}k},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Demange-Paschos/02,
AUTHOR = {Demange, Marc and Paschos, Vangelis Th.},
TITLE = {Algorithms and models for the on-line vertex-covering},
BOOKTITLE = {Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2002 ({\v{C}}esk{\'y} Krumlov, Czech Republic, June 13-15, 2002)},
SERIES = {LNCS},
VOLUME = {2573},
PAGES = {102-113},
YEAR = {2002},
EDITOR = {Ku{\v{c}}era, Lud{\v{e}}k},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Demange-Werra-Monnot-Paschos/02,
AUTHOR = {Demange, Marc and Werra, D. de and Monnot, J. and Paschos, Vangelis Th.},
TITLE = {Weighted node coloring: When stable sets are expensive},
BOOKTITLE = {Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2002 ({\v{C}}esk{\'y} Krumlov, Czech Republic, June 13-15, 2002)},
SERIES = {LNCS},
VOLUME = {2573},
PAGES = {114-125},
YEAR = {2002},
EDITOR = {Ku{\v{c}}era, Lud{\v{e}}k},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Diaz-Serna-Thilikos/02,
AUTHOR = {D{\'i}az, Josep and Serna, Maria and Thilikos, Dimitrios M.},
TITLE = {The complexity of restrictive $H$-coloring},
BOOKTITLE = {Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2002 ({\v{C}}esk{\'y} Krumlov, Czech Republic, June 13-15, 2002)},
SERIES = {LNCS},
VOLUME = {2573},
PAGES = {126-137},
YEAR = {2002},
EDITOR = {Ku{\v{c}}era, Lud{\v{e}}k},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Diks-Kowalik-Kurowski/02,
AUTHOR = {Diks, Krzysztof and Kowalik, Lukasz and Kurowski, Maciej},
TITLE = {A new 3-color criterion for planar graphs},
BOOKTITLE = {Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2002 ({\v{C}}esk{\'y} Krumlov, Czech Republic, June 13-15, 2002)},
SERIES = {LNCS},
VOLUME = {2573},
PAGES = {138-149},
YEAR = {2002},
EDITOR = {Ku{\v{c}}era, Lud{\v{e}}k},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Dourisboure/02,
AUTHOR = {Dourisboure, Yon},
TITLE = {An additive stretched routing scheme for chordal graphs},
BOOKTITLE = {Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2002 ({\v{C}}esk{\'y} Krumlov, Czech Republic, June 13-15, 2002)},
SERIES = {LNCS},
VOLUME = {2573},
PAGES = {150-163},
YEAR = {2002},
EDITOR = {Ku{\v{c}}era, Lud{\v{e}}k},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Dvorak-Kara-Kral-Pangrac/02,
AUTHOR = {Dvo{\v{r}}{\'a}k, Zden{\v{e}}k and K{\'a}ra, Jan and Kr{\'a}l', Daniel and Pangr{\'a}c, Ond{\v{r}}ej},
TITLE = {Complexity of pattern coloring of cycle systems},
BOOKTITLE = {Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2002 ({\v{C}}esk{\'y} Krumlov, Czech Republic, June 13-15, 2002)},
SERIES = {LNCS},
VOLUME = {2573},
PAGES = {164-175},
YEAR = {2002},
EDITOR = {Ku{\v{c}}era, Lud{\v{e}}k},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{van_den_Eijkhof-Bodlaender/02,
AUTHOR = {van den Eijkhof, Frank and Bodlaender, Hans L.},
TITLE = {Safe reduction rules for weighted treewidth},
BOOKTITLE = {Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2002 ({\v{C}}esk{\'y} Krumlov, Czech Republic, June 13-15, 2002)},
SERIES = {LNCS},
VOLUME = {2573},
PAGES = {176-185},
YEAR = {2002},
EDITOR = {Ku{\v{c}}era, Lud{\v{e}}k},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Fernau/02a,
AUTHOR = {Fernau, Henning},
TITLE = {Graph seperator algorithms: A refined analysis},
BOOKTITLE = {Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2002 ({\v{C}}esk{\'y} Krumlov, Czech Republic, June 13-15, 2002)},
SERIES = {LNCS},
VOLUME = {2573},
PAGES = {186-197},
YEAR = {2002},
EDITOR = {Ku{\v{c}}era, Lud{\v{e}}k},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Fiala-Heggernes-Kristiansen-Telle/02,
AUTHOR = {Fiala, Ji{\v{r}}{\'i} and Heggernes, Pinar and Kristiansen, Petter and Telle, Jan Arne},
TITLE = {Generalized $H$-coloring and $H$-covering of trees},
BOOKTITLE = {Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2002 ({\v{C}}esk{\'y} Krumlov, Czech Republic, June 13-15, 2002)},
SERIES = {LNCS},
VOLUME = {2573},
PAGES = {198-210},
YEAR = {2002},
EDITOR = {Ku{\v{c}}era, Lud{\v{e}}k},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Fomin-Matamala-Rapaport/02,
AUTHOR = {Fomin, Fedor V. and Matamala, Mart{\'i}n and Rapaport, Ivan},
TITLE = {The complexity of approximating the oriented diameter of chordal graphs},
BOOKTITLE = {Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2002 ({\v{C}}esk{\'y} Krumlov, Czech Republic, June 13-15, 2002)},
SERIES = {LNCS},
VOLUME = {2573},
PAGES = {211-222},
YEAR = {2002},
EDITOR = {Ku{\v{c}}era, Lud{\v{e}}k},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Fotakis-Nikoletseas-Papadopoulou-Spirakis/02,
AUTHOR = {Fotakis, D.A. and Nikoletseas, S.E. and Papadopoulou, V.G. and Spirakis, P.G.},
TITLE = {Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies},
BOOKTITLE = {Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2002 ({\v{C}}esk{\'y} Krumlov, Czech Republic, June 13-15, 2002)},
SERIES = {LNCS},
VOLUME = {2573},
PAGES = {223-234},
YEAR = {2002},
EDITOR = {Ku{\v{c}}era, Lud{\v{e}}k},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Hasunuma/02,
AUTHOR = {Hasunuma, Toru},
TITLE = {Completely independent spanning trees in maximal planar graphs},
BOOKTITLE = {Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2002 ({\v{C}}esk{\'y} Krumlov, Czech Republic, June 13-15, 2002)},
SERIES = {LNCS},
VOLUME = {2573},
PAGES = {235-245},
YEAR = {2002},
EDITOR = {Ku{\v{c}}era, Lud{\v{e}}k},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Healy-Nikolov/02b,
AUTHOR = {Healy, Patrick and Nikolov, Nikola S.},
TITLE = {Facets of the directed acyclic graph layering polytope},
BOOKTITLE = {Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2002 ({\v{C}}esk{\'y} Krumlov, Czech Republic, June 13-15, 2002)},
SERIES = {LNCS},
VOLUME = {2573},
PAGES = {246-257},
YEAR = {2002},
EDITOR = {Ku{\v{c}}era, Lud{\v{e}}k},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Hemaspaandra-Rothe-Spakowski/02,
AUTHOR = {Hemaspaandra, Edith and Rothe, J{\"o}rg and Spakowski, Holger},
TITLE = {Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to $NP$},
BOOKTITLE = {Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2002 ({\v{C}}esk{\'y} Krumlov, Czech Republic, June 13-15, 2002)},
SERIES = {LNCS},
VOLUME = {2573},
PAGES = {258-269},
YEAR = {2002},
EDITOR = {Ku{\v{c}}era, Lud{\v{e}}k},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Ishihara-Khoussainov/02,
AUTHOR = {Ishihara, Hajime and Khoussainov, Bakhadyr},
TITLE = {Complexity of some infinite games played on finite graphs},
BOOKTITLE = {Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2002 ({\v{C}}esk{\'y} Krumlov, Czech Republic, June 13-15, 2002)},
SERIES = {LNCS},
VOLUME = {2573},
PAGES = {270-281},
YEAR = {2002},
EDITOR = {Ku{\v{c}}era, Lud{\v{e}}k},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Kloks-Lee-Liu/02,
AUTHOR = {Kloks, Ton and Lee, C.M. and Liu, Jiping},
TITLE = {New algorithms for $k$-face cover, $k$-feedback vertex set, and $k$-disjoint cycles on plane and planar graphs},
BOOKTITLE = {Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2002 ({\v{C}}esk{\'y} Krumlov, Czech Republic, June 13-15, 2002)},
SERIES = {LNCS},
VOLUME = {2573},
PAGES = {282-295},
YEAR = {2002},
EDITOR = {Ku{\v{c}}era, Lud{\v{e}}k},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Koren-Harel/02,
AUTHOR = {Koren, Yehuda and Harel, David},
TITLE = {A multi-scale algorithm for the linear arrangement problem},
BOOKTITLE = {Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2002 ({\v{C}}esk{\'y} Krumlov, Czech Republic, June 13-15, 2002)},
SERIES = {LNCS},
VOLUME = {2573},
PAGES = {296-309},
YEAR = {2002},
EDITOR = {Ku{\v{c}}era, Lud{\v{e}}k},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Kratochvil-Tuza-Voigt/02,
AUTHOR = {Kratochv{\'i}l, Jan and Tuza, Zsolt and Voigt, Margit},
TITLE = {On the $b$-chromatic number of graphs},
BOOKTITLE = {Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2002 ({\v{C}}esk{\'y} Krumlov, Czech Republic, June 13-15, 2002)},
SERIES = {LNCS},
VOLUME = {2573},
PAGES = {310-320},
YEAR = {2002},
EDITOR = {Ku{\v{c}}era, Lud{\v{e}}k},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Krumke-Marathe-Poensgen-Ravi-Wirth/02,
AUTHOR = {Krumke, Sven Oliver and Marathe, Madhav V. and Poensgen, Diana and Ravi, S.S. and Wirth, Hans-Christoph},
TITLE = {Budgeted maximum graph coverage},
BOOKTITLE = {Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2002 ({\v{C}}esk{\'y} Krumlov, Czech Republic, June 13-15, 2002)},
SERIES = {LNCS},
VOLUME = {2573},
PAGES = {321-332},
YEAR = {2002},
EDITOR = {Ku{\v{c}}era, Lud{\v{e}}k},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Krumke-Poensgen/02,
AUTHOR = {Krumke, Sven Oliver and Poensgen, Diana},
TITLE = {Online call admission in optical networks with larger demands},
BOOKTITLE = {Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2002 ({\v{C}}esk{\'y} Krumlov, Czech Republic, June 13-15, 2002)},
SERIES = {LNCS},
VOLUME = {2573},
PAGES = {333-344},
YEAR = {2002},
EDITOR = {Ku{\v{c}}era, Lud{\v{e}}k},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Lari-Ricca-Scozzari/02,
AUTHOR = {Lari, Isabella and Ricca, Federica and Scozzari, Andrea},
TITLE = {The forest wrapping problem on outerplanar graphs},
BOOKTITLE = {Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2002 ({\v{C}}esk{\'y} Krumlov, Czech Republic, June 13-15, 2002)},
SERIES = {LNCS},
VOLUME = {2573},
PAGES = {345-354},
YEAR = {2002},
EDITOR = {Ku{\v{c}}era, Lud{\v{e}}k},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Nikolopoulos-Palios/02,
AUTHOR = {Nikolopoulos, Stavros D. and Palios, Leonidas},
TITLE = {On the recognition of $P_4$-comparability graphs},
BOOKTITLE = {Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2002 ({\v{C}}esk{\'y} Krumlov, Czech Republic, June 13-15, 2002)},
SERIES = {LNCS},
VOLUME = {2573},
PAGES = {355-366},
YEAR = {2002},
EDITOR = {Ku{\v{c}}era, Lud{\v{e}}k},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Rahman-Nishizeki/02,
AUTHOR = {Rahman, Md. Saidur and Nishizeki, Takao},
TITLE = {Bend-minimum orthogonal drawings of plane 3-graphs},
BOOKTITLE = {Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2002 ({\v{C}}esk{\'y} Krumlov, Czech Republic, June 13-15, 2002)},
SERIES = {LNCS},
VOLUME = {2573},
PAGES = {367-378},
YEAR = {2002},
EDITOR = {Ku{\v{c}}era, Lud{\v{e}}k},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Shamir-Sharan-Tsur/02,
AUTHOR = {Shamir, Ron and Sharan, Roded and Tsur, Dekel},
TITLE = {Cluster graph modification problems},
BOOKTITLE = {Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2002 ({\v{C}}esk{\'y} Krumlov, Czech Republic, June 13-15, 2002)},
SERIES = {LNCS},
VOLUME = {2573},
PAGES = {379-390},
YEAR = {2002},
EDITOR = {Ku{\v{c}}era, Lud{\v{e}}k},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Sykora-Szekely-Vrto/02a,
AUTHOR = {S{\'y}kora, O. and Sz{\'e}kely, L.A. and Vrt'o, I.},
TITLE = {Two counterexamples in graph drawing},
BOOKTITLE = {Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2002 ({\v{C}}esk{\'y} Krumlov, Czech Republic, June 13-15, 2002)},
SERIES = {LNCS},
VOLUME = {2573},
PAGES = {391-398},
YEAR = {2002},
EDITOR = {Ku{\v{c}}era, Lud{\v{e}}k},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Vikas/02,
AUTHOR = {Vikas, Narayan},
TITLE = {Connected and loosely connected list homomorphisms},
BOOKTITLE = {Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2002 ({\v{C}}esk{\'y} Krumlov, Czech Republic, June 13-15, 2002)},
SERIES = {LNCS},
VOLUME = {2573},
PAGES = {399-412},
YEAR = {2002},
EDITOR = {Ku{\v{c}}era, Lud{\v{e}}k},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Wanka/02,
AUTHOR = {Wanka, Rolf},
TITLE = {Any load-balancing regimen for evolving tree computations on circulant graphs is asymptotically optimal},
BOOKTITLE = {Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2002 ({\v{C}}esk{\'y} Krumlov, Czech Republic, June 13-15, 2002)},
SERIES = {LNCS},
VOLUME = {2573},
PAGES = {413-420},
YEAR = {2002},
EDITOR = {Ku{\v{c}}era, Lud{\v{e}}k},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Hong Kong-London-Milan-Paris-Tokyo},
}