Thomas Bläsius

Philipp Fischbeck

ACM Trans. Algorithms, January, 2024

Robust Parameter Fitting to Realistic Network Models via Iterative Stochastic Approximation.

[BibT_eX]

[DOI]

CoRR, 2024

2023

The impact of heterogeneity and geometry on the proof complexity of random satisfiability.

[BibT_eX]

[DOI]

Random Struct. Algorithms, December, 2023

Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry.

[BibT_eX]

[DOI]

Algorithmica, December, 2023

Synchronized Planarity with Applications to Constrained Planarity Problems.

[BibT_eX]

[DOI]

Simon D. Fink

ACM Trans. Algorithms, October, 2023

Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs.

[BibT_eX]

[DOI]

Theory Comput. Syst., February, 2023

Maximal Cliques in Scale-Free Random Graphs.

[BibT_eX]

[DOI]

Clara Stegehuis

CoRR, 2023

Recognizing Unit Disk Graphs in Hyperbolic Geometry is ∃R-Complete.

[BibT_eX]

[DOI]

CoRR, 2023

The impact of geometry on monochrome regions in the flip Schelling process.

[BibT_eX]

[DOI]

Comput. Geom., 2023

Partitioning the Bags of a Tree Decomposition into Cliques.

[BibT_eX]

[DOI]

Marcus Wilhelm

Proceedings of the 21st International Symposium on Experimental Algorithms, 2023

Strongly Hyperbolic Unit Disk Graphs.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

Deterministic Performance Guarantees for Bidirectional BFS on Real-World Networks.

[BibT_eX]

[DOI]

Marcus Wilhelm

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

An Efficient Algorithm for Power Dominating Set.

[BibT_eX]

[DOI]

Max Göttlicher

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

On the Giant Component of Geometric Inhomogeneous Random Graphs.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Dynamic Flows with Time-Dependent Capacities.

[BibT_eX]

[DOI]

Adrian Feilhauer

Jannik Westenfelder

Proceedings of the Algorithms and Complexity - 13th International Conference, 2023

2022

Efficiently generating geometric inhomogeneous and hyperbolic random graphs.

[BibT_eX]

[DOI]

Netw. Sci., December, 2022

The complexity of dependency detection and discovery in relational databases.

[BibT_eX]

[DOI]

Martin Schirneck

Theor. Comput. Sci., 2022

Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry.

[BibT_eX]

[DOI]

Felix Montenegro-Retana

Marianne Thieffry

ACM Trans. Algorithms, 2022

Efficiently enumerating hitting sets of hypergraphs arising in data profiling.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2022

A Branch-And-Bound Algorithm for Cluster Editing.

[BibT_eX]

[DOI]

Proceedings of the 20th International Symposium on Experimental Algorithms, 2022

An Efficient Branch-and-Bound Solver for Hitting Set.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2022

2021

Routing in Strongly Hyperbolic Unit Disk Graphs.

[BibT_eX]

[DOI]

CoRR, 2021

The Flip Schelling Process on Random Geometric and Erdös-Rényi Graphs.

[BibT_eX]

[DOI]

CoRR, 2021

Force-Directed Embedding of Scale-Free Networks in the Hyperbolic Plane.

[BibT_eX]

[DOI]

Proceedings of the 19th International Symposium on Experimental Algorithms, 2021

PACE Solver Description: KaPoCE: A Heuristic Cluster Editing Algorithm.

[BibT_eX]

[DOI]

Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

PACE Solver Description: The KaPoCE Exact Cluster Editing Algorithm.

[BibT_eX]

[DOI]

Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

Efficiently Computing Maximum Flows in Scale-Free Networks.

[BibT_eX]

[DOI]

Christopher Weyand

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020

Hitting Set Enumeration with Partial Information for Unique Column Combination Discovery.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2020

Hyperbolic Embeddings for Near-Optimal Greedy Routing.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2020

The Minimization of Random Hypergraphs.

[BibT_eX]

[DOI]

Martin Schirneck

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

A Strategic Routing Framework and Algorithms for Computing Alternative Paths.

[BibT_eX]

[DOI]

Proceedings of the 20th Symposium on Algorithmic Approaches for Transportation Modelling, 2020

2019

How to Draw a Planarization.

[BibT_eX]

[DOI]

Marcel Radermacher

J. Graph Algorithms Appl., 2019

Understanding the Effectiveness of Data Reduction in Public Transportation Networks.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Andrew M. Sutton

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.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2018

Scalable exact visualization of isocontours in road networks via minimum-link paths.

[BibT_eX]

[DOI]

J. Comput. Geom., 2018

Local and union boxicity.

[BibT_eX]

[DOI]

Peter Stumpf

Torsten Ueckerdt

Discret. Math., 2018

On the Enumeration of Minimal Hitting Sets in Lexicographical Order.

[BibT_eX]

[DOI]

CoRR, 2018

Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices.

[BibT_eX]

[DOI]

Annette Karrer

Algorithmica, 2018

Cliques in Hyperbolic Random Graphs.

[BibT_eX]

[DOI]

Anton Krohmer

Algorithmica, 2018

Towards a Systematic Evaluation of Generative Network Models.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web Graph - 15th International Workshop, 2018

Memory-Restricted Routing with Tiled Map Data.

[BibT_eX]

[DOI]

J. A. Gregor Lagodzinski

Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, 2018

2017

Demonstrating TrussFab's Editor: Designing Sturdy Large-Scale Structures.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Optimal Orthogonal Graph Drawing with Convex Bend Costs.

[BibT_eX]

[DOI]

Dorothea Wagner

ACM Trans. Algorithms, 2016

Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2016

Scalable Isocontour Visualization in Road Networks via Minimum-Link Paths.

[BibT_eX]

[DOI]

CoRR, 2016

Orthogonal graph drawing with inflexible edges.

[BibT_eX]

[DOI]

Sebastian Lehmann

Comput. Geom., 2016

The Parameterized Complexity of Dependency Detection in Relational Databases.

[BibT_eX]

[DOI]

Martin Schirneck

Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

Hyperbolic Random Graphs: Separators and Treewidth.

[BibT_eX]

[DOI]

Anton Krohmer

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

2015

New Approaches to Classic Graph-Embedding Problems - Orthogonal Drawings & Constrained Planarity.

[BibT_eX]

[DOI]

PhD thesis, 2015

Disconnectivity and relative positions in simultaneous embeddings.

[BibT_eX]

[DOI]

Comput. Geom., 2015

Neue Methoden für klassische Grapheinbettungsprobleme - Orthogonale Zeichnungen & bedingte Planarität.

[BibT_eX]

[DOI]

Proceedings of the Ausgezeichnete Informatikdissertationen 2015, 2015

Pixel and Voxel Representations of Graphs.

[BibT_eX]

[DOI]

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

2014

Testing Mutual duality of Planar graphs.

[BibT_eX]

[DOI]

Patrizio Angelini

Int. J. Comput. Geom. Appl., 2014

Orthogonal Graph Drawing with Flexibility Constraints.

[BibT_eX]

[DOI]

Algorithmica, 2014

Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model.

[BibT_eX]

[DOI]

Guido Brückner

Proceedings of the Algorithms - ESA 2014, 2014

2013

Simultaneous Embedding of Planar Graphs.

[BibT_eX]

Stephen G. Kobourov

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

Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings.

[BibT_eX]

[DOI]

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

2012

Simultaneous Embedding of Planar Graphs

[BibT_eX]

[DOI]

Stephen G. Kobourov