Conferences in DBLP

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

1. Hans-Jürgen Bandelt
   Invited Presentation: Median Hulls as Steiner Hulls in Rectilinear and Molecular Sequence Spaces. [Citation Graph (0, 0)][DBLP]
   WG, 2001, pp:1-7 [Conf]
   
2. Friedhelm Meyer auf der Heide
   Invited Presentation: Data Management in Networks. [Citation Graph (0, 0)][DBLP]
   WG, 2001, pp:8- [Conf]
   
3. Sergei L. Bezrukov, Robert Elsässer
   Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs. [Citation Graph (0, 0)][DBLP]
   WG, 2001, pp:9-20 [Conf]
   
4. Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Pino Persiano, Hervé Rivano
   Approximate Constrained Bipartite Edge Coloring. [Citation Graph (0, 0)][DBLP]
   WG, 2001, pp:21-31 [Conf]
   
5. Maw-Shang Chang, Ton Kloks, Chuan-Min Lee
   Maximum Clique Transversals. [Citation Graph (0, 0)][DBLP]
   WG, 2001, pp:32-43 [Conf]
   
6. Maw-Shang Chang, Haiko Müller
   On the Tree-Degree of Graphs. [Citation Graph (0, 0)][DBLP]
   WG, 2001, pp:44-54 [Conf]
   
7. Jianer Chen, Iyad A. Kanj
   On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms. [Citation Graph (0, 0)][DBLP]
   WG, 2001, pp:55-65 [Conf]
   
8. Serafino Cicerone, Gianluca D'Ermiliis, Gabriele Di Stefano
   (k, +)-Distance-Hereditary Graphs. [Citation Graph (0, 0)][DBLP]
   WG, 2001, pp:66-77 [Conf]
   
9. Derek G. Corneil, Udi Rotics
   On the Relationship between Clique-Width and Treewidth. [Citation Graph (0, 0)][DBLP]
   WG, 2001, pp:78-90 [Conf]
   
10. Sabine Cornelsen, Yefim Dinitz, Dorothea Wagner
    Planarity of the 2-Level Cactus Model. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:91-102 [Conf]
    
11. Feodor F. Dragan
    Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:103-116 [Conf]
    
12. Wolfgang Espelage, Frank Gurski, Egon Wanke
    How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:117-128 [Conf]
    
13. Haodi Feng
    (g, f)-Factorizations Orthogonal to k Subgraphs. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:129-139 [Conf]
    
14. Guillaume Fertin, André Raspaud, Bruce A. Reed
    On Star Coloring of Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:140-153 [Conf]
    
15. Jirí Fiala, Klaus Jansen, Van Bang Le, Eike Seidel
    Graph Subcolorings: Complexity and Algorithms. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:154-165 [Conf]
    
16. Fedor V. Fomin, Hans L. Bodlaender
    Approximation of Pathwidth of Outerplanar Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:166-176 [Conf]
    
17. Fedor V. Fomin, Dimitrios M. Thilikos
    On the Monotonicity of Games Generated by Symmetric Submodular Functions. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:177-188 [Conf]
    
18. Sven Fuhrmann, Sven Oliver Krumke, Hans-Christoph Wirth
    Multiple Hotlink Assignment. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:189-200 [Conf]
    
19. Cyril Gavoille, David Peleg, André Raspaud, Eric Sopena
    Small k-Dominating Sets in Planar Graphs with Applications. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:201-216 [Conf]
    
20. Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel
    Lower Bounds for Approximation Algorithms for the Steiner Tree Problem. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:217-228 [Conf]
    
21. Öjvind Johansson
    log n-Approximative NLC_k-Decomposition in O(n^2k+1) Time. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:229-240 [Conf]
    
22. Ekkehard Köhler, Derek G. Corneil, Stephan Olariu, Lorna Stewart
    On Subfamilies of AT-Free Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:241-253 [Conf]
    
23. Daniel Král, Jan Kratochvíl, Zsolt Tuza, Gerhard J. Woeginger
    Complexity of Coloring Graphs without Forbidden Induced Subgraphs. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:254-262 [Conf]
    
24. Van Bang Le, Bert Randerath
    On Stable Cutsets in Line Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:263-271 [Conf]
    
25. Eunseuk Oh, Jianer Chen
    On Strong Menger-Connectivity of Star Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:272-283 [Conf]
    
26. Maurizio Patrignani, Maurizio Pizzonia
    The Complexity of the Matching-Cut Problem. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:284-295 [Conf]
    
27. Rudi Pendavingh, Petra Schuurman, Gerhard J. Woeginger
    De Bruijn Graphs and DNA Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:296-305 [Conf]
    
28. Antonio Puricella, Iain A. Stewart
    A Generic Greedy Algorithm, Partially-Ordered Graphs and NP-Completeness. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:306-316 [Conf]
    
29. Annegret Wagler
    Critical and Anticritical Edges in Perfect Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:317-328 [Conf]