Conferences in DBLP

(colognetwente)
2008 (conf/colognetwente/2008)

1. 
   Improving the gap of Erdös-Pósa property for minor-closed graph classes. [Citation Graph (, )][DBLP]
   
   
2. 
   Fault-Free Hamiltonian Cycles in Pancake Graphs with Conditional Edge Faults. [Citation Graph (, )][DBLP]
   
   
3. 
   Digraph Embedding on T_h. [Citation Graph (, )][DBLP]
   
   
4. 
   An Application of Network Design with Orientation Constraints. [Citation Graph (, )][DBLP]
   
   
5. 
   Classbased Detailed Routing in VLSI Design. [Citation Graph (, )][DBLP]
   
   
6. 
   A Simple 3-Approximation of Minimum Manhattan Networks. [Citation Graph (, )][DBLP]
   
   
7. 
   Exact Graph Coloring via Hybrid Approaches. [Citation Graph (, )][DBLP]
   
   
8. 
   Maximum Profit Wavelength Assignment in WDM Rings. [Citation Graph (, )][DBLP]
   
   
9. 
   Cellular radio resource allocation problem. [Citation Graph (, )][DBLP]
   
   
10. 
    A local approximation algorithm for maximum weight matching. [Citation Graph (, )][DBLP]
    
    
11. 
    An Exact Approach for solving the Balanced Minimum Evolution Problem. [Citation Graph (, )][DBLP]
    
    
12. 
    Heuristic and exact approaches to the Quadratic Minimum Spanning Tree Problem. [Citation Graph (, )][DBLP]
    
    
13. 
    On the cardinality constrained matroid polytope. [Citation Graph (, )][DBLP]
    
    
14. 
    On the Facial Structure of the Common Edge Subgraph polytope. [Citation Graph (, )][DBLP]
    
    
15. 
    Reformulations in Mathematical Programming: Definitions. [Citation Graph (, )][DBLP]
    
    
16. 
    UFO: Uncertainty Feature Optimization, an Implicit Paradigm for Problems with Noisy Data. [Citation Graph (, )][DBLP]
    
    
17. 
    A dynamic service mechanic problem for a housing corporation. [Citation Graph (, )][DBLP]
    
    
18. 
    Special Cases of Online Parallel Job Scheduling. [Citation Graph (, )][DBLP]
    
    
19. 
    Percolation on sparse random graphs with given degree sequence. [Citation Graph (, )][DBLP]
    
    
20. 
    On co-distance hereditary graphs. [Citation Graph (, )][DBLP]
    
    
21. 
    Global r-alliances and total domination. [Citation Graph (, )][DBLP]
    
    
22. 
    Exact Algorithms for the Vertex Separator Problem in Graphs. [Citation Graph (, )][DBLP]
    
    
23. 
    Inverse Tension Problems. [Citation Graph (, )][DBLP]
    
    
24. 
    On minimum reload cost paths, tours and flows. [Citation Graph (, )][DBLP]
    
    
25. 
    A decomposition for total-coloring graphs of maximum degree 3. [Citation Graph (, )][DBLP]
    
    
26. 
    Using Latin Squares to Color Split Graphs. [Citation Graph (, )][DBLP]
    
    
27. 
    On total chromatic number of direct product graphs. [Citation Graph (, )][DBLP]
    
    
28. 
    Bidirectional A^* on Time-dependent Graphs. [Citation Graph (, )][DBLP]
    
    
29. 
    A Multi-start Heuristic Algorithm for the Generalized Traveling Salesman Problem. [Citation Graph (, )][DBLP]
    
    
30. 
    The Uncapacitated Swapping Problem. [Citation Graph (, )][DBLP]
    
    
31. 
    Edge fault-diameter of Cartesian graph bundles. [Citation Graph (, )][DBLP]
    
    
32. 
    Decomposing trees with large diameter. [Citation Graph (, )][DBLP]
    
    
33. 
    On the Bi-enhancement of Chordal-bipartite Probe Graphs. [Citation Graph (, )][DBLP]
    
    
34. 
    A Compact Representation for Chordal Graphs. [Citation Graph (, )][DBLP]
    
    
35. 
    Constrained Decompositions of Integer Matrices and their Applications to Intensity Modulated Radiation Therapy. [Citation Graph (, )][DBLP]
    
    
36. 
    A Note on LP Relaxations for the 1D Cutting Stock Problem with Setup Costs. [Citation Graph (, )][DBLP]
    
    
37. 
    Locating Median Paths on Connected Outerplanar Graphs. [Citation Graph (, )][DBLP]
    
    
38. 
    Dynamic Programming for Optimization of Capacitor Allocation in Power Distribution Networks. [Citation Graph (, )][DBLP]
    
    
39. 
    Approximating (r, p)-Centroid on a Path. [Citation Graph (, )][DBLP]