Skip to main content
SpringerLink
Log in

Parameterized and Exact Computation

4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers

  • Conference proceedings
  • © 2009

Overview

Editors:
  1. Jianer Chen

    1. Department of Computer Science and Engineering, Texas A&M University, Texas, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Fedor V. Fomin

    1. Institutt for informatikk, Universitetet i Bergen, Bergen, Norway

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 5917)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: IWPEC 2009.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (27 papers)

  1. Front Matter

    Download chapter PDF

  2. Balanced Hashing, Color Coding and Approximate Counting

    • Noga Alon, Shai Gutner
    Pages 1-16

  3. Kernelization: New Upper and Lower Bound Techniques

    • Hans L. Bodlaender
    Pages 17-37

  4. A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams

    • Sebastian Böcker, Falk Hüffner, Anke Truss, Magnus Wahlström
    Pages 38-49

  5. Planar Capacitated Dominating Set Is W[1]-Hard

    • Hans L. Bodlaender, Daniel Lokshtanov, Eelko Penninkx
    Pages 50-60

  6. Boolean-Width of Graphs

    • B. -M. Bui-Xuan, J. A. Telle, M. Vatshelle
    Pages 61-74

  7. The Complexity of Satisfiability of Small Depth Circuits

    • Chris Calabro, Russell Impagliazzo, Ramamohan Paturi
    Pages 75-85

  8. On Finding Directed Trees with Many Leaves

    • Jean Daligault, Stéphan Thomassé
    Pages 86-97

  9. Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms

    • Peter Damaschke
    Pages 98-109

  10. Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover

    • Peter Damaschke
    Pages 110-121

  11. What Makes Equitable Connected Partition Easy

    • Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad Kanj, Frances Rosamond, Ondřej Suchý
    Pages 122-133

  12. Improved Induced Matchings in Sparse Graphs

    • Rok Erman, Łukasz Kowalik, Matjaž Krnc, Tomasz Waleń
    Pages 134-148

  13. Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs

    • Michael R. Fellows, Danny Hermelin, Frances A. Rosamond
    Pages 149-160

  14. An Exact Algorithm for the Maximum Leaf Spanning Tree Problem

    • Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible et al.
    Pages 161-172

  15. An Exponential Time 2-Approximation Algorithm for Bandwidth

    • Martin Fürer, Serge Gaspers, Shiva Prasad Kasiviswanathan
    Pages 173-184

  16. On Digraph Width Measures in Parameterized Algorithmics

    • Robert Ganian, Petr Hliněný, Joachim Kneis, Alexander Langer, Jan Obdržálek, Peter Rossmanith
    Pages 185-197

  17. The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension

    • Panos Giannopoulos, Christian Knauer, Günter Rote
    Pages 198-209

  18. Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms

    • Petr A. Golovach, Dimitrios M. Thilikos
    Pages 210-221

  19. Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs

    • Gregory Gutin, Daniel Karapetyan, Igor Razgon
    Pages 222-233

  20. A Probabilistic Approach to Problems Parameterized above or below Tight Bounds

    • Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo
    Pages 234-245
Back to top

Keywords

Editors and Affiliations

  • Department of Computer Science and Engineering, Texas A&M University, Texas, USA

    Jianer Chen

  • Institutt for informatikk, Universitetet i Bergen, Bergen, Norway

    Fedor V. Fomin

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation