| Publication | Date of Publication | Type |
|---|
| On the giant component of geometric inhomogeneous random graphs | 2025-01-06 | Paper |
| An efficient algorithm for power dominating set | 2025-01-06 | Paper |
| Strongly hyperbolic unit disk graphs | 2024-10-08 | Paper |
| A strategic routing framework and algorithms for computing alternative paths | 2024-08-13 | Paper |
| An efficient branch-and-bound solver for hitting set | 2024-05-24 | Paper |
| Understanding the effectiveness of data reduction in public transportation networks | 2024-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6192496 | 2024-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6192508 | 2024-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147250 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147530 | 2024-01-15 | Paper |
| Deterministic performance guarantees for bidirectional BFS on real-world networks | 2023-12-22 | Paper |
| Efficiently approximating vertex cover on scale-free networks with underlying hyperbolic geometry | 2023-12-13 | Paper |
| The impact of heterogeneity and geometry on the proof complexity of random satisfiability | 2023-11-07 | Paper |
| Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry | 2023-10-31 | Paper |
| Synchronized Planarity with Applications to Constrained Planarity Problems | 2023-10-23 | Paper |
| Dynamic flows with time-dependent capacities | 2023-10-04 | Paper |
| Efficiently approximating vertex cover on scale-free networks with underlying hyperbolic geometry | 2023-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6075906 | 2023-09-20 | Paper |
| Efficiently Computing Maximum Flows in Scale-Free Networks. | 2023-09-20 | Paper |
| Maximal Cliques in Scale-Free Random Graphs | 2023-09-06 | Paper |
| Force-Directed Embedding of Scale-Free Networks in the Hyperbolic Plane | 2023-06-23 | Paper |
| Hyperbolic Embeddings for Near-Optimal Greedy Routing | 2023-05-23 | Paper |
| Solving vertex cover in polynomial time on hyperbolic random graphs | 2023-04-27 | Paper |
| Towards a Systematic Evaluation of Generative Network Models | 2023-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874488 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874296 | 2023-02-07 | Paper |
| The impact of geometry on monochrome regions in the flip Schelling process | 2022-10-06 | Paper |
| Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. | 2022-05-11 | Paper |
| The complexity of dependency detection and discovery in relational databases | 2021-12-22 | Paper |
| Efficiently enumerating hitting sets of hypergraphs arising in data profiling | 2021-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002689 | 2021-07-28 | Paper |
| The Flip Schelling Process on Random Geometric and Erd\"os-R\'enyi Graphs | 2021-02-19 | Paper |
| The Minimization of Random Hypergraphs | 2019-10-01 | Paper |
| How to Draw a Planarization | 2019-09-16 | Paper |
| Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling | 2019-09-13 | Paper |
| Hyperbolic Embeddings for Near-Optimal Greedy Routing | 2019-09-12 | Paper |
| Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems | 2019-05-15 | Paper |
| Scalable exact visualization of isocontours in road networks via minimum-link paths | 2019-02-27 | Paper |
| Optimal Orthogonal Graph Drawing with Convex Bend Costs | 2018-11-05 | Paper |
| Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems | 2018-10-30 | Paper |
| Cliques in hyperbolic random graphs | 2018-07-25 | Paper |
| Simultaneous embedding: edge orderings, relative positions, cutvertices | 2018-05-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4634389 | 2018-04-10 | Paper |
| Local and union boxicity | 2018-04-05 | Paper |
| Hyperbolic Random Graphs: Separators and Treewidth | 2018-03-02 | Paper |
| Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane | 2018-03-02 | Paper |
| Orthogonal graph drawing with inflexible edges | 2018-01-19 | Paper |
| How to Draw a Planarization | 2017-04-04 | Paper |
| Pixel and Voxel Representations of Graphs | 2017-02-10 | Paper |
| A new perspective on clustered planarity as a combinatorial embedding problem | 2015-12-08 | Paper |
| Orthogonal Graph Drawing with Inflexible Edges | 2015-09-21 | Paper |
| TESTING MUTUAL DUALITY OF PLANAR GRAPHS | 2015-07-01 | Paper |
| Disconnectivity and relative positions in simultaneous embeddings | 2015-06-17 | Paper |
| Orthogonal graph drawing with flexibility constraints | 2014-12-02 | Paper |
| Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model | 2014-10-08 | Paper |
| Testing Mutual Duality of Planar Graphs | 2014-01-14 | Paper |
| Simultaneous embedding: edge orderings, relative positions, cutvertices | 2013-12-20 | Paper |
| Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings | 2013-12-20 | Paper |
| Optimal Orthogonal Graph Drawing with Convex Bend Costs | 2013-08-06 | Paper |
| Disconnectivity and Relative Positions in Simultaneous Embeddings | 2013-04-03 | Paper |
| Orthogonal Graph Drawing with Flexibility Constraints | 2011-02-11 | Paper |
