| Publication | Date of Publication | Type |
|---|
Bicriteria FPT-approximation algorithms for vertex deletion to bounded degeneracy graphs
Theoretical Computer Science | 2026-06-15 | Paper |
| When far is better: the Chamberlin-Courant approach to obnoxious committee selection | 2026-06-12 | Paper |
| The parameterized complexity landscape of two-sets cut-uncut | 2026-05-29 | Paper |
| Subset feedback vertex set in tournaments as fast as without the subset | 2026-05-29 | Paper |
| Cuts in graphs with matroid constraints | 2026-05-26 | Paper |
| Breaking a graph into connected components with small dominating sets | 2026-05-12 | Paper |
| An FPT algorithm for elimination distance to bounded degree graphs | 2026-04-21 | Paper |
| Diverse collections in matroids and graphs | 2026-04-21 | Paper |
| Exploiting dense structures in parameterized complexity | 2026-04-21 | Paper |
| On the (parameterized) complexity of almost stable marriage | 2026-03-23 | Paper |
| Parameterized complexity of feedback vertex sets on hypergraphs | 2026-03-23 | Paper |
| Optimal output sensitive fault tolerant cuts | 2026-03-23 | Paper |
| A (2+)-factor approximation algorithm for split vertex deletion | 2026-03-18 | Paper |
| Computation of Hadwiger number and related contraction problems: tight lower bounds | 2026-03-18 | Paper |
| On the parameterized complexity of cosecure domination | 2026-02-26 | Paper |
| On the parameterized complexity of connected cluster vertex deletion | 2026-02-26 | Paper |
Balanced substructures in bicolored graphs
Theoretical Computer Science | 2026-02-12 | Paper |
On the structural parameterized complexity of defective coloring
Journal of Computer and System Sciences | 2026-02-11 | Paper |
The parameterized complexity landscape of two-sets cut-uncut
Theoretical Computer Science | 2026-02-04 | Paper |
Hybrid k-clustering: blending k-median and k-center
ACM Transactions on Computation Theory | 2026-01-20 | Paper |
When recursion is better than iteration: a linear-time algorithm for directed acyclicity with few error vertices
Journal of Combinatorial Theory. Series B | 2026-01-15 | Paper |
| Satisfiability to coverage in presence of fairness, matroid, and global constraints | 2026-01-14 | Paper |
| Bicriteria \textsf{FPT}-approximation algorithms for vertex deletion to bounded degeneracy graphs | 2026-01-13 | Paper |
| Parameterized algorithms for power edge set and zero forcing set | 2026-01-13 | Paper |
| Stability in graphs with matroid constraints | 2025-12-02 | Paper |
| Eliminating crossings in ordered graphs | 2025-12-02 | Paper |
| A 1.9999-approximation algorithm for vertex cover on string graphs | 2025-11-24 | Paper |
| Parameterized complexity of disconnected matchings | 2025-11-11 | Paper |
| Nonpartisan feedback vertex set | 2025-11-11 | Paper |
Max-SAT with cardinality constraint parameterized by the number of clauses
Theoretical Computer Science | 2025-11-10 | Paper |
| Kernelization of counting problems | 2025-11-04 | Paper |
| Exponential-time approximation schemes via compression | 2025-11-04 | Paper |
| Bipartizing (pseudo-)disk graphs: approximation with a ratio better than 3 | 2025-10-06 | Paper |
| Hybrid k-clustering: blending k-median and k-center | 2025-10-06 | Paper |
| Difference determines the degree: structural kernelizations of component order connectivity | 2025-09-24 | Paper |
| A parameterized approximation scheme for min k-cut | 2025-08-12 | Paper |
| Subexponential parameterized algorithms for planar and apex-minor-free graphs via low treewidth pattern covering | 2025-08-06 | Paper |
| FO model checking on posets of bounded width | 2025-08-05 | Paper |
| Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth | 2025-08-05 | Paper |
| FPT approximations for packing and covering problems parameterized by elimination distance and even less | 2025-07-28 | Paper |
| On the complexity of the eigenvalue deletion problem | 2025-07-24 | Paper |
Odd cycle transversal on P₅-free graphs in polynomial time
ACM Transactions on Algorithms | 2025-07-22 | Paper |
True contraction decomposition and almost ETH-tight bipartization for unit-disk graphs
ACM Transactions on Algorithms | 2025-07-22 | Paper |
Further parameterized results on weak Grundy coloring
Theoretical Computer Science | 2025-07-21 | Paper |
Burn and win
Theoretical Computer Science | 2025-07-21 | Paper |
| Exact exponential algorithms for clustering problems | 2025-06-23 | Paper |
| A finite algorithm for the realizabilty of a Delaunay triangulation | 2025-06-23 | Paper |
| \textsc{Planar} \(\mathcal{F}\)-\textsc{deletion}: approximation, kernelization and optimal FPT algorithms | 2025-05-05 | Paper |
| Roman cycle hitting set | 2025-05-02 | Paper |
Wannabe bounded treewidth graphs admit a polynomial kernel for directed feedback vertex set
ACM Transactions on Computation Theory | 2025-04-23 | Paper |
An exponential time parameterized algorithm for planar disjoint paths
SIAM Journal on Computing | 2025-03-27 | Paper |
Exact and approximate digraph bandwidth
Theory of Computing Systems | 2025-02-28 | Paper |
| Parameterized complexity of paired domination | 2025-02-28 | Paper |
Contraction decomposition in unit disk graphs and algorithmic applications in parameterized complexity
ACM Transactions on Algorithms | 2025-02-21 | Paper |
A comprehensive investigation on nonlinear vibration and bending characteristics of bio-inspired helicoidal laminated composite structures
AMM. Applied Mathematics and Mechanics. (English Edition) | 2025-02-20 | Paper |
Fixed-parameter algorithms for fair hitting set problems
Information and Computation | 2025-01-31 | Paper |
| A parameterized algorithm for vertex connectivity survivable network design problem with uniform demands | 2025-01-06 | Paper |
| Kernelization for spreading points | 2025-01-06 | Paper |
| Lossy kernelization for (implicit) hitting set problems | 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
SIAM Journal on Computing | 2024-12-20 | Paper |
On the parameterized complexity of deletion to \(\mathcal{H}\)-free strong components
SIAM Journal on Discrete Mathematics | 2024-12-18 | Paper |
| Fixed-parameter algorithms for fair hitting set problems | 2024-12-03 | 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 |
| Odd cycle transversal on P₅-free graphs in quasi-polynomial time | 2024-11-28 | Paper |
(Re)packing equal disks into rectangle
Discrete & Computational Geometry | 2024-11-22 | Paper |
Parameterized approximation algorithms for weighted vertex cover
Theoretical Computer Science | 2024-11-18 | Paper |
| Breaking the all subsets barrier for min k-cut | 2024-11-14 | Paper |
| Minimum-membership geometric set cover, revisited | 2024-10-16 | Paper |
| FPT constant-approximations for capacitated clustering to minimize the sum of cluster radii | 2024-10-16 | Paper |
| Parameterized complexity of non-separating and non-disconnecting paths and sets | 2024-08-06 | Paper |
| An exact algorithm for knot-free vertex deletion | 2024-08-06 | 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 |
| Quick-sort style approximation algorithms for generalizations of feedback vertex set in tournaments | 2024-05-31 | Paper |
| Parameterized approximation algorithms for weighted vertex cover | 2024-05-31 | Paper |
| Max-SAT with cardinality constraint parameterized by the number of clauses | 2024-05-31 | Paper |
| A framework for approximation schemes on disk graphs | 2024-05-14 | Paper |
| Parameterized approximation scheme for biclique-free max k-weight SAT and max coverage | 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 |
Improved FPT Algorithms for Deletion to Forest-Like Structures
Algorithmica | 2024-04-24 | Paper |
| Detours in directed graphs | 2024-04-23 | Paper |
| Further exploiting \(c\)-closure for FPT algorithms and kernels for domination problems | 2024-04-23 | Paper |
Diverse collections in matroids and graphs
Mathematical Programming. Series A. Series B | 2024-02-21 | Paper |
| scientific article; zbMATH DE number 7803579 (Why is no real title available?) | 2024-02-12 | Paper |
| A polynomial kernel for bipartite permutation vertex deletion | 2024-02-12 | Paper |
The parameterized complexity of guarding almost convex polygons
Discrete & Computational Geometry | 2024-02-09 | Paper |
scientific article; zbMATH DE number 7799599 (Why is no real title available?)
(available as arXiv preprint) | 2024-02-05 | Paper |
An ETH-tight algorithm for bidirected Steiner connectivity
Lecture Notes in Computer Science | 2024-01-16 | Paper |
| scientific article; zbMATH DE number 7788351 (Why is no real title available?) | 2024-01-15 | Paper |
| scientific article; zbMATH DE number 7788352 (Why is no real title available?) | 2024-01-15 | Paper |
| scientific article; zbMATH DE number 7788353 (Why is no real title available?) | 2024-01-15 | Paper |
scientific article; zbMATH DE number 7788390 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Small vertex cover helps in fixed-parameter tractability of graph deletion problems over data streams
Theory of Computing Systems | 2024-01-08 | Paper |
Partitioning subclasses of chordal graphs with few deletions
Theoretical Computer Science | 2024-01-05 | Paper |
Parameterized algorithms for eccentricity shortest path problem
Lecture Notes in Computer Science | 2023-12-22 | Paper |
Burn and win
Lecture Notes in Computer Science | 2023-12-22 | Paper |
Even more effort towards improved bounds and fixed-parameter tractability for multiwinner rules
Algorithmica | 2023-12-13 | Paper |
Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems
SIAM Journal on Discrete Mathematics | 2023-11-29 | Paper |
Improved FPT Algorithms for Deletion to Forest-Like Structures.
(available as arXiv preprint) | 2023-11-14 | Paper |
| On the Parameterized Complexity of Maximum Degree Contraction Problem. | 2023-11-13 | Paper |
| Parameterized Complexity of Directed Spanner Problems. | 2023-11-13 | Paper |
scientific article; zbMATH DE number 7764101 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-13 | Paper |
| ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs | 2023-11-02 | Paper |
| On the Parameterized Complexity Of Grid Contraction | 2023-11-02 | Paper |
The Parameterized Complexity of Guarding Almost Convex Polygons.
(available as arXiv preprint) | 2023-11-02 | Paper |
| On the Parameterized Approximability of Contraction to Classes of Chordal Graphs | 2023-10-31 | Paper |
Clustering what matters: optimal approximation for clustering with outliers
The Journal of Artificial Intelligence Research (JAIR) | 2023-10-23 | Paper |
Polynomial Kernel for Interval Vertex Deletion
ACM Transactions on Algorithms | 2023-10-23 | Paper |
Erdős–Pósa property of obstructions to interval graphs
Journal of Graph Theory | 2023-10-09 | Paper |
Partitioning subclasses of chordal graphs with few deletions
Lecture Notes in Computer Science | 2023-10-04 | Paper |
| K-distinct branchings admits a polynomial kernel | 2023-09-20 | Paper |
Balanced substructures in bicolored graphs
Lecture Notes in Computer Science | 2023-08-14 | Paper |
Gehrlein stable committee with multi-modal preferences
Algorithmic Game Theory | 2023-07-28 | Paper |
List homomorphism: beyond the known boundaries
LATIN 2022: Theoretical Informatics | 2023-07-26 | Paper |
Detours in directed graphs
Journal of Computer and System Sciences | 2023-07-10 | Paper |
Almost optimal query algorithm for hitting set using a subset query
Journal of Computer and System Sciences | 2023-07-10 | Paper |
Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number
Algorithmica | 2023-06-28 | Paper |
Kernelization of arc disjoint cycle packing in -bounded digraphs
Theory of Computing Systems | 2023-05-02 | Paper |
Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems
ACM Transactions on Algorithms | 2023-04-26 | Paper |
Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering
SIAM Journal on Computing | 2023-04-04 | Paper |
| Circumventing connectivity for kernelization | 2023-03-22 | Paper |
On the optimality of pseudo-polynomial algorithms for integer programming
Mathematical Programming. Series A. Series B | 2023-03-01 | Paper |
| Exact and Approximate Digraph Bandwidth | 2023-02-03 | Paper |
| scientific article; zbMATH DE number 7650305 (Why is no real title available?) | 2023-02-03 | Paper |
| scientific article; zbMATH DE number 7650395 (Why is no real title available?) | 2023-02-03 | Paper |
| Parameterization Above a Multiplicative Guarantee | 2023-02-03 | Paper |
| Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices | 2023-02-03 | Paper |
Parameterized algorithms for finding highly connected solution
Theoretical Computer Science | 2022-12-21 | Paper |
Parameterized algorithms for finding highly connected solution
Computer Science – Theory and Applications | 2022-11-11 | 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 |
A polynomial kernel for bipartite permutation vertex deletion
Algorithmica | 2022-10-27 | 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
Treewidth, Kernels, and Algorithms | 2022-10-19 | Paper |
Parameterized Complexity of Fair Feedback Vertex Set Problem
Computer Science – Theory and Applications | 2022-10-19 | Paper |
Kernelization of Arc Disjoint Cycle Packing in \alpha -Bounded Digraphs
Computer Science – Theory and Applications | 2022-10-19 | Paper |
On the Complexity of Singly Connected Vertex Deletion
Lecture Notes in Computer Science | 2022-10-13 | Paper |
Parameterized complexity of multi-node hubs
Journal of Computer and System Sciences | 2022-10-13 | Paper |
| Graph Hamiltonicity parameterized by proper interval deletion set | 2022-10-13 | Paper |
Parameterized complexity of maximum edge colorable subgraph
Algorithmica | 2022-10-06 | Paper |
On the complexity of singly connected vertex deletion
Theoretical Computer Science | 2022-10-06 | Paper |
Multiplicative Parameterization Above a Guarantee
ACM Transactions on Computation Theory | 2022-09-24 | Paper |
Fast exact algorithms for survivable network design with uniform requirements
Algorithmica | 2022-08-18 | Paper |
Parameterized complexity of directed spanner problems
Algorithmica | 2022-08-03 | Paper |
scientific article; zbMATH DE number 7561379 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
| Packing Arc-Disjoint Cycles in Tournaments | 2022-07-21 | Paper |
| Parameterized complexity of conflict-free matchings and paths | 2022-07-21 | Paper |
| Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number | 2022-07-21 | Paper |
| Path Contraction Faster Than 2^n | 2022-07-21 | Paper |
Decomposition of Map Graphs with Applications.
(available as arXiv preprint) | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7561552 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
| Approximate Counting of k-Paths: Deterministic and in Polynomial Space | 2022-07-21 | Paper |
| Approximation in (Poly-) Logarithmic Space | 2022-07-18 | Paper |
scientific article; zbMATH DE number 7559446 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
| Connecting the dots (with minimum crossings) | 2022-07-18 | Paper |
| Quick separation in chordal and split graphs | 2022-07-18 | Paper |
On the parameterized complexity of grid contraction
Journal of Computer and System Sciences | 2022-06-13 | Paper |
| Odd cycle transversal in mixed graphs | 2022-06-08 | Paper |
Gerrymandering on graphs: computational complexity and parameterized algorithms
(available as arXiv preprint) | 2022-06-01 | Paper |
Resolute control: forbidding candidates from winning an election is hard
Theoretical Computer Science | 2022-05-31 | Paper |
ETH-tight algorithms for long path and cycle on unit disk graphs
(available as arXiv preprint) | 2022-05-18 | Paper |
| scientific article; zbMATH DE number 7525484 (Why is no real title available?) | 2022-05-11 | Paper |
A fixed-parameter tractable algorithm for elimination distance to bounded degree graphs
SIAM Journal on Discrete Mathematics | 2022-04-20 | Paper |
On the parameterized approximability of contraction to classes of chordal graphs
ACM Transactions on Computation Theory | 2022-03-29 | Paper |
On the parameterized complexity of maximum degree contraction problem
Algorithmica | 2022-03-25 | Paper |
Computation of Hadwiger number and related contraction problems. Tight lower bounds
ACM Transactions on Computation Theory | 2022-03-22 | Paper |
Popular matching in roommates setting is NP-hard
ACM Transactions on Computation Theory | 2022-03-22 | Paper |
On treewidth and stable marriage: parameterized algorithms and hardness results (complete characterization)
SIAM Journal on Discrete Mathematics | 2022-03-15 | Paper |
Approximate Counting of <i>k</i> -Paths: Simpler, Deterministic, and in Polynomial Space
ACM Transactions on Algorithms | 2022-02-16 | Paper |
2-Approximating Feedback Vertex Set in Tournaments
ACM Transactions on Algorithms | 2022-02-16 | Paper |
Exact multi-covering problems with geometric sets
Theory of Computing Systems | 2022-02-14 | Paper |
Randomized Contractions Meet Lean Decompositions
ACM Transactions on Algorithms | 2022-02-08 | Paper |
| Parameterized Algorithms | 2022-02-04 | Paper |
| Popular matching in roommates setting is \textsf{NP}-hard | 2021-08-30 | Paper |
Balanced stable marriage: how close is close enough?
Theoretical Computer Science | 2021-08-27 | Paper |
On the optimality of pseudo-polynomial algorithms for integer programming
(available as arXiv preprint) | 2021-08-04 | Paper |
Polylogarithmic approximation algorithms for weighted-\(\mathcal{F}\)-deletion problems
(available as arXiv preprint) | 2021-08-04 | Paper |
| Conflict free feedback vertex set: a parameterized dichotomy | 2021-08-04 | Paper |
| Exploring the kernelization borders for hitting cycles | 2021-08-04 | Paper |
| Parameterized complexity of multi-node hubs | 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
(available as arXiv preprint) | 2021-07-28 | Paper |
| Brief announcement: Treewidth modulator: emergency exit for DFVS | 2021-07-28 | Paper |
Approximation in (poly-) logarithmic space
Algorithmica | 2021-06-30 | Paper |
Approximation in (poly-) logarithmic space
Algorithmica | 2021-06-30 | Paper |
| Quasipolynomial representation of transversal matroids with applications in parameterized complexity | 2021-06-15 | Paper |
Subexponential algorithms for rectilinear Steiner tree and arborescence problems
ACM Transactions on Algorithms | 2021-05-03 | Paper |
Covering small independent sets and separators with applications to parameterized algorithms
ACM Transactions on Algorithms | 2021-05-03 | Paper |
Parameterized complexity of \textsc{maximum edge colorable subgraph}
(available as arXiv preprint) | 2021-04-21 | Paper |
| Fixed parameter tractability of graph deletion problems over data streams | 2021-04-21 | Paper |
Packing arc-disjoint cycles in tournaments
Algorithmica | 2021-04-19 | Paper |
Parameterized complexity of fair feedback vertex set problem
Theoretical Computer Science | 2021-04-15 | Paper |
Simultaneous feedback edge set: a parameterized perspective
Algorithmica | 2021-03-26 | Paper |
Parameterized and exact algorithms for class domination coloring
Discrete Applied Mathematics | 2021-03-25 | Paper |
Paths to trees and cacti
Theoretical Computer Science | 2021-03-09 | Paper |
Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
2-Approximating Feedback Vertex Set in Tournaments
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
An exponential time parameterized algorithm for planar disjoint paths
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Hitting topological minors is FPT
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Bidimensionality and kernels
SIAM Journal on Computing | 2021-01-13 | Paper |
| Balanced judicious bipartition is fixed-parameter tractable | 2020-11-25 | Paper |
Fixed-parameter tractable algorithms for tracking shortest paths
Theoretical Computer Science | 2020-11-06 | Paper |
Going far from degeneracy
SIAM Journal on Discrete Mathematics | 2020-10-29 | Paper |
Approximation algorithms for geometric conflict free covering problems
Computational Geometry | 2020-10-23 | Paper |
On the approximate compressibility of connected vertex cover
Algorithmica | 2020-10-12 | Paper |
Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces
(available as arXiv preprint) | 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
Information Processing Letters | 2020-08-04 | Paper |
Path contraction faster than 2ⁿ
SIAM Journal on Discrete Mathematics | 2020-07-30 | Paper |
Subexponential algorithm for d-cluster edge deletion: exception or rule?
Journal of Computer and System Sciences | 2020-06-09 | Paper |
On the parameterized complexity of contraction to generalization of trees
(available as arXiv preprint) | 2020-05-27 | Paper |
Finding, hitting and packing cycles in subexponential time on unit disk graphs
(available as arXiv preprint) | 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
(available as arXiv preprint) | 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
Theoretical Computer Science | 2020-05-23 | Paper |
Parameterized complexity of conflict-free matchings and paths
Algorithmica | 2020-05-21 | Paper |
Linear representation of transversal matroids and gammoids parameterized by rank
Theoretical Computer Science | 2020-04-07 | Paper |
Quadratic vertex kernel for rainbow matching
Algorithmica | 2020-02-28 | Paper |
Fixed-parameter tractable algorithm and polynomial kernel for \textsc{Max-Cut Above Spanning Tree}
Theory of Computing Systems | 2020-02-27 | Paper |
| Solving group interval scheduling efficiently | 2020-02-25 | Paper |
Faster graph bipartization
Journal of Computer and System Sciences | 2020-02-24 | Paper |
Fully dynamic arboricity maintenance
Lecture Notes in Computer Science | 2020-02-24 | Paper |
| An Erdős-Pósa theorem on neighborhoods and domination number | 2020-02-24 | Paper |
The parameterized complexity of cycle packing: indifference is not an issue
LATIN 2018: Theoretical Informatics | 2020-02-12 | Paper |
A polynomial sized kernel for tracking paths problem
LATIN 2018: Theoretical Informatics | 2020-02-12 | Paper |
Subset feedback vertex set in chordal and split graphs
Lecture Notes in Computer Science | 2020-02-06 | Paper |
A polynomial sized kernel for tracking paths problem
Algorithmica | 2020-01-16 | Paper |
Parameterized complexity of geometric covering problems having conflicts
Algorithmica | 2020-01-16 | Paper |
Balanced stable marriage: how close is close enough?
Lecture Notes in Computer Science | 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
ACM Transactions on Computation Theory | 2019-12-16 | Paper |
Split contraction: the untold story
ACM Transactions on Computation Theory | 2019-12-16 | Paper |
Communication complexity and graph families
ACM Transactions on Computation Theory | 2019-12-16 | Paper |
Approximation Schemes for Low-rank Binary Matrix Approximation Problems
ACM Transactions on Algorithms | 2019-12-02 | Paper |
Spanning circuits in regular matroids
ACM Transactions on Algorithms | 2019-12-02 | Paper |
Exact algorithms via monotone local search
Journal of the ACM | 2019-11-21 | Paper |
Finding, hitting and packing cycles in subexponential time on unit disk graphs
Discrete & Computational Geometry | 2019-11-07 | Paper |
Balanced Judicious Bipartition is Fixed-Parameter Tractable
SIAM Journal on Discrete Mathematics | 2019-10-28 | Paper |
| On the parameterized complexity of edge-linked paths | 2019-10-22 | Paper |
| On the complexity of Mixed Dominating Set | 2019-10-22 | Paper |
The parameterized complexity landscape of finding 2-partitions of digraphs
Theoretical Computer Science | 2019-10-18 | Paper |
Contraction decomposition in unit disk graphs and algorithmic applications in parameterized complexity
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Interval vertex deletion admits a polynomial kernel
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Popular matching in roommates setting is NP-hard
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
| Parameterized computational geometry via decomposition theorems | 2019-10-15 | Paper |
Polynomial kernels for vertex cover parameterized by small degree modulators
Theory of Computing Systems | 2019-09-05 | Paper |
Parameterised algorithms for deletion to classes of DAGs
Theory of Computing Systems | 2019-09-05 | Paper |
Editing to Connected F-Degree Graph
SIAM Journal on Discrete Mathematics | 2019-08-29 | Paper |
Packing cycles faster than Erdős-Pósa
SIAM Journal on Discrete Mathematics | 2019-08-29 | Paper |
Rank vertex cover as a natural problem for algebraic compression
SIAM Journal on Discrete Mathematics | 2019-08-29 | Paper |
The parameterized complexity of cycle packing: indifference is not an issue
Algorithmica | 2019-08-20 | Paper |
Subset feedback vertex set in chordal and split graphs
Algorithmica | 2019-08-20 | Paper |
On the parameterized complexity of contraction to generalization of trees
Theory of Computing Systems | 2019-06-27 | Paper |
Efficient computation of representative sets with applications in parameterized and exact algorithms
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Linear time parameterized algorithms via skew-symmetric multicuts
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
A near-optimal planarization algorithm
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
| Some hard stable marriage problems: a survey on multivariate analysis | 2019-05-28 | Paper |
| Linear kernels for (connected) dominating set on \(H\)-minor-free graphs | 2019-05-10 | Paper |
| scientific article; zbMATH DE number 7053376 (Why is no real title available?) | 2019-05-10 | Paper |
Minimum bisection is fixed-parameter tractable
SIAM Journal on Computing | 2019-05-07 | Paper |
| Clique-width: on the price of generality | 2019-05-06 | Paper |
Parameterized algorithms and kernels for rainbow matching
Algorithmica | 2019-04-25 | Paper |
Feedback vertex set inspired kernel for chordal vertex deletion
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Clique-width. III: Hamiltonian cycle and the odd case of graph coloring
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Subquadratic kernels for implicit 3-{\textsc{Hitting Set}} and 3-{\textsc{Set Packing}} problems
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Parameterized algorithms for list \(K\)-cycle
Algorithmica | 2019-03-11 | Paper |
Parameterized single-exponential time polynomial space algorithm for Steiner tree
SIAM Journal on Discrete Mathematics | 2019-02-06 | Paper |
| Kernelization. Theory of parameterized preprocessing | 2019-01-14 | Paper |
Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs
Algorithmica | 2019-01-11 | Paper |
Excluded grid minors and efficient polynomial-time approximation schemes
Journal of the ACM | 2018-12-06 | Paper |
| \textsc{Max-Cut Above Spanning Tree} is fixed-parameter tractable | 2018-11-28 | Paper |
Covering Vectors by Spaces: Regular Matroids
SIAM Journal on Discrete Mathematics | 2018-11-19 | Paper |
Fully polynomial-time parameterized computations for graphs and matrices of low treewidth
ACM Transactions on Algorithms | 2018-11-13 | Paper |
Known algorithms on graphs of bounded treewidth are probably optimal
ACM Transactions on Algorithms | 2018-11-13 | Paper |
Exact algorithms for terrain guarding
ACM Transactions on Algorithms | 2018-11-13 | Paper |
Deterministic truncation of linear matroids
ACM Transactions on Algorithms | 2018-11-13 | Paper |
Linear time parameterized algorithms for \textsc{Subset Feedback Vertex Set}
ACM Transactions on Algorithms | 2018-11-12 | Paper |
Kernels for (connected) dominating set on graphs with excluded topological minors
ACM Transactions on Algorithms | 2018-11-12 | Paper |
Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts
ACM Transactions on Algorithms | 2018-11-12 | Paper |
On problems as hard as CNF-SAT
ACM Transactions on Algorithms | 2018-11-05 | Paper |
On problems as hard as CNF-SAT
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Representative families of product families
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Uniform kernelization complexity of hitting forbidden minors
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Kernelization lower bounds through colors and IDs
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Faster parameterized algorithms using linear programming
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Long directed \((s,t)\)-path: FPT algorithm
Information Processing Letters | 2018-10-19 | Paper |
\((k,n-k)\)-\textsc{Max-Cut}: an \(\mathcal{O}^*(2^p)\)-time algorithm and a polynomial kernel
Algorithmica | 2018-10-18 | Paper |
| Hitting and covering partially | 2018-10-04 | Paper |
Below all subsets for minimal connected dominating set
SIAM Journal on Discrete Mathematics | 2018-09-26 | Paper |
Finding even subgraphs even faster
Journal of Computer and System Sciences | 2018-09-07 | Paper |
Finding even subgraphs even faster
Journal of Computer and System Sciences | 2018-09-07 | Paper |
| Exact algorithms for terrain guarding | 2018-08-13 | Paper |
Efficient computation of representative families with applications in parameterized and exact algorithms
Journal of the ACM | 2018-08-02 | Paper |
(Meta) kernelization
Journal of the ACM | 2018-08-02 | Paper |
Rank reduction of oriented graphs by vertex and edge deletions
Algorithmica | 2018-07-26 | Paper |
Kernelization of cycle packing with relaxed disjointness constraints
SIAM Journal on Discrete Mathematics | 2018-07-18 | Paper |
Fully polynomial-time parameterized computations for graphs and matrices of low treewidth
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Feedback vertex set inspired kernel for chordal vertex deletion
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Spanning circuits in regular matroids
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs
SIAM Journal on Discrete Mathematics | 2018-06-05 | Paper |
Slightly superexponential parameterized problems
SIAM Journal on Computing | 2018-06-05 | Paper |
On the kernelization complexity of string problems
Theoretical Computer Science | 2018-05-17 | Paper |
Reconfiguration on sparse graphs
Journal of Computer and System Sciences | 2018-05-08 | Paper |
Matrix Rigidity from the Viewpoint of Parameterized Complexity
SIAM Journal on Discrete Mathematics | 2018-05-02 | Paper |
| scientific article; zbMATH DE number 6863617 (Why is no real title available?) | 2018-04-23 | Paper |
| Matrix Rigidity from the Viewpoint of Parameterized Complexity | 2018-04-19 | Paper |
| scientific article; zbMATH DE number 6862097 (Why is no real title available?) | 2018-04-19 | Paper |
Simultaneous feedback edge set: a parameterized perspective
(available as arXiv preprint) | 2018-04-19 | Paper |
| Kernels for deletion to classes of acyclic digraphs | 2018-04-19 | Paper |
Generalized pseudoforest deletion: algorithms and uniform kernel
SIAM Journal on Discrete Mathematics | 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
Theoretical Computer Science | 2018-04-04 | Paper |
Parameterized algorithms on perfect graphs for deletion to \((r,\ell)\)-graphs
(available as arXiv preprint) | 2018-03-21 | Paper |
| Parameterized algorithms for survivable network design with uniform demands | 2018-03-15 | Paper |
| Cliquewidth III: the odd case of graph coloring parameterized by cliquewidth | 2018-03-15 | Paper |
| Subquadratic kernels for implicit 3-hitting set and 3-set packing problems | 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 |
| 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
(available as arXiv preprint) | 2018-01-24 | Paper |
| Editing to connected f-degree graph | 2018-01-24 | Paper |
Bivariate complexity analysis of \textsc{Almost Forest Deletion}
Theoretical Computer Science | 2017-12-20 | Paper |
| Kernelization of cycle packing with relaxed disjointness constraints | 2017-12-19 | Paper |
Kernels for deletion to classes of acyclic digraphs
Journal of Computer and System Sciences | 2017-11-14 | Paper |
Multivariate complexity analysis of geometric \textsc{Red Blue Set Cover}
Algorithmica | 2017-11-09 | Paper |
Parameterized complexity of superstring problems
Algorithmica | 2017-11-09 | Paper |
Linear representation of transversal matroids and gammoids parameterized by rank
Lecture Notes in Computer Science | 2017-10-23 | Paper |
Lower bounds for approximation schemes for Closest String
(available as arXiv preprint) | 2017-10-17 | Paper |
Quick but odd growth of cacti
Algorithmica | 2017-10-10 | Paper |
Solving <i>d-</i>SAT via Backdoors to Small Treewidth
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Exact algorithms via monotone local search
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
| scientific article; zbMATH DE number 6783430 (Why is no real title available?) | 2017-09-29 | Paper |
| B-chromatic number: beyond NP-hardness | 2017-09-29 | Paper |
| scientific article; zbMATH DE number 6783431 (Why is no real title available?) | 2017-09-29 | Paper |
| scientific article; zbMATH DE number 6783432 (Why is no real title available?) | 2017-09-29 | Paper |
| Kernels for structural parameterizations of vertex cover -- case of small degree modulators | 2017-09-29 | Paper |
| scientific article; zbMATH DE number 6784975 (Why is no real title available?) | 2017-09-29 | Paper |
Fast exact algorithms for survivable network design with uniform requirements
Lecture Notes in Computer Science | 2017-09-22 | Paper |
Parameterized complexity of geometric covering problems having conflicts
Lecture Notes in Computer Science | 2017-09-22 | Paper |
On approximability of optimization problems related to red/blue-split graphs
Theoretical Computer Science | 2017-08-24 | Paper |
Lossy kernelization
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Lossy kernelization
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Hitting selected (odd) cycles
SIAM Journal on Discrete Mathematics | 2017-08-14 | Paper |
Paths to trees and cacti
Lecture Notes in Computer Science | 2017-07-21 | Paper |
| Finding even subgraphs even faster | 2017-07-13 | Paper |
Faster exact algorithms for some terminal set problems
Journal of Computer and System Sciences | 2017-06-30 | Paper |
Tree deletion set has a polynomial kernel (but no \(\mathrm {OPT}^{\mathcal O(1)}\) approximation)
(available as arXiv preprint) | 2017-04-25 | Paper |
| Connecting Vertices by Independent Trees | 2017-04-25 | Paper |
Parameterized and exact algorithms for class domination coloring
SOFSEM 2017: Theory and Practice of Computer Science | 2017-04-04 | Paper |
Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth
SIAM Journal on Computing | 2017-03-10 | Paper |
Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth
SIAM Journal on Computing | 2017-03-10 | Paper |
| Partially Polynomial Kernels for Set Cover and Test Cover | 2017-02-21 | Paper |
scientific article; zbMATH DE number 6678911 (Why is no real title available?)
(available as arXiv preprint) | 2017-01-30 | Paper |
| Backdoors to q-Horn | 2017-01-30 | Paper |
| Beyond Max-Cut: -extendible properties parameterized above the Poljak-Turzík bound | 2017-01-26 | Paper |
| Subexponential parameterized odd cycle transversal on planar graphs | 2017-01-26 | Paper |
Parameterized complexity of strip packing and minimum volume packing
Theoretical Computer Science | 2017-01-09 | Paper |
Irrelevant vertices for the planar disjoint paths problem
Journal of Combinatorial Theory. Series B | 2016-11-25 | Paper |
Reducing rank of the adjacency matrix by graph modification
Theoretical Computer Science | 2016-11-24 | Paper |
On the parameterized complexity of b-\textsc{chromatic number}
Journal of Computer and System Sciences | 2016-11-14 | Paper |
Parameterized algorithms for non-separating trees and branchings in digraphs
Algorithmica | 2016-11-01 | Paper |
Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments
Algorithmica | 2016-10-21 | Paper |
Partially polynomial kernels for set cover and test cover
SIAM Journal on Discrete Mathematics | 2016-07-22 | Paper |
Tree deletion set has a polynomial kernel but no \(\mathrm{OPT}^\mathcal{O}(1)\) approximation)
SIAM Journal on Discrete Mathematics | 2016-07-22 | Paper |
A parameterized algorithm for mixed-cut
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
\((k,n-k)\)-max-cut: an \({\mathcal O}^*(2^p)\)-time algorithm and a polynomial kernel
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Rank reduction of directed graphs by vertex and edge deletions
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Parameterized complexity of \textsc{Red Blue Set Cover} for lines
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Backdoors to q-Horn
Algorithmica | 2016-03-23 | Paper |
Hitting forbidden minors: approximation and kernelization
SIAM Journal on Discrete Mathematics | 2016-03-04 | Paper |
On the parameterized complexity of \textsc{Girth} and \textsc{Connectivity} problems on linear matroids
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Reconfiguration on sparse graphs
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Time-space tradeoffs for dynamic programming algorithms in trees and bounded treewidth graphs
Lecture Notes in Computer Science | 2015-10-29 | Paper |
Bivariate complexity analysis of \textsc{Almost Forest Deletion}
Lecture Notes in Computer Science | 2015-10-29 | Paper |
Unique covering problems with geometric sets
Lecture Notes in Computer Science | 2015-10-29 | Paper |
Reducing rank of the adjacency matrix by graph modification
Lecture Notes in Computer Science | 2015-10-29 | Paper |
Linear time parameterized algorithms for subset feedback vertex set
Automata, Languages, and Programming | 2015-10-27 | Paper |
Parameterized single-exponential time polynomial space algorithm for Steiner tree
Automata, Languages, and Programming | 2015-10-27 | Paper |
Uniform kernelization complexity of hitting forbidden minors
Lecture Notes in Computer Science | 2015-10-27 | Paper |
Deterministic truncation of linear matroids
Lecture Notes in Computer Science | 2015-10-27 | Paper |
Distortion is fixed parameter tractable
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
Generalized pseudoforest deletion: algorithms and uniform kernel
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Faster fixed parameter tractable algorithms for finding feedback vertex sets
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Parameterized complexity of superstring problems
Lecture Notes in Computer Science | 2015-08-20 | Paper |
| Parameterized algorithms | 2015-08-17 | Paper |
Minimum bisection is fixed parameter tractable
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Minimum bisection is fixed parameter tractable
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width
SIAM Journal on Computing | 2015-02-09 | Paper |
Hitting and harvesting pumpkins
SIAM Journal on Discrete Mathematics | 2014-12-22 | Paper |
On the parameterized complexity of vertex cover and edge cover with connectivity constraints
Theoretical Computer Science | 2014-12-22 | Paper |
On cutwidth parameterized by vertex cover
Algorithmica | 2014-12-02 | Paper |
The kernelization complexity of connected domination in graphs with (no) small cycles
Algorithmica | 2014-12-02 | Paper |
Parameterized approximations via d-skew-symmetric multicut
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Representative sets of product families
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Solving multicut faster than \(2^{n }\)
Algorithms - ESA 2014 | 2014-10-08 | Paper |
On the kernelization complexity of string problems
Lecture Notes in Computer Science | 2014-09-26 | Paper |
Kernel(s) for problems with no kernel
ACM Transactions on Algorithms | 2014-09-09 | Paper |
(Meta) Kernelization
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Parameterized algorithms to preserve connectivity
Automata, Languages, and Programming | 2014-07-01 | Paper |
Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound
Journal of Computer and System Sciences | 2014-06-10 | Paper |
Bidimensionality and kernels
(available as arXiv preprint) | 2014-05-22 | Paper |
| Algorithmic lower bounds for problems parameterized by clique-width | 2014-05-22 | Paper |
Imbalance is fixed parameter tractable
Information Processing Letters | 2014-04-14 | Paper |
A Polynomial Kernel for Proper Interval Vertex Deletion
SIAM Journal on Discrete Mathematics | 2014-04-10 | Paper |
On the hardness of losing width
Theory of Computing Systems | 2014-03-25 | Paper |
Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization
Theoretical Computer Science | 2014-03-13 | Paper |
Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization
Information and Computation | 2014-01-16 | Paper |
Parameterized complexity of MaxSat above average
Theoretical Computer Science | 2014-01-13 | Paper |
Beyond bidimensionality: parameterized subexponential algorithms on directed graphs
Information and Computation | 2014-01-10 | Paper |
On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges
Parameterized and Exact Computation | 2013-12-10 | Paper |
Hardness of r-dominating set on graphs of diameter (r + 1)
Parameterized and Exact Computation | 2013-12-10 | Paper |
Faster exact algorithms for some terminal set problems
Parameterized and Exact Computation | 2013-12-10 | Paper |
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments
Theory of Computing Systems | 2013-12-02 | Paper |
An FPT algorithm for Tree Deletion Set
Journal of Graph Algorithms and Applications | 2013-11-28 | Paper |
Quadratic upper bounds on the Erdős--Pósa property for a generalization of packing and covering cycles
Journal of Graph Theory | 2013-11-15 | Paper |
Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule?
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Fixed-parameter tractability of satisfying beyond the number of variables
Theory and Applications of Satisfiability Testing – SAT 2012 | 2013-08-12 | Paper |
The parameterized complexity of unique coverage and its variants
Algorithmica | 2013-08-05 | Paper |
Computing optimal Steiner trees in polynomial space
Algorithmica | 2013-08-05 | Paper |
An FPT algorithm for tree deletion set
WALCOM: Algorithms and Computation | 2013-04-12 | Paper |
Maximum r-regular induced subgraph problem: fast exponential algorithms and combinatorial bounds
SIAM Journal on Discrete Mathematics | 2013-04-09 | Paper |
Subexponential algorithms for partial cover problems
Information Processing Letters | 2013-04-04 | Paper |
A linear vertex kernel for maximum internal spanning tree
Journal of Computer and System Sciences | 2013-02-21 | Paper |
| Lower bounds based on the exponential time hypothesis | 2013-01-28 | Paper |
FPT algorithms for connected feedback vertex set
Journal of Combinatorial Optimization | 2012-12-21 | Paper |
On parameterized independent feedback vertex set
Theoretical Computer Science | 2012-11-27 | Paper |
Parameterized algorithms for even cycle transversal
Graph-Theoretic Concepts in Computer Science | 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
Discrete Optimization | 2012-10-16 | Paper |
Lower bounds on kernelization
Discrete Optimization | 2012-10-16 | Paper |
Parameterized study of the test cover problem
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
A polynomial kernel for \textsc{Proper Interval Vertex Deletion}
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Counting subgraphs via homomorphisms
SIAM Journal on Discrete Mathematics | 2012-09-12 | Paper |
Kernelization -- preprocessing with a guarantee
The Multivariate Algorithmic Revolution and Beyond | 2012-09-05 | Paper |
| Determining the winner of a Dodgson election is hard | 2012-08-29 | Paper |
| The effect of girth on the kernelization complexity of connected dominating set | 2012-08-29 | Paper |
| LP can be a cure for parameterized problems | 2012-08-23 | Paper |
Faster algorithms for finding and counting subgraphs
Journal of Computer and System Sciences | 2012-08-17 | Paper |
Local search: is brute-force avoidable?
Journal of Computer and System Sciences | 2012-08-17 | Paper |
On the approximability of some degree-constrained subgraph problems
Discrete Applied Mathematics | 2012-08-14 | Paper |
New lower bound on Max Cut of hypergraphs with an application to r-Set Splitting
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Parameterized complexity of MaxSat above average
Lecture Notes in Computer Science | 2012-06-29 | Paper |
On cutwidth parameterized by vertex cover
Parameterized and Exact Computation | 2012-06-15 | Paper |
On the hardness of losing width
Parameterized and Exact Computation | 2012-06-15 | Paper |
Parameterized complexity of finding small degree-constrained subgraphs
Journal of Discrete Algorithms | 2012-05-11 | Paper |
Sharp separation and applications to exact and parameterized algorithms
Algorithmica | 2012-04-26 | Paper |
| \(\text{Kernel}(s)\) for problems with no kernel: on out-trees with many leaves | 2012-04-24 | Paper |
Parameterized algorithm for eternal vertex cover
Information Processing Letters | 2012-03-19 | Paper |
| Hitting forbidden minors: approximation and kernelization | 2012-01-23 | Paper |
Hitting forbidden minors: approximation and kernelization
(available as arXiv preprint) | 2012-01-23 | Paper |
| Beyond bidimensionality: parameterized subexponential algorithms on directed graphs | 2012-01-23 | Paper |
Algorithmic aspects of dominator colorings in graphs
Lecture Notes in Computer Science | 2012-01-13 | Paper |
Implicit branching and parameterized partial cover problems
Journal of Computer and System Sciences | 2012-01-11 | Paper |
Kernels for feedback arc set in tournaments
Journal of Computer and System Sciences | 2012-01-11 | Paper |
A polynomial kernel for Feedback Arc Set on bipartite tournaments
Algorithms and Computation | 2011-12-16 | Paper |
Planar k-path in subexponential time and polynomial space
Graph-Theoretic Concepts in Computer Science | 2011-12-16 | Paper |
The complexity of König subgraph problems and above-guarantee vertex cover
Algorithmica | 2011-12-14 | Paper |
Bandwidth on AT-free graphs
Theoretical Computer Science | 2011-12-07 | Paper |
Paths, flowers and vertex cover
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Hitting and harvesting pumpkins
Lecture Notes in Computer Science | 2011-09-16 | Paper |
On parameterized independent feedback vertex set
Lecture Notes in Computer Science | 2011-08-17 | Paper |
An exact algorithm for minimum distortion embedding
Theoretical Computer Science | 2011-07-14 | Paper |
Tight bounds for linkages in planar graphs
Automata, Languages and Programming | 2011-07-06 | Paper |
Ranking and drawing in subexponential time
Lecture Notes in Computer Science | 2011-05-19 | Paper |
A linear kernel for a planar connected dominating set
Theoretical Computer Science | 2011-05-18 | Paper |
Strengthening Erdős -- Pósa property for minor-closed graph classes
Journal of Graph Theory | 2011-03-21 | Paper |
On the complexity of some colorful problems parameterized by treewidth
Information and Computation | 2011-02-21 | Paper |
Approximation algorithms for minimum chain vertex deletion
WALCOM: Algorithms and Computation | 2011-02-20 | Paper |
Parameterized algorithms for boxicity
Algorithms and Computation | 2010-12-09 | Paper |
Intractability of clique-width parameterizations
SIAM Journal on Computing | 2010-11-04 | Paper |
Imbalance is fixed parameter tractable
Lecture Notes in Computer Science | 2010-07-20 | Paper |
The curse of connectivity: \(t\)-total vertex (edge) cover
Lecture Notes in Computer Science | 2010-07-20 | Paper |
Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Sharp separation and applications to exact and parameterized algorithms
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Parameterized complexity of directed feedback set problems in tournaments.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Improved fixed parameter tractable algorithms for two ``edge'' problems: MAXCUT and MAXDAG
Information Processing Letters | 2010-03-24 | Paper |
Spanning directed trees with many leaves
SIAM Journal on Discrete Mathematics | 2010-03-17 | Paper |
Iterative compression and exact algorithms
Theoretical Computer Science | 2010-03-09 | Paper |
FPT algorithms for connected feedback vertex set
WALCOM: Algorithms and Computation | 2010-02-09 | Paper |
An exact algorithm for minimum distortion embedding
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
Even faster algorithm for set splitting!
Parameterized and Exact Computation | 2010-01-14 | Paper |
On the directed degree-preserving spanning tree problem
Parameterized and Exact Computation | 2010-01-14 | Paper |
A linear vertex kernel for Maximum Internal Spanning Tree
Algorithms and Computation | 2009-12-17 | Paper |
Bandwidth on AT-free graphs
Algorithms and Computation | 2009-12-17 | Paper |
Simpler parameterized algorithm for OCT
Lecture Notes in Computer Science | 2009-12-11 | Paper |
The complexity ecology of parameters: An illustration using bounded max leaf number
Theory of Computing Systems | 2009-10-19 | Paper |
The Budgeted Unique Coverage Problem and Color-Coding
Computer Science - Theory and Applications | 2009-08-18 | Paper |
Incompressibility through Colors and IDs
Automata, Languages and Programming | 2009-07-14 | Paper |
Fast FAST
Automata, Languages and Programming | 2009-07-14 | Paper |
Counting Subgraphs via Homomorphisms
Automata, Languages and Programming | 2009-07-14 | Paper |
Distortion Is Fixed Parameter Tractable
Automata, Languages and Programming | 2009-07-14 | Paper |
On two techniques of combining branching and treewidth
Algorithmica | 2009-06-22 | Paper |
Linear Kernel for Planar Connected Dominating Set
Lecture Notes in Computer Science | 2009-06-03 | Paper |
Improved Exact Algorithms for Counting 3- and 4-Colorings
Lecture Notes in Computer Science | 2009-03-06 | Paper |
On the Complexity of Some Colorful Problems Parameterized by Treewidth
Combinatorial Optimization and Applications | 2009-03-03 | Paper |
Degree-Constrained Subgraph Problems: Hardness and Approximation Results
Approximation and Online Algorithms | 2009-02-12 | Paper |
Iterative Compression and Exact Algorithms
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Graph Layout Problems Parameterized by Vertex Cover
Algorithms and Computation | 2009-01-29 | Paper |
König Deletion Sets and Vertex Covers above the Matching Size
Algorithms and Computation | 2009-01-29 | Paper |
Parameterized Algorithms for Generalized Domination
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
Algorithmica | 2008-12-02 | Paper |
Capacitated Domination and Covering: A Parameterized Perspective
Parameterized and Exact Computation | 2008-06-05 | Paper |
Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem
Parameterized and Exact Computation | 2008-06-05 | Paper |
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
Algorithms and Computation | 2008-05-27 | Paper |
A Moderately Exponential Time Algorithm for Full Degree Spanning Tree
Lecture Notes in Computer Science | 2008-05-27 | Paper |
Better Algorithms and Bounds for Directed Maximum Leaf Problems
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science | 2008-04-24 | Paper |
Branching and Treewidth Based Exact Algorithms
Algorithms and Computation | 2008-04-24 | Paper |
Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems
FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science | 2008-04-17 | Paper |
Efficient exact algorithms through enumerating maximal independent sets and other techniques
Theory of Computing Systems | 2007-12-19 | Paper |
Parameterized Algorithms for Directed Maximum Leaf Problems
Automata, Languages and Programming | 2007-11-28 | Paper |
Triangles, 4-Cycles and Parameterized (In-)Tractability
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
| scientific article; zbMATH DE number 5158513 (Why is no real title available?) | 2007-05-29 | Paper |
Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Parameterized algorithms for feedback set problems and their duals in tournaments
Theoretical Computer Science | 2006-04-06 | Paper |
Parameterized and Exact Computation
Lecture Notes in Computer Science | 2005-08-23 | Paper |
| scientific article; zbMATH DE number 1979503 (Why is no real title available?) | 2003-09-14 | Paper |
