An ILP-based Proof System for the Crossing Number Problem. - Markus Chimani; Tilo Wiedera (ESA, 2016)

A Note on the Practicality of Maximal Planar Subgraph Algorithms. - Markus Chimani; Karsten Klein 001; Tilo Wiedera (GD, 2016)

Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem. - Markus Chimani; Ivo Hedtke; Tilo Wiedera (IWOCA, 2016)

Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs Fast. - Markus Chimani; Tilo Wiedera (ESA, 2018)

Stronger ILPs for the Graph Genus Problem. - Markus Chimani; Tilo Wiedera (ESA, 2019)

Bounded maximum degree conjecture holds precisely for c-crossing-critical graphs with c≤12. - Drago Bokal; Zdenek Dvorák 001; Petr Hlinený; Jesús Leaños; Bojan Mohar; Tilo Wiedera (CoRR, 2019)

Extending simple drawings with one edge is hard. - Alan Arroyo; Fabian Klute; Irene Parada; Raimund Seidel; Birgit Vogtenhuber; Tilo Wiedera (CoRR, 2019)

Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments. - Markus Chimani; Ivo Hedtke; Tilo Wiedera (ACM J. Exp. Algorithmics, 2019)

An Experimental Study of ILP Formulations for the Longest Induced Path Problem. - Fritz Bökler; Markus Chimani; Mirko H. Wagner; Tilo Wiedera (ISCO, 2020)

A General Approach to Approximate Multistage Subgraph Problems. - Markus Chimani; Niklas Troost; Tilo Wiedera (CoRR, 2021)

Computing Measures of Non-Planarity - Tilo Wiedera (2021)

Approximating Multistage Matching Problems. - Markus Chimani; Niklas Troost; Tilo Wiedera (Algorithmica, 2022)

Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c ≤ 12. - Drago Bokal; Zdenek Dvorák 001; Petr Hlinený; Jesús Leaños; Bojan Mohar; Tilo Wiedera (Comb., 2022)

Properties of Large 2-Crossing-Critical Graphs. - Drago Bokal; Markus Chimani; Alexander Nover; Jöran Schierbaum; Tobias Stolzmann; Mirko H. Wagner; Tilo Wiedera (J. Graph Algorithms Appl., 2022)

A general approximation for multistage subgraph problems. - Markus Chimani; Niklas Troost; Tilo Wiedera (LAGOS, 2023)

Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics. - Markus Chimani; Max Ilsen; Tilo Wiedera (J. Graph Algorithms Appl., 2023)

Inserting One Edge into a Simple Drawing is Hard. - Alan Arroyo; Fabian Klute; Irene Parada; Birgit Vogtenhuber; Raimund Seidel; Tilo Wiedera (Discret. Comput. Geom., 2023)