| An ILP-based proof system for the crossing number problem M Chimani, T Wiedera 24th annual European symposium on algorithms (ESA 2016), 2016 | 34 | 2016 |
| Approximating multistage matching problems M Chimani, N Troost, T Wiedera Algorithmica 84 (8), 2135-2153, 2022 | 19 | 2022 |
| Inserting one edge into a simple drawing is hard A Arroyo, F Klute, I Parada, B Vogtenhuber, R Seidel, T Wiedera Discrete & Computational Geometry 69 (3), 745-770, 2023 | 13 | 2023 |
| Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c ≤ 12 D Bokal, Z Dvořák, P Hlinĕný, J Leaños, B Mohar, T Wiedera Combinatorica 42 (5), 701-728, 2022 | 10 | 2022 |
| Exact algorithms for the maximum planar subgraph problem: New models and experiments M Chimani, I Hedtke, T Wiedera Journal of Experimental Algorithmics (JEA) 24, 1-21, 2019 | 10 | 2019 |
| A note on the practicality of maximal planar subgraph algorithms M Chimani, K Klein, T Wiedera Graph Drawing and Network Visualization: 24th International Symposium, GD …, 2016 | 10 | 2016 |
| An experimental study of ILP formulations for the longest induced path problem F Bökler, M Chimani, MH Wagner, T Wiedera International Symposium on Combinatorial Optimization, 89-101, 2020 | 8 | 2020 |
| Star-struck by fixed embeddings: Modern crossing number heuristics M Chimani, M Ilsen, T Wiedera International Symposium on Graph Drawing and Network Visualization, 41-56, 2021 | 5 | 2021 |
| Cycles to the rescue! Novel constraints to compute maximum planar subgraphs fast M Chimani, T Wiedera arXiv preprint arXiv:1806.08283, 2018 | 5 | 2018 |
| Limits of greedy approximation algorithms for the maximum planar subgraph problem M Chimani, I Hedtke, T Wiedera Combinatorial Algorithms: 27th International Workshop, IWOCA 2016, Helsinki …, 2016 | 5 | 2016 |
| Properties of large 2-crossing-critical graphs D Bokal, M Chimani, A Nover, J Schierbaum, T Stolzmann, MH Wagner, ... arXiv preprint arXiv:2112.04854, 2021 | 3 | 2021 |
| Extending simple drawings with one edge is hard A Arroyo, F Klute, I Parada, R Seidel, B Vogtenhuber, T Wiedera arXiv preprint arXiv:1909.07347, 2019 | 3 | 2019 |
| A general approach to approximate multistage subgraph problems M Chimani, N Troost, T Wiedera arXiv preprint arXiv:2107.02581, 2021 | 2 | 2021 |
| Stronger ILPs for the graph genus problem M Chimani, T Wiedera 27th Annual European Symposium on Algorithms (ESA 2019), 2019 | 2 | 2019 |
| A general approximation for multistage subgraph problems M Chimani, N Troost, T Wiedera Procedia Computer Science 223, 334-342, 2023 | 1 | 2023 |
| Computing Measures of Non-Planarity T Wiedera Universität Osnabrück, 2021 | 1 | 2021 |
| Properties of Large 2-Crossing-Critical Graphs DBMCA Nover, T Wiedera arXiv preprint arXiv:2112.04854, 2021 | | 2021 |
| An Experimental Study of ILP Formulations for the Longest Induced Path Problem M Chimani, F Bökler, MH Wagner, T Wiedera arXiv, arXiv: 2002.07012, 2020 | | 2020 |
