Frank Dehne / Rod Downey / Michael Fellows (eds.)

Parameterized and Exact Computation

First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004, Proceedings
Herausgegeben:Dehne, Frank; Downey, Rod; Fellows, Michael

• Broschiertes Buch

Produktbeschreibung

This book constitutes the refereed proceedings of the First International Workshop on Parameterized and Exact Computation, IWPEC 2004, held in Bergen, Norway, in September 2004.

The 25 revised full papers presented together with an invited paper were carefully reviewed and selected from 47 submissions. The topics addressed focus on all current issues in this new approach to designing algorithms.

---

Thecentralchallengeoftheoreticalcomputerscienceistodeploymathematicsin waysthatservethecreationofusefulalgorithms. Inrecentyearstherehasbeena growinginterest in the two-dimensionalframework of parameterizedcomplexity, where, in addition to the overall input size, one also considers a parameter,with a focus on how these two dimensions interact in problem complexity. This book presents the proceedings of the 1st InternationalWorkshopon - rameterized and Exact Computation (IWPEC 2004,iwpec. org), which took place in Bergen, Norway, on September 14 16, 2004. The workshop was organized as part of ALGO 2004. There were seven previous workshops on the theory and applications of parameterized complexity. The ?rst was - ganized at the Institute for the Mathematical Sciences in Chennai, India, in September, 2000. The second was held at Dagstuhl Castle, Germany, in July, 2001. In December, 2002, a workshop on parameterized complexity was held in conjunction with the FST-TCS meeting in Kanpur, India. A second Dagstuhl workshop on parameterized complexity was held in July, 2003. Another wo- shoponthesubjectwasheldinOttawa,Canada,inAugust,2003,inconjunction with the WADS 2003 meeting. There have also been two Barbados workshops on applications of parameterized complexity. In response to the IWPEC 2004 call for papers, 47 papers were submitted, and from these the programcommittee selected 25 for presentation at the wo- shop. Inaddition,invitedlectureswereacceptedbythedistinguishedresearchers Michael Langston and Gerhard Woeginger.

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Lecture Notes in Computer Science 3162
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 11321361, 978-3-540-23071-7
• 2004
• Seitenzahl: 308
• Erscheinungstermin: 6. September 2004
• Englisch
• Abmessung: 235mm x 155mm x 17mm
• Gewicht: 476g
• ISBN-13: 9783540230717
• ISBN-10: 3540230718
• Artikelnr.: 14571872

Autorenporträt

Frank Dehne, Griffith University, Brisbane, QLD, Australia / Rod Downey, Victoria University, Wellington, New Zealand / Michael Fellows, The University of Newcastle, Calaghan, NSW, Australia

Inhaltsangabe

Parameterized Enumeration, Transversals, and Imperfect Phylogeny Reconstruction.- Online Problems, Pathwidth, and Persistence.- Chordless Paths Through Three Vertices.- Computing Small Search Numbers in Linear Time.- Bounded Fixed-Parameter Tractability: The Case 2poly( k).- Refined Memorisation for Vertex Cover.- Parameterized Graph Separation Problems.- Parameterized Coloring Problems on Chordal Graphs.- On Decidability of MSO Theories of Representable Matroids.- On Miniaturized Problems in Parameterized Complexity Theory.- Smaller Kernels for Hitting Set Problems of Constant Arity.- Packing Edge Disjoint Triangles: A Parameterized View.- Looking at the Stars.- Moving Policies in Cyclic Assembly-Line Scheduling.- A Structural View on Parameterizing Problems: Distance from Triviality.- Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable.- Simplifying the Weft Hierarchy.- The Minimum Weight Triangulation Problem with Few Inner Points.- A Direct Algorithm for the Parameterized Face Cover Problem.- On Finding Short Resolution Refutations and Small Unsatisfiable Subsets.- Parameterized Algorithms for Feedback Vertex Set.- Automated Proofs of Upper Bounds on the Running Time of Splitting Algorithms.- Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments.- Greedy Localization, Iterative Compression, and Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover.- Space and Time Complexity of Exact Algorithms: Some Open Problems.- Practical FPT Implementations and Applications.