research
∙
09/11/2023
Proceedings of the 31st International Symposium on Graph Drawing and Network Visualization (GD 2023)
This is the arXiv index for the electronic proceedings of GD 2023, which...
share
research
∙
06/01/2023
Green Traffic Engineering by Line Card Minimization
Green Traffic Engineering encompasses network design and traffic routing...
research
∙
03/30/2023
Capacity-Preserving Subgraphs of Directed Flow Networks
We introduce and discuss the Minimum Capacity-Preserving Subgraph (MCPS)...
research
∙
12/09/2021
Properties of Large 2-Crossing-Critical Graphs
A c-crossing-critical graph is one that has crossing number at least c b...
research
∙
12/02/2021
On the Dominant of the Multicut Polytope
Given a graph G=(V,E) and a set S ⊆V2 of terminal pairs, the minimum mul...
research
∙
08/25/2021
Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
We present a thorough experimental evaluation of several crossing minimi...
research
∙
07/06/2021
A General Approach to Approximate Multistage Subgraph Problems
In a Subgraph Problem we are given some graph and want to find a feasibl...
research
∙
07/05/2021
Spanner Approximations in Practice
A multiplicative α-spanner H is a subgraph of G=(V,E) with the same vert...
research
∙
12/11/2020
On the Bond Polytope
Given a graph G=(V,E), the maximum bond problem searches for a maximum c...
research
∙
02/17/2020
An Experimental Study of ILP Formulations for the Longest Induced Path Problem
Given a graph G=(V,E), the longest induced path problem asks for a maxim...
research
∙
02/17/2020
Approximating Multistage Matching Problems
In multistage perfect matching problems we are given a sequence of graph...
research
∙
08/20/2019
Computing Stable Demers Cartograms
Cartograms are popular for visualizing numerical data for map regions. M...
research
∙
08/08/2019
Crossing Numbers of Beyond-Planar Graphs
We study the 1-planar, quasi-planar, and fan-planar crossing number in c...
research
∙
03/14/2019
Maximum Cut Parameterized by Crossing Number
Given an edge-weighted graph G on n nodes, the NP-hard Max-Cut problem a...
research
∙
03/05/2019
Cut Polytopes of Minor-free Graphs
The cut polytope of a graph G is the convex hull of the indicator vector...
research
∙
08/22/2018
Crossing Numbers and Stress of Random Graphs
Consider a random geometric graph over a random point process in R^d. Tw...
research
∙
08/14/2018
A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs
We propose a very simple and natural approximation algorithm for the pro...
research
∙
06/21/2018
Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs Fast
The NP-hard Maximum Planar Subgraph problem asks for a planar subgraph H...
research
∙
04/19/2018
Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments
Given a graph G, the NP-hard Maximum Planar Subgraph problem asks for a ...
research
∙
08/30/2017