| Publication | Date of Publication | Type |
|---|
| On vanishing sums of roots of unity in polynomial calculus and sum-of-squares | 2024-08-06 | Paper |
| On vanishing sums of roots of unity in polynomial calculus and sum-of-squares | 2024-01-24 | Paper |
| Circular (Yet Sound) Proofs in Propositional Logic | 2023-07-18 | Paper |
| On the maximal part in unrefinable partitions of triangular numbers | 2023-04-19 | Paper |
| Verification and generation of unrefinable partitions | 2023-02-03 | Paper |
| Clique Is Hard on Average for Regular Resolution | 2022-12-08 | Paper |
| Verification and generation of unrefinable partitions | 2021-12-30 | Paper |
| On the maximal part in unrefinable partitions of triangular numbers | 2021-11-22 | Paper |
| Upper bounds on positional Paris-Harrington games | 2021-01-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111132 | 2020-05-26 | Paper |
| Circular (yet sound) proofs | 2020-05-20 | Paper |
| A Rank Lower Bound for Cutting Planes Proofs of Ramsey’s Theorem | 2019-12-06 | Paper |
| Clique is hard on average for regular resolution | 2019-08-22 | Paper |
| Algorithm analysis through proof complexity | 2018-09-06 | Paper |
| A note about \(k\)-DNF resolution | 2018-06-15 | Paper |
| On semantic cutting planes with very small coefficients | 2018-05-25 | Paper |
| Cliques enumeration and tree-like resolution proofs | 2018-04-05 | Paper |
| The complexity of proving that a graph is Ramsey | 2018-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4601842 | 2018-01-24 | Paper |
| Semantic Versus Syntactic Cutting Planes | 2018-01-24 | Paper |
| Tight size-degree bounds for sums-of-squares proofs | 2017-12-18 | Paper |
| A lower bound for the pigeonhole principle in tree-like resolution by asymmetric prover-delayer games | 2017-11-03 | Paper |
| On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies | 2017-07-13 | Paper |
| From Small Space to Small Width in Resolution | 2017-07-12 | Paper |
| Narrow Proofs May Be Maximally Long | 2017-07-12 | Paper |
| From small space to small width in resolution | 2017-03-03 | Paper |
| Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers | 2016-09-05 | Paper |
| Parameterized Bounded-Depth Frege Is not Optimal | 2015-09-24 | Paper |
| Optimality of size-degree tradeoffs for polynomial calculus | 2015-09-17 | Paper |
| Parameterized Complexity of DPLL Search Procedures | 2015-09-17 | Paper |
| Space Complexity in Polynomial Calculus | 2015-09-02 | Paper |
| A characterization of tree-like resolution size | 2014-04-11 | Paper |
| The complexity of proving that a graph is Ramsey | 2013-08-06 | Paper |
| Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds | 2013-08-06 | Paper |
| A Rank Lower Bound for Cutting Planes Proofs of Ramsey’s Theorem | 2013-08-05 | Paper |
| Parameterized Bounded-Depth Frege Is Not Optimal | 2011-07-06 | Paper |
| Parameterized Complexity of DPLL Search Procedures | 2011-06-17 | Paper |
| On the automatizability of polynomial calculus | 2010-10-06 | Paper |
| Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks | 2009-03-12 | Paper |
| Minimum-energy broadcast and disk cover in grid wireless networks | 2008-06-24 | Paper |
| On the bounded-hop MST problem on random Euclidean instances | 2007-10-02 | Paper |
| Structural Information and Communication Complexity | 2005-11-30 | Paper |
