| Publication | Date of Publication | Type |
|---|
| PACE solver description: exact solution of the one-sided crossing minimization problem by the MPPEG team | 2026-05-29 | Paper |
| SAT encoding of partial ordering models for graph coloring problems | 2026-02-03 | Paper |
| Revisiting ILP models for exact crossing minimization in storyline drawings | 2025-10-07 | Paper |
| Vehicle routing with heterogeneous time windows | 2024-09-17 | Paper |
| Polygon Aggregration Instances for Monotone Parametric Minimum Cut | 2024-09-03 | Dataset |
Delay-resistant robust vehicle routing with heterogeneous time windows
Computers & Operations Research | 2024-06-06 | Paper |
| McSparse: exact solutions of sparse maximum cut and sparse unconstrained binary quadratic optimization problems | 2024-05-24 | Paper |
| Minimum-error triangulations for sea surface reconstruction | 2024-05-14 | Paper |
Minimum-error triangulations for sea surface reconstruction
(available as arXiv preprint) | 2023-12-20 | Paper |
| Minimum-error triangulations for sea surface reconstruction | 2023-12-20 | Paper |
A polyhedral approach to planar augmentation and related problems
Lecture Notes in Computer Science | 2023-05-08 | Paper |
Quantum annealing versus digital computing. An experimental comparison
ACM Journal of Experimental Algorithmics | 2022-09-06 | Paper |
| Algorithmic data science (invited talk) | 2022-07-18 | Paper |
| 10 reasons to get interested in graph drawing | 2022-02-16 | Paper |
Largest Weight Common Subtree Embeddings with Distance Penalties
(available as arXiv preprint) | 2021-08-04 | Paper |
Shrinking Trees not Blossoms: A Recursive Maximum Matching Approach
2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX) | 2021-01-27 | Paper |
Fixed-parameter algorithms for the weighted max-cut problem on embedded 1-planar graphs
Theoretical Computer Science | 2021-01-25 | Paper |
A unifying view of explicit and implicit feature maps of graph kernels
Data Mining and Knowledge Discovery | 2021-01-15 | Paper |
scientific article; zbMATH DE number 7278018 (Why is no real title available?)
(available as arXiv preprint) | 2020-11-25 | 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 |
New integer linear programming models for the vertex coloring problem
(available as arXiv preprint) | 2020-02-12 | Paper |
On the enumeration of bicriteria temporal paths
(available as arXiv preprint) | 2019-10-15 | Paper |
A flow formulation for horizontal coordinate assignment with prescribed width
Journal of Graph Algorithms and Applications | 2019-09-16 | Paper |
A new Integer Linear Program for the Steiner Tree Problem with Revenues, Budget and Hop Constraints
2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-13 | Paper |
Practical Experience with Hanani-Tutte for Testing c-Planarity
2014 Proceedings of the Sixteenth 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 |
Obtaining Optimal<i>k</i>-Cardinality Trees Fast
2008 Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
| Inserting a vertex into a planar graph | 2019-05-06 | Paper |
A flow formulation for horizontal coordinate assignment with prescribed width
(available as arXiv preprint) | 2019-02-15 | Paper |
A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs
Journal of Graph Algorithms and Applications | 2019-01-18 | Paper |
Bishellable drawings of K_n
SIAM Journal on Discrete Mathematics | 2018-11-19 | Paper |
A fixed-parameter algorithm for the Max-Cut problem on embedded 1-planar graphs
(available as arXiv preprint) | 2018-09-06 | Paper |
The crossing number of seq-shellable drawings of complete graphs
(available as arXiv preprint) | 2018-09-06 | Paper |
Stochastic survivable network design problems: theory and practice
European Journal of Operational Research | 2018-05-24 | Paper |
| The Crossing Number of Semi-Pair-Shellable Drawings of Complete Graphs | 2018-05-16 | Paper |
A sidetrack-based algorithm for finding the k shortest simple paths in a directed graph
(available as arXiv preprint) | 2018-04-19 | Paper |
Matheuristics for optimizing the network in German wagonload traffic
EURO Journal on Computational Optimization | 2018-03-28 | Paper |
Faster algorithms for the maximum common subtree isomorphism problem
(available as arXiv preprint) | 2018-03-21 | Paper |
The Crossing Number of Seq-Shellable Drawings of Complete Graphs
(available as arXiv preprint) | 2018-03-20 | Paper |
On maximum common subgraph problems in series-parallel graphs
European Journal of Combinatorics | 2017-11-14 | Paper |
Tree-deletion pruning in label-correcting algorithms for the multiobjective shortest path problem
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
Finding largest common substructures of molecules in quadratic time
SOFSEM 2017: Theory and Practice of Computer Science | 2017-04-04 | Paper |
Compact layered drawings of general directed graphs
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Drawing partially embedded and simultaneously planar graphs
Journal of Graph Algorithms and Applications | 2016-01-07 | Paper |
Output-sensitive algorithms for enumerating the extreme nondominated points of multiobjective combinatorial optimization problems
Algorithms - ESA 2015 | 2015-11-19 | Paper |
On maximum common subgraph problems in series-parallel graphs
Lecture Notes in Computer Science | 2015-09-15 | Paper |
On maximum common subgraph problems in series-parallel graphs
Lecture Notes in Computer Science | 2015-09-15 | Paper |
Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay
Algorithms and Computation | 2015-09-11 | Paper |
The Maximum Weight Connected Subgraph Problem
Facets of Combinatorial Optimization | 2015-07-22 | Paper |
Practical SAHN clustering for very large data sets and expensive distance metrics
Journal of Graph Algorithms and Applications | 2015-01-15 | Paper |
Drawing partially embedded and simultaneously planar graphs
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
Finding maximum common biconnected subgraphs in series-parallel graphs
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | 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 |
Layer-free upward crossing minimization
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 |
SAHN Clustering in Arbitrary Metric Spaces Using Heuristic Nearest Neighbor Search
Algorithms and Computation | 2014-02-18 | Paper |
Recent advances in exact crossing minimization (extended abstract)
Electronic Notes in Discrete Mathematics | 2013-06-28 | Paper |
The rooted maximum node-weight connected subgraph problem
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems | 2013-06-04 | Paper |
Exact ground states of two-dimensional \(\pm J\) Ising spin glasses
Journal of Statistical Physics | 2013-04-10 | Paper |
Improved Steiner tree algorithms for bounded treewidth
Journal of Discrete Algorithms | 2013-01-18 | 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 |
Colored simultaneous geometric embeddings and universal pointsets
Algorithmica | 2011-06-30 | Paper |
Upward planarization layout
Journal of Graph Algorithms and Applications | 2011-04-19 | Paper |
A multi-commodity flow approach for the design of the last mile in real-world fiber optic networks
Operations Research Proceedings | 2011-04-07 | Paper |
An experimental evaluation of multilevel layout methods
Graph Drawing | 2011-02-11 | Paper |
Crossing minimization and layouts of directed hypergraphs with port constraints
Graph Drawing | 2011-02-11 | 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 |
On open problems in biological network visualization
Graph Drawing | 2010-04-27 | Paper |
Upward planarization layout
Graph Drawing | 2010-04-27 | Paper |
The fractional prize-collecting Steiner tree problem on trees (extended abstract)
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Subgraph induced planar connectivity augmentation (extended abstract)
Lecture Notes in Computer Science | 2010-01-12 | Paper |
Planar biconnectivity augmentation with fixed embedding
Lecture Notes in Computer Science | 2009-12-11 | Paper |
The Crossing Number of Graphs: Theory and Computation
Lecture Notes in Computer Science | 2009-11-12 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2009-08-11 | Paper |
On the Hardness and Approximability of Planar Biconnectivity Augmentation
Lecture Notes in Computer Science | 2009-07-23 | 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 |
Planarity Testing and Optimal Edge Insertion with Embedding Constraints
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Planarity Testing and Optimal Edge Insertion with Embedding Constraints
Journal of Graph Algorithms and Applications | 2009-01-19 | 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 |
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 |
Bend Minimization in Planar Orthogonal Drawings Using Integer Programming
SIAM Journal on Optimization | 2007-09-06 | Paper |
Planarity Testing and Optimal Edge Insertion with Embedding Constraints
Graph Drawing | 2007-08-28 | Paper |
A New Approximation Algorithm for Bend Minimization in the Kandinsky Model
Graph Drawing | 2007-08-28 | 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 |
Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm
Journal of Statistical Physics | 2006-08-23 | Paper |
Simple and Efficient Bilayer Cross Counting
Journal of Graph Algorithms and Applications | 2006-04-03 | Paper |
An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
Mathematical Programming. Series A. Series B | 2006-01-13 | Paper |
SOFSEM 2005: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2005-12-07 | Paper |
| scientific article; zbMATH DE number 2196291 (Why is no real title available?) | 2005-08-22 | Paper |
Inserting an edge into a planar graph
Algorithmica | 2005-04-29 | Paper |
| scientific article; zbMATH DE number 2090004 (Why is no real title available?) | 2004-08-12 | Paper |
