Conferences in DBLP

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

1. Evangelos Kranakis, Danny Krizanc, Berthold Ruf, Jorge Urrutia, Gerhard J. Woeginger
   VC-Dimensions for Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
   WG, 1995, pp:1-13 [Conf]
   
2. Ton Kloks, Dieter Kratsch, Haiko Müller
   Finding and Counting Small Induced Subgraphs Efficiently. [Citation Graph (0, 0)][DBLP]
   WG, 1995, pp:14-23 [Conf]
   
3. Luitpold Babel, Stephan Olariu
   On the Isomorphism of Graphs with Few P4s. [Citation Graph (0, 0)][DBLP]
   WG, 1995, pp:24-36 [Conf]
   
4. Daniele Giorgio Degiorgi, Klaus Simon
   A Dynamic Algorithm for Line Graph Recognition. [Citation Graph (0, 0)][DBLP]
   WG, 1995, pp:37-48 [Conf]
   
5. Fabrizio d'Amore, Roberto Giaccio
   Incremental Hive Graph. [Citation Graph (0, 0)][DBLP]
   WG, 1995, pp:49-61 [Conf]
   
6. Hristo Djidjev, Shankar M. Venkatesan
   Planarization of Graphs Embedded on Surfaces. [Citation Graph (0, 0)][DBLP]
   WG, 1995, pp:62-72 [Conf]
   
7. Sven Oliver Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe
   Complexity and Approximability of Certain Bicriteria Location Problems. [Citation Graph (0, 0)][DBLP]
   WG, 1995, pp:73-87 [Conf]
   
8. Detlef Plump
   On Termination of Graph Rewriting. [Citation Graph (0, 0)][DBLP]
   WG, 1995, pp:88-100 [Conf]
   
9. Michel Bauderon
   A Uniform Approach to Graph Rewriting: The Pullback Approach. [Citation Graph (0, 0)][DBLP]
   WG, 1995, pp:101-115 [Conf]
   
10. F. David Fracchia
    Visualizing Two- and Three-Dimensional Models of Meristematic Growth. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:116-130 [Conf]
    
11. Sven Hartmann
    Graph-Theoretical Methods to Construct Entity-Relationship Databases. [Citation Graph (1, 0)][DBLP]
    WG, 1995, pp:131-145 [Conf]
    
12. Ingo Schiermeyer
    An Approximation Algorithm for 3-Colourability. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:146-151 [Conf]
    
13. Sophie Fischer, Leen Torenvliet
    The Malleability of TSP_{2Opt}. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:152-166 [Conf]
    
14. Paola Alimonti
    Non-Oblivious Local Search for Grpah and Hyperpraph Coloring Problems. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:167-180 [Conf]
    
15. Hans L. Bodlaender, Richard B. Tan, Dimitrios M. Thilikos, Jan van Leeuwen
    On Interval Routing Schemes and Treewidth. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:181-196 [Conf]
    
16. Koichi Wada, Takaharu Ikeo, Kimio Kawaguchi, Wei Chen
    Highly Fault-Tolerant Routings and Diameter Vulnerability for Generalized Hypercube Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:197-208 [Conf]
    
17. Friedhelm Meyer auf der Heide, Matthias Westermann
    Hot-Potato Routing on Multi-Dimensional Tori. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:209-221 [Conf]
    
18. Michele Flammini, Giorgio Gambosi, Sandro Salomone
    On Devising Boolean Routing Schemes. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:222-236 [Conf]
    
19. Barbara D. Birchler, Abdol-Hossein Esfahanian, Eric Torng
    Toward a General Theory of Unicast-Based Multicast Communication. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:237-251 [Conf]
    
20. José D. P. Rolim, Ondrej Sýkora, Imrich Vrto
    Optimal Cutwidths and Bisection Widths of 2- and 3-Dimensional Meshes. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:252-264 [Conf]
    
21. Peter Damaschke
    Searching for Faulty Leaves in Binary Trees. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:265-274 [Conf]
    
22. Zhi-Zhong Chen, Xin He
    NC Algorithms for Partitioning Planar Graphs into Induced Forests and Approximating NP-Hard Problems. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:275-289 [Conf]
    
23. Elias Dahlhaus
    Efficient Parallel Modular Decomposition (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:290-302 [Conf]
    
24. Paola Bonizzoni, Gianluca Della Vedova
    Modular Decomposition of Hypergraphs. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:303-317 [Conf]
    
25. John L. Pfaltz
    Partition Coefficients of Acyclic Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:318-322 [Conf]
    
26. Tadao Takaoka
    Sub-Cubic Cost Algorithms for the All Pairs Shortest Path Problem. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:323-343 [Conf]
    
27. Jitender S. Deogun, Dieter Kratsch
    Diametral Path Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:344-357 [Conf]
    
28. Philippe Galinier, Michel Habib, Christophe Paul
    Chordal Graphs and Their Clique Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:358-371 [Conf]
    
29. Jens Gustedt, Michel Morvan, Laurent Viennot
    A Compact Data Structure and Parallel Algorithms for Permutation Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:372-380 [Conf]
    
30. Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai
    Homogeneously Orderable Graphs and the Steiner Tree Problem. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:381-395 [Conf]