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

Routing with congestion in acyclic digraphs., , , and . Inf. Process. Lett., (2019)Algorithmic Properties of Sparse Digraphs., , , , and . STACS, volume 126 of LIPIcs, page 46:1-46:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs., , , , , , and . ICALP, volume 80 of LIPIcs, page 63:1-63:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Coloring and Covering Nowhere Dense Graphs., , , , and . SIAM J. Discret. Math., 32 (4): 2467-2481 (2018)Rankwidth meets stability., , , , and . SODA, page 2014-2033. SIAM, (2021)Colouring and Covering Nowhere Dense Graphs., , , , and . WG, volume 9224 of Lecture Notes in Computer Science, page 325-338. Springer, (2015)Classes of graphs with low complexity: The case of classes with bounded linear rankwidth., , , and . Eur. J. Comb., (2021)Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs., , and . WG, volume 11789 of Lecture Notes in Computer Science, page 53-65. Springer, (2019)Linear rankwidth meets stability., , , and . SODA, page 1180-1199. SIAM, (2020)Neighborhood complexity and kernelization for nowhere dense classes of graphs., , , , , , and . CoRR, (2016)