| Publication | Date of Publication | Type |
|---|
Parameterized complexity of generalizations of edge dominating set
Theory of Computing Systems | 2026-08-21 | Paper |
| Streaming algorithms for conflict-free coloring | 2026-08-11 | Paper |
| Quasipolynomial-time deterministic kernelization and (gammoid) representation | 2026-08-05 | Paper |
| Parameterized saga of first-fit and last-fit coloring | 2026-06-24 | Paper |
| When far is better: the Chamberlin-Courant approach to obnoxious committee selection | 2026-06-12 | Paper |
| Parameterized algorithms and hardness for the maximum edge q-coloring problem | 2026-06-12 | Paper |
On the polynomial kernelizations of finding a shortest path with positive disjunctive constraints
Information and Computation | 2026-06-11 | Paper |
| Covering and partitioning of split, chain and cographs with isometric paths | 2026-05-12 | Paper |
Covering and partitioning of split, chain and cographs with isometric paths
Theoretical Computer Science | 2026-05-11 | 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 |
| Parameterized complexity of feedback vertex sets on hypergraphs | 2026-03-23 | Paper |
| A (2+)-factor approximation algorithm for split vertex deletion | 2026-03-18 | Paper |
| A 1.9999-approximation algorithm for vertex cover on string graphs | 2025-11-24 | Paper |
| Parameterized complexity of shortest path with positive disjunctive constraints | 2025-11-14 | Paper |
| Decremental sensitivity oracles for covering and packing minors | 2025-11-10 | Paper |
Max-SAT with cardinality constraint parameterized by the number of clauses
Theoretical Computer Science | 2025-11-10 | Paper |
| Bipartizing (pseudo-)disk graphs: approximation with a ratio better than 3 | 2025-10-06 | Paper |
| Fast FPT algorithms for Grundy number on dense graphs | 2025-06-20 | Paper |
Contraction decomposition in unit disk graphs and algorithmic applications in parameterized complexity
ACM Transactions on Algorithms | 2025-02-21 | Paper |
Parameterized algorithms for minimum sum vertex cover
Theoretical Computer Science | 2025-02-03 | Paper |
On MAX-SAT with cardinality constraint
Theoretical Computer Science | 2024-12-12 | Paper |
| Meta-theorems for parameterized streaming algorithms | 2024-11-28 | 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 |
| On MAX-SAT with cardinality constraint | 2024-07-19 | Paper |
| Backdoor sets on nowhere dense SAT | 2024-06-24 | Paper |
| Parameterized algorithms for minimum sum 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 |
Improved FPT Algorithms for Deletion to Forest-Like Structures
Algorithmica | 2024-04-24 | Paper |
Diverse collections in matroids and graphs
Mathematical Programming. Series A. Series B | 2024-02-21 | Paper |
Socially fair matching: exact and approximation algorithms
Lecture Notes in Computer Science | 2024-01-16 | Paper |
An ETH-tight algorithm for bidirected Steiner connectivity
Lecture Notes in Computer Science | 2024-01-16 | Paper |
scientific article; zbMATH DE number 7788495 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Improved FPT Algorithms for Deletion to Forest-Like Structures.
(available as arXiv preprint) | 2023-11-14 | Paper |
| Structural parameterizations with modulator oblivion | 2023-11-13 | Paper |
| scientific article; zbMATH DE number 7764115 (Why is no real title available?) | 2023-11-13 | Paper |
| ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs | 2023-11-02 | Paper |
Low-Rank Binary Matrix Approximation in Column-Sum Norm.
(available as arXiv preprint) | 2023-10-31 | Paper |
List homomorphism: beyond the known boundaries
LATIN 2022: Theoretical Informatics | 2023-07-26 | Paper |
On the optimality of pseudo-polynomial algorithms for integer programming
Mathematical Programming. Series A. Series B | 2023-03-01 | Paper |
| Parameterization Above a Multiplicative Guarantee | 2023-02-03 | Paper |
| Parameterized complexity of list coloring and max coloring | 2022-11-11 | Paper |
| Parameterized complexity of set-restricted disjoint paths on chordal graphs | 2022-11-11 | Paper |
Partial vertex cover on graphs of bounded degeneracy
(available as arXiv preprint) | 2022-11-11 | Paper |
Target set selection parameterized by vertex cover and more
Theory of Computing Systems | 2022-10-04 | 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 |
Structural parameterizations with modulator oblivion
Algorithmica | 2022-08-03 | Paper |
| On the Parameterized Complexity of [1,j]-Domination Problems | 2022-07-21 | Paper |
Decomposition of Map Graphs with Applications.
(available as arXiv preprint) | 2022-07-21 | Paper |
| Quick separation in chordal and split graphs | 2022-07-18 | Paper |
Complexity of the Steiner Network Problem with Respect to the Number of Terminals
(available as arXiv preprint) | 2022-07-18 | Paper |
Gerrymandering on graphs: computational complexity and parameterized algorithms
(available as arXiv preprint) | 2022-06-01 | Paper |
ETH-tight algorithms for long path and cycle on unit disk graphs
(available as arXiv preprint) | 2022-05-18 | Paper |
| Going far from degeneracy | 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 complexity of reconfiguration of connected dominating sets
Algorithmica | 2022-03-25 | Paper |
2-Approximating Feedback Vertex Set in Tournaments
ACM Transactions on Algorithms | 2022-02-16 | Paper |
On the optimality of pseudo-polynomial algorithms for integer programming
(available as arXiv preprint) | 2021-08-04 | Paper |
| Parameterized low-rank binary matrix approximation | 2021-07-28 | Paper |
| Quasipolynomial representation of transversal matroids with applications in parameterized complexity | 2021-06-15 | Paper |
Subexponential algorithms for rectilinear Steiner tree and arborescence problems
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 |
Simultaneous feedback edge set: a parameterized perspective
Algorithmica | 2021-03-26 | Paper |
2-Approximating Feedback Vertex Set in Tournaments
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Hitting topological minors is FPT
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Parameterized low-rank binary matrix approximation
Data Mining and Knowledge Discovery | 2021-01-15 | Paper |
Parameterized low-rank binary matrix approximation
Data Mining and Knowledge Discovery | 2021-01-15 | Paper |
Going far from degeneracy
SIAM Journal on Discrete Mathematics | 2020-10-29 | Paper |
Lossy kernels for connected dominating set on sparse graphs
(available as arXiv preprint) | 2020-08-05 | Paper |
Subexponential algorithm for d-cluster edge deletion: exception or rule?
Journal of Computer and System Sciences | 2020-06-09 | Paper |
Finding, hitting and packing cycles in subexponential time on unit disk graphs
(available as arXiv preprint) | 2020-05-27 | Paper |
| Communication complexity of pairs of graph families with applications | 2020-05-26 | Paper |
Linear representation of transversal matroids and gammoids parameterized by rank
Theoretical Computer Science | 2020-04-07 | Paper |
Parameterized complexity of geometric covering problems having conflicts
Algorithmica | 2020-01-16 | Paper |
On the parameterized complexity of \([1,j]\)-domination problems
Theoretical Computer Science | 2019-12-27 | 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 |
Finding, hitting and packing cycles in subexponential time on unit disk graphs
Discrete & Computational Geometry | 2019-11-07 | Paper |
| On the complexity of Mixed Dominating Set | 2019-10-22 | Paper |
| On the parameterized complexity of edge-linked paths | 2019-10-22 | Paper |
| Parameterized computational geometry via decomposition theorems | 2019-10-15 | 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 |
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets
(available as arXiv preprint) | 2019-10-01 | Paper |
Lossy kernels for connected dominating set on sparse graphs
SIAM Journal on Discrete Mathematics | 2019-09-30 | Paper |
Editing to Connected F-Degree Graph
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 |
Harmonious coloring: parameterized algorithms and upper bounds
Theoretical Computer Science | 2019-05-17 | 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 |
Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs
Algorithmica | 2019-01-11 | Paper |
Deterministic truncation of linear matroids
ACM Transactions on Algorithms | 2018-11-13 | Paper |
Representative families of product families
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Long directed \((s,t)\)-path: FPT algorithm
Information Processing Letters | 2018-10-19 | 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 |
Efficient computation of representative families with applications in parameterized and exact algorithms
Journal of the ACM | 2018-08-02 | Paper |
Fréchet distance between a line and avatar point set
Algorithmica | 2018-07-26 | Paper |
On the kernelization complexity of string problems
Theoretical Computer Science | 2018-05-17 | Paper |
