Conferences in DBLP

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

1. Norbert Korte, Rolf H. Möhring
   A Simple Linear -TIme Algorithm to Recognize Interval Graphs. [Citation Graph (0, 0)][DBLP]
   WG, 1986, pp:1-16 [Conf]
   
2. Peter Widmayer
   An Approximation Algorithms for Steiner's Problem in Graphs. [Citation Graph (0, 0)][DBLP]
   WG, 1986, pp:17-28 [Conf]
   
3. Manfred Kaul
   Specification of Error Distances for Graphs by Precedence Graph Grammars and Fast Recognition of Similarity. [Citation Graph (0, 0)][DBLP]
   WG, 1986, pp:29-40 [Conf]
   
4. Manfred Jackel
   ADA Concurrency Specified by Graph Grammars. [Citation Graph (0, 0)][DBLP]
   WG, 1986, pp:41-57 [Conf]
   
5. M. Dao, Michel Habib, J. P. Richard, D. Tallot
   CABRI, An Interactive System for Graph Manipulation. [Citation Graph (0, 0)][DBLP]
   WG, 1986, pp:58-67 [Conf]
   
6. Hans Zierer, Gunther Schmidt, Rudolf Berghammer
   An Interactive Graphical Manipulation System for Higher Order Objects Based on Relational Algebra. [Citation Graph (0, 0)][DBLP]
   WG, 1986, pp:68-81 [Conf]
   
7. Walter Vogler
   Behaviour Preserving Refinement of Petri Nets. [Citation Graph (0, 0)][DBLP]
   WG, 1986, pp:82-93 [Conf]
   
8. Ulrich Faigle
   The Bandwidth of Planar Distributive Lattices. [Citation Graph (0, 0)][DBLP]
   WG, 1986, pp:94-105 [Conf]
   
9. Rolf Klein, Derick Wood
   The Node Visit Cost of Brother Trees. [Citation Graph (0, 0)][DBLP]
   WG, 1986, pp:106-117 [Conf]
   
10. Stephan Abramowski, Heinrich Müller
    Searching Connected Components in Very Large Grid Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1986, pp:118-130 [Conf]
    
11. Ramesh Dewangan, C. Pandu Rangan
    A Simple Implementation of Warshall's Algorithm on a VLSI Chip. [Citation Graph (0, 0)][DBLP]
    WG, 1986, pp:131-145 [Conf]
    
12. Maciej M. Syslo
    On Some Generalizations of Outerplanar Graphs: Results and Open Problems. [Citation Graph (0, 0)][DBLP]
    WG, 1986, pp:146-164 [Conf]
    
13. Manfred Wiegers
    Recognizing Outerplanar Graphs in Linear Time. [Citation Graph (0, 0)][DBLP]
    WG, 1986, pp:165-176 [Conf]
    
14. Ivan Gutman
    Graphs and Graph Polynomials of interest in Chemistry. [Citation Graph (0, 0)][DBLP]
    WG, 1986, pp:177-187 [Conf]
    
15. David P. Helmbold, Ernst W. Mayr
    Applications of Parallel Scheduling to Perfect Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1986, pp:188-203 [Conf]
    
16. Horst Wedde
    A Graph-Theoretic Approach for Designing Fair Distributed Resource Scheduling Algorithms. [Citation Graph (0, 0)][DBLP]
    WG, 1986, pp:204-226 [Conf]
    
17. Anneke A. Schoone, Hans L. Bodlaender, Jan van Leeuwen
    Improved Diameter Bounds for Altered Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1986, pp:227-236 [Conf]
    
18. Frank K. H. A. Dehne, Jörg-Rüdiger Sack
    Seperability of Sets of Polygons. [Citation Graph (0, 0)][DBLP]
    WG, 1986, pp:237-251 [Conf]
    
19. Roberto Tamassia, Ioannis G. Tollis
    Centipede Graphs and Visibility on a Cylinder. [Citation Graph (0, 0)][DBLP]
    WG, 1986, pp:252-263 [Conf]
    
20. Paul G. Spirakis
    The Diameter of Connected Components of Random Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1986, pp:264-276 [Conf]
    
21. Giuseppe Di Battista, Enrico Nardelli
    An Algorithm for Testing Planarity of Hierarchical Graphs. [Citation Graph (1, 0)][DBLP]
    WG, 1986, pp:277-289 [Conf]
    
22. Detlev Ruland
    EDM - A Data Model for Electronic CAD/CAM-Applications. [Citation Graph (0, 0)][DBLP]
    WG, 1986, pp:290-305 [Conf]