| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6182149 | 2023-12-20 | Paper |
| A polyhedral approach to planar augmentation and related problems | 2023-05-08 | Paper |
| Quantum Annealing versus Digital Computing | 2022-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090449 | 2022-07-18 | Paper |
| 10 reasons to get interested in graph drawing | 2022-02-16 | Paper |
| Largest Weight Common Subtree Embeddings with Distance Penalties | 2021-08-04 | Paper |
| Shrinking Trees not Blossoms: A Recursive Maximum Matching Approach | 2021-01-27 | Paper |
| Fixed-parameter algorithms for the weighted max-cut problem on embedded 1-planar graphs | 2021-01-25 | Paper |
| A unifying view of explicit and implicit feature maps of graph kernels | 2021-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136229 | 2020-11-25 | Paper |
| Maximum Cut Parameterized by Crossing Number | 2020-09-04 | Paper |
| Crossing number for graphs with bounded pathwidth | 2020-04-09 | Paper |
| New integer linear programming models for the vertex coloring problem | 2020-02-12 | Paper |
| On the enumeration of bicriteria temporal paths | 2019-10-15 | Paper |
| A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width | 2019-09-16 | Paper |
| A new Integer Linear Program for the Steiner Tree Problem with Revenues, Budget and Hop Constraints | 2019-09-13 | Paper |
| Practical Experience with Hanani-Tutte for Testing c-Planarity | 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 |
| https://portal.mardi4nfdi.de/entity/Q4633846 | 2019-05-06 | Paper |
| A flow formulation for horizontal coordinate assignment with prescribed width | 2019-02-15 | Paper |
| A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs | 2019-01-18 | Paper |
| Bishellable drawings of $K_n$ | 2018-11-19 | Paper |
| A fixed-parameter algorithm for the Max-Cut problem on embedded 1-planar graphs | 2018-09-06 | Paper |
| The crossing number of seq-shellable drawings of complete graphs | 2018-09-06 | Paper |
| Stochastic survivable network design problems: theory and practice | 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 | 2018-04-19 | Paper |
| Matheuristics for optimizing the network in German wagonload traffic | 2018-03-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608592 | 2018-03-21 | Paper |
| The Crossing Number of Seq-Shellable Drawings of Complete Graphs | 2018-03-20 | Paper |
| On maximum common subgraph problems in series-parallel graphs | 2017-11-14 | Paper |
| Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem | 2017-05-05 | Paper |
| Finding Largest Common Substructures of Molecules in Quadratic Time | 2017-04-04 | Paper |
| Compact Layered Drawings of General Directed Graphs | 2017-02-21 | Paper |
| Drawing Partially Embedded and Simultaneously Planar Graphs | 2016-01-07 | Paper |
| Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems | 2015-11-19 | Paper |
| On Maximum Common Subgraph Problems in Series-Parallel Graphs | 2015-09-15 | Paper |
| Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay | 2015-09-11 | Paper |
| The Maximum Weight Connected Subgraph Problem | 2015-07-22 | Paper |
| Practical SAHN Clustering for Very Large Data Sets and Expensive Distance Metrics | 2015-01-15 | Paper |
| Drawing Partially Embedded and Simultaneously Planar Graphs | 2015-01-07 | Paper |
| Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs | 2014-10-14 | 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 |
| SAHN Clustering in Arbitrary Metric Spaces Using Heuristic Nearest Neighbor Search | 2014-02-18 | Paper |
| Recent Advances in Exact Crossing Minimization (Extended Abstract) | 2013-06-28 | Paper |
| The Rooted Maximum Node-Weight Connected Subgraph Problem | 2013-06-04 | Paper |
| Exact ground states of two-dimensional \(\pm J\) Ising spin glasses | 2013-04-10 | Paper |
| Improved Steiner tree algorithms for bounded treewidth | 2013-01-18 | Paper |
| Vertex insertion approximates the crossing number of apex graphs | 2012-02-11 | Paper |
| Improved Steiner Tree Algorithms for Bounded Treewidth | 2012-01-13 | Paper |
| Colored simultaneous geometric embeddings and universal pointsets | 2011-06-30 | Paper |
| Upward Planarization Layout | 2011-04-19 | Paper |
| A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks | 2011-04-07 | Paper |
| An Experimental Evaluation of Multilevel Layout Methods | 2011-02-11 | Paper |
| Crossing Minimization and Layouts of Directed Hypergraphs with Port Constraints | 2011-02-11 | 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 |
| On Open Problems in Biological Network Visualization | 2010-04-27 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| Planar Biconnectivity Augmentation with Fixed Embedding | 2009-12-11 | Paper |
| The Crossing Number of Graphs: Theory and Computation | 2009-11-12 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| On the Hardness and Approximability of Planar Biconnectivity Augmentation | 2009-07-23 | 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 |
| Planarity Testing and Optimal Edge Insertion with Embedding Constraints | 2009-01-19 | 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 |
| Efficient Extraction of Multiple Kuratowski Subdivisions | 2008-03-25 | Paper |
| Experiments on Exact Crossing Minimization Using Column Generation | 2007-09-14 | Paper |
| Bend Minimization in Planar Orthogonal Drawings Using Integer Programming | 2007-09-06 | Paper |
| Planarity Testing and Optimal Edge Insertion with Embedding Constraints | 2007-08-28 | Paper |
| A New Approximation Algorithm for Bend Minimization in the Kandinsky Model | 2007-08-28 | Paper |
| On the Minimum Cut of Planarizations | 2007-05-29 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm | 2006-08-23 | Paper |
| Simple and Efficient Bilayer Cross Counting | 2006-04-03 | Paper |
| An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem | 2006-01-13 | Paper |
| SOFSEM 2005: Theory and Practice of Computer Science | 2005-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5465124 | 2005-08-22 | Paper |
| Inserting an edge into a planar graph | 2005-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808670 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043769 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043780 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472290 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472293 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471659 | 2004-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471661 | 2004-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4450516 | 2004-02-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449162 | 2004-02-08 | Paper |
| Optimal labeling of point features in rectangular labeling models | 2003-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422269 | 2003-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422278 | 2003-09-03 | Paper |
| A polyhedral approach to sequence alignment problems | 2002-11-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766818 | 2002-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766843 | 2002-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768302 | 2002-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4494408 | 2001-08-05 | Paper |
| An Alternative Method to Crossing Minimization on Hierarchical Graphs | 2001-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501703 | 2001-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263724 | 2000-11-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501694 | 2000-11-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234163 | 2000-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250191 | 2000-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263720 | 1999-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249523 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232783 | 1999-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4398382 | 1998-07-19 | Paper |
| The thickness of a minor-excluded class of graphs | 1998-05-13 | Paper |
| The thickness of graphs: A survey | 1998-04-26 | Paper |
| 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms | 1998-04-01 | Paper |
| Maximum planar subgraphs and nice embeddings: Practical layout tools | 1996-10-20 | Paper |
| On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm | 1996-10-20 | Paper |
