Tilo Wiedera

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