IWPEC 2006:
Zürich,
Switzerland
Hans L. Bodlaender, Michael A. Langston (Eds.):
Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings.
Lecture Notes in Computer Science 4169 Springer 2006, ISBN 3-540-39098-7 BibTeX
- Fábio Protti, Maise Dantas da Silva, Jayme Luiz Szwarcfiter:
Applying Modular Decomposition to Parameterized Bicluster Editing.
1-12
Electronic Edition (link) BibTeX
- Frank K. H. A. Dehne, Michael A. Langston, Xuemei Luo, Sylvain Pitre, Peter Shaw, Yun Zhang:
The Cluster Editing Problem: Implementations and Experiments.
13-24
Electronic Edition (link) BibTeX
- Yijia Chen, Jörg Flum:
The Parameterized Complexity of Maximality and Minimality Problems.
25-37
Electronic Edition (link) BibTeX
- Meena Mahajan, Venkatesh Raman, Somnath Sikdar:
Parameterizing MAX SNP Problems Above Guaranteed Values.
38-49
Electronic Edition (link) BibTeX
- Moritz Müller:
Randomized Approximations of Parameterized Counting Problems.
50-59
Electronic Edition (link) BibTeX
- Gregory Gutin, Stefan Szeider, Anders Yeo:
Fixed-Parameter Complexity of Minimum Profile Problems.
60-71
Electronic Edition (link) BibTeX
- Klaus Meer, Dieter Rautenbach:
On the OBDD Size for Graphs of Bounded Tree- and Clique-Width.
72-83
Electronic Edition (link) BibTeX
- Yang Liu, Songjian Lu, Jianer Chen, Sing-Hoi Sze:
Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms.
84-95
Electronic Edition (link) BibTeX
- Liming Cai, Xiuzhen Huang:
Fixed-Parameter Approximation: Conceptual Framework and Approximability Results.
96-108
Electronic Edition (link) BibTeX
- Yijia Chen, Martin Grohe, Magdalena Grüber:
On Parameterized Approximability.
109-120
Electronic Edition (link) BibTeX
- Rodney G. Downey, Michael R. Fellows, Catherine McCartin:
Parameterized Approximation Problems.
121-129
Electronic Edition (link) BibTeX
- Dieter Kratsch, Mathieu Liedloff:
An Exact Algorithm for the Minimum Dominating Clique Problem.
130-141
Electronic Edition (link) BibTeX
- Henning Fernau:
edge dominating set: Efficient Enumeration-Based Exact Algorithms.
142-153
Electronic Edition (link) BibTeX
- Dániel Marx:
Parameterized Complexity of Independence and Domination on Geometric Graphs.
154-165
Electronic Edition (link) BibTeX
- Jan Kára, Jan Kratochvíl:
Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs.
166-174
Electronic Edition (link) BibTeX
- Sergio Cabello, Panos Giannopoulos, Christian Knauer:
On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching.
175-183
Electronic Edition (link) BibTeX
- Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin:
Finding a Minimum Feedback Vertex Set in Time O (1.7548n).
184-191
Electronic Edition (link) BibTeX
- Kevin Burrage, Vladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, Shev Mac, Frances A. Rosamond:
The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel.
192-202
Electronic Edition (link) BibTeX
- Jiong Guo, Rolf Niedermeier, Sebastian Wernicke:
Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual.
203-214
Electronic Edition (link) BibTeX
- Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang:
On the Effective Enumerability of NP Problems.
215-226
Electronic Edition (link) BibTeX
- Matthew Hamilton, Rhonda Chaytor, Todd Wareham:
The Parameterized Complexity of Enumerating Frequent Itemsets.
227-238
Electronic Edition (link) BibTeX
- Leizhen Cai, Siu Man Chan, Siu On Chan:
Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems.
239-250
Electronic Edition (link) BibTeX
- Christian Sloper, Jan Arne Telle:
Towards a Taxonomy of Techniques for Designing Parameterized Algorithms.
251-263
Electronic Edition (link) BibTeX
- Faisal N. Abu-Khzam, Henning Fernau:
Kernels: Annotated, Proper and Induced.
264-275
Electronic Edition (link) BibTeX
- Michael R. Fellows:
The Lost Continent of Polynomial Time: Preprocessing and Kernelization.
276-277
Electronic Edition (link) BibTeX
- Frank K. H. A. Dehne:
FPT at Work: Using Fixed Parameter Tractability to Solve Larger Instances of Hard Problems.
278
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:27:23 2009
by Michael Ley (ley@uni-trier.de)