Parameterized and exact computation : First international workshop, IWPEC 2004, Bergen, Norway, september 14-17, 2004 : proceedings
Enregistré dans:
| Collectivité auteur: | |
|---|---|
| Autres auteurs: | , , |
| Format: | Livre numérique |
| Langue: | Anglais |
| Publié: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Collection: | Lecture notes in computer science
3162 |
| Sujets: | |
| Accès en ligne: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Note: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Parameterized and exact computation, First international workshop, IWPEC 2004, Bergen, Norway, september 14-17, 2004, proceedings, Rod Downey, Michael Fellows, Frank Dehne (eds.), Berlin, Springer, 2004, 1 vol. (X-290 p.), Lecture notes in computer science, 3-540-23071-8 • Parameterized and Exact Computation, Texte imprimé, 9783662206263 |
Table des matières:
- 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.