| Publication | Date of Publication | Type |
|---|
| MaxCut above guarantee | 2024-12-03 | Paper |
| Tight double exponential lower bounds | 2024-11-12 | Paper |
| Hardness of approximation for \(H\)-free edge modification problems: towards a dichotomy | 2024-09-11 | Paper |
Fair division with minimal withheld information in social networks
Theoretical Computer Science | 2024-03-01 | 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 |
Solving target set selection with bounded thresholds faster than \(2^n\)
Algorithmica | 2023-02-16 | Paper |
Maximizing happiness in graphs of bounded clique-width
(available as arXiv preprint) | 2022-10-13 | Paper |
Solving target set selection with bounded thresholds faster than \(2^n\)
(available as arXiv preprint) | 2021-08-04 | Paper |
Lower bounds for the parameterized complexity of minimum fill-in and other completion problems
ACM Transactions on Algorithms | 2021-05-03 | Paper |
Lower bounds for the happy coloring problems
Theoretical Computer Science | 2020-09-01 | Paper |
Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters
(available as arXiv preprint) | 2020-05-26 | 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 |
Algorithms for \((n,3)\)-MAXSAT and parameterization above the all-true assignment
Theoretical Computer Science | 2019-12-27 | Paper |
Hardness of approximation for \(H\)-free edge modification problems
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
| Upper and lower bounds for different parameterizations of \((n,3)\)-MAXSAT | 2019-10-11 | Paper |
Subexponential parameterized algorithm for {\textsc{Interval Completion}}
ACM Transactions on Algorithms | 2018-11-13 | Paper |
Subexponential parameterized algorithm for interval completion
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Lower bounds for the parameterized complexity of minimum fill-in and other completion problems
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Hardness of approximation for \(H\)-free edge modification problems
(available as arXiv preprint) | 2018-04-19 | Paper |
Parameterized complexity of superstring problems
Algorithmica | 2017-11-09 | Paper |
Largest chordal and interval subgraphs faster than \(2^n\)
Algorithmica | 2016-10-21 | Paper |
A Subexponential Parameterized Algorithm for Proper Interval Completion
SIAM Journal on Discrete Mathematics | 2015-10-30 | Paper |
Parameterized complexity of superstring problems
Lecture Notes in Computer Science | 2015-08-20 | Paper |
Kernelization lower bound for permutation pattern matching
Information Processing Letters | 2015-04-02 | Paper |
A subexponential parameterized algorithm for proper interval completion
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Largest Chordal and Interval Subgraphs Faster Than 2 n
Lecture Notes in Computer Science | 2013-09-17 | Paper |
A new upper bound for \(( n , 3)\)-MAX-SAT
Journal of Mathematical Sciences (New York) | 2013-04-09 | Paper |
A new algorithm for parameterized MAX-SAT
Parameterized and Exact Computation | 2013-01-07 | Paper |
A \(p\)-adic algorithm for the factorization of polynomials with integer coefficients
Vestnik Belorusskogo Gosudarstvennogo Universiteta. Seria 1. Fizika, Matematika, Informatika | 2012-09-25 | Paper |
