Parameterized and Exact Computation First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Downey, Rod (Επιμελητής έκδοσης), Fellows, Michael (Επιμελητής έκδοσης), Dehne, Frank (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2004.
• Σειρά: Lecture Notes in Computer Science, 3162
• Θέματα: Computer science.; Data structures (Computer science).; Computers.; Algorithms.; Computer science > Mathematics.; Application software.; Probabilities.; Computer Science.; Algorithm Analysis and Problem Complexity.; Probability Theory and Stochastic Processes.; Computer Applications.; Computation by Abstract Devices.; Data Structures.; Discrete Mathematics in Computer Science.

Πίνακας περιεχομένων:

• 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.