| Publication | Date of Publication | Type |
|---|
| On the parameterized complexity of diverse SAT | 2026-06-08 | Paper |
| m-eternal domination and variants on some classes of finite and infinite graphs | 2026-02-26 | Paper |
On the parameterized complexity of diverse SAT
Theoretical Computer Science | 2025-12-17 | Paper |
| On the complexity of the eigenvalue deletion problem | 2025-07-24 | Paper |
| A little aggression goes a long way | 2025-06-17 | Paper |
| \textsc{Planar} \(\mathcal{F}\)-\textsc{deletion}: approximation, kernelization and optimal FPT algorithms | 2025-05-05 | Paper |
| Envy-free and efficient allocations for graphical valuations | 2025-03-25 | Paper |
| Spartan bipartite graphs are essentially elementary | 2024-12-03 | Paper |
Parameterized aspects of distinct Kemeny rank aggregation
Acta Informatica | 2024-11-07 | Paper |
Romeo and Juliet meeting in forest like regions
Algorithmica | 2024-10-24 | Paper |
Chess is hard even for a single player
Theoretical Computer Science | 2024-10-07 | Paper |
| Romeo and Juliet meeting in forest like regions | 2024-09-12 | Paper |
| Parameterized aspects of distinct Kemeny rank aggregation | 2024-05-31 | Paper |
| The price of equity with binary valuations and few agent types | 2024-05-29 | Paper |
| Chess is hard even for a single player | 2024-05-16 | Paper |
Finding perfect matching cuts faster
Lecture Notes in Computer Science | 2023-12-22 | Paper |
| Spartan Bipartite Graphs are Essentially Elementary | 2023-08-08 | Paper |
On fair division with binary valuations respecting social networks
Algorithms and Discrete Applied Mathematics | 2023-05-08 | Paper |
On the exact amount of missing information that makes finding possible winners hard
Journal of Computer and System Sciences | 2023-04-21 | Paper |
| Eternal vertex cover on bipartite graphs | 2022-11-11 | Paper |
A Parameterized Perspective on Attacking and Defending Elections
Lecture Notes in Computer Science | 2022-10-13 | Paper |
| Fair division is hard even for amicable agents | 2022-03-24 | Paper |
Exact multi-covering problems with geometric sets
Theory of Computing Systems | 2022-02-14 | Paper |
Imbalance parameterized by twin cover revisited
Theoretical Computer Science | 2021-11-18 | Paper |
A parameterized perspective on protecting elections
Theoretical Computer Science | 2021-06-22 | Paper |
Imbalance parameterized by twin cover revisited
Lecture Notes in Computer Science | 2021-04-21 | Paper |
| On the complexity of optimal matching reconfiguration | 2020-10-22 | Paper |
| Robustness radius for Chamberlin-Courant on restricted domains | 2020-10-22 | Paper |
Parameterized complexity of happy coloring problems
Theoretical Computer Science | 2020-08-17 | Paper |
| On the complexity of Two Dots for narrow boards and few colors | 2020-08-11 | Paper |
| On the parameterized complexity of spanning trees with small vertex covers | 2020-07-21 | Paper |
Subexponential algorithm for d-cluster edge deletion: exception or rule?
Journal of Computer and System Sciences | 2020-06-09 | Paper |
On the Exact Amount of Missing Information that Makes Finding Possible Winners Hard
(available as arXiv preprint) | 2020-05-26 | Paper |
Color spanning objects: algorithms and hardness results
Discrete Applied Mathematics | 2020-05-18 | Paper |
Deleting to structured trees
(available as arXiv preprint) | 2020-02-24 | Paper |
| On the parameterized complexity of party nominations | 2020-01-27 | Paper |
| The parameterized complexity of dominating set and friends revisited for structured graphs | 2019-10-22 | Paper |
| On the parameterized complexity of edge-linked paths | 2019-10-22 | Paper |
Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers
Theoretical Computer Science | 2019-08-13 | Paper |
On structural parameterizations of firefighting
Theoretical Computer Science | 2019-06-06 | Paper |
Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs
Algorithmica | 2019-01-11 | Paper |
| On the complexity of Chamberlin-Courant on almost structured profiles | 2018-10-25 | Paper |
| On the parameterized complexity of colorful components and related problems | 2018-09-06 | Paper |
The parameterized complexity of happy colorings
(available as arXiv preprint) | 2018-06-15 | Paper |
On structural parameterizations of firefighting
Lecture Notes in Computer Science | 2018-06-05 | Paper |
Complexity of manipulation with partial information in voting
Theoretical Computer Science | 2018-04-16 | 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 |
| Two Dots is NP-complete | 2017-07-17 | Paper |
Frugal bribery in voting
Theoretical Computer Science | 2017-05-11 | Paper |
On structural parameterizations of graph motif and chromatic number
Algorithms and Discrete Applied Mathematics | 2017-04-07 | Paper |
| scientific article; zbMATH DE number 6687769 (Why is no real title available?) | 2017-02-21 | Paper |
Backdoors into heterogeneous classes of SAT and CSP
Journal of Computer and System Sciences | 2016-12-28 | Paper |
Color spanning objects: algorithms and hardness results
Algorithms and Discrete Applied Mathematics | 2016-03-23 | Paper |
Hitting forbidden minors: approximation and kernelization
SIAM Journal on Discrete Mathematics | 2016-03-04 | Paper |
Kernelization complexity of possible winner and coalitional manipulation problems in voting
Theoretical Computer Science | 2016-01-21 | Paper |
Unique covering problems with geometric sets
Lecture Notes in Computer Science | 2015-10-29 | Paper |
Deterministic algorithms for matching and packing problems based on representative sets
SIAM Journal on Discrete Mathematics | 2015-10-21 | Paper |
Parameterized algorithms and kernels for 3-hitting set with parity constraints
Lecture Notes in Computer Science | 2015-09-21 | Paper |
On the parameterized complexity of finding separators with non-hereditary properties
Algorithmica | 2015-09-02 | Paper |
The kernelization complexity of connected domination in graphs with (no) small cycles
Algorithmica | 2014-12-02 | Paper |
Vertex Cover Gets Faster and Harder on Low Degree Graphs
Lecture Notes in Computer Science | 2014-09-26 | Paper |
An Erdős-Ko-Rado theorem for matchings in the complete graph
(available as arXiv preprint) | 2014-06-11 | Paper |
Imbalance is fixed parameter tractable
Information Processing Letters | 2014-04-14 | Paper |
Solving min ones 2-SAT as fast as vertex cover
Theoretical Computer Science | 2014-01-16 | 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 |
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | 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 |
On the parameterized complexity of the maximum edge 2-coloring problem
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule?
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
The parameterized complexity of unique coverage and its variants
Algorithmica | 2013-08-05 | Paper |
Upper and lower bounds for weak backdoor set detection
Theory and Applications of Satisfiability Testing – SAT 2013 | 2013-08-05 | Paper |
Hitting and Piercing Rectangles Induced by a Point Set
Lecture Notes in Computer Science | 2013-06-11 | 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 |
On the parameterized complexity of finding separators with non-hereditary properties
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
Lower bounds on kernelization
Discrete Optimization | 2012-10-16 | Paper |
Kernelization -- preprocessing with a guarantee
The Multivariate Algorithmic Revolution and Beyond | 2012-09-05 | Paper |
| The effect of girth on the kernelization complexity of connected dominating set | 2012-08-29 | 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 |
Algorithmic aspects of dominator colorings in graphs
Lecture Notes in Computer Science | 2012-01-13 | Paper |
On parameterized independent feedback vertex set
Lecture Notes in Computer Science | 2011-08-17 | Paper |
On the Kernelization Complexity of Colorful Motifs
Parameterized and Exact Computation | 2010-12-07 | Paper |
Solving \textsc{minones-2-sat} as fast as \textsc{vertex cover}
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
Imbalance is fixed parameter tractable
Lecture Notes in Computer Science | 2010-07-20 | Paper |
FPT algorithms for connected feedback vertex set
WALCOM: Algorithms and Computation | 2010-02-09 | 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 |
Graph Layout Problems Parameterized by Vertex Cover
Algorithms and Computation | 2009-01-29 | Paper |
