Skip to main content
Springer Nature Link
Account

Parameterized and Exact Computation

First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004, Proceedings

  • Conference proceedings
  • © 2004

Overview

Editors:
  1. Rod Downey

    1. School of Mathematics, Statistics, and Computer Science, Victoria University, Wellington, New Zealand

  2. Michael Fellows

    1. PCRU, Office of DVC (Research), University of Newcastle, Australia

  3. Frank Dehne

    1. Carleton University, Ottawa, Canada

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

Included in the following conference series:

Conference proceedings info: IWPEC 2004.

  • 15k Accesses

  • 2 Citations

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

Explore related subjects

Discover the latest articles, books and news in related subjects.

Table of contents (26 papers)

  1. Front Matter

    Download chapter PDF

  2. Parameterized Enumeration, Transversals, and Imperfect Phylogeny Reconstruction

    • Peter Damaschke
    Pages 1-12

  3. Online Problems, Pathwidth, and Persistence

    • Rodney G. Downey, Catherine McCartin
    Pages 13-24

  4. Chordless Paths Through Three Vertices

    • Robert Haas, Michael Hoffmann
    Pages 25-36

  5. Computing Small Search Numbers in Linear Time

    • Hans L. Bodlaender, Dimitrios M. Thilikos
    Pages 37-48

  6. Bounded Fixed-Parameter Tractability: The Case 2poly( k)

    • Mark Weyer
    Pages 49-60

  7. Refined Memorisation for Vertex Cover

    • L. Sunil Chandran, Fabrizio Grandoni
    Pages 61-70

  8. Parameterized Graph Separation Problems

    • Dániel Marx
    Pages 71-82

  9. Parameterized Coloring Problems on Chordal Graphs

    • Dániel Marx
    Pages 83-95

  10. On Decidability of MSO Theories of Representable Matroids

    • Petr HlinÄ›ný, Detlef Seese
    Pages 96-107

  11. On Miniaturized Problems in Parameterized Complexity Theory

    • Yijia Chen, Jörg Flum
    Pages 108-120

  12. Smaller Kernels for Hitting Set Problems of Constant Arity

    • Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
    Pages 121-126

  13. Packing Edge Disjoint Triangles: A Parameterized View

    • Luke Mathieson, Elena Prieto, Peter Shaw
    Pages 127-137

  14. Looking at the Stars

    • Elena Prieto, Christian Sloper
    Pages 138-148

  15. Moving Policies in Cyclic Assembly-Line Scheduling

    • Matthias Müller-Hannemann, Karsten Weihe
    Pages 149-161

  16. A Structural View on Parameterizing Problems: Distance from Triviality

    • Jiong Guo, Falk Hüffner, Rolf Niedermeier
    Pages 162-173

  17. Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable

    • Jens Gramm, Till Nierhoff, Till Tantau
    Pages 174-186

  18. Simplifying the Weft Hierarchy

    • Jonathan F. Buss, Tarique Islam
    Pages 187-199

  19. The Minimum Weight Triangulation Problem with Few Inner Points

    • Michael Hoffmann, Yoshio Okamoto
    Pages 200-212

  20. A Direct Algorithm for the Parameterized Face Cover Problem

    • Faisal N. Abu-Khzam, Michael A. Langston
    Pages 213-222
Back to top

Editors and Affiliations

  • School of Mathematics, Statistics, and Computer Science, Victoria University, Wellington, New Zealand

    Rod Downey

  • PCRU, Office of DVC (Research), University of Newcastle, Australia

    Michael Fellows

  • Carleton University, Ottawa, Canada

    Frank Dehne

Accessibility Information

Accessibility information for this book is coming soon. We're working to make it available as quickly as possible. Thank you for your patience.

Bibliographic Information

Keywords

Publish with us

Policies and ethics

Back to top