Author of the publication

Planarizing Graphs and Their Drawings by Vertex Splitting.

, , , , , and . GD, volume 13764 of Lecture Notes in Computer Science, page 232-246. Springer, (2022)

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

Efficient algorithms for measuring the funnel-likeness of DAGs., , , and . J. Comb. Optim., 39 (1): 216-245 (2020)Constant Congestion Brambles in Directed Graphs., , , and . SIAM J. Discret. Math., 36 (2): 922-938 (2022)Efficient fully dynamic elimination forests with applications to detecting long paths and cycles., , , , , , , , , and 1 other author(s). SODA, page 796-809. SIAM, (2021)The Influence of Dimensions on the Complexity of Computing Decision Trees., , , , , , , and . AAAI, page 8343-8350. AAAI Press, (2023)On Computing Optimal Tree Ensembles., , , and . ICML, volume 202 of Proceedings of Machine Learning Research, page 17364-17374. PMLR, (2023)Your Rugby Mates Don't Need to Know Your Colleagues: Triadic Closure with Edge Colors., , , and . CIAC, volume 11485 of Lecture Notes in Computer Science, page 99-111. Springer, (2019)The Minimum Feasible Tileset Problem., , and . Algorithmica, 81 (3): 1126-1151 (2019)Your Rugby Mates Don't Need to Know your Colleagues: Triadic Closure with Edge Colors., , , and . CoRR, (2018)The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth., , , , , and . IPEC, volume 180 of LIPIcs, page 37:1-37:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Optimal Discretization is Fixed-parameter Tractable., , , , and . CoRR, (2020)