In: 32nd Computational Complexity Conference, CCC 2017 Leibniz International Proceedings in Informatics, LIPIcs (79) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 30:1-30:24. ISSN 1868-8969
On the polynomial parity argument complexity of the combinatorial nullstellensatz
In: 8th Innovations in Theoretical Computer Science Conference, (ITCS) Leibniz International Proceedings in Informatics (LIPIcs) (67) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 55:1-55:19. ISSN 1868-8969
Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time
In: 25th Annual European Symposium on Algorithms (ESA 2017) Leibniz International Proceedings in Informatics (LIPIcs) (87) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 59:1-59:15. ISSN 1868-8969
Subexponential parameterized algorithms for graphs of polynomial growth
In: 33rd International Symposium on Computational Geometry, SoCG 2017 Leibniz International Proceedings in Informatics, LIPIcs (77) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 3:1-3:15. ISSN 1868-8969
In: 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017) Leibniz International Proceedings in Informatics, LIPIcs (66) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 25:1-25:15. ISSN 1868-8969
Counting edge-injective homomorphisms and matchings on restricted graph classes
In: 2017 Workshops of the International Conference on Extending Database Technology and the International Conference on Database Theory, EDBT/ICDT 2017 CEUR Workshop Proceedings (1810) CEUR-WS.org, Aachen, pp. 1-1. ISSN 1613-0073
STREAMLINE - Streamlined analysis of data at rest and data in motion