The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Hartmut Noltemeier
    Invited Lecture: Silver Graphs: Achievements and New Challenges. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:1-9 [Conf]
  2. Susanne Albers
    Invited Lecture: Online Algorithms: A Study of Graph-Theoretic Concepts. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:10-26 [Conf]
  3. Thomas Lengauer
    Invited Lecture: Discrete Optimization Methods for Packing Problems in Two and Three Dimensions - With Applications in the Textile and Car Manufacturing Industries. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:27-28 [Conf]
  4. Nicola Santoro
    Informatica, Scoula, Communità: Uno Sguardo dall' Occhio del Ciclone. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:29- [Conf]
  5. David Peleg
    Proximity-Preserving Labeling Schemes and Their Applications. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:30-41 [Conf]
  6. Dietrich Hauptmeier, Sven Oliver Krumke, Jörg Rambau, Hans-Christoph Wirth
    Euler is Standing in Line. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:42-54 [Conf]
  7. Sascha Ott
    Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:55-64 [Conf]
  8. Assaf Natanzon, Ron Shamir, Roded Sharan
    Complexity Classification of Some Edge Modification Problems. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:65-77 [Conf]
  9. Hans-Christoph Wirth, Jan Steffan
    On Minimum Diameter Spanning Trees under Reload Costs. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:78-88 [Conf]
  10. Michele Zito
    Induced Matchings in Regular Graphs and Trees. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:89-100 [Conf]
  11. Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle
    Mod-2 Independence and Domination in Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:101-109 [Conf]
  12. Öjvind Johansson
    NLC2-Decomposition in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:110-121 [Conf]
  13. Benno Stein, Oliver Niggemann
    On the Nature of Structure and Its Identification. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:122-134 [Conf]
  14. Martin Charles Golumbic, Udi Rotics
    On the Clique-Width of Perfect Graph Classes. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:135-147 [Conf]
  15. Ljubomir Perkovic, Bruce A. Reed
    An Improved Algorithm for Finding Tree Decompositions of Small Width. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:148-154 [Conf]
  16. Konstantin Skodinis
    Efficient Analysis of Graphs with Small Minimal Separators. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:155-166 [Conf]
  17. Anne Berry, Jean Paul Bordat, Olivier Cogis
    Generating All the Minimal Separators of a Graph. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:167-172 [Conf]
  18. Stefan Dobrev, Imrich Vrto
    Two Broadcasting Problems in Faulty Hypercubes. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:173-178 [Conf]
  19. Olivier Baudon, Guillaume Fertin, Ivan Havel
    Routing Permutations in the Hypercube. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:179-190 [Conf]
  20. Koichi Wada, Yoriyuki Nagata, Wei Chen
    An Optimal Fault-Tolerant Routing for Triconnected Planar Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:191-201 [Conf]
  21. Paola Flocchini, Frédéric Geurts, Nicola Santoro
    Optimal Irreversible Dynamos in Chordal Rings. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:202-214 [Conf]
  22. Johanne Cohen, Pierre Fraigniaud, Cyril Gavoille
    Recognizing Bipartite Incident-Graphs of Circulant Digraphs. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:215-227 [Conf]
  23. Sergei L. Bezrukov, Sajal K. Das, Robert Elsässer
    Optimal Cuts for Powers of the Petersen Graph. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:228-239 [Conf]
  24. Jung-Heum Park, Hee-Chul Kim
    Dihamiltonian Decomposition of Regular Graphs with Degree Three. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:240-249 [Conf]
  25. Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
    Box-Rectangular Drawings of Plane Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:250-261 [Conf]
  26. Ronny Hadany, David Harel
    A Multi-Scale Algorithm for Drawing Graphs Nicely. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:262-277 [Conf]
  27. Anna Accornero, Massimo Ancona, Sonia Varini
    All Separating Triangles in a Plane Graph Can Be Optimally "Broken" in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:278-290 [Conf]
  28. Josep Díaz, Mathew D. Penrose, Jordi Petit, Maria J. Serna
    Linear Orderings of Random Geometric Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:291-302 [Conf]
  29. Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
    Finding Smallest Supertrees Under Minor Containment. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:303-312 [Conf]
  30. Jianer Chen, Iyad A. Kanj, Weijia Jia
    Vertex Cover: Further Observations and Further Improvements. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:313-324 [Conf]
  31. Annegret Liebers, Dorothea Wagner, Karsten Weihe
    On the Hardness of Recognizing Bundles in Time Table Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:325-337 [Conf]
  32. Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen
    Optimal Solutions for Frequency Assignment Problems via Tree Decomposition. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:338-349 [Conf]
  33. Jirí Fiala, Ton Kloks, Jan Kratochvíl
    Fixed-Parameter Complexity of lambda-Labelings. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:350-363 [Conf]
  34. Andreas Brandstädt, Feodor F. Dragan, Ekkehard Köhler
    Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:364-376 [Conf]
  35. Harald Hempel, Dieter Kratsch
    On Claw-Free Asteroidal Triple-Free Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:377-390 [Conf]
  36. Giuseppe Confessore, Paolo Dell'Olmo, Stefano Giordani
    Vertex Partitioning of Crown-Free Interval Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:391-401 [Conf]
  37. Igor Parfenoff, Florian Roussel, Irena Rusu
    Triangulated Neighbourhoods in C4-Free Berge Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:402-412 [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