| Publication | Date of Publication | Type |
|---|
| Diverse collections in matroids and graphs | 2024-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6192471 | 2024-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6192491 | 2024-02-12 | Paper |
| The parameterized complexity of guarding almost convex polygons | 2024-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6146249 | 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/Q6147262 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147302 | 2024-01-15 | Paper |
| Small vertex cover helps in fixed-parameter tractability of graph deletion problems over data streams | 2024-01-08 | Paper |
| Partitioning subclasses of chordal graphs with few deletions | 2024-01-05 | Paper |
| Burn and win | 2023-12-22 | Paper |
| Parameterized algorithms for eccentricity shortest path problem | 2023-12-22 | Paper |
| Even more effort towards improved bounds and fixed-parameter tractability for multiwinner rules | 2023-12-13 | Paper |
| Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor | 2023-12-08 | Paper |
| Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems | 2023-11-29 | Paper |
| Improved FPT Algorithms for Deletion to Forest-Like Structures. | 2023-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6089654 | 2023-11-13 | Paper |
| Parameterized Complexity of Directed Spanner Problems. | 2023-11-13 | Paper |
| On the Parameterized Complexity of Maximum Degree Contraction Problem. | 2023-11-13 | Paper |
| On the Parameterized Complexity Of Grid Contraction | 2023-11-02 | 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 |
| 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 |
| Partitioning subclasses of chordal graphs with few deletions | 2023-10-04 | Paper |
| K-distinct branchings admits a polynomial kernel | 2023-09-20 | Paper |
| Balanced substructures in bicolored graphs | 2023-08-14 | Paper |
| Gehrlein stable committee with multi-modal preferences | 2023-07-28 | Paper |
| List homomorphism: beyond the known boundaries | 2023-07-26 | Paper |
| Almost optimal query algorithm for hitting set using a subset query | 2023-07-10 | Paper |
| Detours in directed graphs | 2023-07-10 | Paper |
| Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number | 2023-06-28 | Paper |
| Kernelization of arc disjoint cycle packing in \(\alpha\)-bounded digraphs | 2023-05-02 | Paper |
| Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems | 2023-04-26 | Paper |
| Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering | 2023-04-04 | Paper |
| Circumventing connectivity for kernelization | 2023-03-22 | Paper |
| On the optimality of pseudo-polynomial algorithms for integer programming | 2023-03-01 | Paper |
| Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875640 | 2023-02-03 | Paper |
| Exact and Approximate Digraph Bandwidth | 2023-02-03 | Paper |
| Parameterization Above a Multiplicative Guarantee | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875748 | 2023-02-03 | Paper |
| Parameterized algorithms for finding highly connected solution | 2022-12-21 | Paper |
| Output sensitive fault tolerant maximum matching | 2022-11-11 | Paper |
| Parameterized complexity of set-restricted disjoint paths on chordal graphs | 2022-11-11 | Paper |
| Parameterized algorithms for finding highly connected solution | 2022-11-11 | Paper |
| A polynomial kernel for bipartite permutation vertex deletion | 2022-10-27 | Paper |
| Highly unbreakable graph with a fixed excluded minor are almost rigid | 2022-10-26 | Paper |
| Parameterized Complexity of Fair Feedback Vertex Set Problem | 2022-10-19 | Paper |
| Kernelization of Arc Disjoint Cycle Packing in $$\alpha $$-Bounded Digraphs | 2022-10-19 | Paper |
| Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths | 2022-10-19 | Paper |
| Graph Hamiltonicity parameterized by proper interval deletion set | 2022-10-13 | Paper |
| Parameterized complexity of multi-node hubs | 2022-10-13 | Paper |
| On the Complexity of Singly Connected Vertex Deletion | 2022-10-13 | Paper |
| Parameterized complexity of maximum edge colorable subgraph | 2022-10-06 | Paper |
| On the complexity of singly connected vertex deletion | 2022-10-06 | Paper |
| Multiplicative Parameterization Above a Guarantee | 2022-09-24 | Paper |
| Fast exact algorithms for survivable network design with uniform requirements | 2022-08-18 | Paper |
| Parameterized complexity of directed spanner problems | 2022-08-03 | Paper |
| Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091015 | 2022-07-21 | Paper |
| Path Contraction Faster Than 2^n | 2022-07-21 | Paper |
| Approximate Counting of k-Paths: Deterministic and in Polynomial Space | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091216 | 2022-07-21 | Paper |
| Decomposition of Map Graphs with Applications. | 2022-07-21 | Paper |
| Packing Arc-Disjoint Cycles in Tournaments | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092396 | 2022-07-21 | Paper |
| Connecting the dots (with minimum crossings) | 2022-07-18 | Paper |
| Approximation in (Poly-) Logarithmic Space | 2022-07-18 | Paper |
| Quick separation in chordal and split graphs | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089249 | 2022-07-18 | Paper |
| On the parameterized complexity of grid contraction | 2022-06-13 | Paper |
| Odd cycle transversal in mixed graphs | 2022-06-08 | Paper |
| Gerrymandering on graphs: computational complexity and parameterized algorithms | 2022-06-01 | Paper |
| Resolute control: forbidding candidates from winning an election is hard | 2022-05-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5077647 | 2022-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075790 | 2022-05-11 | Paper |
| A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs | 2022-04-20 | Paper |
| On the Parameterized Approximability of Contraction to Classes of Chordal Graphs | 2022-03-29 | Paper |
| On the parameterized complexity of maximum degree contraction problem | 2022-03-25 | Paper |
| Popular Matching in Roommates Setting Is NP-hard | 2022-03-22 | Paper |
| Computation of Hadwiger Number and Related Contraction Problems | 2022-03-22 | Paper |
| On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization) | 2022-03-15 | Paper |
| 2-Approximating Feedback Vertex Set in Tournaments | 2022-02-16 | Paper |
| Approximate Counting of k -Paths: Simpler, Deterministic, and in Polynomial Space | 2022-02-16 | Paper |
| Exact multi-covering problems with geometric sets | 2022-02-14 | Paper |
| Randomized Contractions Meet Lean Decompositions | 2022-02-08 | Paper |
| Parameterized Algorithms | 2022-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5011876 | 2021-08-30 | Paper |
| Balanced stable marriage: how close is close enough? | 2021-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5005155 | 2021-08-04 | Paper |
| Parameterized Complexity of Multi-Node Hubs | 2021-08-04 | Paper |
| Exploring the Kernelization Borders for Hitting Cycles | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009489 | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009491 | 2021-08-04 | Paper |
| On the Optimality of Pseudo-polynomial Algorithms for Integer Programming | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002795 | 2021-07-28 | Paper |
| Reducing CMSO model checking to highly connected graphs | 2021-07-28 | Paper |
| Approximation in (Poly-) logarithmic space | 2021-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4993296 | 2021-06-15 | Paper |
| Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms | 2021-05-03 | Paper |
| Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems | 2021-05-03 | Paper |
| Parameterized complexity of \textsc{maximum edge colorable subgraph} | 2021-04-21 | Paper |
| Fixed parameter tractability of graph deletion problems over data streams | 2021-04-21 | Paper |
| Packing arc-disjoint cycles in tournaments | 2021-04-19 | Paper |
| Parameterized complexity of fair feedback vertex set problem | 2021-04-15 | Paper |
| Simultaneous feedback edge set: a parameterized perspective | 2021-03-26 | Paper |
| Parameterized and exact algorithms for class domination coloring | 2021-03-25 | Paper |
| Paths to trees and cacti | 2021-03-09 | Paper |
| 2-Approximating Feedback Vertex Set in Tournaments | 2021-02-02 | Paper |
| Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs | 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 |
| Fixed-parameter tractable algorithms for tracking shortest paths | 2020-11-06 | Paper |
| Going Far from Degeneracy | 2020-10-29 | Paper |
| Approximation algorithms for geometric conflict free covering problems | 2020-10-23 | Paper |
| On the approximate compressibility of connected vertex cover | 2020-10-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5115789 | 2020-08-18 | Paper |
| Erdös-Pósa Property of Obstructions to Interval Graphs | 2020-08-05 | Paper |
| A characterization of König-Egerváry graphs with extendable vertex covers | 2020-08-04 | Paper |
| Path Contraction Faster than $2^n$ | 2020-07-30 | Paper |
| Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule? | 2020-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111387 | 2020-05-27 | Paper |
| Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs | 2020-05-27 | Paper |
| Packing Cycles Faster Than Erdos-Posa | 2020-05-27 | Paper |
| A Linear-Time Parameterized Algorithm for Node Unique Label Cover | 2020-05-27 | Paper |
| On the Parameterized Complexity of Contraction to Generalization of Trees. | 2020-05-27 | Paper |
| Communication Complexity of Pairs of Graph Families with Applications | 2020-05-26 | Paper |
| Parameterized Algorithms and Kernels for Rainbow Matching | 2020-05-26 | Paper |
| Fully dynamic arboricity maintenance | 2020-05-23 | Paper |
| Parameterized complexity of conflict-free matchings and paths | 2020-05-21 | Paper |
| Linear representation of transversal matroids and gammoids parameterized by rank | 2020-04-07 | Paper |
| Quadratic vertex kernel for rainbow matching | 2020-02-28 | Paper |
| Fixed-parameter tractable algorithm and polynomial kernel for \textsc{Max-Cut Above Spanning Tree} | 2020-02-27 | Paper |
| Solving group interval scheduling efficiently | 2020-02-25 | Paper |
| An Erdős-Pósa theorem on neighborhoods and domination number | 2020-02-24 | Paper |
| Faster graph bipartization | 2020-02-24 | Paper |
| Fully dynamic arboricity maintenance | 2020-02-24 | Paper |
| The parameterized complexity of cycle packing: indifference is not an issue | 2020-02-12 | Paper |
| A polynomial sized kernel for tracking paths problem | 2020-02-12 | Paper |
| Subset feedback vertex set in chordal and split graphs | 2020-02-06 | Paper |
| Wannabe bounded treewidth graphs admit a polynomial kernel for DFVS | 2020-01-16 | Paper |
| Parameterized complexity of geometric covering problems having conflicts | 2020-01-16 | Paper |
| A polynomial sized kernel for tracking paths problem | 2020-01-16 | Paper |
| Balanced stable marriage: how close is close enough? | 2020-01-16 | Paper |
| Communication Complexity and Graph Families | 2019-12-16 | Paper |
| Simultaneous Feedback Vertex Set | 2019-12-16 | Paper |
| Split Contraction | 2019-12-16 | Paper |
| Spanning Circuits in Regular Matroids | 2019-12-02 | Paper |
| Approximation Schemes for Low-rank Binary Matrix Approximation Problems | 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 complexity of Mixed Dominating Set | 2019-10-22 | Paper |
| On the parameterized complexity of edge-linked paths | 2019-10-22 | Paper |
| The parameterized complexity landscape of finding 2-partitions of digraphs | 2019-10-18 | Paper |
| Parameterized computational geometry via decomposition theorems | 2019-10-15 | Paper |
| Popular Matching in Roommates Setting Is NP-hard | 2019-10-15 | Paper |
| Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity | 2019-10-15 | Paper |
| Interval Vertex Deletion Admits a Polynomial Kernel | 2019-10-15 | Paper |
| Parameterised algorithms for deletion to classes of DAGs | 2019-09-05 | Paper |
| Polynomial kernels for vertex cover parameterized by small degree modulators | 2019-09-05 | Paper |
| Editing to Connected F-Degree Graph | 2019-08-29 | Paper |
| Packing Cycles Faster Than Erdos--Posa | 2019-08-29 | Paper |
| Rank Vertex Cover as a Natural Problem for Algebraic Compression | 2019-08-29 | Paper |
| Subset feedback vertex set in chordal and split graphs | 2019-08-20 | Paper |
| The parameterized complexity of cycle packing: indifference is not an issue | 2019-08-20 | Paper |
| On the parameterized complexity of contraction to generalization of trees | 2019-06-27 | Paper |
| Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms | 2019-06-20 | Paper |
| Linear Time Parameterized Algorithms via Skew-Symmetric Multicuts | 2019-06-20 | Paper |
| A Near-Optimal Planarization Algorithm | 2019-06-20 | Paper |
| Some hard stable marriage problems: a survey on multivariate analysis | 2019-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743379 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743499 | 2019-05-10 | Paper |
| Minimum Bisection Is Fixed-Parameter Tractable | 2019-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633895 | 2019-05-06 | Paper |
| Parameterized algorithms and kernels for rainbow matching | 2019-04-25 | Paper |
| Clique-width III | 2019-03-28 | Paper |
| Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion | 2019-03-28 | Paper |
| Subquadratic Kernels for Implicit 3-H <scp>itting</scp> S <scp>et</scp> and 3-S <scp>et</scp> P <scp>acking</scp> Problems | 2019-03-28 | Paper |
| Parameterized algorithms for list \(K\)-cycle | 2019-03-11 | Paper |
| Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree | 2019-02-06 | Paper |
| Kernelization | 2019-01-14 | Paper |
| Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs | 2019-01-11 | Paper |
| Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes | 2018-12-06 | Paper |
| \textsc{Max-Cut Above Spanning Tree} is fixed-parameter tractable | 2018-11-28 | Paper |
| Covering Vectors by Spaces: Regular Matroids | 2018-11-19 | Paper |
| Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal | 2018-11-13 | Paper |
| Exact Algorithms for Terrain Guarding | 2018-11-13 | Paper |
| Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth | 2018-11-13 | Paper |
| Deterministic Truncation of Linear Matroids | 2018-11-13 | Paper |
| Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts | 2018-11-12 | Paper |
| Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors | 2018-11-12 | Paper |
| Linear Time Parameterized Algorithms for S <scp>ubset</scp> F <scp>eedback</scp> V <scp>ertex</scp> S <scp>et</scp> | 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 |
| \((k,n-k)\)-\textsc{Max-Cut}: an \(\mathcal{O}^*(2^p)\)-time algorithm and a polynomial kernel | 2018-10-18 | Paper |
| Hitting and covering partially | 2018-10-04 | Paper |
| Below All Subsets for Minimal Connected Dominating Set | 2018-09-26 | Paper |
| Finding even subgraphs even faster | 2018-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4580083 | 2018-08-13 | Paper |
| Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms | 2018-08-02 | Paper |
| (Meta) Kernelization | 2018-08-02 | Paper |
| Rank reduction of oriented graphs by vertex and edge deletions | 2018-07-26 | Paper |
| Kernelization of Cycle Packing with Relaxed Disjointness Constraints | 2018-07-18 | Paper |
| Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion | 2018-07-16 | Paper |
| Fully polynomial-time parameterized computations for graphs and matrices of low treewidth | 2018-07-16 | Paper |
| Spanning Circuits in Regular Matroids | 2018-07-16 | Paper |
| Slightly Superexponential Parameterized Problems | 2018-06-05 | Paper |
| Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs | 2018-06-05 | Paper |
| On the kernelization complexity of string problems | 2018-05-17 | Paper |
| Reconfiguration on sparse graphs | 2018-05-08 | Paper |
| Matrix Rigidity from the Viewpoint of Parameterized Complexity | 2018-05-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636003 | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636486 | 2018-04-19 | Paper |
| Kernels for Deletion to Classes of Acyclic Digraphs. | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636602 | 2018-04-19 | Paper |
| Matrix Rigidity from the Viewpoint of Parameterized Complexity | 2018-04-19 | Paper |
| Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel | 2018-04-18 | Paper |
| Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set | 2018-04-10 | Paper |
| Parameterized algorithms for stable matching with ties and incomplete lists | 2018-04-04 | Paper |
| Parameterized Algorithms on Perfect Graphs for Deletion to (r,l)-Graphs | 2018-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607896 | 2018-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607901 | 2018-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608015 | 2018-03-15 | Paper |
| Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms | 2018-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608076 | 2018-03-15 | Paper |
| Group activity selection on graphs: parameterized analysis | 2018-02-13 | 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 |
| Editing to Connected f-Degree Graph | 2018-01-24 | Paper |
| Bivariate complexity analysis of \textsc{Almost Forest Deletion} | 2017-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4598162 | 2017-12-19 | Paper |
| Kernels for deletion to classes of acyclic digraphs | 2017-11-14 | Paper |
| Multivariate complexity analysis of geometric \textsc{Red Blue Set Cover} | 2017-11-09 | Paper |
| Parameterized complexity of superstring problems | 2017-11-09 | Paper |
| Linear representation of transversal matroids and gammoids parameterized by rank | 2017-10-23 | 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 |
| Exact Algorithms via Monotone Local Search | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5363780 | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5363786 | 2017-09-29 | Paper |
| B-chromatic number: Beyond NP-hardness | 2017-09-29 | 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 |
| Fast exact algorithms for survivable network design with uniform requirements | 2017-09-22 | Paper |
| Parameterized complexity of geometric covering problems having conflicts | 2017-09-22 | Paper |
| On approximability of optimization problems related to red/blue-split graphs | 2017-08-24 | Paper |
| Lossy kernelization | 2017-08-17 | Paper |
| Hitting Selected (Odd) Cycles | 2017-08-14 | Paper |
| Paths to Trees and Cacti | 2017-07-21 | Paper |
| Finding Even Subgraphs Even Faster | 2017-07-13 | Paper |
| Faster exact algorithms for some terminal set problems | 2017-06-30 | Paper |
| Connecting Vertices by Independent Trees | 2017-04-25 | Paper |
| Tree Deletion Set Has a Polynomial Kernel (but no OPT^O(1) Approximation) | 2017-04-25 | Paper |
| Parameterized and Exact Algorithms for Class Domination Coloring | 2017-04-04 | Paper |
| Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth | 2017-03-10 | Paper |
| Partially Polynomial Kernels for Set Cover and Test Cover | 2017-02-21 | Paper |
| Backdoors to q-Horn | 2017-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957874 | 2017-01-30 | Paper |
| Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound | 2017-01-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957518 | 2017-01-26 | Paper |
| Parameterized complexity of strip packing and minimum volume packing | 2017-01-09 | Paper |
| Irrelevant vertices for the planar disjoint paths problem | 2016-11-25 | Paper |
| Reducing rank of the adjacency matrix by graph modification | 2016-11-24 | Paper |
| On the parameterized complexity of b-\textsc{chromatic number} | 2016-11-14 | Paper |
| Parameterized algorithms for non-separating trees and branchings in digraphs | 2016-11-01 | Paper |
| Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments | 2016-10-21 | Paper |
| Tree Deletion Set Has a Polynomial Kernel but No $\text{OPT}^\mathcal{O}(1)$ Approximation) | 2016-07-22 | Paper |
| Partially Polynomial Kernels for Set Cover and Test Cover | 2016-07-22 | Paper |
| A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion | 2016-05-03 | Paper |
| Parameterized Complexity of Red Blue Set Cover for Lines | 2016-05-03 | Paper |
| Rank Reduction of Directed Graphs by Vertex and Edge Deletions | 2016-05-03 | Paper |
| A Parameterized Algorithm for Mixed-Cut | 2016-05-03 | Paper |
| $$(k,n-k)$$ ( k , n - k ) -Max-Cut: An $${\mathcal O}^*(2^p)$$ O ∗ ( 2 p ) -Time Algorithm and a Polynomial Kernel | 2016-05-03 | Paper |
| Backdoors to q-Horn | 2016-03-23 | Paper |
| Hitting Forbidden Minors: Approximation and Kernelization | 2016-03-04 | Paper |
| Reconfiguration on sparse graphs | 2015-10-30 | Paper |
| On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids | 2015-10-30 | Paper |
| Bivariate Complexity Analysis of Almost Forest Deletion | 2015-10-29 | Paper |
| Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs | 2015-10-29 | Paper |
| Reducing Rank of the Adjacency Matrix by Graph Modification | 2015-10-29 | Paper |
| Unique Covering Problems with Geometric Sets | 2015-10-29 | 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 |
| Linear Time Parameterized Algorithms for Subset Feedback Vertex Set | 2015-10-27 | Paper |
| Distortion is Fixed Parameter Tractable | 2015-09-24 | Paper |
| Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel | 2015-09-16 | Paper |
| Faster fixed parameter tractable algorithms for finding feedback vertex sets | 2015-09-02 | Paper |
| Parameterized complexity of superstring problems | 2015-08-20 | 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 the parameterized complexity of vertex cover and edge cover with connectivity constraints | 2014-12-22 | Paper |
| Hitting and Harvesting Pumpkins | 2014-12-22 | Paper |
| The kernelization complexity of connected domination in graphs with (no) small cycles | 2014-12-02 | Paper |
| On cutwidth parameterized by vertex cover | 2014-12-02 | Paper |
| Parameterized Approximations via d-Skew-Symmetric Multicut | 2014-10-14 | Paper |
| Representative Sets of Product Families | 2014-10-08 | Paper |
| Solving Multicut Faster Than 2 n | 2014-10-08 | Paper |
| On the Kernelization Complexity of String Problems | 2014-09-26 | Paper |
| Kernel(s) for problems with no kernel | 2014-09-09 | Paper |
| (Meta) Kernelization | 2014-07-25 | Paper |
| Parameterized Algorithms to Preserve Connectivity | 2014-07-01 | Paper |
| Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound | 2014-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417642 | 2014-05-22 | Paper |
| Bidimensionality and Geometric Graphs | 2014-05-22 | Paper |
| Imbalance is fixed parameter tractable | 2014-04-14 | Paper |
| A Polynomial Kernel for Proper Interval Vertex Deletion | 2014-04-10 | Paper |
| On the hardness of losing width | 2014-03-25 | Paper |
| Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization | 2014-03-13 | 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 |
| Faster Exact Algorithms for Some Terminal Set Problems | 2013-12-10 | Paper |
| On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges | 2013-12-10 | Paper |
| Hardness of r-dominating set on Graphs of Diameter (r + 1) | 2013-12-10 | Paper |
| Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs | 2013-12-06 | Paper |
| A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments | 2013-12-02 | Paper |
| An FPT algorithm for Tree Deletion Set | 2013-11-28 | Paper |
| Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles | 2013-11-15 | Paper |
| Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule? | 2013-09-20 | Paper |
| The parameterized complexity of unique coverage and its variants | 2013-08-05 | Paper |
| Computing optimal Steiner trees in polynomial space | 2013-08-05 | Paper |
| An FPT Algorithm for Tree Deletion Set | 2013-04-12 | Paper |
| Maximum $r$-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds | 2013-04-09 | Paper |
| Subexponential algorithms for partial cover problems | 2013-04-04 | Paper |
| A linear vertex kernel for maximum internal spanning tree | 2013-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4904144 | 2013-01-28 | Paper |
| FPT algorithms for connected feedback vertex set | 2012-12-21 | Paper |
| On parameterized independent feedback vertex set | 2012-11-27 | Paper |
| Parameterized Algorithms for Even Cycle Transversal | 2012-11-06 | Paper |
| Kernels for Feedback Arc Set In Tournaments | 2012-10-24 | Paper |
| Subexponential Algorithms for Partial Cover Problems | 2012-10-24 | Paper |
| Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract) | 2012-10-19 | Paper |
| On the directed full degree spanning tree problem | 2012-10-16 | Paper |
| Lower bounds on kernelization | 2012-10-16 | Paper |
| A Polynomial Kernel for Proper Interval Vertex Deletion | 2012-09-25 | Paper |
| Counting Subgraphs via Homomorphisms | 2012-09-12 | Paper |
| Kernelization – Preprocessing with a Guarantee | 2012-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2908840 | 2012-08-29 | Paper |
| Determining the winner of a Dodgson election is hard | 2012-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2904774 | 2012-08-23 | Paper |
| Faster algorithms for finding and counting subgraphs | 2012-08-17 | Paper |
| Local search: is brute-force avoidable? | 2012-08-17 | Paper |
| On the approximability of some degree-constrained subgraph problems | 2012-08-14 | Paper |
| New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting | 2012-06-29 | Paper |
| On the Hardness of Losing Width | 2012-06-15 | Paper |
| On Cutwidth Parameterized by Vertex Cover | 2012-06-15 | Paper |
| Parameterized complexity of finding small degree-constrained subgraphs | 2012-05-11 | Paper |
| Sharp separation and applications to exact and parameterized algorithms | 2012-04-26 | Paper |
| Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves | 2012-04-24 | Paper |
| Parameterized algorithm for eternal vertex cover | 2012-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113683 | 2012-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113754 | 2012-01-23 | Paper |
| Algorithmic Aspects of Dominator Colorings in Graphs | 2012-01-13 | Paper |
| Kernels for feedback arc set in tournaments | 2012-01-11 | Paper |
| Implicit branching and parameterized partial cover problems | 2012-01-11 | Paper |
| A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments | 2011-12-16 | Paper |
| Planar k-Path in Subexponential Time and Polynomial Space | 2011-12-16 | Paper |
| The complexity of König subgraph problems and above-guarantee vertex cover | 2011-12-14 | Paper |
| Bandwidth on AT-free graphs | 2011-12-07 | Paper |
| Hitting and Harvesting Pumpkins | 2011-09-16 | Paper |
| Paths, Flowers and Vertex Cover | 2011-09-16 | Paper |
| On Parameterized Independent Feedback Vertex Set | 2011-08-17 | Paper |
| An exact algorithm for minimum distortion embedding | 2011-07-14 | Paper |
| Tight Bounds for Linkages in Planar Graphs | 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 |
| Strengthening Erdös-Pósa property for minor-closed graph classes | 2011-03-21 | Paper |
| On the complexity of some colorful problems parameterized by treewidth | 2011-02-21 | Paper |
| Approximation Algorithms for Minimum Chain Vertex Deletion | 2011-02-20 | Paper |
| Parameterized Algorithms for Boxicity | 2010-12-09 | Paper |
| Intractability of Clique-Width Parameterizations | 2010-11-04 | Paper |
| The Curse of Connectivity: t-Total Vertex (Edge) Cover | 2010-07-20 | Paper |
| Imbalance Is Fixed Parameter Tractable | 2010-07-20 | Paper |
| Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing | 2010-06-22 | Paper |
| Sharp Separation and Applications to Exact and Parameterized Algorithms | 2010-04-27 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| Improved fixed parameter tractable algorithms for two ``edge problems: MAXCUT and MAXDAG | 2010-03-24 | Paper |
| Spanning Directed Trees with Many Leaves | 2010-03-17 | Paper |
| Iterative compression and exact algorithms | 2010-03-09 | Paper |
| FPT Algorithms for Connected Feedback Vertex Set | 2010-02-09 | Paper |
| An Exact Algorithm for Minimum Distortion Embedding | 2010-01-21 | Paper |
| On the Directed Degree-Preserving Spanning Tree Problem | 2010-01-14 | Paper |
| Even Faster Algorithm for Set Splitting! | 2010-01-14 | Paper |
| A Linear Vertex Kernel for Maximum Internal Spanning Tree | 2009-12-17 | 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 |
| The Budgeted Unique Coverage Problem and Color-Coding | 2009-08-18 | Paper |
| Counting Subgraphs via Homomorphisms | 2009-07-14 | Paper |
| Incompressibility through Colors and IDs | 2009-07-14 | Paper |
| Distortion Is Fixed Parameter Tractable | 2009-07-14 | Paper |
| Fast FAST | 2009-07-14 | Paper |
| On two techniques of combining branching and treewidth | 2009-06-22 | Paper |
| Linear Kernel for Planar Connected Dominating Set | 2009-06-03 | Paper |
| Improved Exact Algorithms for Counting 3- and 4-Colorings | 2009-03-06 | Paper |
| On the Complexity of Some Colorful Problems Parameterized by Treewidth | 2009-03-03 | Paper |
| Degree-Constrained Subgraph Problems: Hardness and Approximation Results | 2009-02-12 | Paper |
| Iterative Compression and Exact Algorithms | 2009-02-03 | Paper |
| Graph Layout Problems Parameterized by Vertex Cover | 2009-01-29 | Paper |
| König Deletion Sets and Vertex Covers above the Matching Size | 2009-01-29 | Paper |
| Parameterized Algorithms for Generalized Domination | 2009-01-27 | Paper |
| Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles | 2008-12-02 | Paper |
| Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem | 2008-06-05 | Paper |
| Capacitated Domination and Covering: A Parameterized Perspective | 2008-06-05 | Paper |
| The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number | 2008-05-27 | Paper |
| A Moderately Exponential Time Algorithm for Full Degree Spanning Tree | 2008-05-27 | Paper |
| Better Algorithms and Bounds for Directed Maximum Leaf Problems | 2008-04-24 | Paper |
| Branching and Treewidth Based Exact Algorithms | 2008-04-24 | Paper |
| Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems | 2008-04-17 | Paper |
| Efficient exact algorithms through enumerating maximal independent sets and other techniques | 2007-12-19 | Paper |
| Parameterized Algorithms for Directed Maximum Leaf Problems | 2007-11-28 | Paper |
| Triangles, 4-Cycles and Parameterized (In-)Tractability | 2007-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3439693 | 2007-05-29 | Paper |
| Theoretical Computer Science | 2006-11-01 | Paper |
| Parameterized algorithms for feedback set problems and their duals in tournaments | 2006-04-06 | Paper |
| Parameterized and Exact Computation | 2005-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4425958 | 2003-09-14 | Paper |
