Conferences in DBLP
Bruno Courcelle , Johann A. Makowsky , Udi Rotics Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width. [Citation Graph (0, 0)][DBLP ] WG, 1998, pp:1-16 [Conf ] Peter Damaschke Minus Domination in Small-Degree Graphs. [Citation Graph (0, 0)][DBLP ] WG, 1998, pp:17-25 [Conf ] Venkatesan Guruswami , C. Pandu Rangan , Maw-Shang Chang , Gerard J. Chang , C. K. Wong The Vertex-Disjoint Triangles Problem. [Citation Graph (0, 0)][DBLP ] WG, 1998, pp:26-37 [Conf ] Hans-Joachim Böckenhauer Communication in the Two-Way Listen-in Vertex-disjoint Paths Mode. [Citation Graph (0, 0)][DBLP ] WG, 1998, pp:38-49 [Conf ] Stefan Dobrev , Peter Ruzicka Broadcasting on Anonymous Unoriented Tori. [Citation Graph (0, 0)][DBLP ] WG, 1998, pp:50-62 [Conf ] Guillaume Fertin , André Raspaud Families of Graphs Having Broadcasting and Gossiping Properties. [Citation Graph (0, 0)][DBLP ] WG, 1998, pp:63-77 [Conf ] Olivier Togni Optical All-to-All Communication in Inflated Networks. [Citation Graph (0, 0)][DBLP ] WG, 1998, pp:78-87 [Conf ] Hajo Broersma , Ton Kloks , Dieter Kratsch , Haiko Müller A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking. [Citation Graph (0, 0)][DBLP ] WG, 1998, pp:88-99 [Conf ] Shuji Isobe , Xiao Zhou , Takao Nishizeki A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees. [Citation Graph (0, 0)][DBLP ] WG, 1998, pp:100-113 [Conf ] Jan Kratochvíl , Zsolt Tuza Rankings of Directed Graphs. [Citation Graph (0, 0)][DBLP ] WG, 1998, pp:114-123 [Conf ] Therese C. Biedl , Michael Kaufmann , Petra Mutzel Drawing Planar Partitions II: HH-Drawings. [Citation Graph (0, 0)][DBLP ] WG, 1998, pp:124-136 [Conf ] Stefan Felsner , Klaus Kriegel Triangles in Euclidean Arrangements. [Citation Graph (0, 0)][DBLP ] WG, 1998, pp:137-148 [Conf ] Wolfram Kahl Interally Typed Second-Order Term Graphs. [Citation Graph (0, 0)][DBLP ] WG, 1998, pp:149-163 [Conf ] Maurizio Talamo , Paola Vocca Compact Implicit Representation of Graphs. [Citation Graph (0, 0)][DBLP ] WG, 1998, pp:164-176 [Conf ] Serafino Cicerone , Gabriele Di Stefano Graphs with Bounded Induced Distance. [Citation Graph (0, 0)][DBLP ] WG, 1998, pp:177-191 [Conf ] Derek G. Corneil , Feodor F. Dragan , Michel Habib , Christophe Paul Diameter Determination on Restricted Graph Faminlies. [Citation Graph (0, 0)][DBLP ] WG, 1998, pp:192-202 [Conf ] Dagmar Handke Independent Tree Spanners. [Citation Graph (0, 0)][DBLP ] WG, 1998, pp:203-214 [Conf ] Sven Oliver Krumke , Madhav V. Marathe , Hartmut Noltemeier , S. S. Ravi , Hans-Christoph Wirth Upgrading Bottleneck Constrained Forests. [Citation Graph (0, 0)][DBLP ] WG, 1998, pp:215-226 [Conf ] Ginette Gauyacq , C. Micheneau , André Raspaud Routing in Recursive Circulant Graphs: Edge Forwarding Index and Hamiltonian Decomposition. [Citation Graph (0, 0)][DBLP ] WG, 1998, pp:227-241 [Conf ] Ralf Klasing Improved Compressions of Cube-Connected Cycles Networks. [Citation Graph (0, 0)][DBLP ] WG, 1998, pp:242-256 [Conf ] Markus Röttger , Ulf-Peter Schroeder Efficient Embeddings of Grids into Grids. [Citation Graph (0, 0)][DBLP ] WG, 1998, pp:257-271 [Conf ] Farhad Shahrokhi , László A. Székely Integral Uniform Flows in Symmetric Networks. [Citation Graph (0, 0)][DBLP ] WG, 1998, pp:272-284 [Conf ] Luerbio Faria , Celina M. Herrera de Figueiredo , Candido Ferreira Xavier de Mendonça Neto Splitting Number is NP-complete [Citation Graph (0, 0)][DBLP ] WG, 1998, pp:285-297 [Conf ] Sándor P. Fekete , Jana Kremer Tree Spanners in Planar Graphs. [Citation Graph (0, 0)][DBLP ] WG, 1998, pp:298-309 [Conf ] Kazuyuki Miura , Daishiro Takahashi , Shin-Ichi Nakano , Takao Nishizeki A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs. [Citation Graph (0, 0)][DBLP ] WG, 1998, pp:310-323 [Conf ] Koichi Wada , Wei Chen Linear Algorithms for a k-partition Problem of Planar Graphs without Specifying Bases. [Citation Graph (0, 0)][DBLP ] WG, 1998, pp:324-336 [Conf ] Luitpold Babel , Stephan Olariu Domination and Steiner Tree Problems on Graphs with Few P4S. [Citation Graph (0, 0)][DBLP ] WG, 1998, pp:337-350 [Conf ] Elias Dahlhaus Minimum Fill-in and Treewidth for Graphs Modularly Decomposable into Chordal Graphs. [Citation Graph (0, 0)][DBLP ] WG, 1998, pp:351-358 [Conf ] Fedor V. Fomin , Petr A. Golovach Interval Completion with the Smallest Max-degree. [Citation Graph (0, 0)][DBLP ] WG, 1998, pp:359-371 [Conf ] Konstantin Yu. Gorbunov An Estimate of the Tree-Width of a Planar Graph Which Has Not a Given Planar Grid as a Minor. [Citation Graph (0, 0)][DBLP ] WG, 1998, pp:372-383 [Conf ]