The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. David P. Williamson
    Gadgets, Approximation, and Linear Programming: Improved Hardness Results for Cut and Satisfiability Problems (Abstract of Invited Lecture). [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:1- [Conf]
  2. Paola Alimonti
    Non-oblivious Local Search for MAX 2-CCSP with Application to MAX DICUT. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:2-14 [Conf]
  3. Helmut Alt, Ulrich Fuchs, Klaus Kriegel
    On the Number of Simple Cycles in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:15-24 [Conf]
  4. Luitpold Babel, Stephan Olariu
    On the Separable-Homogeneous Decomposition of Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:25-37 [Conf]
  5. Luitpold Babel, Gerhard J. Woeginger
    Pseudo-Hamiltonian Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:38-51 [Conf]
  6. Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes
    Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:52-64 [Conf]
  7. Karell Bertet, Jens Gustedt, Michel Morvan
    Weak-Order Extensions of an Order. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:65-77 [Conf]
  8. Alberto Bertoni, Paola Campadelli, Roberto Posenato
    An Upper Bound for the Maximum Cut Mean Value. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:78-84 [Conf]
  9. Ulrik Brandes, Dagmar Handke
    NP-Completness Results for Minimum Planar Spanners. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:85-99 [Conf]
  10. Stephan Brandt
    Computing the Independence Number of Dense Triangle-Free Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:100-108 [Conf]
  11. Hajo Broersma, Elias Dahlhaus, Ton Kloks
    Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:109-117 [Conf]
  12. Christian Capelle
    Block Decomposition of Inheritance Hierarchies. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:118-131 [Conf]
  13. Elias Dahlhaus
    Minimal Elimination Ordering Inside a Given Chordal Graph. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:132-143 [Conf]
  14. Fabrizio d'Amore, Fabio Iacobini
    On-Line Algorithms for Networks of Temporal Constraints. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:144-156 [Conf]
  15. Babette de Fluiter, Hans L. Bodlaender
    Parallel Algorithms for Treewidth Two. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:157-170 [Conf]
  16. Yefim Dinitz, Marcelo Feighelstein, Shmuel Zaks
    On Optimal Graphs Embedded into Path and Rings, with Analysis Using l1-Spheres. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:171-183 [Conf]
  17. Feodor F. Dragan
    On Greedy Matching Ordering and Greedy Matchable Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:184-198 [Conf]
  18. Thomas Erlebach, Klaus Jansen
    Off-Line and On-Line Call-Scheduling in Stars and Trees. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:199-213 [Conf]
  19. Petr Hlinený, Jan Kratochvíl
    Computational Complexity of the Krausz Dimension of Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:214-228 [Conf]
  20. Ton Kloks, Dieter Kratsch, Haiko Müller
    Asteroidal Sets in Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:229-241 [Conf]
  21. Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle
    Complexity of Colored Graph Covers I. Colored Directed Multigraphs. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:242-257 [Conf]
  22. Mohamed Mosbah, Nasser Saheb
    A Syntactic Approach to Random Walks on Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:258-272 [Conf]
  23. Erich Prisner
    Bicliques in Graphs II: Recognizing k-Path Graphs and Underlying Graphs of Line Digraphs. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:273-287 [Conf]
  24. Michael Sampels
    Large Networks with Small Diameter. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:288-302 [Conf]
  25. Konstantin Skodinis
    The Bounded Tree-Width Problem of Context-Free Graph Languages. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:303-317 [Conf]
  26. Mikkel Thorup
    Structured Programs have Small Tree-Width and Good Register Allocation (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:318-332 [Conf]
  27. Ryuhei Uehara
    A Measure of Parallelization for the Lexicographically First Maximal Subgraph Problems. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:333-341 [Conf]
  28. Tanja E. J. Vos, S. Doaitse Swierstra
    Make your Enemies Transparent. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:342-353 [Conf]
  29. Koichi Wada, Wei Chen, Yupin Luo, Kimio Kawaguchi
    Optimal Fault-Tolerant ATM-Routings for Biconnected Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:354-367 [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