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. 16:1-16: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: 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. 22:1-22:14. ISSN 1868-8969
Parameterized and approximation results for scheduling with a low rank processing time matrix
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
INTERNAL MEDICINE REVIEW, 3 (4)., pp. 1-8. ISSN 2470-3524
Autoimmune T-cells induced by low dose immune checkpoint blockade could be a powerful therapeutic tool in cancer through activation of eliminative inflammation and immunity
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: 33rd International Symposium on Computational Geometry, SoCG 2017 Leibniz International Proceedings in Informatics, LIPIcs (77) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 20:1-20:15. ISSN 1868-8969
An approximation algorithm for the art gallery problem