Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIWPEC 2006: Zürich, Switzerland
- Hans L. Bodlaender, Michael A. Langston:
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 - Fábio Protti, Maise Dantas da Silva, Jayme Luiz Szwarcfiter:
Applying Modular Decomposition to Parameterized Bicluster Editing. 1-12 - 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 - Yijia Chen, Jörg Flum:
The Parameterized Complexity of Maximality and Minimality Problems. 25-37 - Meena Mahajan, Venkatesh Raman, Somnath Sikdar:
Parameterizing MAX SNP Problems Above Guaranteed Values. 38-49 - Moritz Müller:
Randomized Approximations of Parameterized Counting Problems. 50-59 - Gregory Z. Gutin, Stefan Szeider, Anders Yeo:
Fixed-Parameter Complexity of Minimum Profile Problems. 60-71 - Klaus Meer, Dieter Rautenbach:
On the OBDD Size for Graphs of Bounded Tree- and Clique-Width. 72-83 - Yang Liu, Songjian Lu, Jianer Chen, Sing-Hoi Sze:
Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms. 84-95 - Liming Cai, Xiuzhen Huang:
Fixed-Parameter Approximation: Conceptual Framework and Approximability Results. 96-108 - Yijia Chen, Martin Grohe, Magdalena Grüber:
On Parameterized Approximability. 109-120 - Rodney G. Downey, Michael R. Fellows, Catherine McCartin:
Parameterized Approximation Problems. 121-129 - Dieter Kratsch, Mathieu Liedloff:
An Exact Algorithm for the Minimum Dominating Clique Problem. 130-141 - Henning Fernau
:
edge dominating set: Efficient Enumeration-Based Exact Algorithms. 142-153 - Dániel Marx:
Parameterized Complexity of Independence and Domination on Geometric Graphs. 154-165 - Jan Kára, Jan Kratochvíl:
Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs. 166-174 - Sergio Cabello, Panos Giannopoulos, Christian Knauer:
On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching. 175-183 - Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin:
Finding a Minimum Feedback Vertex Set in Time O (1.7548n). 184-191 - 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 - Jiong Guo, Rolf Niedermeier, Sebastian Wernicke:
Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual. 203-214 - Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang:
On the Effective Enumerability of NP Problems. 215-226 - Matthew Hamilton, Rhonda Chaytor, Todd Wareham:
The Parameterized Complexity of Enumerating Frequent Itemsets. 227-238 - Leizhen Cai, Siu Man Chan, Siu On Chan:
Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems. 239-250 - Christian Sloper, Jan Arne Telle:
Towards a Taxonomy of Techniques for Designing Parameterized Algorithms. 251-263 - Faisal N. Abu-Khzam, Henning Fernau:
Kernels: Annotated, Proper and Induced. 264-275 - Michael R. Fellows:
The Lost Continent of Polynomial Time: Preprocessing and Kernelization. 276-277 - Frank K. H. A. Dehne:
FPT at Work: Using Fixed Parameter Tractability to Solve Larger Instances of Hard Problems. 278
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-18 20:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
