2024
Discovering Functional Dependencies through Hitting Set Enumeration.
Proc. ACM Manag. Data, February, 2024
Robust Parameter Fitting to Realistic Network Models via Iterative Stochastic Approximation (Data and Code).
Dataset, February, 2024
On the External Validity of Average-case Analyses of Graph Algorithms.
ACM Trans. Algorithms, January, 2024
Maximal cliques in scale-free random graphs.
Netw. Sci., 2024
Uniform Sampling of Negative Edge Weights in Shortest Path Networks.
CoRR, 2024
The Constrained Layer Tree Problem and Applications to Solar Farm Cabling.
CoRR, 2024
Weighted Embeddings for Low-Dimensional Graph Representation.
CoRR, 2024
Structure and Independence in Hyperbolic Uniform Disk Graphs.
CoRR, 2024
Robust Parameter Fitting to Realistic Network Models via Iterative Stochastic Approximation.
CoRR, 2024
2023
The impact of heterogeneity and geometry on the proof complexity of random satisfiability.
Random Struct. Algorithms, December, 2023
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry.
Algorithmica, December, 2023
Synchronized Planarity with Applications to Constrained Planarity Problems.
ACM Trans. Algorithms, October, 2023
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs.
Theory Comput. Syst., February, 2023
Recognizing Unit Disk Graphs in Hyperbolic Geometry is ∃R-Complete.
CoRR, 2023
The impact of geometry on monochrome regions in the flip Schelling process.
Comput. Geom., 2023
Partitioning the Bags of a Tree Decomposition into Cliques.
Proceedings of the 21st International Symposium on Experimental Algorithms, 2023
Strongly Hyperbolic Unit Disk Graphs.
Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023
Deterministic Performance Guarantees for Bidirectional BFS on Real-World Networks.
Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023
An Efficient Algorithm for Power Dominating Set.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023
On the Giant Component of Geometric Inhomogeneous Random Graphs.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023
Dynamic Flows with Time-Dependent Capacities.
Proceedings of the Algorithms and Complexity - 13th International Conference, 2023
2022
Efficiently generating geometric inhomogeneous and hyperbolic random graphs.
Netw. Sci., December, 2022
The complexity of dependency detection and discovery in relational databases.
Theor. Comput. Sci., 2022
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry.
ACM Trans. Algorithms, 2022
Efficiently enumerating hitting sets of hypergraphs arising in data profiling.
J. Comput. Syst. Sci., 2022
A Branch-And-Bound Algorithm for Cluster Editing.
Proceedings of the 20th International Symposium on Experimental Algorithms, 2022
An Efficient Branch-and-Bound Solver for Hitting Set.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2022
2021
Routing in Strongly Hyperbolic Unit Disk Graphs.
CoRR, 2021
The Flip Schelling Process on Random Geometric and Erdös-Rényi Graphs.
CoRR, 2021
Force-Directed Embedding of Scale-Free Networks in the Hyperbolic Plane.
Proceedings of the 19th International Symposium on Experimental Algorithms, 2021
PACE Solver Description: KaPoCE: A Heuristic Cluster Editing Algorithm.
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021
PACE Solver Description: The KaPoCE Exact Cluster Editing Algorithm.
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021
Efficiently Computing Maximum Flows in Scale-Free Networks.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021
2020
Hitting Set Enumeration with Partial Information for Unique Column Combination Discovery.
Proc. VLDB Endow., 2020
Hyperbolic Embeddings for Near-Optimal Greedy Routing.
ACM J. Exp. Algorithmics, 2020
The Minimization of Random Hypergraphs.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020
A Strategic Routing Framework and Algorithms for Computing Alternative Paths.
,
,
,
,
,
,
,
,
,
,
,
Proceedings of the 20th Symposium on Algorithmic Approaches for Transportation Modelling, 2020
2019
How to Draw a Planarization.
J. Graph Algorithms Appl., 2019
Understanding the Effectiveness of Data Reduction in Public Transportation Networks.
Proceedings of the Algorithms and Models for the Web Graph - 16th International Workshop, 2019
On the Empirical Time Complexity of Scale-Free 3-SAT at the Phase Transition.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2019
2018
Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane.
IEEE/ACM Trans. Netw., 2018
Scalable exact visualization of isocontours in road networks via minimum-link paths.
J. Comput. Geom., 2018
Local and union boxicity.
Discret. Math., 2018
On the Enumeration of Minimal Hitting Sets in Lexicographical Order.
CoRR, 2018
Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices.
Algorithmica, 2018
Cliques in Hyperbolic Random Graphs.
Algorithmica, 2018
Towards a Systematic Evaluation of Generative Network Models.
Proceedings of the Algorithms and Models for the Web Graph - 15th International Workshop, 2018
Memory-Restricted Routing with Tiled Map Data.
Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, 2018
2017
Demonstrating TrussFab's Editor: Designing Sturdy Large-Scale Structures.
,
,
,
,
,
,
,
,
,
,
Proceedings of the Adjunct Publication of the 30th Annual ACM Symposium on User Interface Software and Technology, 2017
TrussFab: Fabricating Sturdy Large-Scale Structures on Desktop 3D Printers.
,
,
,
,
,
,
,
,
,
,
,
,
Proceedings of the 2017 CHI Conference on Human Factors in Computing Systems, 2017
2016
A new perspective on clustered planarity as a combinatorial embedding problem.
Theor. Comput. Sci., 2016
Optimal Orthogonal Graph Drawing with Convex Bend Costs.
ACM Trans. Algorithms, 2016
Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems.
ACM Trans. Algorithms, 2016
Scalable Isocontour Visualization in Road Networks via Minimum-Link Paths.
CoRR, 2016
Orthogonal graph drawing with inflexible edges.
Comput. Geom., 2016
The Parameterized Complexity of Dependency Detection in Relational Databases.
Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016
Hyperbolic Random Graphs: Separators and Treewidth.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016
2015
New Approaches to Classic Graph-Embedding Problems - Orthogonal Drawings & Constrained Planarity.
PhD thesis, 2015
Disconnectivity and relative positions in simultaneous embeddings.
Comput. Geom., 2015
Neue Methoden für klassische Grapheinbettungsprobleme - Orthogonale Zeichnungen & bedingte Planarität.
Proceedings of the Ausgezeichnete Informatikdissertationen 2015, 2015
Pixel and Voxel Representations of Graphs.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015
2014
Testing Mutual duality of Planar graphs.
Int. J. Comput. Geom. Appl., 2014
Orthogonal Graph Drawing with Flexibility Constraints.
Algorithmica, 2014
Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model.
Proceedings of the Algorithms - ESA 2014, 2014
2013
Simultaneous Embedding of Planar Graphs.
Proceedings of the Handbook on Graph Drawing and Visualization., 2013
Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings.
Proceedings of the Graph Drawing - 21st International Symposium, 2013
2012
Simultaneous Embedding of Planar Graphs
CoRR, 2012