| 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
Lecture Notes in Computer Science | 2024-02-16 | Paper |
| scientific article; zbMATH DE number 7803605 (Why is no real title available?) | 2024-02-12 | Paper |
| scientific article; zbMATH DE number 7803609 (Why is no real title available?) | 2024-02-12 | Paper |
| scientific article; zbMATH DE number 7788342 (Why is no real title available?) | 2024-01-15 | Paper |
| scientific article; zbMATH DE number 7788602 (Why is no real title available?) | 2024-01-15 | Paper |
Deterministic performance guarantees for bidirectional BFS on real-world networks
Lecture Notes in Computer Science | 2023-12-22 | Paper |
Efficiently approximating vertex cover on scale-free networks with underlying hyperbolic geometry
Algorithmica | 2023-12-13 | Paper |
The impact of heterogeneity and geometry on the proof complexity of random satisfiability
Random Structures & Algorithms | 2023-11-07 | Paper |
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry
ACM Transactions on Algorithms | 2023-10-31 | Paper |
Synchronized Planarity with Applications to Constrained Planarity Problems
ACM Transactions on Algorithms | 2023-10-23 | Paper |
Dynamic flows with time-dependent capacities
Lecture Notes in Computer Science | 2023-10-04 | Paper |
Synchronized planarity with applications to constrained planarity problems
(available as arXiv preprint) | 2023-09-20 | Paper |
Efficiently Computing Maximum Flows in Scale-Free Networks.
(available as arXiv preprint) | 2023-09-20 | Paper |
| Efficiently approximating vertex cover on scale-free networks with underlying hyperbolic geometry | 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
ACM Journal of Experimental Algorithmics | 2023-05-23 | Paper |
Solving vertex cover in polynomial time on hyperbolic random graphs
Theory of Computing Systems | 2023-04-27 | Paper |
Towards a Systematic Evaluation of Generative Network Models
Lecture Notes in Computer Science | 2023-03-09 | Paper |
scientific article; zbMATH DE number 7651160 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
Solving vertex cover in polynomial time on hyperbolic random graphs
(available as arXiv preprint) | 2023-02-07 | Paper |
The impact of geometry on monochrome regions in the flip Schelling process
Computational Geometry | 2022-10-06 | Paper |
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs.
(available as arXiv preprint) | 2022-05-11 | Paper |
The complexity of dependency detection and discovery in relational databases
Theoretical Computer Science | 2021-12-22 | Paper |
Efficiently enumerating hitting sets of hypergraphs arising in data profiling
Journal of Computer and System Sciences | 2021-11-25 | Paper |
Efficient shortest paths in scale-free networks with underlying hyperbolic geometry
(available as arXiv preprint) | 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
(available as arXiv preprint) | 2019-10-01 | Paper |
How to draw a planarization
Journal of Graph Algorithms and Applications | 2019-09-16 | Paper |
Efficiently enumerating hitting sets of hypergraphs arising in data profiling
2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-13 | Paper |
Hyperbolic Embeddings for Near-Optimal Greedy Routing
2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Simultaneous PQ-ordering with applications to constrained embedding problems
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Scalable exact visualization of isocontours in road networks via minimum-link paths
(available as arXiv preprint) | 2019-02-27 | Paper |
Optimal orthogonal graph drawing with convex bend costs
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Simultaneous PQ-ordering with applications to constrained embedding problems
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Cliques in hyperbolic random graphs
Algorithmica | 2018-07-25 | Paper |
Simultaneous embedding: edge orderings, relative positions, cutvertices
Algorithmica | 2018-05-23 | Paper |
| The parameterized complexity of dependency detection in relational databases | 2018-04-10 | Paper |
Local and union boxicity
Discrete Mathematics | 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
Computational Geometry | 2018-01-19 | Paper |
How to draw a planarization
SOFSEM 2017: Theory and Practice of Computer Science | 2017-04-04 | Paper |
Pixel and voxel representations of graphs
Lecture Notes in Computer Science | 2017-02-10 | Paper |
A new perspective on clustered planarity as a combinatorial embedding problem
Theoretical Computer Science | 2015-12-08 | Paper |
Orthogonal graph drawing with inflexible edges
Lecture Notes in Computer Science | 2015-09-21 | Paper |
Testing mutual duality of planar graphs
International Journal of Computational Geometry & Applications | 2015-07-01 | Paper |
Disconnectivity and relative positions in simultaneous embeddings
Computational Geometry | 2015-06-17 | Paper |
Orthogonal graph drawing with flexibility constraints
Algorithmica | 2014-12-02 | Paper |
Complexity of higher-degree orthogonal graph embedding in the Kandinsky model
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Testing Mutual Duality of Planar Graphs
Algorithms and Computation | 2014-01-14 | Paper |
Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings
Graph Drawing | 2013-12-20 | Paper |
Simultaneous embedding: edge orderings, relative positions, cutvertices
Lecture Notes in Computer Science | 2013-12-20 | Paper |
Optimal Orthogonal Graph Drawing with Convex Bend Costs
Automata, Languages, and Programming | 2013-08-06 | Paper |
Disconnectivity and relative positions in simultaneous embeddings
Graph Drawing | 2013-04-03 | Paper |
Orthogonal graph drawing with flexibility constraints
Graph Drawing | 2011-02-11 | Paper |
