The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Andrew Chi-Chih Yao
    Hypergraphs and Decision Trees (Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:1- [Conf]
  2. Paola Alimonti, Tiziana Calamoneri
    Improved Approximations of Independent Dominating Set in Bounded Degree Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:2-16 [Conf]
  3. Luitpold Babel, Stephan Olariu
    A New Characterization of P4-connected Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:17-30 [Conf]
  4. Michel Bauderon, Hélène Jacquet
    Node Rewriting in Hypergraphs. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:31-43 [Conf]
  5. Sergei L. Bezrukov
    On k-Partitioning the n-Cube. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:44-55 [Conf]
  6. Adrienne L. Broadwater, Kemal Efe, Antonio Fernández
    Embedding Complete Binary Trees in Product Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:56-66 [Conf]
  7. Krzysztof Brys, Zbigniew Lonc
    Clique and Anticlique Partition of Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:67-72 [Conf]
  8. Chi-Chang Chen, Jianer Chen
    Optimal Parallel Routing in Star Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:73-84 [Conf]
  9. Serafino Cicerone, Daniele Frigioni, Umberto Nanni, Francesco Pugliese
    Counting Edges in a Dag. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:85-100 [Conf]
  10. Ornella Ciotti, Francesco Parisi-Presicce
    Closure Properties of Context-Tree Hyperedge Replacement Systems. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:101-113 [Conf]
  11. Pierluigi Crescenzi, Paolo Penna
    Upward Drawings of Search Trees (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:114-125 [Conf]
  12. Krzysztof Diks, Torben Hagerup
    More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:126-140 [Conf]
  13. Krzysztof Diks, Andrzej Pelc
    System Diagnosis with Smallest Risk of Error. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:141-150 [Conf]
  14. Hristo Djidjev
    On-Line Algorithms for Shortest Path Problems on Planar Digraphs. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:151-165 [Conf]
  15. Feodor F. Dragan, Falk Nicolai, Andreas Brandstädt
    LexBFS-Orderings and Power of Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:166-180 [Conf]
  16. Jens Gustedt
    Efficient Union-Find for Planar Graphs and other Sparse Graph Classes (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:181-195 [Conf]
  17. Stephan Hartmann, Markus W. Schäffter, Andreas S. Schulz
    Switchbox Routing in VLSI Design: Closing the Complexity Gap. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:196-210 [Conf]
  18. Michel Hurfin, Michel Raynal
    Detecting Diamond Necklaces in Labeled Dags (A Problem from Distributed Debugging). [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:211-223 [Conf]
  19. Wolfram Kahl
    Algebraic Graph Derivations for Graphical Calculi. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:224-238 [Conf]
  20. Damon Kaller
    Definability Equals Recognizability of Partial 3-Trees. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:239-253 [Conf]
  21. Bettina Klinz, Gerhard J. Woeginger
    One, Two, Three, Many, or: Complexity Aspects of Dynamic Network Flows with Dedicated Arcs. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:254-267 [Conf]
  22. Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, David Peleg
    Approximate Maxima Finding of Continuous Functions Under Restricted Budget (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:268-278 [Conf]
  23. Leo G. Kroon, Arunabha Sen, Haiyong Deng, Asim Roy
    The Optimal Cost Chromatic Partition Problem for Trees and Interval Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:279-292 [Conf]
  24. Sven Oliver Krumke, Hartmut Noltemeier, Madhav V. Marathe, S. S. Ravi, Kay U. Drangmeister
    Modifying Networks to Obtain Low Cost Trees. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:293-307 [Conf]
  25. Ewa Malesinska, Alessandro Panconesi
    On the Hardness of Allocating Frequencies for Hybrid Networks. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:308-322 [Conf]
  26. Falk Nicolai, Thomas Szymczak
    Homogeneous Sets and Domination Problems. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:323-337 [Conf]
  27. Koji Obokata, Yukihiro Iwasaki, Feng Bao, Yoshihide Igarashi
    Independent Spanning Trees of Product Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:338-351 [Conf]
  28. Swamy K. Sitarama, Abdol-Hossein Esfahanian
    Designing Distance-Preserving Fault-Tolerant Topologies. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:352-366 [Conf]
  29. Tadao Takaoka
    Shortest Path Algorithms for Nearly Acyclic Directed Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:367-374 [Conf]
  30. Spyros Tragoudas, Yaakov L. Varol
    Computing Disjoint Path with Lenght Constraints. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:375-389 [Conf]
  31. Xiao Zhou, Abul Kashem, Takao Nishizeki
    Generalized Edge-Ranking of Trees (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:390-404 [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