| Publication | Date of Publication | Type |
|---|
| Computations with polynomial evaluation oracle: ruling out superlinear SETH-based lower bounds | 2024-11-28 | Paper |
| CNF encodings of symmetric functions | 2024-11-12 | Paper |
| CNF encodings of parity | 2024-08-06 | Paper |
| SAT-based circuit local improvement | 2024-08-06 | Paper |
| If Edge Coloring is hard under SETH, then SETH is false | 2024-05-29 | Paper |
| Polynomial formulations as a barrier for reduction-based hardness proofs | 2024-05-14 | Paper |
| Improving \(3N\) circuit complexity lower bounds | 2024-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6075924 | 2023-09-20 | Paper |
| Collapsing Superstring Conjecture | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875578 | 2023-02-03 | Paper |
| Computing majority by constant depth majority circuits with low fan-in gates | 2019-08-27 | Paper |
| Lower bounds for unrestricted Boolean circuits: open problems | 2018-11-28 | Paper |
| Families with Infants | 2018-11-05 | Paper |
| Tight Bounds for Graph Homomorphism and Subgraph Isomorphism | 2018-07-16 | Paper |
| On the limits of gate elimination | 2018-06-06 | Paper |
| Tight Lower Bounds on Graph Embedding Problems | 2018-05-17 | Paper |
| Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates | 2018-04-19 | Paper |
| Circuit Size Lower Bounds and #SAT Upper Bounds Through a General Framework | 2018-03-21 | Paper |
| On the Limits of Gate Elimination | 2018-03-21 | Paper |
| Gate elimination: circuit size lower bounds and \#SAT upper bounds | 2018-03-12 | Paper |
| Parameterized complexity of superstring problems | 2017-11-09 | Paper |
| Parameterized complexity of secluded connectivity problems | 2017-10-12 | Paper |
| Parameterized Complexity of Secluded Connectivity Problems | 2017-07-13 | Paper |
| Weighted Gate Elimination | 2016-04-15 | Paper |
| Lower Bounds for the Graph Homomorphism Problem | 2015-10-27 | Paper |
| Parameterized complexity of superstring problems | 2015-08-20 | Paper |
| Greedy Conjecture for Strings of Length 4 | 2015-08-20 | Paper |
| New lower bounds on circuit size of multi-output functions | 2015-07-20 | Paper |
| Families with Infants: A General Approach to Solve Hard Partition Problems | 2014-07-01 | Paper |
| Solving SCS for bounded length strings in fewer than \(2^n\) steps | 2014-04-30 | Paper |
| Solving 3-Superstring in 3 n/3 Time | 2013-09-20 | Paper |
| Approximating Shortest Superstring Problem Using de Bruijn Graphs | 2013-06-14 | Paper |
| Computing All MOD-Functions Simultaneously | 2012-09-10 | Paper |
| A 5n − o(n) Lower Bound on the Circuit Size over U 2 of a Linear Boolean Function | 2012-08-14 | Paper |
| New upper bounds for the problem of maximal satisfiability | 2012-03-23 | Paper |
| An Elementary Proof of a 3n − o(n) Lower Bound on the Circuit Complexity of Affine Dispersers | 2011-08-17 | Paper |
| New upper bounds on the Boolean circuit complexity of symmetric functions | 2010-09-07 | Paper |
| A new approach to proving upper bounds for MAX-2-SAT | 2010-08-16 | Paper |
| Circuit Complexity and Multiplicative Complexity of Boolean Functions | 2010-07-29 | Paper |
| On convex complexity measures | 2010-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3181643 | 2009-10-12 | Paper |
| On covering graphs by complete bipartite subgraphs | 2009-06-23 | Paper |
| New Bounds for MAX-SAT by Clause Learning | 2008-06-03 | Paper |
| Complexity of Semialgebraic Proofs with Restricted Degree of Falsity | 2007-09-04 | Paper |
| An upper bound \(O(2^{0.16254n})\) for exact 3-satisfiability: a simpler proof | 2006-01-03 | Paper |
| A \(2^{|E|/4}\)-time algorithm for MAX-CUT | 2006-01-03 | Paper |
| Theory and Applications of Satisfiability Testing | 2005-12-15 | Paper |
| Parameterized and Exact Computation | 2005-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5460921 | 2005-07-20 | Paper |
