Graph-theoretic concepts in computer science. 27th international workshop, WG 2001, Boltenhagen, Germany, June 14--16, 2001. Proceedings (Q5960798)

The articles of this volume will be reviewed individually. The preceding workshop (26th, 2000) has been reviewed (see Zbl 0952.00042). Indexed articles: \textit{Bandelt, Hans-J.}, Median hulls as Steiner hulls in rectilinear and molecular sequence spaces, 1-7 [Zbl 1042.68616] \textit{Meyer auf der Heide, Friedhelm}, Data management in networks, 8 [Zbl 1042.68509] \textit{Bezrukov, Sergei L.; Elsässer, Robert}, Edge-isoperimetric problems for Cartesian powers of regular graphs, 9-20 [Zbl 1042.68617] \textit{Caragiannis, Ioannis; Ferreira, Afonso; Kaklamanis, Christos; Pérennes, Stéphane; Persiano, Pino; Rivano, Hervé}, Approximate constrained bipartite edge coloring, 21-31 [Zbl 1042.68618] \textit{Chang, Maw-Shang; Kloks, Ton; Lee, Chuan-Min}, Maximum clique transversals, 32-43 [Zbl 1042.68619] \textit{Chang, Maw-Shang; Müller, Haiko}, On the tree-degree of graphs, 44-54 [Zbl 1042.68620] \textit{Chen, Jianer; Kanj, Iyad A.}, On constrained minimum vertex covers of bipartite graphs: Improved algorithms, 55-65 [Zbl 1042.68621] \textit{Cicerone, Serafino; D'Ermiliis, Gianluca; Di Stefano, Gabriele}, \((k,+)\)-distance-hereditary graphs, 66-77 [Zbl 1042.68622] \textit{Corneil, Derek G.; Rotics, Udi}, On the relationship between clique-width and treewidth, 78-90 [Zbl 1042.68623] \textit{Cornelsen, Sabine; Dinitz, Yefim; Wagner, Dorothea}, Planarity of the 2-level cactus model, 91-102 [Zbl 1042.68624] \textit{Dragan, Feodor F.}, Estimating all pairs shortest paths in restricted graph families: A unified approach, 103-116 [Zbl 1042.68625] \textit{Espelage, Wolfgang; Gurski, Frank; Wanke, Egon}, How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time, 117-128 [Zbl 1042.68626] \textit{Feng, Haodi}, \((g, f)\)-factorizations orthogonal to \(k\) subgraphs, 129-139 [Zbl 1042.68627] \textit{Fertin, Guillaume; Raspaud, André; Reed, Bruce}, On star coloring of graphs, 140-153 [Zbl 1042.68628] \textit{Fiala, Jiří; Jansen, Klaus; Le, Van Bang; Seidel, Eike}, Graph subcolorings: Complexity and algorithms, 154-165 [Zbl 1042.68629] \textit{Fomin, Fedor V.; Bodlaender, Hans L.}, Approximation of pathwidth of outerplanar graphs, 166-176 [Zbl 1042.68630] \textit{Fomin, Fedor V.; Thilikos, Dimitrios M.}, On the monotonicity of games generated by symmetric submodular functions, 177-188 [Zbl 1042.68631] \textit{Fuhrmann, Sven; Krumke, Sven Oliver; Wirth, Hans-Christoph}, Multiple hotlink assignment, 189-200 [Zbl 1042.68633] \textit{Gavoille, Cyril; Peleg, David; Raspaud, André; Sopena, Eric}, Small \(k\)-dominating sets in planar graphs with applications, 201-216 [Zbl 1042.68634] \textit{Gröpl, Clemens; Hougardy, Stefan; Nierhoff, Till; Prömel, Hans Jürgen}, Lower bounds for approximation algorithms for the Steiner tree problem, 217-228 [Zbl 1042.68635] \textit{Johansson, Öjvind}, log \(n\)-approximative NLC\(_{k}\)-decomposition in \(O(n^{2k+1})\) time, 229-240 [Zbl 1042.68637] \textit{Köhler, Ekkehard; Corneil, Derek G.; Olariu, Stephan; Stewart, Lorna}, On subfamilies of AT-free graphs, 241-253 [Zbl 1042.68638] \textit{Král', Daniel; Kratochvíl, Jan; Tuza, Zsolt; Woeginger, Gerhard J.}, Complexity of coloring graphs without forbidden induced subgraphs, 254-262 [Zbl 1042.68639] \textit{Le, Van Bang; Randerath, Bert}, On stable cutsets in line graphs, 263-271 [Zbl 1042.68640] \textit{Oh, Eunseuk; Chen, Jianer}, On strong Menger-connectivity of star graphs, 272-283 [Zbl 1042.68641] \textit{Patrignani, Maurizio; Pizzonia, Maurizio}, The complexity of the matching-cut problem, 284-295 [Zbl 1042.68642] \textit{Pendavingh, Rudi; Schuurman, Petra; Woeginger, Gerhard J.}, De Bruijn graphs and DNA graphs, 296-305 [Zbl 1042.68643] \textit{Puricella, Antonio; Stewart, Iain A.}, A generic greedy algorithm, partially-ordered graphs and NP-completeness, 306-316 [Zbl 1042.68644] \textit{Wagler, Annegret}, Critical and anticritical edges in perfect graphs, 317-327 [Zbl 1042.68645]