| Publication | Date of Publication | Type |
|---|
| Manipulating weights to improve stress-graph drawings of 3-connected planar graphs | 2024-10-14 | Paper |
| Highway preferential attachment models for geographic routing | 2024-09-16 | Paper |
| Leveraging parameterized Chernoff bounds for simplified algorithm analyses | 2024-09-11 | Paper |
| Mapping networks via parallel \(k\)th-hop traceroute queries | 2024-04-23 | Paper |
| Zip-zip trees: making zip trees more balanced, biased, compact, or persistent | 2024-01-16 | Paper |
| External-memory sorting with comparison errors | 2024-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147384 | 2024-01-15 | Paper |
| Exact learning of multitrees and almost-trees using path queries | 2023-07-26 | Paper |
| Simplified Chernoff bounds with powers-of-two probabilities | 2023-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874464 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875621 | 2023-02-03 | Paper |
| C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width. | 2023-02-03 | Paper |
| Improved kernels for tracking paths | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875617 | 2023-02-03 | Paper |
| Point probe decision trees for geometric concept classes | 2023-01-18 | Paper |
| Adaptive Exact Learning in a Mixed-Up World: Dealing with Periodicity, Errors and Jumbled-Index Queries in String Reconstruction | 2022-12-22 | Paper |
| On the complexity of approximating and illuminating three-dimensional convex polyhedra | 2022-12-16 | Paper |
| Topology B-trees and their applications | 2022-12-16 | Paper |
| Offset-polygon annulus placement problems | 2022-08-19 | Paper |
| Voronoi diagrams for polygon-offset distance functions | 2022-08-19 | Paper |
| Accountable Storage | 2022-07-01 | Paper |
| Algorithms for Stable Matching and Clustering in a Grid | 2022-05-18 | Paper |
| Computing k-modal embeddings of planar digraphs | 2022-05-11 | Paper |
| How to catch marathon cheaters: new approximation algorithms for tracking paths | 2022-03-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002769 | 2021-07-28 | Paper |
| C-planarity testing of embedded clustered graphs with bounded dual carving-width | 2021-07-26 | Paper |
| Convex-straight-skeleton Voronoi diagrams for segments and convex polygons | 2021-06-30 | Paper |
| A competitive analysis for the start-gap algorithm for online memory wear leveling | 2021-02-04 | Paper |
| Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms | 2020-08-04 | Paper |
| The Online House Numbering Problem: Min-Max Online List Labeling | 2020-05-27 | Paper |
| Reactive proximity data structures for graphs | 2020-02-12 | Paper |
| Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection | 2019-10-24 | Paper |
| Spin-the-bottle Sort and Annealing Sort: Oblivious Sorting via Round-robin Random Comparisons | 2019-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743386 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633821 | 2019-05-06 | Paper |
| Planar and Poly-arc Lombardi Drawings | 2019-02-27 | Paper |
| Subexponential-time and FPT algorithms for embedded flat clustered planarity | 2018-11-22 | Paper |
| Models and algorithms for graph watermarking | 2018-10-18 | Paper |
| Computing convex-straight-skeleton Voronoi diagrams for segments and convex polygons | 2018-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4643853 | 2018-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4643870 | 2018-05-29 | Paper |
| The skip quadtree | 2017-10-20 | Paper |
| Linear-time triangulation of a simple polygon made easier via randomization | 2017-09-29 | Paper |
| Efficient perspective-accurate silhouette computation and applications | 2017-09-29 | Paper |
| Deterministic sampling and range counting in geometric data streams | 2017-09-29 | Paper |
| Succinct Greedy Geometric Routing Using Hyperbolic Geometry | 2017-07-27 | Paper |
| Learning Character Strings via Mastermind Queries, With a Case Study Involving mtDNA | 2017-06-08 | Paper |
| Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees | 2016-10-21 | Paper |
| The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings | 2016-01-07 | Paper |
| Data-Oblivious Graph Algorithms in Outsourced External Memory | 2015-09-11 | Paper |
| Deterministic sampling and range counting in geometric data streams | 2015-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501788 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501857 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501858 | 2015-08-14 | Paper |
| Zig-zag sort | 2015-06-26 | Paper |
| Skip-webs | 2015-03-10 | Paper |
| Balanced Circle Packings for Planar Graphs | 2015-01-07 | Paper |
| The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings | 2015-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2935981 | 2014-12-30 | Paper |
| Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons | 2014-12-02 | Paper |
| Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket | 2014-09-30 | Paper |
| The Melbourne Shuffle: Improving Oblivious Storage in the Cloud | 2014-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417705 | 2014-05-22 | Paper |
| Randomized Shellsort | 2014-02-17 | Paper |
| Streamed Graph Drawing and the File Maintenance Problem | 2013-12-20 | Paper |
| Achieving Good Angular Resolution in 3D Arc Diagrams | 2013-12-20 | Paper |
| Category-based routing in social networks: membership dimension and the small-world phenomenon | 2013-12-11 | Paper |
| External-memory multimaps | 2013-11-11 | Paper |
| Combinatorial Pair Testing: Distinguishing Workers from Slackers | 2013-08-12 | Paper |
| Cache-Oblivious Dictionaries and Multimaps with Negligible Failure Probability | 2013-04-19 | Paper |
| On the Density of Maximal 1-Planar Graphs | 2013-04-03 | Paper |
| Force-Directed Graph Drawing Using Social Gravity and Scaling | 2013-04-03 | Paper |
| Graph Drawing in the Cloud: Privately Visualizing Relational Data Using Small Working Storage | 2013-04-03 | Paper |
| Drawing trees with perfect angular resolution and polynomial area | 2013-03-20 | Paper |
| Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area | 2012-12-04 | Paper |
| Anonymous Card Shuffling and Its Applications to Parallel Mixnets | 2012-11-01 | Paper |
| Extended dynamic subgraph statistics using \(h\)-index parameterized data structures | 2012-08-13 | Paper |
| Planar and Poly-arc Lombardi Drawings | 2012-03-09 | Paper |
| Force-Directed Lombardi-Style Graph Drawing | 2012-03-09 | Paper |
| Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks | 2012-03-09 | Paper |
| Lombardi Drawings of Graphs | 2012-01-12 | Paper |
| External-memory multimaps | 2011-12-16 | Paper |
| Fully Retroactive Approximate Range and Nearest Neighbor Searching | 2011-12-16 | Paper |
| Sorting, Searching, and Simulation in the MapReduce Framework | 2011-12-16 | Paper |
| External-Memory Network Analysis Algorithms for Naturally Sparse Graphs | 2011-09-16 | Paper |
| Tracking Moving Objects with Few Handovers | 2011-08-12 | Paper |
| Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation | 2011-07-07 | Paper |
| Efficient authenticated data structures for graph connectivity and geometric search problems | 2011-06-30 | Paper |
| Planar Drawings of Higher-Genus Graphs | 2011-04-19 | Paper |
| Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings | 2011-04-04 | Paper |
| Drawing Trees with Perfect Angular Resolution and Polynomial Area | 2011-02-11 | Paper |
| Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area | 2011-02-11 | Paper |
| Lombardi Drawings of Graphs | 2011-02-11 | Paper |
| Extended Dynamic Subgraph Statistics Using h-Index Parameterized Data Structures | 2011-01-08 | Paper |
| Priority Range Trees | 2010-12-09 | Paper |
| Cloning Voronoi Diagrams via Retroactive Data Structures | 2010-09-06 | Paper |
| On the algorithmic complexity of the Mastermind game with black-peg results | 2010-08-20 | Paper |
| The rainbow skip graph | 2010-08-16 | Paper |
| Planar Drawings of Higher-Genus Graphs | 2010-04-27 | Paper |
| Reliable Resource Searching in P2P Networks | 2010-04-24 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| Distributed Computing | 2010-02-23 | Paper |
| Succinct Greedy Geometric Routing in the Euclidean Plane | 2009-12-17 | Paper |
| On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem | 2009-10-20 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| Succinct Greedy Graph Drawing in the Hyperbolic Plane | 2009-03-03 | Paper |
| Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton’s Identities and Invertible Bloom Filters | 2009-02-17 | Paper |
| Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric | 2009-02-17 | Paper |
| Guard placement for efficient point-in-polygon proofs | 2009-02-12 | Paper |
| Planar separators and parallel polygon triangulation. | 2008-12-21 | Paper |
| Pipelined algorithms to detect cheating in long-term grid computations | 2008-12-12 | Paper |
| Straight Skeletons of Three-Dimensional Polyhedra | 2008-11-25 | Paper |
| SKIP QUADTREES: DYNAMIC DATA STRUCTURES FOR MULTIDIMENSIONAL POINT SETS | 2008-08-26 | Paper |
| Checking Value-Sensitive Data Structures in Sublinear Space | 2008-05-27 | Paper |
| Super-Efficient Verification of Dynamic Outsourced Databases | 2008-04-24 | Paper |
| Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis | 2008-04-23 | Paper |
| Improved Combinatorial Group Testing Algorithms for Real‐World Problem Sizes | 2007-10-22 | Paper |
| Indexing Information for Data Forensics | 2007-09-24 | Paper |
| Searching for High-Value Rare Events with Uncheatable Grid Computing | 2007-09-24 | Paper |
| Choosing Colors for Geometric Graphs Via Color Space Embeddings | 2007-08-28 | Paper |
| Confluent layered drawings | 2007-05-10 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way | 2006-04-03 | Paper |
| Financial Cryptography and Data Security | 2005-12-22 | Paper |
| Graph Drawing | 2005-12-07 | Paper |
| Advances in Cryptology – CRYPTO 2004 | 2005-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024779 | 2005-07-04 | Paper |
| Drawing Planar Graphs with Large Vertices and Thick Edges | 2005-05-25 | Paper |
| Biased skip lists | 2005-05-13 | Paper |
| Optimizing a constrained convex polygonal annulus | 2005-05-04 | Paper |
| Contour interpolation by straight skeletons | 2004-11-12 | Paper |
| A multi-dimensional approach to force-directed layouts of large graphs | 2004-10-13 | Paper |
| Three-dimensional layers of maxima | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3047574 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472309 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471284 | 2004-07-28 | 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/Q4425935 | 2003-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418544 | 2003-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411364 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4408458 | 2003-06-29 | Paper |
| Planarity-preserving clustering and embedding for large planar graphs | 2003-04-28 | Paper |
| Optimizing area and aspect ratio in straight-line orthogonal tree drawings | 2003-03-10 | Paper |
| A randomized algorithm for triangulating a simple polygon in linear time | 2002-09-11 | Paper |
| Efficiently approximating polygonal paths in three and higher dimensions | 2002-06-17 | Paper |
| Algorithm design: Foundations, analysis, and Internet examples | 2001-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753929 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753934 | 2001-11-11 | Paper |
| Drawing planar graphs with circular arcs | 2001-10-10 | Paper |
| Balanced aspect ratio trees: Combining the advantages of \(k\)-\(d\) trees and octrees | 2001-10-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945511 | 2001-10-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234117 | 2001-08-28 | Paper |
| Voronoi diagrams for convex polygon-offset distance functions | 2001-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952656 | 2001-03-15 | Paper |
| Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs | 2001-01-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4788597 | 2001-01-01 | Paper |
| A Framework for Drawing Planar Graphs with Curves and Polylines | 2000-12-19 | Paper |
| An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction | 2000-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501704 | 2000-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952690 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252301 | 2000-04-13 | Paper |
| Communication-Efficient Parallel Sorting | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228477 | 1999-05-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4401026 | 1999-03-02 | Paper |
| Offset-polygon annulus placement problems | 1999-02-02 | Paper |
| Dynamic Trees and Dynamic Point Location | 1998-09-21 | Paper |
| Bounded-independance derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming | 1998-03-11 | Paper |
| Sorting on a parallel pointer machine with applications to set expression evaluation | 1998-01-21 | Paper |
| Fast randomized parallel methods for planar convex hull construction | 1998-01-04 | Paper |
| On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees | 1997-11-09 | Paper |
| PLANAR UPWARD TREE DRAWINGS WITH OPTIMAL AREA | 1997-06-30 | Paper |
| Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations | 1997-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128883 | 1997-04-23 | Paper |
| Geometric pattern matching under Euclidean motion | 1997-03-18 | Paper |
| A nearly optimal deterministic parallel Voronoi diagram algorithm | 1997-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886043 | 1996-11-04 | Paper |
| Blocking for external graph searching | 1996-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875177 | 1996-04-28 | Paper |
| Almost optimal set covers in finite VC-dimension | 1996-02-06 | Paper |
| Efficient piecewise-linear function approximation using the uniform metric | 1996-02-06 | Paper |
| Parallel algorithms for evaluating sequences of set-manipulation operations | 1995-04-10 | Paper |
| P-COMPLETE GEOMETRIC PROBLEMS | 1995-01-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138885 | 1994-09-20 | Paper |
| Output-sensitive methods for rectilinear hidden surface removal | 1994-03-24 | Paper |
| Stabbing parallel segments with a convex polygon | 1993-08-24 | Paper |
| Constructing the convex hull of a partially sorted set of points | 1993-06-29 | Paper |
| An addendum to parallel methods for visibility and shortest-path problems in simple polygons | 1993-06-29 | Paper |
| Constructing arrangements optimally in parallel | 1993-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4038727 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4038709 | 1993-05-18 | Paper |
| Constructing the Voronoi diagram of a set of line segments in parallel | 1993-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028889 | 1993-03-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028871 | 1993-03-28 | Paper |
| Parallel methods for visibility and shortest-path problems in simple polygons | 1993-01-17 | Paper |
| Optimal parallel algorithms for point-set and polygon problems | 1992-06-28 | Paper |
| Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors | 1992-06-25 | Paper |
| Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms | 1989-01-01 | Paper |
| Triangulating a polygon in parallel | 1989-01-01 | Paper |
| Parallel algorithms for some functions of two convex polygons | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3795217 | 1988-01-01 | Paper |
| Parallel algorithms for shortest path problems in polygons | 1988-01-01 | Paper |
| Finding the convex hull of a sorted point set in parallel | 1987-01-01 | Paper |
