( en | de | ru )

 

Disambiguation of "Wiedera, Tilo"

Author of the publication

copydeleteadd this publication to your clipboard
A Note on the Practicality of Maximal Planar Subgraph Algorithms.

, , and . Graph Drawing, volume 9801 of Lecture Notes in Computer Science, page 357-364. Springer, (2016)

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.

Maria Tilov

Tichomir Tilov

Maria Cristina Tilotta

Tilo Gutewort

Tilo Burkhardt

 

Other publications of authors with the same name

Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics., , and . GD, volume 12868 of Lecture Notes in Computer Science, page 41-56. Springer, (2021)A general approximation for multistage subgraph problems., , and . LAGOS, volume 223 of Procedia Computer Science, page 334-342. Elsevier, (2023)Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c ≤ 12., , , , , and . Comb., 42 (5): 701-728 (2022)Stronger ILPs for the Graph Genus Problem., and . ESA, volume 144 of LIPIcs, page 30:1-30:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Bounded maximum degree conjecture holds precisely for c-crossing-critical graphs with c≤12., , , , , and . CoRR, (2019)Computing Measures of Non-Planarity. University of Osnabrück, Germany, (2021)base-search.net (ftunivosnabrueck:oai:osnadocs.ub.uni-osnabrueck.de:ds-202112225739).Inserting One Edge into a Simple Drawing Is Hard., , , , , and . WG, volume 12301 of Lecture Notes in Computer Science, page 325-338. Springer, (2020)Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem., , and . IWOCA, volume 9843 of Lecture Notes in Computer Science, page 334-346. Springer, (2016)Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments., , and . SEA, volume 103 of LIPIcs, page 22:1-22:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs Fast., and . ESA, volume 112 of LIPIcs, page 19:1-19:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)