| Publication | Date of Publication | Type |
|---|
| Capacity-preserving subgraphs of directed flow networks | 2023-12-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6179343 | 2023-12-16 | Paper |
| On the bond polytope | 2023-11-06 | Paper |
| Inserting Multiple Edges into a Planar Graph | 2023-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6103156 | 2023-06-02 | Paper |
| On the connected blocks polytope | 2023-04-13 | Paper |
| Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics | 2023-03-30 | Paper |
| On the rectangular knapsack problem | 2022-08-31 | Paper |
| Approximating multistage matching problems | 2022-08-03 | Paper |
| Star-struck by fixed embeddings: modern crossing number heuristics | 2022-07-01 | Paper |
| Properties of Large 2-Crossing-Critical Graphs | 2022-06-28 | Paper |
| Stronger ILPs for the Graph Genus Problem. | 2022-05-11 | Paper |
| Approximating multistage matching problems | 2022-03-22 | Paper |
| On the Dominant of the Multicut Polytope | 2021-12-02 | Paper |
| Crossing numbers of beyond-planar graphs | 2021-12-01 | Paper |
| Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics | 2021-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009576 | 2021-08-04 | Paper |
| A simple primal-dual approximation algorithm for 2-edge-connected spanning subgraphs | 2021-04-21 | Paper |
| An experimental study of ILP formulations for the longest induced path problem | 2021-02-04 | Paper |
| Approximating Multiobjective Shortest Path in Practice | 2021-01-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5140734 | 2020-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136229 | 2020-11-25 | Paper |
| Computing stable Demers cartograms | 2020-10-26 | Paper |
| Crossing numbers of beyond-planar graphs | 2020-10-26 | Paper |
| Maximum Cut Parameterized by Crossing Number | 2020-09-04 | Paper |
| Crossing number for graphs with bounded pathwidth | 2020-04-09 | Paper |
| Toroidal grid minors and stretch in embedded graphs | 2020-01-15 | Paper |
| An Exact Approach to Upward Crossing Minimization | 2019-09-12 | Paper |
| A Closer Look at the Closest String and Closest Substring Problem | 2019-09-12 | Paper |
| An SDP Approach to Multi-level Crossing Minimization | 2019-09-12 | Paper |
| Obtaining Optimalk-Cardinality Trees Fast | 2019-09-11 | Paper |
| Advances on Testing C-Planarity of Embedded Flat Clustered Graphs | 2019-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633846 | 2019-05-06 | Paper |
| Strong Steiner Tree Approximations in Practice | 2019-03-27 | Paper |
| Planar L-Drawings of Directed Graphs | 2019-02-20 | Paper |
| Crossing numbers and stress of random graphs | 2019-02-15 | Paper |
| Crossing Numbers and Stress of Random Graphs | 2018-08-22 | Paper |
| On the maximum crossing number | 2018-06-15 | Paper |
| An ILP-based Proof System for the Crossing Number Problem | 2018-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3132864 | 2018-01-30 | Paper |
| On the Maximum Crossing Number | 2018-01-12 | Paper |
| A tighter insertion-based approximation of the crossing number | 2017-08-03 | Paper |
| Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus | 2017-04-05 | Paper |
| Placing Arrows in Directed Graph Drawings | 2017-02-21 | Paper |
| A Note on the Practicality of Maximal Planar Subgraph Algorithms | 2017-02-21 | Paper |
| 2-Layer Fan-Planarity: From Caterpillar to Stegosaurus | 2017-02-10 | Paper |
| Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees | 2017-01-24 | Paper |
| Upward Planarity Testing in Practice | 2016-10-24 | Paper |
| Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem | 2016-09-29 | Paper |
| The Influence of Preprocessing on Steiner Tree Approximations | 2016-02-05 | Paper |
| Speedy Colorful Subtrees | 2015-10-29 | Paper |
| Approximating spanning trees with few branches | 2015-05-12 | Paper |
| Algorithms for the Hypergraph and the Minor Crossing Number Problems | 2015-04-22 | Paper |
| Advances on Testing C-Planarity of Embedded Flat Clustered Graphs | 2015-01-07 | Paper |
| Computing the Stretch of an Embedded Graph | 2014-12-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417677 | 2014-05-22 | Paper |
| Crossing number additivity over edge cuts | 2014-04-11 | Paper |
| Obtaining optimal k -cardinality trees fast | 2014-04-01 | Paper |
| Experiments on exact crossing minimization using column generation | 2014-04-01 | Paper |
| Layer-free upward crossing minimization | 2014-04-01 | Paper |
| An SDP approach to multi-level crossing minimization | 2014-04-01 | Paper |
| Upward Planarity Testing: A Computational Study | 2013-12-20 | Paper |
| Approximating Spanning Trees with Few Branches | 2013-09-13 | Paper |
| Multi-level Verticality Optimization: Concept, Strategies, and Drawing Scheme | 2013-08-13 | Paper |
| Shrinking the Search Space for Clustered Planarity | 2013-04-03 | Paper |
| Upward Planarity Testing via SAT | 2013-04-03 | Paper |
| Improved Steiner tree algorithms for bounded treewidth | 2013-01-18 | Paper |
| How not to characterize planar-emulable graphs | 2013-01-14 | Paper |
| Advances in the Planarization Method: Effective Multiple Edge Insertions | 2012-12-07 | Paper |
| Advances in the Planarization Method: Effective Multiple Edge Insertions | 2012-03-09 | Paper |
| Vertex insertion approximates the crossing number of apex graphs | 2012-02-11 | Paper |
| How Not to Characterize Planar-Emulable Graphs | 2012-01-13 | Paper |
| Improved Steiner Tree Algorithms for Bounded Treewidth | 2012-01-13 | Paper |
| Contraction-Based Steiner Tree Approximations in Practice | 2011-12-16 | Paper |
| Minor crossing number is additive over arbitrary cuts | 2011-11-25 | Paper |
| Facets in the Crossing Number Polytope | 2011-10-27 | Paper |
| A tighter insertion-based approximation of the crossing number | 2011-07-06 | Paper |
| Upward Planarization Layout | 2011-04-19 | Paper |
| Crossing Minimization and Layouts of Directed Hypergraphs with Port Constraints | 2011-02-11 | Paper |
| Algorithm Engineering: Concepts and Practice | 2010-12-22 | Paper |
| Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut | 2010-12-09 | Paper |
| Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice | 2010-09-16 | Paper |
| Upward Planarization Layout | 2010-04-27 | Paper |
| Non-planar core reduction of graphs | 2009-04-09 | Paper |
| Computing Maximum C-Planar Subgraphs | 2009-03-03 | Paper |
| Approximating the Crossing Number of Apex Graphs | 2009-03-03 | Paper |
| Strong Formulations for 2-Node-Connected Steiner Network Problems | 2009-01-27 | Paper |
| A New Approach to Exact Crossing Minimization | 2008-11-25 | Paper |
| A branch-and-cut approach to the crossing number problem | 2008-10-29 | Paper |
| A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks | 2008-09-25 | Paper |
| Algorithms for the Hypergraph and the Minor Crossing Number Problems | 2008-05-27 | Paper |
| Efficient Extraction of Multiple Kuratowski Subdivisions | 2008-03-25 | Paper |
| Experiments on Exact Crossing Minimization Using Column Generation | 2007-09-14 | Paper |
| On the Minimum Cut of Planarizations | 2007-05-29 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| SOFSEM 2005: Theory and Practice of Computer Science | 2005-12-07 | Paper |
