IWPEC 2009: Copenhagen, Denmark

• Noga Alon, Shai Gutner:
  Balanced Hashing, Color Coding and Approximate Counting. 1-16
  
• Hans L. Bodlaender:
  Kernelization: New Upper and Lower Bound Techniques. 17-37
  
• Sebastian Böcker, Falk Hüffner, Anke Truß, Magnus Wahlström:
  A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams. 38-49
  
• Hans L. Bodlaender, Daniel Lokshtanov, Eelko Penninkx:
  Planar Capacitated Dominating Set Is W[1]-Hard. 50-60
  
• Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle:
  Boolean-Width of Graphs. 61-74
  
• Chris Calabro, Russell Impagliazzo, Ramamohan Paturi:
  The Complexity of Satisfiability of Small Depth Circuits. 75-85
  
• Jean Daligault, Stéphan Thomassé:
  On Finding Directed Trees with Many Leaves. 86-97
  
• Peter Damaschke:
  Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms. 98-109
  
• Peter Damaschke:
  Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover. 110-121
  
• Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A. Kanj, Frances A. Rosamond, Ondrej Suchý:
  What Makes Equitable Connected Partition Easy. 122-133
  
• Rok Erman, Lukasz Kowalik, Matjaz Krnc, Tomasz Walen:
  Improved Induced Matchings in Sparse Graphs. 134-148
  
• Michael R. Fellows, Danny Hermelin, Frances A. Rosamond:
  Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs. 149-160
  
• Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith:
  An Exact Algorithm for the Maximum Leaf Spanning Tree Problem. 161-172
  
• Martin Fürer, Serge Gaspers, Shiva Prasad Kasiviswanathan:
  An Exponential Time 2-Approximation Algorithm for Bandwidth. 173-184
  
• Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith:
  On Digraph Width Measures in Parameterized Algorithmics. 185-197
  
• Panos Giannopoulos, Christian Knauer, Günter Rote:
  The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension. 198-209
  
• Petr A. Golovach, Dimitrios M. Thilikos:
  Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms. 210-221
  
• Gregory Gutin, Daniel Karapetyan, Igor Razgon:
  Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs. 222-233
  
• Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo:
  A Probabilistic Approach to Problems Parameterized above or below Tight Bounds. 234-245
  
• Shai Gutner:
  Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor. 246-257
  
• Mikko Koivisto:
  Partitioning into Sets of Bounded Cardinality. 258-263
  
• Stefan Kratsch, Magnus Wahlström:
  Two Edge Modification Problems without Polynomial Kernels. 264-275
  
• Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
  On the Directed Degree-Preserving Spanning Tree Problem. 276-287
  
• Daniel Lokshtanov, Saket Saurabh:
  Even Faster Algorithm for Set Splitting! 288-299
  
• Dániel Marx, Ildikó Schlotter:
  Stable Assignment with Couples: Parameterized Complexity and Local Search. 300-311
  
• Narges Simjour:
  Improved Parameterized Algorithms for the Kemeny Aggregation Problem. 312-323
  
• Karol Suchan, Yngve Villanger:
  Computing Pathwidth Faster Than 2ⁿ. 324-335
  

Last update Fri May 24 19:32:44 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page