In: 11th International Symposium on Parameterized and Exact Computation, IPEC 2016 Leibniz International Proceedings in Informatics, LIPIcs (63) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 3:1-3:12. ISSN 1868-8969
H-free graphs, Independent Sets, and subexponential-time algorithms
In: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017 Leibniz International Proceedings in Informatics, LIPIcs (80) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 54:1-54:14. ISSN 1868-8969
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: Poceedings of the 2017 IEEE International Conference on Computer Communications (IEEE INFOCOM) IEEE Communications Society, Piscataway (NJ), pp. 1-9.
List of Shared Risk Link Groups Representing Regional Failures with Limited Size
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