Electronic Notes in Discrete Mathematics, Volume 32

Volume 32, March 2009

• Arie M. C. A. Koster, Vadim V. Lozin:
  DIMAP Workshop on Algorithmic Graph Theory. 1
  
• Domingos Moreira Cardoso, Sofia J. Pinheiro:
  Spectral upper bounds on the size of k-regular induced subgraphs. 3-10
  
• Carmen C. Centeno, Mitre Costa Dourado, Jayme Luiz Szwarcfiter:
  On the Convexity of Paths of Length Two in Undirected Graphs. 11-18
  
• Vladimir G. Deineko, Alexander Tiskin:
  Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio. 19-26
  
• Pinar Heggernes, Daniel Meister, Charis Papadopoulos:
  A new representation of proper interval graphs with an application to clique-width. 27-34
  
• Alexander Grigoriev, Bert Marchal, Natalya Usotskaya:
  On planar graphs with large tree-width and small grid minors. 35-42
  
• Stan P. M. van Hoesel, Bert Marchal:
  Finding good tree decompositions by local search. 43-50
  
• Daniel Brügmann, Christian Komusiewicz, Hannes Moser:
  On Generating Triangle-Free Graphs. 51-58
  
• Ignasi Sau, Dimitrios M. Thilikos:
  Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs. 59-66
  
• Kathie Cameron, Chính T. Hoàng, Benjamin Lévêque:
  Asteroids in rooted and directed path graphs. 67-74
  
• Gregory Gutin:
  Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems. 75-82
  
• Tomás Feder, Pavol Hell, Jing Huang, Arash Rafiey:
  Adjusted Interval Digraphs. 83-91
  
• Frédéric Mazoit:
  Tree-width of graphs and surface duality. 93-97
  
• Michel Habib, Juraj Stacho:
  Linear Algorithms for Chordal Graphs of Bounded Directed Vertex Leafage. 99-108
  
• David Coudert, Dorian Mazauric, Nicolas Nisse:
  On Rerouting Connection Requests in Networks with Shared Bandwidth. 109-116
  
• Feodor F. Dragan, Yang Xiang, Chenyu Yan:
  Collective Tree Spanners for Unit Disk Graphs with Applications. 117-124
  
• Michel Habib, Vincent Limouzy:
  On some simplicial elimination schemes for chordal graphs. 125-132
  
• Nicholas Korpelainen:
  A Polynomial-time Algorithm for the Dominating Induced Matching Problem in the Class of Convex Graphs. 133-140