Skip to main content
  • Conference proceedings
  • © 2009

Parameterized and Exact Computation

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

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)

Conference series link(s): IWPEC: International Workshop on Parameterized and Exact Computation

Conference proceedings info: IWPEC 2009.

Buying options

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (27 papers)

  1. Front Matter

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

    • Sebastian Böcker, Falk Hüffner, Anke Truss, Magnus Wahlström
    Pages 38-49
  3. Planar Capacitated Dominating Set Is W[1]-Hard

    • Hans L. Bodlaender, Daniel Lokshtanov, Eelko Penninkx
    Pages 50-60
  4. Boolean-Width of Graphs

    • B. -M. Bui-Xuan, J. A. Telle, M. Vatshelle
    Pages 61-74
  5. The Complexity of Satisfiability of Small Depth Circuits

    • Chris Calabro, Russell Impagliazzo, Ramamohan Paturi
    Pages 75-85
  6. On Finding Directed Trees with Many Leaves

    • Jean Daligault, Stéphan Thomassé
    Pages 86-97
  7. What Makes Equitable Connected Partition Easy

    • Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad Kanj, Frances Rosamond, Ondřej Suchý
    Pages 122-133
  8. Improved Induced Matchings in Sparse Graphs

    • Rok Erman, Łukasz Kowalik, Matjaž Krnc, Tomasz Waleń
    Pages 134-148
  9. Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs

    • Michael R. Fellows, Danny Hermelin, Frances A. Rosamond
    Pages 149-160
  10. 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
  11. An Exponential Time 2-Approximation Algorithm for Bandwidth

    • Martin Fürer, Serge Gaspers, Shiva Prasad Kasiviswanathan
    Pages 173-184
  12. On Digraph Width Measures in Parameterized Algorithmics

    • Robert Ganian, Petr Hliněný, Joachim Kneis, Alexander Langer, Jan Obdržálek, Peter Rossmanith
    Pages 185-197
  13. The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension

    • Panos Giannopoulos, Christian Knauer, Günter Rote
    Pages 198-209
  14. Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms

    • Petr A. Golovach, Dimitrios M. Thilikos
    Pages 210-221
  15. A Probabilistic Approach to Problems Parameterized above or below Tight Bounds

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

Other Volumes

  1. Parameterized and Exact Computation

Keywords

  • algorithmics
  • algorithms
  • classification
  • complexity
  • computational graph theory
  • discrete mathematic
  • exponential time
  • graph algorithms
  • maximum spanning tree
  • optimization
  • parametrized algorithms
  • parametrized complexity
  • satisfiability
  • sparse graphs
  • vertex cover
  • algorithm analysis and problem complexity

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

Buying options

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions