27. WG 2001: Boltenhagen, Germany

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

Last update Tue Feb 14 04:13:06 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page