| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Karol Suchan, Yngve Villanger |
Computing Pathwidth Faster Than 2n.  |
IWPEC  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Saket Saurabh 0001 |
Even Faster Algorithm for Set Splitting! |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Daniel Lokshtanov, Eelko Penninkx |
Planar Capacitated Dominating Set Is W[1]-Hard. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A. Kanj, Frances A. Rosamond, Ondrej Suchý |
What Makes Equitable Connected Partition Easy. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Danny Hermelin, Frances A. Rosamond |
Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Damaschke |
Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikko Koivisto |
Partitioning into Sets of Bounded Cardinality. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian Böcker, Falk Hüffner, Anke Truß, Magnus Wahlström |
A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Shai Gutner |
Balanced Hashing, Color Coding and Approximate Counting. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
Approximate counting of subgraphs, derandomization, expanders, perfect hashing, color-coding, k-wise independence |
| 1 | Gregory Z. Gutin, Daniel Karapetyan, Igor Razgon |
Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Damaschke |
Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Dimitrios M. Thilikos |
Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
Bounded length disjoint paths, Bounded length cuts, Parameterized Complexity, Parameterized Algorithms |
| 1 | Dániel Marx, Ildikó Schlotter |
Stable Assignment with Couples: Parameterized Complexity and Local Search. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianer Chen, Fedor V. Fomin (eds.) |
Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Rok Erman, Lukasz Kowalik, Matjaz Krnc, Tomasz Walen |
Improved Induced Matchings in Sparse Graphs. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Kratsch, Magnus Wahlström |
Two Edge Modification Problems without Polynomial Kernels. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris Calabro, Russell Impagliazzo, Ramamohan Paturi |
The Complexity of Satisfiability of Small Depth Circuits. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Venkatesh Raman 0001, Saket Saurabh 0001, Somnath Sikdar |
On the Directed Degree-Preserving Spanning Tree Problem. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle |
Boolean-Width of Graphs. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible 0001, Peter Rossmanith |
An Exact Algorithm for the Maximum Leaf Spanning Tree Problem. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Panos Giannopoulos, Christian Knauer, Günter Rote |
The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
geometric dimension, minimum enclosing cylinder, maximum feasible subsystem, 2-linear separability, lower bounds, parameterized complexity |
| 1 | Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith |
On Digraph Width Measures in Parameterized Algorithmics. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender |
Kernelization: New Upper and Lower Bound Techniques. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
algorithms, kernel, kernelization, preprocessing, data reduction, fixed parameter tractability, combinatorial problems |
| 1 | Jean Daligault, Stéphan Thomassé |
On Finding Directed Trees with Many Leaves. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Fürer, Serge Gaspers, Shiva Prasad Kasiviswanathan |
An Exponential Time 2-Approximation Algorithm for Bandwidth. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Gregory Z. Gutin, Eun Jung Kim 0002, Stefan Szeider, Anders Yeo |
A Probabilistic Approach to Problems Parameterized above or below Tight Bounds. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Shai Gutner |
Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
H-minor-free graphs, degenerated graphs, dominating set problem, fixed-parameter tractable algorithms, problem kernel |
| 1 | Narges Simjour |
Improved Parameterized Algorithms for the Kemeny Aggregation Problem. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
Kemeny score, parameterized, enumeration, exact algorithms |
| 1 | Moritz Müller |
Parameterized Derandomization. |
IWPEC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Khaled M. Elbassioni, Matthias Hagen, Imran Rauf |
Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems. |
IWPEC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos |
An O*(1.0977n) Exact Algorithm for max independent set in Sparse Graphs. |
IWPEC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yonatan Aumann, Yair Dombb |
Fixed Structure Complexity. |
IWPEC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov |
Wheel-Free Deletion Is W[2]-Hard. |
IWPEC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Dom, Daniel Lokshtanov, Saket Saurabh 0001, Yngve Villanger |
Capacitated Domination and Covering: A Parameterized Perspective. |
IWPEC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sylvain Guillemot |
FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs. |
IWPEC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sylvain Guillemot |
Parameterized Complexity and Approximability of the SLCS Problem. |
IWPEC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephan Kreutzer |
Algorithmic Meta-theorems. |
IWPEC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Johan M. M. van Rooij, Hans L. Bodlaender |
Exact Algorithms for Edge Domination. |
IWPEC |
2008 |
DBLP DOI BibTeX RDF |
minimum maximal matching, exponential time algorithms, measure and conquer, exact algorithms, edge dominating set |
| 1 | Erik D. Demaine |
Algorithmic Graph Minors and Bidimensionality. |
IWPEC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Omid Amini, Ignasi Sau, Saket Saurabh 0001 |
Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem. |
IWPEC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Allan Scott, Ulrike Stege |
Parameterized Chess. |
IWPEC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian Böcker, Quang Bao Anh Bui, Anke Truß |
An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees. |
IWPEC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianer Chen |
Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters. |
IWPEC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Danny Hermelin, Moritz Müller, Frances A. Rosamond |
A Purely Democratic Characterization of W[1]. |
IWPEC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Maw-Shang Chang, Chuang-Chieh Lin, Peter Rossmanith |
New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem. |
IWPEC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, Rolf Niedermeier (eds.) |
Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008. Proceedings |
IWPEC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Magnus Wahlström |
A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances. |
IWPEC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Eelko Penninkx |
A Linear Kernel for Planar Feedback Vertex Set. |
IWPEC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrick Traxler |
The Time Complexity of Constraint Satisfaction. |
IWPEC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Fábio Protti, Maise Dantas da Silva, Jayme Luiz Szwarcfiter |
Applying Modular Decomposition to Parameterized Bicluster Editing. |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
edge modification problems, bicluster graphs, NP-complete problems, fixed-parameter tractability, cluster graphs |
| 1 | Yang Liu 0002, Songjian Lu, Jianer Chen, Sing-Hoi Sze |
Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms. |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Yijia Chen, Jörg Flum |
The Parameterized Complexity of Maximality and Minimality Problems. |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Sergio Cabello, Panos Giannopoulos, Christian Knauer |
On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching. |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows |
The Lost Continent of Polynomial Time: Preprocessing and Kernelization. |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Liming Cai, Xiuzhen Huang |
Fixed-Parameter Approximation: Conceptual Framework and Approximability Results. |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew Hamilton, Rhonda Chaytor, Todd Wareham |
The Parameterized Complexity of Enumerating Frequent Itemsets. |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Kratsch, Mathieu Liedloff |
An Exact Algorithm for the Minimum Dominating Clique Problem. |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Faisal N. Abu-Khzam, Henning Fernau |
Kernels: Annotated, Proper and Induced. |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Gregory Z. Gutin, Stefan Szeider, Anders Yeo |
Fixed-Parameter Complexity of Minimum Profile Problems. |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin |
Finding a Minimum Feedback Vertex Set in Time O (1.7548n). |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
maximum induced forest, exact exponential algorithm, minimum feedback vertex set |
| 1 | Henning Fernau |
edge dominating set: Efficient Enumeration-Based Exact Algorithms. |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank K. H. A. Dehne |
FPT at Work: Using Fixed Parameter Tractability to Solve Larger Instances of Hard Problems. |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Meer, Dieter Rautenbach |
On the OBDD Size for Graphs of Bounded Tree- and Clique-Width. |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Leizhen Cai, Siu Man Chan, Siu On Chan |
Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems. |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Kára, Jan Kratochvíl |
Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs. |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Sloper, Jan Arne Telle |
Towards a Taxonomy of Techniques for Designing Parameterized Algorithms. |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rodney G. Downey, Michael R. Fellows, Catherine McCartin |
Parameterized Approximation Problems. |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank K. H. A. Dehne, Michael A. Langston, Xuemei Luo, Sylvain Pitre, Peter Shaw 0001, Yun Zhang 0013 |
The Cluster Editing Problem: Implementations and Experiments. |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Moritz Müller |
Randomized Approximations of Parameterized Counting Problems. |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Michael A. Langston (eds.) |
Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Meena Mahajan, Venkatesh Raman 0001, Somnath Sikdar |
Parameterizing MAX SNP Problems Above Guaranteed Values. |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jiong Guo, Rolf Niedermeier, Sebastian Wernicke 0001 |
Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual. |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Yijia Chen, Martin Grohe, Magdalena Grüber |
On Parameterized Approximability. |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx |
Parameterized Complexity of Independence and Domination on Geometric Graphs. |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang |
On the Effective Enumerability of NP Problems. |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Elena Prieto-Rodriguez, Christian Sloper |
Looking at the Stars. |
IWPEC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Hoffmann 0001, Yoshio Okamoto |
The Minimum Weight Triangulation Problem with Few Inner Points. |
IWPEC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Rodney G. Downey, Michael R. Fellows, Frank K. H. A. Dehne (eds.) |
Parameterized and Exact Computation, First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004, Proceedings |
IWPEC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, Fabrizio Grandoni 0001 |
Refined Memorisation for Vertex Cover. |
IWPEC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos |
Smaller Kernels for Hitting Set Problems of Constant Arity. |
IWPEC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond, Peter Shaw 0001 |
Greedy Localization, Iterative Compression, Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover. |
IWPEC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx |
Parameterized Coloring Problems on Chordal Graphs. |
IWPEC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Haas 0001, Michael Hoffmann 0001 |
Chordless Paths Through Three Vertices. |
IWPEC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Luke Mathieson, Elena Prieto-Rodriguez, Peter Shaw 0001 |
Packing Edge Disjoint Triangles: A Parameterized View. |
IWPEC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael A. Langston |
Practical FPT Implementations and Applications (Invited Talk). |
IWPEC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jiong Guo, Falk Hüffner, Rolf Niedermeier |
A Structural View on Parameterizing Problems: Distance from Triviality. |
IWPEC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Weyer |
Bounded Fixed-Parameter Tractability: The Case 2poly(k). |
IWPEC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Iyad A. Kanj, Michael J. Pelsmajer, Marcus Schaefer 0001 |
Parameterized Algorithms for Feedback Vertex Set. |
IWPEC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Sergey S. Fedin, Alexander S. Kulikov |
Automated Proofs of Upper Bounds on the Running Time of Splitting Algorithms. |
IWPEC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesh Raman 0001, Saket Saurabh 0001 |
Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments. |
IWPEC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerhard J. Woeginger |
Space and Time Complexity of Exact Algorithms: Some Open Problems (Invited Talk). |
IWPEC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Faisal N. Abu-Khzam, Michael A. Langston |
A Direct Algorithm for the Parameterized Face Cover Problem. |
IWPEC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jens Gramm, Till Nierhoff, Till Tantau |
Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable. |
IWPEC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Yijia Chen, Jörg Flum |
On Miniaturized Problems in Parameterized Complexity Theory. |
IWPEC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Stefan Szeider, Graham Wrightson |
On Finding Short Resolution Refutations and Small Unsatisfiable Subsets. |
IWPEC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Dimitrios M. Thilikos |
Computing Small Search Numbers in Linear Time. |
IWPEC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx |
Parameterized Graph Separation Problems. |
IWPEC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Rodney G. Downey, Catherine McCartin |
Online Problems, Pathwidth, and Persistence. |
IWPEC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Hlinený, Detlef Seese |
On Decidability of MSO Theories of Representable Matroids. |
IWPEC |
2004 |
DBLP DOI BibTeX RDF |
MSO theory, decidability, matroid, branch-width |
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license