Cargando…
Parameterized and Exact Computation Third International Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008, Proceedings /
This book constitutes the refereed proceedings of the Third International Workshop on Parameterized and Exact Computation, IWPEC 2008, held in Victoria, Canada, in May 2008 - co-located with the 40th ACM Symposium on Theory of Computing, STOC 2008. The 17 revised full papers presented together with...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor Corporativo: | |
| Otros Autores: | , |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2008.
|
| Edición: | 1st ed. 2008. |
| Colección: | Theoretical Computer Science and General Issues,
5018 |
| Temas: | |
| Acceso en línea: | Texto Completo |
Tabla de Contenidos:
- Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters
- Algorithmic Graph Minors and Bidimensionality
- Algorithmic Meta-theorems
- Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem
- Fixed Structure Complexity
- An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees
- An O *(1.0977 n ) Exact Algorithm for max independent set in Sparse Graphs
- New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem
- Capacitated Domination and Covering: A Parameterized Perspective
- Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems
- A Purely Democratic Characterization of W[1]
- Parameterized Complexity and Approximability of the SLCS Problem
- FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs
- Wheel-Free Deletion Is W[2]-Hard
- Parameterized Derandomization
- A Linear Kernel for Planar Feedback Vertex Set
- Parameterized Chess
- The Time Complexity of Constraint Satisfaction
- A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances
- Exact Algorithms for Edge Domination.