Parameterized and Exact Computation First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004, Proceedings / edited by Frank Dehne, Rod Downey, Michael Fellows.

Saved in:

Bibliographic Details
Corporate Author:	SpringerLink (Online service)
Other Authors:	Dehne, Frank (Editor), Downey, Rod (Editor), Fellows, Michael (Editor)
Format:	eBook
Language:	English
Published:	Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2004.
Edition:	1st ed. 2004.
Series:	Lecture Notes in Computer Science, 3162 Springer eBook Collection.
Subjects:	Algorithms. Probabilities. Application software. Computers. Data structures (Computer science). Computer science—Mathematics. Electronic resources (E-books)
Online Access:	Click to view e-book
Holy Cross Note:	Loaded electronically. Electronic access restricted to members of the Holy Cross Community.

Table of Contents:

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.

Parameterized and Exact Computation First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004, Proceedings / edited by Frank Dehne, Rod Downey, Michael Fellows.

Similar Items