Tilo Wiedera

According to our database, Tilo Wiedera authored at least 17 papers between 2016 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

A general approximation for multistage subgraph problems.

Markus Chimani, Niklas Troost, Tilo Wiedera

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

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

2021

Computing Measures of Non-Planarity

Tilo Wiedera

PhD thesis, 2021

A General Approach to Approximate Multistage Subgraph Problems.

Markus Chimani, Niklas Troost, Tilo Wiedera

CoRR, 2021

Approximating Multistage Matching Problems.

Markus Chimani, Niklas Troost, Tilo Wiedera

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics.

Markus Chimani, Max Ilsen, Tilo Wiedera

Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

2020

Inserting One Edge into a Simple Drawing Is Hard.

Alan Arroyo, Fabian Klute, Irene Parada, Raimund Seidel, Birgit Vogtenhuber, Tilo Wiedera

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

An Experimental Study of ILP Formulations for the Longest Induced Path Problem.

Fritz Bökler, Markus Chimani, Mirko H. Wagner, Tilo Wiedera

Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020

2019

Extending simple drawings with one edge is hard.

Alan Arroyo, Fabian Klute, Irene Parada, Raimund Seidel, Birgit Vogtenhuber, Tilo Wiedera

CoRR, 2019

Bounded maximum degree conjecture holds precisely for c-crossing-critical graphs with c≤12.

Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera

CoRR, 2019

Stronger ILPs for the Graph Genus Problem.

Markus Chimani, Tilo Wiedera

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c <= 12.

Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera

Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018

Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments.

Markus Chimani, Ivo Hedtke, Tilo Wiedera

Proceedings of the 17th International Symposium on Experimental Algorithms, 2018

Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs Fast.

Markus Chimani, Tilo Wiedera

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2016

Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem.

Markus Chimani, Ivo Hedtke, Tilo Wiedera

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

A Note on the Practicality of Maximal Planar Subgraph Algorithms.

Markus Chimani, Karsten Klein, Tilo Wiedera

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

An ILP-based Proof System for the Crossing Number Problem.

Markus Chimani, Tilo Wiedera

Proceedings of the 24th Annual European Symposium on Algorithms, 2016