The SCEAS System
Navigation Menu

Conferences in DBLP

Workshop on Graph-Theoretic Concepts in Computer Science (WG) (wg)
1998 (conf/wg/1998)

  1. 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]
  2. Peter Damaschke
    Minus Domination in Small-Degree Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:17-25 [Conf]
  3. 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]
  4. 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]
  5. Stefan Dobrev, Peter Ruzicka
    Broadcasting on Anonymous Unoriented Tori. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:50-62 [Conf]
  6. Guillaume Fertin, André Raspaud
    Families of Graphs Having Broadcasting and Gossiping Properties. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:63-77 [Conf]
  7. Olivier Togni
    Optical All-to-All Communication in Inflated Networks. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:78-87 [Conf]
  8. 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]
  9. 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]
  10. Jan Kratochvíl, Zsolt Tuza
    Rankings of Directed Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:114-123 [Conf]
  11. Therese C. Biedl, Michael Kaufmann, Petra Mutzel
    Drawing Planar Partitions II: HH-Drawings. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:124-136 [Conf]
  12. Stefan Felsner, Klaus Kriegel
    Triangles in Euclidean Arrangements. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:137-148 [Conf]
  13. Wolfram Kahl
    Interally Typed Second-Order Term Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:149-163 [Conf]
  14. Maurizio Talamo, Paola Vocca
    Compact Implicit Representation of Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:164-176 [Conf]
  15. Serafino Cicerone, Gabriele Di Stefano
    Graphs with Bounded Induced Distance. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:177-191 [Conf]
  16. 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]
  17. Dagmar Handke
    Independent Tree Spanners. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:203-214 [Conf]
  18. 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]
  19. 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]
  20. Ralf Klasing
    Improved Compressions of Cube-Connected Cycles Networks. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:242-256 [Conf]
  21. Markus Röttger, Ulf-Peter Schroeder
    Efficient Embeddings of Grids into Grids. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:257-271 [Conf]
  22. Farhad Shahrokhi, László A. Székely
    Integral Uniform Flows in Symmetric Networks. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:272-284 [Conf]
  23. 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]
  24. Sándor P. Fekete, Jana Kremer
    Tree Spanners in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:298-309 [Conf]
  25. 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]
  26. 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]
  27. 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]
  28. 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]
  29. Fedor V. Fomin, Petr A. Golovach
    Interval Completion with the Smallest Max-degree. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:359-371 [Conf]
  30. 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]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002