Markus Chimani

Max Ilsen

J. Graph Algorithms Appl., 2023

Inserting Multiple Edges into a Planar Graph.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2023

Proceedings of the 31st International Symposium on Graph Drawing and Network Visualization (GD 2023).

[BibT_eX]

[DOI]

Michael A. Bekos

CoRR, 2023

Planar L-Drawings of Directed Graphs.

[BibT_eX]

[DOI]

Comput. Geom. Topol., 2023

Multistage Shortest Path: Instances and Practical Evaluation.

[BibT_eX]

[DOI]

Proceedings of the 2nd Symposium on Algorithmic Foundations of Dynamic Networks, 2023

Green Traffic Engineering by Line Card Minimization.

[BibT_eX]

[DOI]

Proceedings of the 48th IEEE Conference on Local Computer Networks, 2023

A general approximation for multistage subgraph problems.

[BibT_eX]

[DOI]

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

Capacity-Preserving Subgraphs of Directed Flow Networks.

[BibT_eX]

[DOI]

Max Ilsen

Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

2022

Crossing numbers of beyond-planar graphs.

[BibT_eX]

[DOI]

Philipp Kindermann

Pavel Valtr

Theor. Comput. Sci., 2022

On the rectangular knapsack problem.

[BibT_eX]

[DOI]

Fritz Bökler

Mirko H. Wagner

Math. Methods Oper. Res., 2022

Properties of Large 2-Crossing-Critical Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2022

Approximating Multistage Matching Problems.

[BibT_eX]

[DOI]

Algorithmica, 2022

Spanner Approximations in Practice.

[BibT_eX]

[DOI]

Finn Stutzenstein

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Failure Resiliency With Only a Few Tunnels - Enabling Segment Routing for Traffic Engineering.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2021

On the Dominant of the Multicut Polytope.

[BibT_eX]

[DOI]

CoRR, 2021

A General Approach to Approximate Multistage Subgraph Problems.

[BibT_eX]

[DOI]

CoRR, 2021

2020

Maximum Cut Parameterized by Crossing Number.

[BibT_eX]

[DOI]

Christine Dahn

Nils M. Kriege

J. Graph Algorithms Appl., 2020

Toroidal grid minors and stretch in embedded graphs.

[BibT_eX]

[DOI]

Gelasio Salazar

J. Comb. Theory, Ser. B, 2020

On the Bond Polytope.

[BibT_eX]

[DOI]

CoRR, 2020

Crossing Number for Graphs with Bounded Pathwidth.

[BibT_eX]

[DOI]

Algorithmica, 2020

An Experimental Study of ILP Formulations for the Longest Induced Path Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020

A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs.

[BibT_eX]

[DOI]

Joachim Spoerhase

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

Approximating Multiobjective Shortest Path in Practice.

[BibT_eX]

[DOI]

Fritz Bökler

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2020

2019

Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments.

[BibT_eX]

[DOI]

Ivo Hedtke

ACM J. Exp. Algorithmics, 2019

Strong Steiner Tree Approximations in Practice.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2019

Advances on Testing C-Planarity of Embedded Flat Clustered Graphs.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2019

Cut Polytopes of Minor-free Graphs.

[BibT_eX]

[DOI]

Tim Römer

CoRR, 2019

Failure Resilient Traffic Engineering Using Segment Routing.

[BibT_eX]

[DOI]

Proceedings of the 44th IEEE Conference on Local Computer Networks, 2019

Computing Stable Demers Cartograms.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Stronger ILPs for the Graph Genus Problem.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018

Traffic Engineering Using Segment Routing and Considering Requirements of a Carrier IP Network.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2018

On the Maximum Crossing Number.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2018

On the Practical Irrelevance of Metrics on Segment Routing Traffic Engineering optimization.

[BibT_eX]

[DOI]

Proceedings of the 43rd IEEE Conference on Local Computer Networks, 2018

Crossing Numbers and Stress of Random Graphs.

[BibT_eX]

[DOI]

Hanna Döring

Matthias Reitzner

Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs Fast.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus.

[BibT_eX]

[DOI]

Ioannis G. Tollis

J. Graph Algorithms Appl., 2017

A tighter insertion-based approximation of the crossing number.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

Predictive Traffic Engineering with 2-Segment Routing Considering Requirements of a Carrier IP Network.

[BibT_eX]

[DOI]

Proceedings of the 42nd IEEE Conference on Local Computer Networks, 2017

2016

Planarisation and Crossing Minimisation.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

A Practical Method for the Minimum Genus of a Graph: Models and Experiments.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem.

[BibT_eX]

[DOI]

Ivo Hedtke

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

A Note on the Practicality of Maximal Planar Subgraph Algorithms.

[BibT_eX]

[DOI]

Karsten Klein

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

Placing Arrows in Directed Graph Drawings.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

An ILP-based Proof System for the Crossing Number Problem.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

Approximating Spanning Trees with Few Branches.

[BibT_eX]

[DOI]

Joachim Spoerhase

Theory Comput. Syst., 2015

Hypergraph and Minor Crossing Number Problems.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2015

Upward Planarity Testing in Practice: SAT Formulations and Comparative Study.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2015

Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees.

[BibT_eX]

[DOI]

Joachim Spoerhase

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

2-Layer Fan-Planarity: From Caterpillar to Stegosaurus.

[BibT_eX]

[DOI]

Ioannis G. Tollis

Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

Speedy Colorful Subtrees.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

The Influence of Preprocessing on Steiner Tree Approximations.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2015

2014

Computing the Stretch of an Embedded Graph.

[BibT_eX]

[DOI]

Sergio Cabello

SIAM J. Discret. Math., 2014

