@incollection{Bandelt/01,
AUTHOR = {Bandelt, Hans-J.},
TITLE = {Median hulls as Steiner hulls in rectilinear and molecular sequence spaces},
BOOKTITLE = {Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2001 (Boltenhagen, Germany, June 14-16, 2001)},
SERIES = {LNCS},
VOLUME = {2204},
PAGES = {1-7},
YEAR = {2001},
EDITOR = {Brandst{\"a}dt, Andreas and Le, Van Bang},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Meyer_auf_der_Heide/01,
AUTHOR = {Meyer auf der Heide, Friedhelm},
TITLE = {Data management in networks},
BOOKTITLE = {Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2001 (Boltenhagen, Germany, June 14-16, 2001)},
SERIES = {LNCS},
VOLUME = {2204},
PAGES = {8-8},
YEAR = {2001},
EDITOR = {Brandst{\"a}dt, Andreas and Le, Van Bang},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Bezrukov-Elsasser/01,
AUTHOR = {Bezrukov, Sergei L. and Els{\"a}sser, Robert},
TITLE = {Edge-isoperimetric problems for Cartesian powers of regular graphs},
BOOKTITLE = {Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2001 (Boltenhagen, Germany, June 14-16, 2001)},
SERIES = {LNCS},
VOLUME = {2204},
PAGES = {9-20},
YEAR = {2001},
EDITOR = {Brandst{\"a}dt, Andreas and Le, Van Bang},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Caragiannis-Ferreira-Kaklamanis-Perennes-Persiano-Rivano/01,
AUTHOR = {Caragiannis, Ioannis and Ferreira, Afonso and Kaklamanis, Christos and P{\'{e}}rennes, St{\'{e}}phane and Persiano, Pino and Rivano, Herv{\'{e}}},
TITLE = {Approximate constrained bipartite edge coloring},
BOOKTITLE = {Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2001 (Boltenhagen, Germany, June 14-16, 2001)},
SERIES = {LNCS},
VOLUME = {2204},
PAGES = {21-31},
YEAR = {2001},
EDITOR = {Brandst{\"a}dt, Andreas and Le, Van Bang},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Chang-Kloks-Lee/01,
AUTHOR = {Chang, Maw-Shang and Kloks, Ton and Lee, Chuan-Min},
TITLE = {Maximum clique transversals},
BOOKTITLE = {Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2001 (Boltenhagen, Germany, June 14-16, 2001)},
SERIES = {LNCS},
VOLUME = {2204},
PAGES = {32-43},
YEAR = {2001},
EDITOR = {Brandst{\"a}dt, Andreas and Le, Van Bang},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Chang-Muller/01,
AUTHOR = {Chang, Maw-Shang and M{\"u}ller, Haiko},
TITLE = {On the tree-degree of graphs},
BOOKTITLE = {Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2001 (Boltenhagen, Germany, June 14-16, 2001)},
SERIES = {LNCS},
VOLUME = {2204},
PAGES = {44-54},
YEAR = {2001},
EDITOR = {Brandst{\"a}dt, Andreas and Le, Van Bang},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Chen-Kanj/01,
AUTHOR = {Chen, Jianer and Kanj, Iyad A.},
TITLE = {On constrained minimum vertex covers of bipartite graphs: Improved algorithms},
BOOKTITLE = {Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2001 (Boltenhagen, Germany, June 14-16, 2001)},
SERIES = {LNCS},
VOLUME = {2204},
PAGES = {55-65},
YEAR = {2001},
EDITOR = {Brandst{\"a}dt, Andreas and Le, Van Bang},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Cicerone-DErmiliis-Stefano/01,
AUTHOR = {Cicerone, Serafino and D'Ermiliis, Gianluca and Stefano, Gabriele di},
TITLE = {$(k,+)$-distance-hereditary graphs},
BOOKTITLE = {Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2001 (Boltenhagen, Germany, June 14-16, 2001)},
SERIES = {LNCS},
VOLUME = {2204},
PAGES = {66-77},
YEAR = {2001},
EDITOR = {Brandst{\"a}dt, Andreas and Le, Van Bang},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Corneil-Rotics/01,
AUTHOR = {Corneil, Derek G. and Rotics, Udi},
TITLE = {On the relationship between clique-width and treewidth},
BOOKTITLE = {Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2001 (Boltenhagen, Germany, June 14-16, 2001)},
SERIES = {LNCS},
VOLUME = {2204},
PAGES = {78-90},
YEAR = {2001},
EDITOR = {Brandst{\"a}dt, Andreas and Le, Van Bang},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Cornelsen-Dinitz-Wagner/01,
AUTHOR = {Cornelsen, Sabine and Dinitz, Yefim and Wagner, Dorothea},
TITLE = {Planarity of the 2-level cactus model},
BOOKTITLE = {Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2001 (Boltenhagen, Germany, June 14-16, 2001)},
SERIES = {LNCS},
VOLUME = {2204},
PAGES = {91-102},
YEAR = {2001},
EDITOR = {Brandst{\"a}dt, Andreas and Le, Van Bang},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Dragan/01,
AUTHOR = {Dragan, Feodor F.},
TITLE = {Estimating all pairs shortest paths in restricted graph families: A unified approach},
BOOKTITLE = {Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2001 (Boltenhagen, Germany, June 14-16, 2001)},
SERIES = {LNCS},
VOLUME = {2204},
PAGES = {103-116},
YEAR = {2001},
EDITOR = {Brandst{\"a}dt, Andreas and Le, Van Bang},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Espelage-Gurski-Wanke/01a,
AUTHOR = {Espelage, Wolfgang and Gurski, Frank and Wanke, Egon},
TITLE = {How to solve $NP$-hard graph problems on clique-width bounded graphs in polynomial time},
BOOKTITLE = {Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2001 (Boltenhagen, Germany, June 14-16, 2001)},
SERIES = {LNCS},
VOLUME = {2204},
PAGES = {117-128},
YEAR = {2001},
EDITOR = {Brandst{\"a}dt, Andreas and Le, Van Bang},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Feng/01a,
AUTHOR = {Feng, Haodi},
TITLE = {$(g,f)$-factorizations orthogonal to $k$ subgraphs},
BOOKTITLE = {Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2001 (Boltenhagen, Germany, June 14-16, 2001)},
SERIES = {LNCS},
VOLUME = {2204},
PAGES = {129-139},
YEAR = {2001},
EDITOR = {Brandst{\"a}dt, Andreas and Le, Van Bang},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Fertin-Raspaud-Reed/01,
AUTHOR = {Fertin, Guillaume and Raspaud, Andr{\'{e}} and Reed, Bruce},
TITLE = {On star coloring of graphs},
BOOKTITLE = {Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2001 (Boltenhagen, Germany, June 14-16, 2001)},
SERIES = {LNCS},
VOLUME = {2204},
PAGES = {140-153},
YEAR = {2001},
EDITOR = {Brandst{\"a}dt, Andreas and Le, Van Bang},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Fiala-Jansen-Le-Seidel/01,
AUTHOR = {Fiala, Ji{\v{r}}{\'{i}} and Jansen, Klaus and Le, Van Bang and Seidel, Eike},
TITLE = {Graph subcolorings: Complexity and algorithms},
BOOKTITLE = {Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2001 (Boltenhagen, Germany, June 14-16, 2001)},
SERIES = {LNCS},
VOLUME = {2204},
PAGES = {154-165},
YEAR = {2001},
EDITOR = {Brandst{\"a}dt, Andreas and Le, Van Bang},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Fomin-Bodlaender/01,
AUTHOR = {Fomin, Fedor V. and Bodlaender, Hans L.},
TITLE = {Approximation of pathwidth of outerplanar graphs},
BOOKTITLE = {Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2001 (Boltenhagen, Germany, June 14-16, 2001)},
SERIES = {LNCS},
VOLUME = {2204},
PAGES = {166-176},
YEAR = {2001},
EDITOR = {Brandst{\"a}dt, Andreas and Le, Van Bang},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Fomin-Thilikos/01,
AUTHOR = {Fomin, Fedor V. and Thilikos, Dimitrios M.},
TITLE = {On the monotonicity of games generated by symmetric submodular functions},
BOOKTITLE = {Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2001 (Boltenhagen, Germany, June 14-16, 2001)},
SERIES = {LNCS},
VOLUME = {2204},
PAGES = {177-188},
YEAR = {2001},
EDITOR = {Brandst{\"a}dt, Andreas and Le, Van Bang},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Fuhrmann-Krumke-Wirth/01,
AUTHOR = {Fuhrmann, Sven and Krumke, Sven Oliver and Wirth, Hans-Christoph},
TITLE = {Multiple hotlink assignment},
BOOKTITLE = {Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2001 (Boltenhagen, Germany, June 14-16, 2001)},
SERIES = {LNCS},
VOLUME = {2204},
PAGES = {189-200},
YEAR = {2001},
EDITOR = {Brandst{\"a}dt, Andreas and Le, Van Bang},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Gavoille-Peleg-Raspaud-Sopena/01,
AUTHOR = {Gavoille, Cyril and Peleg, David and Raspaud, Andr{\'{e}} and Sopena, Eric},
TITLE = {Small $k$-dominating sets in planar graphs with applications},
BOOKTITLE = {Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2001 (Boltenhagen, Germany, June 14-16, 2001)},
SERIES = {LNCS},
VOLUME = {2204},
PAGES = {201-216},
YEAR = {2001},
EDITOR = {Brandst{\"a}dt, Andreas and Le, Van Bang},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Gropl-Hougardy-Nierhoff-Promel/01,
AUTHOR = {Gr{\"o}pl, Clemens and Hougardy, Stefan and Nierhoff, Till and Pr{\"o}mel, Hans J{\"u}rgen},
TITLE = {Lower bounds for approximation algorithms for the Steiner tree problem},
BOOKTITLE = {Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2001 (Boltenhagen, Germany, June 14-16, 2001)},
SERIES = {LNCS},
VOLUME = {2204},
PAGES = {217-228},
YEAR = {2001},
EDITOR = {Brandst{\"a}dt, Andreas and Le, Van Bang},
KEYWORDS = {228},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Johansson/01,
AUTHOR = {Johansson, {\"o}jvind},
TITLE = {$\log n$-approximative $NLC_k$-decomposition in $O(n^{2k+1})$ time},
BOOKTITLE = {Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2001 (Boltenhagen, Germany, June 14-16, 2001)},
SERIES = {LNCS},
VOLUME = {2204},
PAGES = {229-240},
YEAR = {2001},
EDITOR = {Brandst{\"a}dt, Andreas and Le, Van Bang},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2204&spage=229},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Kohler-Corneil-Olariu-Stewart/01,
AUTHOR = {K{\"o}hler, Ekkehard and Corneil, Derek G. and Olariu, Stephan and Stewart, Lorna},
TITLE = {On subfamilies of AT-free graphs},
BOOKTITLE = {Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2001 (Boltenhagen, Germany, June 14-16, 2001)},
SERIES = {LNCS},
VOLUME = {2204},
PAGES = {241-253},
YEAR = {2001},
EDITOR = {Brandst{\"a}dt, Andreas and Le, Van Bang},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Kral-Kratochvil-Tuza-Woeginger/01,
AUTHOR = {Kr{\'{a}}l, Daniel and Kratochv{\'{i}}l, Jan and Tuza, Zsolt and Woeginger, Gerhard J.},
TITLE = {Complexity of coloring graphs without forbidden induced subgraphs},
BOOKTITLE = {Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2001 (Boltenhagen, Germany, June 14-16, 2001)},
SERIES = {LNCS},
VOLUME = {2204},
PAGES = {254-262},
YEAR = {2001},
EDITOR = {Brandst{\"a}dt, Andreas and Le, Van Bang},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Le-Randerath/01,
AUTHOR = {Le, Van Bang and Randerath, Bert},
TITLE = {On stable cutsets in line graphs},
BOOKTITLE = {Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2001 (Boltenhagen, Germany, June 14-16, 2001)},
SERIES = {LNCS},
VOLUME = {2204},
PAGES = {263-271},
YEAR = {2001},
EDITOR = {Brandst{\"a}dt, Andreas and Le, Van Bang},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Oh-Chen/01,
AUTHOR = {Oh, Eunseuk and Chen, Jianer},
TITLE = {On strong Menger-connectivity of star graphs},
BOOKTITLE = {Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2001 (Boltenhagen, Germany, June 14-16, 2001)},
SERIES = {LNCS},
VOLUME = {2204},
PAGES = {272-283},
YEAR = {2001},
EDITOR = {Brandst{\"a}dt, Andreas and Le, Van Bang},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Patrignani-Pizzonia/01,
AUTHOR = {Patrignani, Maurizio and Pizzonia, Maurizio},
TITLE = {The complexity of the matching-cut problem},
BOOKTITLE = {Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2001 (Boltenhagen, Germany, June 14-16, 2001)},
SERIES = {LNCS},
VOLUME = {2204},
PAGES = {284-295},
YEAR = {2001},
EDITOR = {Brandst{\"a}dt, Andreas and Le, Van Bang},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Pendvingh-Schuurman-Woeginger/01,
AUTHOR = {Pendvingh, Rudi and Schuurman, Petra and Woeginger, Gerhard J.},
TITLE = {De Bruijn graphs and DNA graphs},
BOOKTITLE = {Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2001 (Boltenhagen, Germany, June 14-16, 2001)},
SERIES = {LNCS},
VOLUME = {2204},
PAGES = {296-305},
YEAR = {2001},
EDITOR = {Brandst{\"a}dt, Andreas and Le, Van Bang},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Puricella-Stewart/01,
AUTHOR = {Puricella, Antonio and Stewart, Iain A.},
TITLE = {A generic greedy algorithm, partially-ordered graphs and $NP$-comleteness},
BOOKTITLE = {Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2001 (Boltenhagen, Germany, June 14-16, 2001)},
SERIES = {LNCS},
VOLUME = {2204},
PAGES = {306-316},
YEAR = {2001},
EDITOR = {Brandst{\"a}dt, Andreas and Le, Van Bang},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Tokyo},
}
@incollection{Wagler/01,
AUTHOR = {Wagler, Annegret},
TITLE = {Critical and anticritical edges in perfect graphs},
BOOKTITLE = {Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2001 (Boltenhagen, Germany, June 14-16, 2001)},
SERIES = {LNCS},
VOLUME = {2204},
PAGES = {317-327},
YEAR = {2001},
EDITOR = {Brandst{\"a}dt, Andreas and Le, Van Bang},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Tokyo},
}