Author of the publication

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Families with Infants: A General Approach to Solve Hard Partition Problems., , and . ICALP (1), volume 8572 of Lecture Notes in Computer Science, page 551-562. Springer, (2014)Nondeterministic extensions of the Strong Exponential Time Hypothesis and consequences for non-reducibility., , , , , and . Electron. Colloquium Comput. Complex., (2015)If Edge Coloring is Hard under SETH, then SETH is False., and . SOSA, page 115-120. SIAM, (2024)A Better-Than-3log(n) Depth Lower Bound for De Morgan Formulas with Restrictions on Top Gates., and . CCC, volume 234 of LIPIcs, page 13:1-13:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Collapsing Superstring Conjecture., , , , and . APPROX-RANDOM, volume 145 of LIPIcs, page 26:1-26:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)CNF Encodings of Parity., , , and . MFCS, volume 241 of LIPIcs, page 47:1-47:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Tight Lower Bounds on Graph Embedding Problems., , , , , , and . CoRR, (2016)Lower Bounds for the Graph Homomorphism Problem., , , and . ICALP (1), volume 9134 of Lecture Notes in Computer Science, page 481-493. Springer, (2015)Tight Bounds for Graph Homomorphism and Subgraph Isomorphism., , , , , , and . SODA, page 1643-1649. SIAM, (2016)Polynomial formulations as a barrier for reduction-based hardness proofs., , , , and . SODA, page 3245-3281. SIAM, (2023)