Graph theoretic concepts in computer science. 25th international workshop, WG '99, Ascona, Switzerland, June 17--19, 1999. Proceedings (Q1819253)

The articles of this volume will be reviewed individually. The preceding workshop (24th, 1998) has been indicated (see Zbl 0899.00040). Indexed articles: \textit{Peleg, David}, Proximity-preserving labeling schemes and their applications, 30-41 [Zbl 0945.05053] \textit{Hauptmeier, D.; Krumke, S. O.; Rambau, J.; Wirth, H.-C.}, Euler is standing in line. Dial-a-Ride problems with precedence-constraints, 42-54 [Zbl 0953.90004] \textit{Ott, Sascha}, Lower bounds for approximating shortest superstrings over an alphabet of size 2, 55-64 [Zbl 0946.68019] \textit{Natanzon, Assaf; Shamir, Ron; Sharan, Roded}, Complexity classification of some edge modification problems, 65-77 [Zbl 0952.68112] \textit{Wirth, Hans-Christoph; Steffan, Jan}, On minimum diameter spanning trees under reload costs, 78-88 [Zbl 0938.90071] \textit{Zito, Michele}, Induced matchings in regular graphs and trees, 89-100 [Zbl 0941.05052] \textit{Halldórsson, Magnús M.; Kratochvíl, Jan; Telle, Jan Arne}, Mod-2 independence and domination in graphs, 101-109 [Zbl 0943.05081] \textit{Johansson, Öjvind}, \(\text{NLC}_2\)-decomposition in polynomial time (extended abstract), 110-121 [Zbl 0941.05061] \textit{Golumbic, Martin Charles; Rotics, Udi}, On the clique-width of perfect graph classes (extended abstract), 135-147 [Zbl 0941.05047] \textit{Perković, Ljubomir; Reed, Bruce}, An improved algorithm for finding tree decompositions of small width, 148-154 [Zbl 0945.05054] \textit{Skodinis, K.}, Efficient analysis of graphs with small minimal separators, 155-166 [Zbl 0943.05077] \textit{Berry, Anne; Bordat, Jean-Paul; Cogis, Olivier}, Generating all the minimal separators of a graph, 167-172 [Zbl 0943.05078] \textit{Dobrev, Stefan; Vrto, Imrich}, Two broadcasting problems in faulty hypercubes, 173-178 [Zbl 0946.68001] \textit{Baudon, Olivier; Fertin, Guillaume; Havel, Ivan}, Routing permutations in the hypercube, 179-190 [Zbl 0952.68003] \textit{Wada, Koichi; Nagata, Yoriyuki; Chen, Wei}, An optimal fault-tolerant routing for triconnected planar graphs, 191-201 [Zbl 0948.68005] \textit{Flocchini, Paola; Geurts, Frédéric; Santoro, Nicola}, Optimal irreversible dynamos in chordal rings, 202-214 [Zbl 0957.68093] \textit{Cohen, Johanne; Fraigniaud, Pierre; Gavoille, Cyril}, Recognizing bipartite incident-graphs of circulant digraphs, 215-227 [Zbl 0941.05059] \textit{Bezrukov, Sergei L.; Das, Sajal K.; Elsässer, Robert}, Optimal cuts for powers of the Petersen graph, 228-239 [Zbl 0946.05082] \textit{Park, Jung-Heum; Kim, Hee-Chul}, Dihamiltonian decomposition of regular graphs with degree three, 240-249 [Zbl 0941.05051] \textit{Accornero, Anna; Ancona, Massimo; Varini, Sonia}, All separating triangles in a plane graph can be optimally ``broken'' in polynomial time, 278-290 [Zbl 0941.05058] \textit{Díaz, Josep; Penrose, Mathew D.; Petit, Jordi; Serna, María}, Linear orderings of random geometric graphs, 291-302 [Zbl 0941.05055] \textit{Nishimura, Naomi; Ragde, Prabhakar; Thilikos, Dimitrios M.}, Finding smallest supertrees under minor containment, 303-312 [Zbl 0944.68145] \textit{Chen, Jianer; Kanj, Iyad A.; Jia, Weijia}, Vertex cover: Further observations and further improvements, 313-324 [Zbl 0952.68111] \textit{Liebers, Annegret; Wagner, Dorothea; Weihe, Karsten}, On the hardness of recognizing bundles in time table graphs, 325-337 [Zbl 0942.68650] \textit{Fiala, Jiří; Kloks, Ton; Kratochvíl, Jan}, Fixed-parameter complexity of \(\lambda\)-labelings, 350-363 [Zbl 0943.05072] \textit{Brandstädt, Andreas; Dragan, Feodor F.; Köhler, Ekkehard}, Linear time algorithms for Hamiltonian problems on (claw, net)-free graphs (extended abstract), 364-376 [Zbl 0943.05080] \textit{Hempel, Harald; Kratsch, Dieter}, On claw-free asteroidal triple-free graphs, 377-390 [Zbl 0941.05060] \textit{Confessore, Giuseppe; Dell'Olmo, Paolo; Giordani, Stefano}, Vertex partitioning of crown-free interval graphs, 391-401 [Zbl 1003.68118] \textit{Parfenoff, I.; Roussel, F.; Rusu, I.}, Triangulated neighbourhoods in \(C_4\)-free Berge graphs, 402-412 [Zbl 0941.05031]