Steiner Tree 1.39-Approximation in Practice.

[BibT_eX]

[DOI]

Proceedings of the Mathematical and Engineering Methods in Computer Science, 2014

How to eat a graph: computing selection sequences for the continuous generalization of road networks.

[BibT_eX]

[DOI]

Thomas C. van Dijk

Jan-Henrik Haunert

Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2014

An Exact Approach to Upward Crossing Minimization.

[BibT_eX]

[DOI]

Proceedings of the 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments, 2014

2013

The Open Graph Drawing Framework (OGDF).

[BibT_eX]

Proceedings of the Handbook on Graph Drawing and Visualization., 2013

Crossings and Planarization.

[BibT_eX]

Proceedings of the Handbook on Graph Drawing and Visualization., 2013

Multi-level Verticality Optimization: Concept, Strategies, and Drawing Scheme.

[BibT_eX]

[DOI]

Philipp Hungerländer

J. Graph Algorithms Appl., 2013

Exact Approaches to Multilevel Vertical Orderings.

[BibT_eX]

[DOI]

Philipp Hungerländer

INFORMS J. Comput., 2013

2-InterConnected Facility Location: Specification, Complexity, and Exact Solutions.

[BibT_eX]

[DOI]

Maria Kandyba

Maren Martens

Electron. Notes Discret. Math., 2013

Crossing number additivity over edge cuts.

[BibT_eX]

[DOI]

Drago Bokal

Jesús Leaños

Eur. J. Comb., 2013

How not to characterize planar-emulable graphs.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2013

Upward Planarity Testing: A Computational Study.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 21st International Symposium, 2013

2012

Advances in the Planarization Method: Effective Multiple Edge Insertions.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2012

Improved Steiner tree algorithms for bounded treewidth.

[BibT_eX]

[DOI]

Bernd Zey

J. Discrete Algorithms, 2012

Vertex insertion approximates the crossing number of apex graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2012

Fast alignment of fragmentation trees.

[BibT_eX]

[DOI]

Bioinform., 2012

Upward Planarity Testing via SAT.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 20th International Symposium, 2012

Shrinking the Search Space for Clustered Planarity.

[BibT_eX]

[DOI]

Karsten Klein

Proceedings of the Graph Drawing - 20th International Symposium, 2012

2011

Facets in the Crossing Number Polytope.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2011

Upward Planarization Layout.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2011

An SDP approach to multi-level crossing minimization.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2011

Contraction-Based Steiner Tree Approximations in Practice.

[BibT_eX]

[DOI]

Matthias Woste

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

A Closer Look at the Closest String and Closest Substring Problem.

[BibT_eX]

[DOI]

Matthias Woste

Sebastian Böcker

Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments, 2011

2010

Orientation-based models for {0, 1, 2}-survivable network design: theory and practice.

[BibT_eX]

[DOI]

Math. Program., 2010

Layer-free upward crossing minimization.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2010

Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Crossing Minimization and Layouts of Directed Hypergraphs with Port Constraints.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 18th International Symposium, 2010

Exact ILP solutions for phylogenetic minimum flip problems.

[BibT_eX]

[DOI]

Sven Rahmann

Sebastian Böcker

Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology, 2010

Algorithm Engineering: Concepts and Practice.

[BibT_eX]

[DOI]

Karsten Klein

Proceedings of the Experimental Methods for the Analysis of Optimization Algorithms., 2010

2009

Computing crossing numbers

[BibT_eX]

[DOI]

PhD thesis, 2009

Obtaining optimal <i>k</i>-cardinality trees fast.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2009

Experiments on exact crossing minimization using column generation.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2009

Non-planar core reduction of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2009

Inserting a vertex into a planar graph.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008

A branch-and-cut approach to the crossing number problem.

[BibT_eX]

[DOI]

Discret. Optim., 2008

Computing Crossing Numbers: Berechnen von Kreuzungszahlen.

[BibT_eX]

[DOI]

Proceedings of the Ausgezeichnete Informatikdissertationen 2008, 2008

Approximating the Crossing Number of Apex Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 16th International Symposium, 2008

Computing Maximum C-Planar Subgraphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 16th International Symposium, 2008

A New Approach to Exact Crossing Minimization.

[BibT_eX]

[DOI]

Immanuel M. Bomze

Proceedings of the Algorithms, 2008

Strong Formulations for 2-Node-Connected Steiner Network Problems.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2008

Crossing Minimization meets Simultaneous Drawing.

[BibT_eX]

[DOI]

Michael Jünger

Michael Schulz

Proceedings of the IEEE VGTC Pacific Visualization Symposium 2008, 2008

Obtaining Optimal k-Cardinality Trees Fast.

[BibT_eX]

[DOI]

Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments, 2008

2007

On the Minimum Cut of Planarizations.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

Algorithms for the Hypergraph and the Minor Crossing Number Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Hybrid Numerical Optimization for Combinatorial Network Problems.

[BibT_eX]

[DOI]

Maria Kandyba

Mike Preuss

Proceedings of the Hybrid Metaheuristics, 4th International Workshop, 2007

Efficient Extraction of Multiple Kuratowski Subdivisions.

[BibT_eX]

[DOI]

Jens M. Schmidt

Proceedings of the Graph Drawing, 15th International Symposium, 2007

A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks.

[BibT_eX]

[DOI]

Maria Kandyba

Proceedings of the Algorithms, 2007

2006

DiamondHelp: a new interaction design for networked home appliances.

[BibT_eX]

[DOI]

Pers. Ubiquitous Comput., 2006

2005

Non-planar Orthogonal Drawings with Fixed Topology.

[BibT_eX]

[DOI]