Graph-theoretic concepts in computer science. 24th international workshop, WG '98, Smolenice Castle, Slovak Republic, June 18--20, 1998. Proceedings (Q1269733)

The articles of this volume will be reviewed individually. The preceding workshop (23rd, 1997) has been reviewed (see Zbl 0877.00011). Indexed articles: \textit{Courcelle, B.; Makowsky, J. A.; Rotics, U.}, Linear time solvable optimization problems on graphs of bounded clique width, 1-16 [Zbl 0929.90084] \textit{Damaschke, Peter}, Minus domination in small-degree graphs (extended abstract), 17-25 [Zbl 0915.05074] \textit{Guruswami, Venkatesan; Rangan, C. Pandu; Chang, M. S.; Chang, G. J.; Wong, C. K.}, The vertex-disjoint triangles problem, 26-37 [Zbl 0918.68081] \textit{Böckenhauer, Hans-Joachim}, Communication in the two-way listen-in vertex-disjoint paths mode, 38-49 [Zbl 0918.68082] \textit{Dobrev, Stefan; Ružička, Peter}, Broadcasting on anonymous unoriented tori, 50-62 [Zbl 0936.68119] \textit{Fertin, Guillaume; Raspaud, André}, Families of graphs having broadcasting and gossiping properties, 63-77 [Zbl 0918.68083] \textit{Togni, Olivier}, Optical all-to-all communication in inflated networks, 78-87 [Zbl 0918.68005] \textit{Broersma, Hajo; Kloks, Ton; Kratsch, Dieter; Müller, Haiko}, A generalization of AT-free graphs and a generic algorithm for solving treewidth, minimum fill-in and vertex ranking, 88-99 [Zbl 0928.68086] \textit{Isobe, Shuji; Zhou, Xiao; Nishizeki, Takao}, A polynomial-time algorithm for finding total colorings of partial \(k\)-trees, 100-113 [Zbl 0915.05059] \textit{Kratochvíl, Jan; Tuza, Zsolt}, Rankings of directed graphs. (Extended abstract), 114-123 [Zbl 0918.68084] \textit{Biedl, Therese; Kaufmann, Michael; Mutzel, Petra}, Drawing planar partitions. II: HH-drawings, 124-136 [Zbl 0918.68085] \textit{Felsner, Stefan; Kriegel, Klaus}, Triangles in Euclidean arrangements, 137-148 [Zbl 1023.52006] \textit{Kahl, Wolfram}, Internally typed second-order term graphs, 149-163 [Zbl 0918.68086] \textit{Talamo, Maurizio; Vocca, Paola}, Compact implicit representation of graphs. (Extended abstract), 164-176 [Zbl 0918.68087] \textit{Cicerone, Serafino; Di Stefano, Gabriele}, Graphs with bounded induced distance, 177-191 [Zbl 0916.05023] \textit{Corneil, Derek G.; Dragan, Feodor F.; Habib, Michel; Paul, Christophe}, Diameter determination on restricted graph families, 192-202 [Zbl 0928.68087] \textit{Handke, Dagmar}, Independent tree spanners. Fault-tolerant spanning trees with constant distance guarantees. (Extended abstract), 203-214 [Zbl 0918.68088] \textit{Krumke, S. O.; Marathe, M. V.; Noltemeier, H.; Ravi, S. S.; Wirth, H.-C.}, Upgrading bottleneck constrained forests, 215-226 [Zbl 0936.68009] \textit{Gauyacq, G.; Micheneau, C.; Raspaud, A.}, Routing in recursive circulant graphs: Edge forwarding index and Hamiltonian decomposition, 227-241 [Zbl 0936.68074] \textit{Klasing, Ralf}, Improved compressions of cube-connected cycles networks. (Extended abstract), 242-256 [Zbl 0918.68089] \textit{Röttger, Markus; Schroeder, Ulf-Peter}, Efficient embeddings of grids into grids (extended abstract), 257-271 [Zbl 0915.05051] \textit{Shahrokhi, Farhad; Székely, László A.}, Integral uniform flows in symmetric networks. (Extended abstract), 272-284 [Zbl 0915.90101] \textit{Faria, L.; de Figueiredo, C. M. H.; Mendonça, C. F. X.}, Splitting number is NP-complete, 285-297 [Zbl 0918.68048] \textit{Fekete, Sándor P.; Kremer, Jana}, Tree spanners in planar graphs. (Extended abstract), 298-309 [Zbl 0918.68090] \textit{Miura, Kazuyuki; Takahashi, Daishiro; Nakano, Shin-ichi; Nishizeki, Takao}, A linear-time algorithm to find four independent spanning trees in four-connected planar graphs, 310-323 [Zbl 0918.68091] \textit{Wada, Koichi; Chen, Wei}, Linear algorithms for a \(k\)-partition problem of planar graphs without specifying bases, 324-336 [Zbl 0918.68092] \textit{Babel, Luitpold; Olariu, Stephan}, Domination and Steiner tree problems on graphs with few \(P_4\)s, 337-350 [Zbl 0916.05043] \textit{Dahlhaus, Elias}, Minimum fill-in and treewidth for graphs modularly decomposable into chordal graphs, 351-358 [Zbl 0936.68075] \textit{Fomin, Fedor V.; Golovach, Petr A.}, Interval completion with the smallest max-degree (extended abstract), 359-371 [Zbl 0915.05073] \textit{Gorbunov, K. Yu.}, An estimate of the tree-width of a planar graph which has not a given planar grid as a minor, 372-383 [Zbl 0915.05052]