Tilo Wiedera

Publication Activity (10 Years)

Years Active: 2016-2023
Publications (10 Years): 28

Top Topics

Graph Theoretic

Top Venues

Publications

Markus Chimani, Max Ilsen, Tilo Wiedera
Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics. J. Graph Algorithms Appl. 27 (2) (2023)
Alan Arroyo, Fabian Klute, Irene Parada, Birgit Vogtenhuber, Raimund Seidel, Tilo Wiedera
Inserting One Edge into a Simple Drawing is Hard. Discret. Comput. Geom. 69 (3) (2023)
Markus Chimani, Niklas Troost, Tilo Wiedera
A general approximation for multistage subgraph problems. LAGOS (2023)
Drago Bokal, Markus Chimani, Alexander Nover, Jöran Schierbaum, Tobias Stolzmann, Mirko H. Wagner, Tilo Wiedera
Properties of Large 2-Crossing-Critical Graphs. J. Graph Algorithms Appl. 26 (1) (2022)
Markus Chimani, Niklas Troost, Tilo Wiedera
Approximating Multistage Matching Problems. Algorithmica 84 (8) (2022)
Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera
Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c ≤ 12. Comb. 42 (5) (2022)
Markus Chimani, Max Ilsen, Tilo Wiedera
Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics. Graph Drawing (2021)
Markus Chimani, Niklas Troost, Tilo Wiedera
Approximating Multistage Matching Problems. IWOCA (2021)
Markus Chimani, Niklas Troost, Tilo Wiedera
A General Approach to Approximate Multistage Subgraph Problems. CoRR (2021)
Markus Chimani, Max Ilsen, Tilo Wiedera
Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics. CoRR (2021)
Drago Bokal, Markus Chimani, Alexander Nover, Jöran Schierbaum, Tobias Stolzmann, Mirko H. Wagner, Tilo Wiedera
Properties of Large 2-Crossing-Critical Graphs. CoRR (2021)
Alan Arroyo, Fabian Klute, Irene Parada, Raimund Seidel, Birgit Vogtenhuber, Tilo Wiedera
Inserting One Edge into a Simple Drawing Is Hard. WG (2020)
Markus Chimani, Niklas Troost, Tilo Wiedera
Approximating Multistage Matching Problems. CoRR (2020)
Markus Chimani, Fritz Bökler, Mirko H. Wagner, Tilo Wiedera
An Experimental Study of ILP Formulations for the Longest Induced Path Problem. CoRR (2020)
Fritz Bökler, Markus Chimani, Mirko H. Wagner, Tilo Wiedera
An Experimental Study of ILP Formulations for the Longest Induced Path Problem. ISCO (2020)
Alan Arroyo, Fabian Klute, Irene Parada, Raimund Seidel, Birgit Vogtenhuber, Tilo Wiedera
Extending simple drawings with one edge is hard. CoRR (2019)
Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera
Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c <= 12. SoCG (2019)
Markus Chimani, Tilo Wiedera
Stronger ILPs for the Graph Genus Problem. ESA (2019)
Markus Chimani, Ivo Hedtke, Tilo Wiedera
Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments. ACM J. Exp. Algorithmics 24 (1) (2019)
Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera
Bounded maximum degree conjecture holds precisely for c-crossing-critical graphs with c≤12. CoRR (2019)
Markus Chimani, Ivo Hedtke, Tilo Wiedera
Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments. SEA (2018)
Markus Chimani, Tilo Wiedera
Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs Fast. ESA (2018)
Markus Chimani, Tilo Wiedera
Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs Fast. CoRR (2018)
Markus Chimani, Ivo Hedtke, Tilo Wiedera
Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments. CoRR (2018)
Markus Chimani, Ivo Hedtke, Tilo Wiedera
Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem. IWOCA (2016)
Markus Chimani, Tilo Wiedera
An ILP-based Proof System for the Crossing Number Problem. ESA (2016)
Markus Chimani, Karsten Klein, Tilo Wiedera
A Note on the Practicality of Maximal Planar Subgraph Algorithms. Graph Drawing (2016)
Markus Chimani, Karsten Klein, Tilo Wiedera
A Note on the Practicality of Maximal Planar Subgraph Algorithms. CoRR (2016)