| Publication | Date of Publication | Type |
|---|
On the dominant of the multicut polytope
Discrete \& Computational Geometry | 2024-10-25 | Paper |
Capacity-preserving subgraphs of directed flow networks
Lecture Notes in Computer Science | 2023-12-22 | Paper |
Planar L-drawings of directed graphs
| 2023-12-16 | Paper |
On the bond polytope
advg | 2023-11-06 | Paper |
Inserting Multiple Edges into a Planar Graph
Journal of Graph Algorithms and Applications | 2023-09-20 | Paper |
Cut polytopes of minor-free graphs
| 2023-06-02 | Paper |
On the connected blocks polytope
| 2023-04-13 | Paper |
Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
Journal of Graph Algorithms and Applications | 2023-03-30 | Paper |
On the rectangular knapsack problem
Mathematical Methods of Operations Research | 2022-08-31 | Paper |
Approximating multistage matching problems
Algorithmica | 2022-08-03 | Paper |
Star-struck by fixed embeddings: modern crossing number heuristics
| 2022-07-01 | Paper |
Properties of large 2-crossing-critical graphs
Journal of Graph Algorithms and Applications | 2022-06-28 | Paper |
Stronger ILPs for the Graph Genus Problem.
| 2022-05-11 | Paper |
Approximating multistage matching problems
Lecture Notes in Computer Science | 2022-03-22 | Paper |
On the Dominant of the Multicut Polytope
| 2021-12-02 | Paper |
Crossing numbers of beyond-planar graphs
Theoretical Computer Science | 2021-12-01 | Paper |
Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
| 2021-08-25 | Paper |
Cycles to the rescue! Novel constraints to compute maximum planar subgraphs fast
| 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
2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX) | 2021-01-27 | Paper |
Exact algorithms for the maximum planar subgraph problem: new models and experiments
| 2020-12-16 | Paper |
scientific article; zbMATH DE number 7278018 (Why is no real title available?)
| 2020-11-25 | Paper |
Crossing numbers of beyond-planar graphs
Lecture Notes in Computer Science | 2020-10-26 | Paper |
Computing stable Demers cartograms
| 2020-10-26 | Paper |
Maximum cut parameterized by crossing number
Journal of Graph Algorithms and Applications | 2020-09-04 | Paper |
Crossing number for graphs with bounded pathwidth
Algorithmica | 2020-04-09 | Paper |
Toroidal grid minors and stretch in embedded graphs
Journal of Combinatorial Theory. Series B | 2020-01-15 | Paper |
A closer look at the closest string and closest substring problem
2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
An SDP approach to multi-level crossing minimization
2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
An exact approach to upward crossing minimization
2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Obtaining Optimalk-Cardinality Trees Fast
2008 Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Advances on testing C-planarity of embedded flat clustered graphs
International Journal of Foundations of Computer Science | 2019-06-24 | Paper |
Inserting a vertex into a planar graph
| 2019-05-06 | Paper |
Strong Steiner tree approximations in practice
ACM Journal of Experimental Algorithmics | 2019-03-27 | Paper |
Planar L-drawings of directed graphs
Lecture Notes in Computer Science | 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 |
Inserting multiple edges into a planar graph
| 2018-01-30 | Paper |
On the Maximum Crossing Number
Journal of Graph Algorithms and Applications | 2018-01-12 | Paper |
A tighter insertion-based approximation of the crossing number
Journal of Combinatorial Optimization | 2017-08-03 | Paper |
Algorithms and characterizations for 2-layer fan-planarity: from caterpillar to stegosaurus
Journal of Graph Algorithms and Applications | 2017-04-05 | Paper |
A note on the practicality of maximal planar subgraph algorithms
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Placing arrows in directed graph drawings
Lecture Notes in Computer Science | 2017-02-21 | Paper |
2-layer fan-planarity: from caterpillar to stegosaurus
Lecture Notes in Computer Science | 2017-02-10 | Paper |
Network design problems with bounded distances via shallow-light Steiner trees
| 2017-01-24 | Paper |
Upward planarity testing in practice: SAT formulations and comparative study
ACM Journal of Experimental Algorithmics | 2016-10-24 | Paper |
Limits of greedy approximation algorithms for the maximum planar subgraph problem
Lecture Notes in Computer Science | 2016-09-29 | Paper |
The influence of preprocessing on Steiner tree approximations
Combinatorial Optimization and Applications | 2016-02-05 | Paper |
Speedy colorful subtrees
Lecture Notes in Computer Science | 2015-10-29 | Paper |
Approximating spanning trees with few branches
Theory of Computing Systems | 2015-05-12 | Paper |
Hypergraph and minor crossing number problems
Journal of Graph Algorithms and Applications | 2015-04-22 | Paper |
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
Computing the stretch of an embedded graph
SIAM Journal on Discrete Mathematics | 2014-12-22 | Paper |
Approximating the crossing number of graphs embeddable in any orientable surface
| 2014-05-22 | Paper |
Crossing number additivity over edge cuts
European Journal of Combinatorics | 2014-04-11 | Paper |
Obtaining optimal \(k\)-cardinality trees fast
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Experiments on exact crossing minimization using column generation
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
An SDP approach to multi-level crossing minimization
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Layer-free upward crossing minimization
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Upward Planarity Testing: A Computational Study
Graph Drawing | 2013-12-20 | Paper |
Approximating spanning trees with few branches
Approximation and Online Algorithms | 2013-09-13 | Paper |
Multi-level verticality optimization: concept, strategies, and drawing scheme
Journal of Graph Algorithms and Applications | 2013-08-13 | Paper |
Shrinking the search space for clustered planarity
Graph Drawing | 2013-04-03 | Paper |
Upward planarity testing via SAT
Graph Drawing | 2013-04-03 | Paper |
Improved Steiner tree algorithms for bounded treewidth
Journal of Discrete Algorithms | 2013-01-18 | Paper |
How not to characterize planar-emulable graphs
Advances in Applied Mathematics | 2013-01-14 | Paper |
Advances in the planarization method: effective multiple edge insertions
Journal of Graph Algorithms and Applications | 2012-12-07 | Paper |
Advances in the planarization method: effective multiple edge insertions
Graph Drawing | 2012-03-09 | Paper |
Vertex insertion approximates the crossing number of apex graphs
European Journal of Combinatorics | 2012-02-11 | Paper |
Improved Steiner tree algorithms for bounded treewidth
Lecture Notes in Computer Science | 2012-01-13 | Paper |
How not to characterize planar-emulable graphs
Lecture Notes in Computer Science | 2012-01-13 | Paper |
Contraction-based Steiner tree approximations in practice
Algorithms and Computation | 2011-12-16 | Paper |
Minor crossing number is additive over arbitrary cuts
| 2011-11-25 | Paper |
Facets in the crossing number polytope
SIAM Journal on Discrete Mathematics | 2011-10-27 | Paper |
A tighter insertion-based approximation of the crossing number
Lecture Notes in Computer Science | 2011-07-06 | Paper |
Upward planarization layout
Journal of Graph Algorithms and Applications | 2011-04-19 | Paper |
Crossing minimization and layouts of directed hypergraphs with port constraints
Graph Drawing | 2011-02-11 | Paper |
Algorithm engineering: Concepts and practice
Experimental Methods for the Analysis of Optimization Algorithms | 2010-12-22 | Paper |
Solving two-stage stochastic Steiner tree problems by two-stage branch-and-cut
Algorithms and Computation | 2010-12-09 | Paper |
Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice
Mathematical Programming. Series A. Series B | 2010-09-16 | Paper |
Upward planarization layout
Graph Drawing | 2010-04-27 | Paper |
Non-planar core reduction of graphs
Discrete Mathematics | 2009-04-09 | Paper |
Computing Maximum C-Planar Subgraphs
Graph Drawing | 2009-03-03 | Paper |
Approximating the Crossing Number of Apex Graphs
Graph Drawing | 2009-03-03 | Paper |
Strong Formulations for 2-Node-Connected Steiner Network Problems
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
A New Approach to Exact Crossing Minimization
Algorithms - ESA 2008 | 2008-11-25 | Paper |
A branch-and-cut approach to the crossing number problem
Discrete Optimization | 2008-10-29 | Paper |
A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Algorithms for the Hypergraph and the Minor Crossing Number Problems
Algorithms and Computation | 2008-05-27 | Paper |
Efficient Extraction of Multiple Kuratowski Subdivisions
Graph Drawing | 2008-03-25 | Paper |
Experiments on Exact Crossing Minimization Using Column Generation
Experimental Algorithms | 2007-09-14 | Paper |
On the Minimum Cut of Planarizations
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2006-11-13 | Paper |
SOFSEM 2005: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2005-12-07 | Paper |
