| Publication | Date of Publication | Type |
|---|
| Output-sensitive reporting of disjoint paths (extended abstract) | 2024-01-29 | Paper |
| On-line convex planarity testing | 2024-01-05 | Paper |
| How to draw a series-parallel digraph | 2022-12-09 | Paper |
| Checking the convexity of polytopes and the planarity of subdivisions (extended abstract) | 2022-08-19 | Paper |
| Dynamic planar point location with optimal query time | 2022-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743386 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4643870 | 2018-05-29 | Paper |
| Drawing with colors | 2017-12-05 | Paper |
| Zero-Knowledge Accumulators and Set Algebra | 2017-01-06 | Paper |
| Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees | 2016-10-21 | Paper |
| Area requirement of visibility representations of trees | 2016-05-26 | Paper |
| Authenticated hash tables based on cryptographic accumulators | 2016-03-29 | Paper |
| Zero-Knowledge Authenticated Order Queries and Order Statistics on a List | 2016-03-10 | Paper |
| Reinventing the wheel | 2015-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2935981 | 2014-12-30 | Paper |
| The Melbourne Shuffle: Improving Oblivious Storage in the Cloud | 2014-07-01 | Paper |
| Streaming Authenticated Data Structures | 2013-05-31 | Paper |
| Graph Drawing in the Cloud: Privately Visualizing Relational Data Using Small Working Storage | 2013-04-03 | Paper |
| Signatures of Correct Computation | 2013-03-18 | Paper |
| Optimal Verification of Operations on Dynamic Sets | 2011-08-12 | Paper |
| Efficient authenticated data structures for graph connectivity and geometric search problems | 2011-06-30 | Paper |
| Optimal Authenticated Data Structures with Multilinear Forms | 2010-11-26 | Paper |
| Reliable Resource Searching in P2P Networks | 2010-04-24 | Paper |
| Efficient Content Authentication in Peer-to-Peer Networks | 2009-03-10 | Paper |
| An experimental comparison of four graph drawing algorithms. | 2008-04-25 | Paper |
| Super-Efficient Verification of Dynamic Outsourced Databases | 2008-04-24 | Paper |
| Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures | 2008-03-25 | Paper |
| Indexing Information for Data Forensics | 2007-09-24 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Financial Cryptography and Data Security | 2005-12-22 | Paper |
| Advances in Cryptology – CRYPTO 2004 | 2005-08-23 | Paper |
| A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING | 2005-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3154375 | 2004-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3047574 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043758 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472288 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472300 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448416 | 2004-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4446073 | 2004-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418544 | 2003-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4408458 | 2003-06-29 | Paper |
| A User Study in Similarity Measures for Graph Drawing | 2003-06-23 | Paper |
| Optimizing area and aspect ratio in straight-line orthogonal tree drawings | 2003-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4789076 | 2003-01-23 | Paper |
| Incremental convex planarity testing | 2003-01-14 | Paper |
| On the Computational Complexity of Upward and Rectilinear Planarity Testing | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2757736 | 2001-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753952 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945522 | 2001-04-20 | Paper |
| DRAWING DIRECTED ACYCLIC GRAPHS: AN EXPERIMENTAL STUDY | 2001-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4788597 | 2001-01-01 | Paper |
| Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms | 2000-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501693 | 2000-11-16 | Paper |
| Turn-regularity and optimal area drawings of orthogonal representations | 2000-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234136 | 1999-11-03 | Paper |
| Visualizing geometric algorithms over the Web | 1999-05-03 | Paper |
| Advances in the theory and practice of graph drawing | 1999-04-28 | Paper |
| Checking the convexity of polytopes and the planarity of subdivisions | 1999-04-11 | Paper |
| Output-sensitive reporting of disjoint paths | 1999-03-30 | Paper |
| Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design | 1999-02-22 | Paper |
| Constraints in graph drawing algorithms | 1998-10-05 | Paper |
| Dynamic Trees and Dynamic Point Location | 1998-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4401034 | 1998-08-02 | Paper |
| Optimal Upward Planarity Testing of Single-Source Digraphs | 1998-05-10 | Paper |
| Optimal Shortest Path and Minimum-Link Path Queries between Two Convex Polygons inside a Simple Polygonal Obstacle | 1997-07-27 | Paper |
| PLANAR UPWARD TREE DRAWINGS WITH OPTIMAL AREA | 1997-06-30 | Paper |
| On-line Planar Graph Embedding | 1997-03-12 | Paper |
| On-Line Planarity Testing | 1996-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886043 | 1996-11-04 | Paper |
| AN ALGORITHM FOR DRAWING A HIERARCHICAL GRAPH | 1996-08-12 | Paper |
| A Unified Approach to Dynamic Point Location, Ray shooting, and Shortest Paths in Planar Maps | 1996-07-02 | Paper |
| On-line maintenance of triconnected components with SPQR-trees | 1996-06-06 | Paper |
| Upward planarity testing | 1996-04-11 | Paper |
| Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar $ST$-Digraphs | 1996-04-11 | Paper |
| An efficient parallel algorithm for shortest paths in planar layered digraphs | 1996-03-18 | Paper |
| Optimal cooperative search in fractional cascaded data structures | 1996-03-07 | Paper |
| Dynamic expression trees | 1995-04-09 | Paper |
| HOW TO DRAW A SERIES-PARALLEL DIGRAPH | 1995-04-06 | Paper |
| Algorithms for drawing graphs: An annotated bibliography | 1994-11-30 | Paper |
| Complexity models for incremental computation | 1994-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281566 | 1994-04-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138871 | 1994-01-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140400 | 1994-01-02 | Paper |
| Dynamic reachability in planar digraphs with one source and one sink | 1993-11-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138939 | 1993-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4038721 | 1993-05-18 | Paper |
| DYNAMIZATION OF THE TRAPEZOID METHOD FOR PLANAR POINT LOCATION IN MONOTONE SUBDIVISIONS | 1993-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028870 | 1993-03-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4014632 | 1992-10-18 | Paper |
| Area requirement and symmetry display of planar upward drawings | 1992-09-26 | Paper |
| Constrained visibility representations of graphs | 1992-06-28 | Paper |
| Maintenance of a minimum spanning forest in a dynamic plane graph | 1992-06-28 | Paper |
| Efficient Point Location in a Convex Spatial Cell-Complex | 1992-06-28 | Paper |
| Lower bounds for planar orthogonal drawings of graphs | 1992-06-27 | Paper |
| Parallel Transitive Closure and Point Location in Planar Structures | 1992-06-25 | Paper |
| An incremental reconstruction method for dynamic planar point location | 1991-01-01 | Paper |
| Representations of Graphs on a Cylinder | 1991-01-01 | Paper |
| Dynamic maintenance of planar digraphs, with applications | 1990-01-01 | Paper |
| Dynamic planar point location with optimal query time | 1990-01-01 | Paper |
| Fully Dynamic Point Location in a Monotone Subdivision | 1989-01-01 | Paper |
| Algorithms for plane representations of acyclic digraphs | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3795247 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3796780 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3785982 | 1987-01-01 | Paper |
| On Embedding a Graph in the Grid with the Minimum Number of Bends | 1987-01-01 | Paper |
| A unified approach to visibility representations of planar graphs | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3742736 | 1986-01-01 | Paper |
