The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Hans L. Bodlaender, Joost Engelfriet
    Domino Treewith (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:1-13 [Conf]
  2. Siddharthan Ramachandramurthi
    A Lower Bound for Treewidth and Its Consequences. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:14-25 [Conf]
  3. Renate Garbe
    Tree-width and Path-width of Comparability Graphs of interval Orders. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:26-37 [Conf]
  4. Jürgen Ebert, Angelika Franzke
    A Declarative Approach to Graph Based Modeling. [Citation Graph (1, 0)][DBLP]
    WG, 1994, pp:38-50 [Conf]
  5. Francesco Parisi-Presicce, Gabriele Piersanti
    Multilevel Graph Grammars. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:51-64 [Conf]
  6. Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan
    The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:65-80 [Conf]
  7. Elias Dahlhaus, Peter L. Hammer, Frédéric Maffray, Stephan Olariu
    On Domination Elimination Orderings and Domination Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:81-92 [Conf]
  8. Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle
    Complexity of Graph Covering Problems. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:93-105 [Conf]
  9. Ton Kloks, Dieter Kratsch, Haiko Müller
    Dominoes. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:106-120 [Conf]
  10. Volker Turau, Weimin Chen
    GLB-Closures in Directed Acyclic Graphs and Their Applications. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:121-129 [Conf]
  11. Pierluigi Crescenzi, Luca Trevisan
    Minimum Vertex Cover, Distributed Decision-Making, and Communication Complexity (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:130-139 [Conf]
  12. Thomas Andreae, Michael Nölle, Gerald Schreiber
    Cartesian Products of Graphs as Spanning Subgraphs of De Bruijn Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:140-150 [Conf]
  13. Andy Schürr
    Specification of Graph Translators with Triple Graph Grammars. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:151-163 [Conf]
  14. Bernhard Westfechtel
    Using Programmed Graph Rewriting for the Formal Specification of a Configuration Management System. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:164-179 [Conf]
  15. Konstantin Skodinis, Egon Wanke
    Exponential Time Analysis of Confluent and Boundary eNCE Graph Languages. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:180-192 [Conf]
  16. Dharmavani Bhagavathi, Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing
    Time-Optimal Tree Computations on Sparse Meshes. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:193-205 [Conf]
  17. Shiva Chaudhuri, Torben Hagerup
    Prefix Graphs and Their Applications. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:206-218 [Conf]
  18. Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
    The Complexity of Broadcasting in Planar and Decomposable Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:219-231 [Conf]
  19. Zhi-Zhong Chen
    The Maximal f-Dependent Set Problem for Planar Graphs is in NC. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:232-241 [Conf]
  20. Giuseppe Di Battista, Roberto Tamassia, Luca Vismara
    On-Line Convex Plabarity Testing. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:242-255 [Conf]
  21. Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
    Book Embeddings and Crossing Numbers. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:256-268 [Conf]
  22. Valeska Naumann
    Measuring the Distance to Series-Parallelity by Path Expressions. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:269-281 [Conf]
  23. Mordecai J. Golin, Shmuel Zaks
    Labelled Trees and Pairs of Input-Output Permutations in Priority Queues. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:282-291 [Conf]
  24. Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza
    Ranking of Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:292-304 [Conf]
  25. Heiko Dörr
    Bypass Strong V-Structures and Find an Isomorphic Labelled Subgraph in Linear Time. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:305-318 [Conf]
  26. Koichi Wada, Akinari Takaki, Kimio Kawaguchi
    Efficient Algorithms for a Mixed k-Partition Problem of Graphs without Specifying Bases. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:319-330 [Conf]
  27. Nick D. Dendris, Lefteris M. Kirousis, Dimitrios M. Thilikos
    Fugitive-Search Games on Graphs and Related Parameters. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:331-342 [Conf]
  28. Yoji Kajitani, Jun Dong Cho, Majid Sarrafzadeh
    New Approximation Results on Graph Matching and related Problems. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:343-358 [Conf]
  29. Detlef Sieling, Ingo Wegener
    New Lower Bounds and Hierarchy Results for Restricted Branching Programs. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:359-370 [Conf]
  30. Roberto Giaccio
    On-line Algorithms for Satisfiability Problems with Uncertainty. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:371-386 [Conf]
  31. Evripidis Bampis, Yannis Manoussakis, Ioannis Milis
    NC Algorithms for Antidirected Hamiltonian Paths and Cycles in Tournaments (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:387-394 [Conf]
  32. Luitpold Babel, Ilia N. Ponomarenko, Gottfried Tinhofer
    Direct Path Graph Isomorphism (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:395-406 [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