Browsing by Author Wiedera, Tilo

Showing results 1 to 14 of 14
Issue DateTitleAuthor(s)
2021A General Approach to Approximate Multistage Subgraph Problems.Chimani, Markus ; Troost, Niklas; Wiedera, Tilo
2023A general approximation for multistage subgraph problemsChimani, Markus ; Troost, Niklas; Wiedera, Tilo
2020An Experimental Study of ILP Formulations for the Longest Induced Path ProblemBökler, Fritz; Chimani, Markus ; Wagner, Mirko H.; Wiedera, Tilo
2020An Experimental Study of ILP Formulations for the Longest Induced Path ProblemBökler, Fritz; Chimani, Markus ; Wagner, Mirko H.; Wiedera, Tilo
2020Approximating Multistage Matching ProblemsChimani, Markus ; Troost, Niklas; Wiedera, Tilo
2022Bounded Degree Conjecture Holds Precisely for <i>c</i>-Crossing-Critical Graphs with <i>c</i> ≤ 12Bokal, Drago; Dvorak, Zdenek; Hlineny, Petr; Leanos, Jesus; Mohar, Bojan; Wiedera, Tilo
2019Bounded maximum degree conjecture holds precisely for $c$-crossing-critical graphs with $c leq 12$Bokal, Drago; Dvorak, Zdenek; Hlinený, Petr; Leaños, Jesús; Mohar, Bojan; Wiedera, Tilo
2021Computing measures of non-planarityWiedera, Tilo
2018Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs FastChimani, Markus ; Wiedera, Tilo
2018Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs Fast.Chimani, Markus ; Wiedera, Tilo
2018Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments.Chimani, Markus ; Hedtke, Ivo; Wiedera, Tilo
2018Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments.Chimani, Markus ; Hedtke, Ivo; Wiedera, Tilo
2019Inserting one edge into a simple drawing is hardArroyo, Alan; Klute, Fabian; Parada, Irene; Seidel, Raimund; Vogtenhuber, Birgit; Wiedera, Tilo
2021Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics.Chimani, Markus ; Ilsen, Max; Wiedera, Tilo