The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Derek G. Corneil
    Lexicographic Breadth First Search - A Survey. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:1-19 [Conf]
  2. Roger Wattenhofer
    Wireless Networking: Graph Theory Unplugged. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:20-32 [Conf]
  3. Shin-Ichi Nakano, Takeaki Uno
    Constant Time Generation of Trees with Specified Diameter. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:33-45 [Conf]
  4. Sabine Cornelsen, Gabriele Di Stefano
    Treelike Comparability Graphs: Characterization, Recognition, and Applications. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:46-57 [Conf]
  5. Jirí Fiala, Petr A. Golovach, Jan Kratochvíl
    Elegant Distance Constrained Labelings of Trees. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:58-67 [Conf]
  6. Feodor F. Dragan, Chenyu Yan, Derek G. Corneil
    Collective Tree Spanners and Routing in AT-free Related Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:68-80 [Conf]
  7. Hans L. Bodlaender, Arie M. C. A. Koster
    On the Maximum Cardinality Search Lower Bound for Treewidth. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:81-92 [Conf]
  8. Christophe Crespelle, Christophe Paul
    Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:93-104 [Conf]
  9. Stavros D. Nikolopoulos, Leonidas Palios
    Recognizing HHD-free and Welsh-Powell Opposition Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:105-116 [Conf]
  10. Jean-Luc Fouquet, Michel Habib, Fabien de Montgolfier, Jean-Marie Vanherpe
    Bimodular Decomposition of Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:117-128 [Conf]
  11. Michaël Rao
    Coloring a Graph Using Split Decomposition. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:129-141 [Conf]
  12. Fabrizio Grandoni, Giuseppe F. Italiano
    Decremental Clique Problem. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:142-153 [Conf]
  13. Daniel Sawitzki
    A Symbolic Approach to the All-Pairs Shortest-Paths Problem. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:154-167 [Conf]
  14. Eduardo Moreno, Martín Matamala
    Minimal de Bruijn Sequence in a Language with Forbidden Substrings. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:168-176 [Conf]
  15. Franz Baader
    A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic EL. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:177-188 [Conf]
  16. Hajo Broersma, Daniël Paulusma, Gerard J. M. Smit, Frank Vlaardingerbroek, Gerhard J. Woeginger
    The Computational Complexity of the Minimum Weight Processor Assignment Problem. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:189-200 [Conf]
  17. Nicola Apollonio, Massimiliano Caramia, Giuseppe F. Italiano
    A Stochastic Location Problem with Applications to Tele-diagnostic. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:201-213 [Conf]
  18. Tim Nieberg, Johann Hurink, Walter Kern
    A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:214-221 [Conf]
  19. Boris Goldengorin, Gerard Sierksma, Marcel Turkensteen
    Tolerance Based Algorithms for the ATSP. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:222-234 [Conf]
  20. Mike Fellows, Pinar Heggernes, Frances A. Rosamond, Christian Sloper, Jan Arne Telle
    Finding k Disjoint Triangles in an Arbitrary Graph. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:235-244 [Conf]
  21. Fedor V. Fomin, Dieter Kratsch, Gerhard J. Woeginger
    Exact (Exponential) Algorithms for the Dominating Set Problem. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:245-256 [Conf]
  22. Benny Chor, Mike Fellows, David W. Juedes
    Linear Kernels in Linear Time, or How to Save k Colors in O(n2) Steps. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:257-269 [Conf]
  23. Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer
    Planar Graphs, via Well-Orderly Maps and Trees. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:270-284 [Conf]
  24. Valentin E. Brimkov, Reneta P. Barneva, Reinhard Klette, Joseph Straight
    Efficient Computation of the Lovász Theta Function for a Class of Circulant Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:285-295 [Conf]
  25. Mordecai J. Golin, Yiu-Cho Leung
    Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:296-307 [Conf]
  26. Zhi-Zhong Chen, Tatsuie Tsukiji
    Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:308-319 [Conf]
  27. Md. Saidur Rahman, Kazuyuki Miura, Takao Nishizeki
    Octagonal Drawings of Plane Graphs with Prescribed Face Areas. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:320-331 [Conf]
  28. Michael Baur, Ulrik Brandes
    Crossing Reduction in Circular Layouts. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:332-343 [Conf]
  29. Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter
    Characterization and Recognition of Generalized Clique-Helly Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:344-354 [Conf]
  30. Michele Conforti, Anna Galluccio, Guido Proietti
    Edge-Connectivity Augmentation and Network Matrices. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:355-364 [Conf]
  31. Takehiro Ito, Xiao Zhou, Takao Nishizeki
    Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:365-376 [Conf]
  32. Dominique de Werra, Marc Demange, Jérôme Monnot, Vangelis Th. Paschos
    The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:377-388 [Conf]
  33. Thomas Bietenhader, Yoshio Okamoto
    Core Stability of Minimum Coloring Games. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:389-401 [Conf]
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002