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