| Publication | Date of Publication | Type |
|---|
| Lossy kernelization for (implicit) hitting set problems | 2025-01-06 | Paper |
| Counting and sampling labeled chordal graphs in polynomial time | 2025-01-06 | Paper |
| Parameterized complexity of fair bisection: (FPT-approximation meets unbreakability) | 2025-01-06 | Paper |
| A parameterized approximation scheme for min \(k\)-cut | 2024-12-20 | Paper |
| Parameterized approximation scheme for feedback vertex set | 2024-12-03 | Paper |
| Euclidean bottleneck Steiner tree is fixed-parameter tractable | 2024-11-28 | Paper |
| Meta-theorems for parameterized streaming algorithms | 2024-11-28 | Paper |
| Induced-minor-free graphs: separator theorem, subexponential algorithms, and improved hardness of recognition | 2024-11-28 | Paper |
| Odd cycle transversal on \(P_5\)-free graphs in quasi-polynomial time | 2024-11-28 | Paper |
| Breaking the all subsets barrier for min \(k\)-cut | 2024-11-14 | Paper |
| \(b\)-coloring parameterized by clique-width | 2024-10-07 | Paper |
| Deleting, eliminating and decomposing to hereditary classes are all FPT-equivalent | 2024-07-19 | Paper |
| Subexponential Parameterized algorithms on disk graphs (extended abstract) | 2024-07-19 | Paper |
| Subexponential parameterized algorithms for cut and cycle hitting problems on \(H\)-minor-free graphs | 2024-07-19 | Paper |
| Backdoor sets on nowhere dense SAT | 2024-06-24 | Paper |
| Wordle is NP-hard | 2024-05-16 | Paper |
| Shortest cycles with monotone submodular costs | 2024-05-14 | Paper |
| A framework for approximation schemes on disk graphs | 2024-05-14 | Paper |
| Graph classes with few minimal separators. I: Finite forbidden induced subgraphs | 2024-05-14 | Paper |
| Graph classes with few minimal separators. II: A dichotomy | 2024-05-14 | Paper |
| True contraction decomposition and almost ETH-tight bipartization for unit-disk graphs | 2024-05-14 | Paper |
| Point separation and obstacle removal by finding and hitting odd cycles | 2024-05-14 | Paper |
| An improved parameterized algorithm for treewidth | 2024-05-08 | Paper |
| The parameterized complexity of guarding almost convex polygons | 2024-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6187041 | 2024-02-05 | Paper |
| An ETH-tight algorithm for bidirected Steiner connectivity | 2024-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147260 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147261 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147302 | 2024-01-15 | Paper |
| Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor | 2023-12-08 | Paper |
| Finding large induced sparse subgraphs in c >t -free graphs in quasipolynomial time | 2023-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6089671 | 2023-11-13 | Paper |
| The Parameterized Complexity of Guarding Almost Convex Polygons. | 2023-11-02 | Paper |
| ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs | 2023-11-02 | Paper |
| Removing Connected Obstacles in the Plane is FPT | 2023-11-02 | Paper |
| On the Parameterized Approximability of Contraction to Classes of Chordal Graphs | 2023-10-31 | Paper |
| Polynomial Kernel for Interval Vertex Deletion | 2023-10-23 | Paper |
| Erdős–Pósa property of obstructions to interval graphs | 2023-10-09 | Paper |
| On Induced Versions of Menger's Theorem on Sparse Graphs | 2023-09-15 | Paper |
| Lower Bound for Independence Covering in $C_4$-Free Graphs | 2023-08-29 | Paper |
| Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms, and Improved Hardness of Recognition | 2023-08-09 | Paper |
| Gehrlein stable committee with multi-modal preferences | 2023-07-28 | Paper |
| Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems | 2023-04-26 | Paper |
| The chromatic number of squares of random graphs | 2023-04-19 | Paper |
| Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering | 2023-04-04 | Paper |
| Computing the largest bond of a graph | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875748 | 2023-02-03 | Paper |
| Parameterization Above a Multiplicative Guarantee | 2023-02-03 | Paper |
| On the maximum number of edges in chordal graphs of bounded degree and matching number | 2022-12-08 | Paper |
| Highly unbreakable graph with a fixed excluded minor are almost rigid | 2022-10-26 | Paper |
| Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths | 2022-10-19 | Paper |
| On the maximum number of edges in chordal graphs of bounded degree and matching number | 2022-10-13 | Paper |
| Multiplicative Parameterization Above a Guarantee | 2022-09-24 | Paper |
| Path Contraction Faster Than 2^n | 2022-07-21 | Paper |
| Decomposition of Map Graphs with Applications. | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091216 | 2022-07-21 | Paper |
| Approximate Counting of k-Paths: Deterministic and in Polynomial Space | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092361 | 2022-07-21 | Paper |
| ETH-tight algorithms for long path and cycle on unit disk graphs | 2022-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075784 | 2022-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075790 | 2022-05-11 | Paper |
| On the parameterized approximability of contraction to classes of chordal graphs | 2022-03-29 | Paper |
| On the parameterized complexity of reconfiguration of connected dominating sets | 2022-03-25 | Paper |
| Computation of Hadwiger number and related contraction problems. Tight lower bounds | 2022-03-22 | Paper |
| Approximate Counting of k -Paths: Simpler, Deterministic, and in Polynomial Space | 2022-02-16 | Paper |
| 2-Approximating Feedback Vertex Set in Tournaments | 2022-02-16 | Paper |
| Randomized Contractions Meet Lean Decompositions | 2022-02-08 | Paper |
| Parameterized Algorithms | 2022-02-04 | Paper |
| On the threshold of intractability | 2021-11-25 | Paper |
| The parameterized complexity of finding point sets with hereditary properties | 2021-08-04 | Paper |
| Polylogarithmic approximation algorithms for weighted-\(\mathcal{F}\)-deletion problems | 2021-08-04 | Paper |
| Conflict free feedback vertex set: a parameterized dichotomy | 2021-08-04 | Paper |
| A strongly-uniform slicewise polynomial-time algorithm for the embedded planar diameter improvement problem | 2021-08-04 | Paper |
| Reducing CMSO model checking to highly connected graphs | 2021-07-28 | Paper |
| Brief announcement: Treewidth modulator: emergency exit for DFVS | 2021-07-28 | Paper |
| Quasipolynomial representation of transversal matroids with applications in parameterized complexity | 2021-06-15 | Paper |
| Subexponential algorithms for rectilinear Steiner tree and arborescence problems | 2021-05-03 | Paper |
| Covering small independent sets and separators with applications to parameterized algorithms | 2021-05-03 | Paper |
| Computing the largest bond and the maximum connected cut of a graph | 2021-04-19 | Paper |
| Bisection of bounded treewidth graphs by convolutions | 2021-04-14 | Paper |
| Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs | 2021-02-02 | Paper |
| Parameterized Complexity and Approximability of Directed Odd Cycle Transversal | 2021-02-02 | Paper |
| 2-Approximating Feedback Vertex Set in Tournaments | 2021-02-02 | Paper |
| An exponential time parameterized algorithm for planar disjoint paths | 2021-01-19 | Paper |
| Hitting topological minors is FPT | 2021-01-19 | Paper |
| Bidimensionality and kernels | 2021-01-13 | Paper |
| Balanced judicious bipartition is fixed-parameter tractable | 2020-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136298 | 2020-11-25 | Paper |
| Faster and enhanced inclusion-minimal cograph completion | 2020-11-02 | Paper |
| Going far from degeneracy | 2020-10-29 | Paper |
| A new perspective on FO model checking of dense graph classes | 2020-09-11 | Paper |
| Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces | 2020-08-18 | Paper |
| Erdös-Pósa Property of Obstructions to Interval Graphs | 2020-08-05 | Paper |
| Path contraction faster than \(2^n\) | 2020-07-30 | Paper |
| Dominated Minimal Separators are Tame (Nearly All Others are Feral) | 2020-07-17 | Paper |
| Finding, hitting and packing cycles in subexponential time on unit disk graphs | 2020-05-27 | Paper |
| Packing cycles faster than Erdős-Pósa | 2020-05-27 | Paper |
| Covering vectors by spaces: regular matroids | 2020-05-27 | Paper |
| A Linear-Time Parameterized Algorithm for Node Unique Label Cover | 2020-05-27 | Paper |
| A polynomial sized kernel for tracking paths problem | 2020-02-12 | Paper |
| A polynomial sized kernel for tracking paths problem | 2020-01-16 | Paper |
| Wannabe bounded treewidth graphs admit a polynomial kernel for DFVS | 2020-01-16 | Paper |
| Simultaneous feedback vertex set: a parameterized perspective | 2019-12-16 | Paper |
| Split contraction: the untold story | 2019-12-16 | Paper |
| Approximation Schemes for Low-rank Binary Matrix Approximation Problems | 2019-12-02 | Paper |
| Spanning circuits in regular matroids | 2019-12-02 | Paper |
| Exact algorithms via monotone local search | 2019-11-21 | Paper |
| Finding, hitting and packing cycles in subexponential time on unit disk graphs | 2019-11-07 | Paper |
| Balanced Judicious Bipartition is Fixed-Parameter Tractable | 2019-10-28 | Paper |
| On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets | 2019-10-01 | Paper |
| Packing cycles faster than Erdős-Pósa | 2019-08-29 | Paper |
| Efficient computation of representative sets with applications in parameterized and exact algorithms | 2019-06-20 | Paper |
| A near-optimal planarization algorithm | 2019-06-20 | Paper |
| Linear kernels for (connected) dominating set on \(H\)-minor-free graphs | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743499 | 2019-05-10 | Paper |
| Minimum Bisection Is Fixed-Parameter Tractable | 2019-05-07 | Paper |
| Clique-width: on the price of generality | 2019-05-06 | Paper |
| Feedback vertex set inspired kernel for chordal vertex deletion | 2019-03-28 | Paper |
| Clique-width. III: Hamiltonian cycle and the odd case of graph coloring | 2019-03-28 | Paper |
| The complexity of independent set reconfiguration on bipartite graphs | 2019-03-28 | Paper |
| Subquadratic kernels for implicit 3-{\textsc{Hitting Set}} and 3-{\textsc{Set Packing}} problems | 2019-03-28 | Paper |
| Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs | 2019-02-14 | Paper |
| Parameterized single-exponential time polynomial space algorithm for Steiner tree | 2019-02-06 | Paper |
| Kernelization. Theory of parameterized preprocessing | 2019-01-14 | Paper |
| Excluded grid minors and efficient polynomial-time approximation schemes | 2018-12-06 | Paper |
| Covering Vectors by Spaces: Regular Matroids | 2018-11-19 | Paper |
| Fully polynomial-time parameterized computations for graphs and matrices of low treewidth | 2018-11-13 | Paper |
| Known algorithms on graphs of bounded treewidth are probably optimal | 2018-11-13 | Paper |
| Deterministic truncation of linear matroids | 2018-11-13 | Paper |
| Linear time parameterized algorithms for \textsc{Subset Feedback Vertex Set} | 2018-11-12 | Paper |
| Independence and Efficient Domination on P 6 -free Graphs | 2018-11-12 | Paper |
| Kernels for (connected) dominating set on graphs with excluded topological minors | 2018-11-12 | Paper |
| On problems as hard as CNF-SAT | 2018-11-05 | Paper |
| Representative families of product families | 2018-11-05 | Paper |
| Uniform kernelization complexity of hitting forbidden minors | 2018-11-05 | Paper |
| Kernelization lower bounds through colors and IDs | 2018-10-30 | Paper |
| Faster parameterized algorithms using linear programming | 2018-10-30 | Paper |
| Long directed \((s,t)\)-path: FPT algorithm | 2018-10-19 | Paper |
| Below all subsets for minimal connected dominating set | 2018-09-26 | Paper |
| Efficient computation of representative families with applications in parameterized and exact algorithms | 2018-08-02 | Paper |
| (Meta) kernelization | 2018-08-02 | Paper |
| Kernelization of cycle packing with relaxed disjointness constraints | 2018-07-18 | Paper |
| Independence and efficient domination on \(P_6\)-free graphs | 2018-07-16 | Paper |
| Fully polynomial-time parameterized computations for graphs and matrices of low treewidth | 2018-07-16 | Paper |
| Feedback vertex set inspired kernel for chordal vertex deletion | 2018-07-16 | Paper |
| Beating brute force for systems of polynomial equations over finite fields | 2018-07-16 | Paper |
| Spanning circuits in regular matroids | 2018-07-16 | Paper |
| Slightly superexponential parameterized problems | 2018-06-05 | Paper |
| Reconfiguration on sparse graphs | 2018-05-08 | Paper |
| Matrix Rigidity from the Viewpoint of Parameterized Complexity | 2018-05-02 | Paper |
| A new perspective on FO model checking of dense graph classes | 2018-04-23 | Paper |
| Matrix Rigidity from the Viewpoint of Parameterized Complexity | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636602 | 2018-04-19 | Paper |
| Faster exact and parameterized algorithm for feedback vertex set in bipartite tournaments | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4634403 | 2018-04-10 | Paper |
| Cliquewidth III: the odd case of graph coloring parameterized by cliquewidth | 2018-03-15 | Paper |
| The complexity of independent set reconfiguration on bipartite graphs | 2018-03-15 | Paper |
| Subquadratic kernels for implicit 3-hitting set and 3-set packing problems | 2018-03-15 | Paper |
| Beating brute force for (quantified) satisfiability of circuits of bounded treewidth | 2018-03-15 | Paper |
| When recursion is better than iteration: a linear-time algorithm for acyclicity with few error vertices | 2018-03-15 | Paper |
| Covering small independent sets and separators with applications to parameterized algorithms | 2018-03-15 | Paper |
| Faster and enhanced inclusion-minimal cograph completion | 2018-02-26 | Paper |
| Subexponential algorithms for rectilinear Steiner tree and arborescence problems | 2018-01-30 | Paper |
| Simultaneous feedback vertex set: a parameterized perspective | 2018-01-24 | Paper |
| Faster exact and parameterized algorithm for feedback vertex set in tournaments | 2018-01-24 | Paper |
| Critical node cut parameterized by treewidth and solution size is \(W[1]\)-hard | 2018-01-04 | Paper |
| Kernelization of cycle packing with relaxed disjointness constraints | 2017-12-19 | Paper |
| Lower bounds for approximation schemes for Closest String | 2017-10-17 | Paper |
| Quick but odd growth of cacti | 2017-10-10 | Paper |
| Solving d-SAT via Backdoors to Small Treewidth | 2017-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365078 | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365079 | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365080 | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5363780 | 2017-09-29 | Paper |
| Exact algorithms via monotone local search | 2017-09-29 | Paper |
| Lossy kernelization | 2017-08-17 | Paper |
| Hitting selected (odd) cycles | 2017-08-14 | Paper |
| Faster exact algorithms for some terminal set problems | 2017-06-30 | Paper |
| Tree deletion set has a polynomial kernel (but no \(\mathrm {OPT}^{\mathcal O(1)}\) approximation) | 2017-04-25 | Paper |
| Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth | 2017-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957874 | 2017-01-30 | Paper |
| Subexponential parameterized odd cycle transversal on planar graphs | 2017-01-26 | Paper |
| Irrelevant vertices for the planar disjoint paths problem | 2016-11-25 | Paper |
| Tree deletion set has a polynomial kernel but no \(\mathrm{OPT}^\mathcal{O}(1)\) approximation) | 2016-07-22 | Paper |
| A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion | 2016-05-03 | Paper |
| A \(c^k n\) 5-approximation algorithm for treewidth | 2016-04-11 | Paper |
| On the ordered list subgraph embedding problems | 2016-04-06 | Paper |
| Hitting forbidden minors: approximation and kernelization | 2016-03-04 | Paper |
| The Structure of $W_4$-Immersion-Free Graphs | 2016-02-05 | Paper |
| Fast algorithms for parameterized problems with relaxed disjointness constraints | 2015-11-19 | Paper |
| On the threshold of intractability | 2015-11-19 | Paper |
| Reconfiguration on sparse graphs | 2015-10-30 | Paper |
| Linear time parameterized algorithms for subset feedback vertex set | 2015-10-27 | Paper |
| Parameterized single-exponential time polynomial space algorithm for Steiner tree | 2015-10-27 | Paper |
| Uniform kernelization complexity of hitting forbidden minors | 2015-10-27 | Paper |
| Deterministic truncation of linear matroids | 2015-10-27 | Paper |
| Distortion is fixed parameter tractable | 2015-09-24 | Paper |
| Parameterized algorithms | 2015-08-17 | Paper |
| Minimum bisection is fixed parameter tractable | 2015-06-26 | Paper |
| Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width | 2015-02-09 | Paper |
| On cutwidth parameterized by vertex cover | 2014-12-02 | Paper |
| Representative sets of product families | 2014-10-08 | Paper |
| Solving multicut faster than \(2^{n }\) | 2014-10-08 | Paper |
| Kernel(s) for problems with no kernel | 2014-09-09 | Paper |
| Saving space by algebraization | 2014-08-13 | Paper |
| (Meta) Kernelization | 2014-07-25 | Paper |
| Parameterized complexity of bandwidth on trees | 2014-07-01 | Paper |
| Bidimensionality and kernels | 2014-05-22 | Paper |
| Algorithmic lower bounds for problems parameterized by clique-width | 2014-05-22 | Paper |
| Imbalance is fixed parameter tractable | 2014-04-14 | Paper |
| Obtaining a bipartite graph by contracting few edges | 2014-04-10 | Paper |
| On the hardness of losing width | 2014-03-25 | Paper |
| Contracting graphs to paths and trees | 2014-03-25 | Paper |
| Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization | 2014-01-16 | Paper |
| Beyond bidimensionality: parameterized subexponential algorithms on directed graphs | 2014-01-10 | Paper |
| On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges | 2013-12-10 | Paper |
| The Fine Details of Fast Dynamic Programming over Tree Decompositions | 2013-12-10 | Paper |
| Hardness of \(r\)-dominating set on graphs of diameter \((r + 1)\) | 2013-12-10 | Paper |
| Faster exact algorithms for some terminal set problems | 2013-12-10 | Paper |
| On the ordered list subgraph embedding problems | 2013-12-10 | Paper |
| Quadratic upper bounds on the Erdős--Pósa property for a generalization of packing and covering cycles | 2013-11-15 | Paper |
| Parameterized Complexity of Directed Steiner Tree on Sparse Graphs | 2013-09-17 | Paper |
| Parameterized tractability of multiway cut with parity constraints | 2013-08-12 | Paper |
| Computing optimal Steiner trees in polynomial space | 2013-08-05 | Paper |
| Clustering with local restrictions | 2013-06-06 | Paper |
| Subexponential algorithms for partial cover problems | 2013-04-04 | Paper |
| Lower bounds based on the exponential time hypothesis | 2013-01-28 | Paper |
| Computing the cutwidth of bipartite permutation graphs in linear time | 2013-01-04 | Paper |
| Cops and robber game without recharging | 2012-12-06 | Paper |
| Subexponential algorithms for partial cover problems | 2012-10-24 | Paper |
| Treewidth governs the complexity of target set selection | 2012-10-16 | Paper |
| On the directed full degree spanning tree problem | 2012-10-16 | Paper |
| Kernelization -- preprocessing with a guarantee | 2012-09-05 | Paper |
| Obtaining a bipartite graph by contracting few edges | 2012-08-31 | Paper |
| Determining the winner of a Dodgson election is hard | 2012-08-29 | Paper |
| Faster algorithms for finding and counting subgraphs | 2012-08-17 | Paper |
| Local search: is brute-force avoidable? | 2012-08-17 | Paper |
| On cutwidth parameterized by vertex cover | 2012-06-15 | Paper |
| On the hardness of losing width | 2012-06-15 | Paper |
| Contracting graphs to paths and trees | 2012-06-15 | Paper |
| Sharp separation and applications to exact and parameterized algorithms | 2012-04-26 | Paper |
| \(\text{Kernel}(s)\) for problems with no kernel: on out-trees with many leaves | 2012-04-24 | Paper |
| Cutwidth of split graphs and threshold graphs | 2012-03-15 | Paper |
| Hitting forbidden minors: approximation and kernelization | 2012-01-23 | Paper |
| Beyond bidimensionality: parameterized subexponential algorithms on directed graphs | 2012-01-23 | Paper |
| Planar \(k\)-path in subexponential time and polynomial space | 2011-12-16 | Paper |
| Guard games on graphs: keep the intruder out! | 2011-12-07 | Paper |
| Bandwidth on AT-free graphs | 2011-12-07 | Paper |
| On the complexity of reconstructing H-free graphs from their Star Systems | 2011-10-12 | Paper |
| Feedback vertex set in mixed graphs | 2011-08-12 | Paper |
| An exact algorithm for minimum distortion embedding | 2011-07-14 | Paper |
| Tight bounds for linkages in planar graphs | 2011-07-06 | Paper |
| Clustering with Local Restrictions | 2011-07-06 | Paper |
| Ranking and drawing in subexponential time | 2011-05-19 | Paper |
| A linear kernel for a planar connected dominating set | 2011-05-18 | Paper |
| On the complexity of some colorful problems parameterized by treewidth | 2011-02-21 | Paper |
| Generalized graph clustering: recognizing \((p,q)\)-cluster graphs | 2010-11-16 | Paper |
| Computing the cutwidth of bipartite permutation graphs in linear time | 2010-11-16 | Paper |
| Intractability of clique-width parameterizations | 2010-11-04 | Paper |
| Imbalance is fixed parameter tractable | 2010-07-20 | Paper |
| Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing | 2010-06-22 | Paper |
| Cops and Robber game without recharging | 2010-06-22 | Paper |
| On the complexity of computing treelength | 2010-05-25 | Paper |
| Characterizing and computing minimal cograph completions | 2010-05-25 | Paper |
| Guard games on graphs: keep the intruder out! | 2010-05-11 | Paper |
| Finding the longest isometric cycle in a graph | 2010-04-28 | Paper |
| Sharp separation and applications to exact and parameterized algorithms | 2010-04-27 | Paper |
| An exact algorithm for minimum distortion embedding | 2010-01-21 | Paper |
| Even faster algorithm for set splitting! | 2010-01-14 | Paper |
| On the directed degree-preserving spanning tree problem | 2010-01-14 | Paper |
| Planar capacitated dominating set is \(W[1]\)-hard | 2010-01-14 | Paper |
| Bandwidth on AT-free graphs | 2009-12-17 | Paper |
| Simpler parameterized algorithm for OCT | 2009-12-11 | Paper |
| The complexity ecology of parameters: An illustration using bounded max leaf number | 2009-10-19 | Paper |
| Incompressibility through Colors and IDs | 2009-07-14 | Paper |
| Fast FAST | 2009-07-14 | Paper |
| Distortion Is Fixed Parameter Tractable | 2009-07-14 | Paper |
| Linear Kernel for Planar Connected Dominating Set | 2009-06-03 | Paper |
| On the Complexity of Some Colorful Problems Parameterized by Treewidth | 2009-03-03 | Paper |
| Graph Layout Problems Parameterized by Vertex Cover | 2009-01-29 | Paper |
| Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs | 2009-01-20 | Paper |
| On the Complexity of Computing Treelength | 2008-09-17 | Paper |
| Characterizing and Computing Minimal Cograph Completions | 2008-06-19 | Paper |
| Capacitated Domination and Covering: A Parameterized Perspective | 2008-06-05 | Paper |
| Wheel-Free Deletion Is W[2]-Hard | 2008-06-05 | Paper |
| On the Complexity of Reconstructing H-free Graphs from Their Star Systems | 2008-04-15 | Paper |
| Optimal broadcast domination in polynomial time | 2006-12-14 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Induced subgraphs and tree decompositions XV. Even-hole-free graphs with bounded clique number have logarithmic treewidth | N/A | Paper |
| Tree independence number II. Three-path-configurations | N/A | Paper |
