| Publication | Date of Publication | Type |
|---|
Pliability and Approximating Max-CSPs
(available as arXiv preprint) | N/A | Paper |
| The complexity of promise SAT on non-Boolean domains | 2026-03-18 | Paper |
Pliability and approximating Max-CSPs
Journal of the ACM | 2025-02-05 | Paper |
| Treewidth-pliability and PTAS for Max-CSPs | 2024-01-15 | Paper |
| scientific article; zbMATH DE number 7764127 (Why is no real title available?) | 2023-11-13 | Paper |
PTAS for Sparse General-valued CSPs
ACM Transactions on Algorithms | 2023-10-23 | Paper |
Topology and Adjunction in Promise Constraint Satisfaction
SIAM Journal on Computing | 2023-04-04 | Paper |
Tight complexity lower bounds for integer linear programming with few constraints
ACM Transactions on Computation Theory | 2022-12-05 | Paper |
Tight complexity lower bounds for integer linear programming with few constraints
(available as arXiv preprint) | 2022-07-18 | Paper |
The complexity of promise SAT on non-Boolean domains
ACM Transactions on Computation Theory | 2022-03-29 | Paper |
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes
SIAM Journal on Discrete Mathematics | 2021-02-15 | Paper |
Improved hardness for \(H\)-colourings of \(G\)-colourable graphs
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
| Smaller counterexamples to Hedetniemi's conjecture | 2020-12-25 | Paper |
The power of the combined basic linear programming and affine relaxation for promise constraint satisfaction problems
SIAM Journal on Computing | 2020-12-04 | Paper |
| Linear kernels for edge deletion problems to immersion-closed graph classes | 2020-05-27 | Paper |
Tight lower bounds for the complexity of multicoloring
(available as arXiv preprint) | 2020-05-27 | Paper |
| Turing kernelization for finding long paths in graphs excluding a topological minor | 2020-05-27 | Paper |
Topology and adjunction in promise constraint satisfaction
(available as arXiv preprint) | 2020-03-25 | Paper |
Integer programming and incidence treedepth
(available as arXiv preprint) | 2020-02-06 | Paper |
| Integer programming and incidence treedepth | 2020-02-06 | Paper |
Homomorphism reconfiguration via homotopy
SIAM Journal on Discrete Mathematics | 2020-01-31 | Paper |
Tight lower bounds for the complexity of multicoloring
ACM Transactions on Computation Theory | 2019-12-16 | Paper |
On space efficiency of algorithms working on structural decompositions of graphs
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
On inverse powers of graphs and topological implications of Hedetniemi's conjecture
Journal of Combinatorial Theory. Series B | 2019-11-21 | Paper |
Hedetniemi's conjecture and strongly multiplicative graphs
SIAM Journal on Discrete Mathematics | 2019-11-20 | Paper |
Turing kernelization for finding long paths in graph classes excluding a topological minor
Algorithmica | 2019-09-10 | Paper |
Edge bipartization faster than \(2^k\)
Algorithmica | 2019-03-11 | Paper |
Cutwidth: obstructions and algorithmic aspects
Algorithmica | 2019-02-14 | Paper |
The step Sidorenko property and non-norming edge-transitive graphs
Journal of Combinatorial Theory. Series A | 2018-12-19 | Paper |
The step Sidorenko property and non-norming edge-transitive graphs
Journal of Combinatorial Theory. Series A | 2018-12-19 | Paper |
On directed feedback vertex set parameterized by treewidth
(available as arXiv preprint) | 2018-11-22 | Paper |
Fully polynomial-time parameterized computations for graphs and matrices of low treewidth
ACM Transactions on Algorithms | 2018-11-13 | 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 |
Cutwidth: obstructions and algorithmic aspects
(available as arXiv preprint) | 2018-04-10 | Paper |
Edge Bipartization Faster Than 2ᵏ
(available as arXiv preprint) | 2018-04-10 | Paper |
On space efficiency of algorithms working on structural decompositions of graphs
(available as arXiv preprint) | 2018-01-24 | Paper |
Reconfiguration in bounded bandwidth and tree-depth
Journal of Computer and System Sciences | 2017-12-21 | Paper |
Polynomial kernelization for removing induced claws and diamonds
Theory of Computing Systems | 2017-08-15 | Paper |
Homomorphism reconfiguration via homotopy
(available as arXiv preprint) | 2017-01-24 | Paper |
Square-free graphs are multiplicative
Journal of Combinatorial Theory. Series B | 2016-11-25 | Paper |
Polynomial kernelization for removing induced claws and diamonds
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
Reconfiguration over tree decompositions
Parameterized and Exact Computation | 2015-09-15 | Paper |
Reconfiguring independent sets in claw-free graphs
Algorithm Theory – SWAT 2014 | 2014-09-02 | Paper |
