Conferences in DBLP

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

1. 
   Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs. [Citation Graph (, )][DBLP]
   
   
2. 
   Recognizing Bipartite Tolerance Graphs in Linear Time. [Citation Graph (, )][DBLP]
   
   
3. 
   Graph Searching in a Crime Wave. [Citation Graph (, )][DBLP]
   
   
4. 
   Monotonicity of Non-deterministic Graph Searching. [Citation Graph (, )][DBLP]
   
   
5. 
   Tree-Width and Optimization in Bounded Degree Graphs. [Citation Graph (, )][DBLP]
   
   
6. 
   On Restrictions of Balanced 2-Interval Graphs. [Citation Graph (, )][DBLP]
   
   
7. 
   Graph Operations Characterizing Rank-Width and Balanced Graph Expressions. [Citation Graph (, )][DBLP]
   
   
8. 
   The Clique-Width of Tree-Power and Leaf-Power Graphs. [Citation Graph (, )][DBLP]
   
   
9. 
   NLC-2 Graph Recognition and Isomorphism. [Citation Graph (, )][DBLP]
   
   
10. 
    A Characterisation of the Minimal Triangulations of Permutation Graphs. [Citation Graph (, )][DBLP]
    
    
11. 
    The 3-Steiner Root Problem. [Citation Graph (, )][DBLP]
    
    
12. 
    On Finding Graph Clusterings with Maximum Modularity. [Citation Graph (, )][DBLP]
    
    
13. 
    On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs. [Citation Graph (, )][DBLP]
    
    
14. 
    A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs. [Citation Graph (, )][DBLP]
    
    
15. 
    Approximation Algorithms for Geometric Intersection Graphs. [Citation Graph (, )][DBLP]
    
    
16. 
    An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem. [Citation Graph (, )][DBLP]
    
    
17. 
    Mixing 3-Colourings in Bipartite Graphs. [Citation Graph (, )][DBLP]
    
    
18. 
    Minimum-Weight Cycle Covers and Their Approximability. [Citation Graph (, )][DBLP]
    
    
19. 
    On the Number of alpha -Orientations. [Citation Graph (, )][DBLP]
    
    
20. 
    Complexity and Approximation Results for the Connected Vertex Cover Problem. [Citation Graph (, )][DBLP]
    
    
21. 
    Segmenting Strings Homogeneously Via Trees. [Citation Graph (, )][DBLP]
    
    
22. 
    Characterisations and Linear-Time Recognition of Probe Cographs. [Citation Graph (, )][DBLP]
    
    
23. 
    Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete. [Citation Graph (, )][DBLP]
    
    
24. 
    Proper Helly Circular-Arc Graphs. [Citation Graph (, )][DBLP]
    
    
25. 
    Pathwidth of Circular-Arc Graphs. [Citation Graph (, )][DBLP]
    
    
26. 
    Characterization and Recognition of Digraphs of Bounded Kelly-width. [Citation Graph (, )][DBLP]
    
    
27. 
    How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms. [Citation Graph (, )][DBLP]
    
    
28. 
    Obtaining a Planar Graph by Vertex Deletion. [Citation Graph (, )][DBLP]
    
    
29. 
    Mixed Search Number and Linear-Width of Interval and Split Graphs. [Citation Graph (, )][DBLP]
    
    
30. 
    Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation. [Citation Graph (, )][DBLP]
    
    
31. 
    The Complexity of Bottleneck Labeled Graph Problems. [Citation Graph (, )][DBLP]