| Publication | Date of Publication | Type |
|---|
| Tree containment above minimum degree is FPT | 2024-11-28 | Paper |
| Approximating long cycle above Dirac's guarantee | 2024-11-14 | Paper |
Longest cycle above Erdős-Gallai bound
SIAM Journal on Discrete Mathematics | 2024-11-05 | Paper |
Approximating long cycle above Dirac's guarantee
Algorithmica | 2024-08-13 | Paper |
| Long cycles in graphs: extremal combinatorics meets parameterized algorithms (invited talk) | 2024-08-06 | Paper |
| Algorithmic extensions of Dirac's theorem | 2024-07-19 | Paper |
Diverse pairs of matchings
Algorithmica | 2024-05-30 | Paper |
| Turán’s Theorem Through Algorithmic Lens | 2024-05-03 | Paper |
| Detours in directed graphs | 2024-04-23 | Paper |
Fair division with minimal withheld information in social networks
Theoretical Computer Science | 2024-03-01 | Paper |
Diverse Pairs of Matchings
(available as arXiv preprint) | 2023-11-14 | Paper |
Enumeration of minimal tropical connected sets
Lecture Notes in Computer Science | 2023-10-04 | Paper |
Two generalizations of proper coloring: hardness and approximability
Lecture Notes in Computer Science | 2023-08-10 | Paper |
Fair division with minimal withheld information in social networks
Lecture Notes in Computer Science | 2023-08-10 | Paper |
Detours in directed graphs
Journal of Computer and System Sciences | 2023-07-10 | Paper |
Solving target set selection with bounded thresholds faster than \(2^n\)
Algorithmica | 2023-02-16 | Paper |
Building large \(k\)-cores from sparse graphs
Journal of Computer and System Sciences | 2023-01-09 | Paper |
Maximizing happiness in graphs of bounded clique-width
(available as arXiv preprint) | 2022-10-13 | Paper |
Building large \(k\)-cores from sparse graphs
(available as arXiv preprint) | 2022-07-18 | Paper |
| Longest Cycle above Erd\H{o}s-Gallai Bound | 2022-02-07 | Paper |
Correction to: ``Near-optimal lower bounds on regular resolution refutations of Tseitin formulas for all constant-degree graphs
Computational Complexity | 2022-01-03 | Paper |
Near-optimal lower bounds on regular resolution refutations of Tseitin formulas for all constant-degree graphs
Computational Complexity | 2021-09-10 | Paper |
Solving target set selection with bounded thresholds faster than \(2^n\)
(available as arXiv preprint) | 2021-08-04 | Paper |
Lower bounds for the happy coloring problems
Theoretical Computer Science | 2020-09-01 | Paper |
On happy colorings, cuts, and structural parameterizations
(available as arXiv preprint) | 2020-02-24 | Paper |
Lower bounds for the happy coloring problems
Lecture Notes in Computer Science | 2020-02-24 | Paper |
