Conferences in DBLP

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

1. 
   (Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspective. [Citation Graph (, )][DBLP]
   
   
2. 
   Memory Efficient Anonymous Graph Exploration. [Citation Graph (, )][DBLP]
   
   
3. 
   Algorithmic Meta Theorems. [Citation Graph (, )][DBLP]
   
   
4. 
   A Most General Edge Elimination Polynomial. [Citation Graph (, )][DBLP]
   
   
5. 
   Approximating the Metric TSP in Linear Time. [Citation Graph (, )][DBLP]
   
   
6. 
   The Valve Location Problem in Simple Network Topologies. [Citation Graph (, )][DBLP]
   
   
7. 
   A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs. [Citation Graph (, )][DBLP]
   
   
8. 
   On the Pseudo-achromatic Number Problem. [Citation Graph (, )][DBLP]
   
   
9. 
   Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings. [Citation Graph (, )][DBLP]
   
   
10. 
    Faster Exact Bandwidth. [Citation Graph (, )][DBLP]
    
    
11. 
    Additive Spanners for Circle Graphs and Polygonal Graphs. [Citation Graph (, )][DBLP]
    
    
12. 
    Upward Straight-Line Embeddings of Directed Graphs into Point Sets. [Citation Graph (, )][DBLP]
    
    
13. 
    Complexity of the Packing Coloring Problem for Trees. [Citation Graph (, )][DBLP]
    
    
14. 
    Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges. [Citation Graph (, )][DBLP]
    
    
15. 
    A Lower Bound on the Area Requirements of Series-Parallel Graphs. [Citation Graph (, )][DBLP]
    
    
16. 
    On Independent Sets and Bicliques in Graphs. [Citation Graph (, )][DBLP]
    
    
17. 
    Evaluations of Graph Polynomials. [Citation Graph (, )][DBLP]
    
    
18. 
    Parameterized Complexity for Domination Problems on Degenerate Graphs. [Citation Graph (, )][DBLP]
    
    
19. 
    An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph. [Citation Graph (, )][DBLP]
    
    
20. 
    Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs. [Citation Graph (, )][DBLP]
    
    
21. 
    The Rank-Width of the Square Grid. [Citation Graph (, )][DBLP]
    
    
22. 
    Improved Upper Bounds for Partial Vertex Cover. [Citation Graph (, )][DBLP]
    
    
23. 
    On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width. [Citation Graph (, )][DBLP]
    
    
24. 
    Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms. [Citation Graph (, )][DBLP]
    
    
25. 
    What Is between Chordal and Weakly Chordal Graphs?. [Citation Graph (, )][DBLP]
    
    
26. 
    Parameterized Graph Cleaning Problems. [Citation Graph (, )][DBLP]
    
    
27. 
    Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph. [Citation Graph (, )][DBLP]
    
    
28. 
    Fast Robber in Planar Graphs. [Citation Graph (, )][DBLP]
    
    
29. 
    From a Circular-Arc Model to a Proper Circular-Arc Model. [Citation Graph (, )][DBLP]
    
    
30. 
    Digraph Decompositions and Monotonicity in Digraph Searching. [Citation Graph (, )][DBLP]
    
    
31. 
    Searching for a Visible, Lazy Fugitive. [Citation Graph (, )][DBLP]
    
    
32. 
    A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes. [Citation Graph (, )][DBLP]
    
    
33. 
    Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs. [Citation Graph (, )][DBLP]