| 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
Information Processing Letters | 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
Lecture Notes in Computer Science | 2024-01-16 | Paper |
External-memory sorting with comparison errors
Lecture Notes in Computer Science | 2024-01-16 | Paper |
scientific article; zbMATH DE number 7788466 (Why is no real title available?)
| 2024-01-15 | Paper |
Exact learning of multitrees and almost-trees using path queries
LATIN 2022: Theoretical Informatics | 2023-07-26 | Paper |
Simplified Chernoff bounds with powers-of-two probabilities
Information Processing Letters | 2023-06-05 | Paper |
scientific article; zbMATH DE number 7651142 (Why is no real title available?)
| 2023-02-07 | Paper |
scientific article; zbMATH DE number 7650287 (Why is no real title available?)
| 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
Information Processing Letters | 2023-02-03 | Paper |
scientific article; zbMATH DE number 7650284 (Why is no real title available?)
| 2023-02-03 | Paper |
Point probe decision trees for geometric concept classes
Lecture Notes in Computer Science | 2023-01-18 | Paper |
Adaptive Exact Learning in a Mixed-Up World: Dealing with Periodicity, Errors and Jumbled-Index Queries in String Reconstruction
1511.68347 | 2022-12-22 | Paper |
On the complexity of approximating and illuminating three-dimensional convex polyhedra
Lecture Notes in Computer Science | 2022-12-16 | Paper |
Topology B-trees and their applications
Lecture Notes in Computer Science | 2022-12-16 | Paper |
Offset-polygon annulus placement problems
Lecture Notes in Computer Science | 2022-08-19 | Paper |
Voronoi diagrams for polygon-offset distance functions
Lecture Notes in Computer Science | 2022-08-19 | Paper |
Accountable storage
| 2022-07-01 | Paper |
Algorithms for stable matching and clustering in a grid
Lecture Notes in Computer Science | 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 |
Stable-matching Voronoi diagrams: combinatorial complexity and algorithms
| 2021-07-28 | Paper |
C-planarity testing of embedded clustered graphs with bounded dual carving-width
Algorithmica | 2021-07-26 | Paper |
Convex-straight-skeleton Voronoi diagrams for segments and convex polygons
Algorithmica | 2021-06-30 | Paper |
A competitive analysis for the start-gap algorithm for online memory wear leveling
Information Processing Letters | 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
2011 Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-16 | Paper |
Privacy-preserving group data access via stateless oblivious RAM simulation
| 2019-05-10 | Paper |
Linear-time algorithms for geometric graphs with sublinearly many crossings
| 2019-05-06 | Paper |
Planar and poly-arc Lombardi drawings
Journal of Computational Geometry | 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 |
scientific article; zbMATH DE number 6876083 (Why is no real title available?)
| 2018-05-29 | Paper |
scientific article; zbMATH DE number 6876100 (Why is no real title available?)
| 2018-05-29 | Paper |
The skip quadtree
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
Linear-time triangulation of a simple polygon made easier via randomization
Proceedings of the sixteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Efficient perspective-accurate silhouette computation and applications
Proceedings of the seventeenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Deterministic sampling and range counting in geometric data streams
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
Succinct Greedy Geometric Routing Using Hyperbolic Geometry
IEEE Transactions on Computers | 2017-07-27 | Paper |
Learning Character Strings via Mastermind Queries, With a Case Study Involving mtDNA
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Verifiable zero-knowledge order queries and updates for fully dynamic lists and trees
Lecture Notes in Computer Science | 2016-10-21 | Paper |
The Galois complexity of graph drawing: why numerical solutions are ubiquitous for force-directed, spectral, and circle packing drawings
Journal of Graph Algorithms and Applications | 2016-01-07 | Paper |
Data-oblivious graph algorithms in outsourced external memory
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
Deterministic sampling and range counting in geometric data streams
ACM Transactions on Algorithms | 2015-09-02 | Paper |
scientific article; zbMATH DE number 6472585 (Why is no real title available?)
| 2015-08-14 | Paper |
scientific article; zbMATH DE number 6472654 (Why is no real title available?)
| 2015-08-14 | Paper |
scientific article; zbMATH DE number 6472655 (Why is no real title available?)
| 2015-08-14 | Paper |
Zig-zag sort
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Skip-webs, efficient distributed data structures for multi-dimensional data sets
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Balanced circle packings for planar graphs
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
The Galois complexity of graph drawing: why numerical solutions are ubiquitous for force-directed, spectral, and circle packing drawings
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
Algorithm design and applications
| 2014-12-30 | Paper |
Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons
Algorithmica | 2014-12-02 | Paper |
Wear minimization for cuckoo hashing: how not to throw a lot of eggs into one basket
Experimental Algorithms | 2014-09-30 | Paper |
The Melbourne shuffle: improving oblivious storage in the cloud
Automata, Languages, and Programming | 2014-07-01 | Paper |
Randomized Shellsort, a simple oblivious sorting algorithm
| 2014-05-22 | Paper |
Randomized shellsort: a simple data-oblivious sorting algorithm
Journal of the ACM | 2014-02-17 | Paper |
Streamed Graph Drawing and the File Maintenance Problem
Graph Drawing | 2013-12-20 | Paper |
Achieving good angular resolution in 3D arc diagrams
Graph Drawing | 2013-12-20 | Paper |
Category-based routing in social networks: membership dimension and the small-world phenomenon
Theoretical Computer Science | 2013-12-11 | Paper |
External-memory multimaps
Algorithmica | 2013-11-11 | Paper |
Combinatorial pair testing: distinguishing workers from slackers
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Cache-oblivious dictionaries and multimaps with negligible failure probability
Lecture Notes in Computer Science | 2013-04-19 | Paper |
On the density of maximal 1-planar graphs
Graph Drawing | 2013-04-03 | Paper |
Force-directed graph drawing using social gravity and scaling
Graph Drawing | 2013-04-03 | Paper |
Graph drawing in the cloud: privately visualizing relational data using small working storage
Graph Drawing | 2013-04-03 | Paper |
Drawing trees with perfect angular resolution and polynomial area
Discrete & Computational Geometry | 2013-03-20 | Paper |
Drawing graphs in the plane with a prescribed outer face and polynomial area
Journal of Graph Algorithms and Applications | 2012-12-04 | Paper |
Anonymous card shuffling and its applications to parallel mixnets
Automata, Languages, and Programming | 2012-11-01 | Paper |
Extended dynamic subgraph statistics using \(h\)-index parameterized data structures
Theoretical Computer Science | 2012-08-13 | Paper |
Force-directed Lombardi-style graph drawing
Graph Drawing | 2012-03-09 | Paper |
Planar and poly-arc Lombardi drawings
Lecture Notes in Computer Science | 2012-03-09 | Paper |
Round-trip Voronoi diagrams and doubling density in geographic networks
Lecture Notes in Computer Science | 2012-03-09 | Paper |
Lombardi drawings of graphs
Journal of Graph Algorithms and Applications | 2012-01-12 | Paper |
Fully retroactive approximate range and nearest neighbor searching
Algorithms and Computation | 2011-12-16 | Paper |
External-memory multimaps
Lecture Notes in Computer Science | 2011-12-16 | Paper |
Sorting, searching, and simulation in the MapReduce framework
Algorithms and Computation | 2011-12-16 | Paper |
External-memory network analysis algorithms for naturally sparse graphs
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Tracking moving objects with few handovers
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Privacy-preserving access of outsourced data via oblivious RAM simulation
Automata, Languages and Programming | 2011-07-07 | Paper |
Efficient authenticated data structures for graph connectivity and geometric search problems
Algorithmica | 2011-06-30 | Paper |
Planar drawings of higher-genus graphs
Journal of Graph Algorithms and Applications | 2011-04-19 | Paper |
Linear-time algorithms for geometric graphs with sublinearly many edge crossings
SIAM Journal on Computing | 2011-04-04 | Paper |
Drawing Trees with Perfect Angular Resolution and Polynomial Area
Graph Drawing | 2011-02-11 | Paper |
Drawing graphs in the plane with a prescribed outer face and polynomial area
Graph Drawing | 2011-02-11 | Paper |
Lombardi Drawings of Graphs
Graph Drawing | 2011-02-11 | Paper |
Extended dynamic subgraph statistics using \(h\)-index parameterized data structures
Combinatorial Optimization and Applications | 2011-01-08 | Paper |
Priority Range Trees
Algorithms and Computation | 2010-12-09 | Paper |
Cloning Voronoi diagrams via retroactive data structures
Algorithms – ESA 2010 | 2010-09-06 | Paper |
On the algorithmic complexity of the Mastermind game with black-peg results
Information Processing Letters | 2010-08-20 | Paper |
The rainbow skip graph
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Planar drawings of higher-genus graphs
Graph Drawing | 2010-04-27 | Paper |
Reliable resource searching in P2P networks
Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering | 2010-04-24 | Paper |
Drawing graphs with large vertices and thick edges.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Constructing disjoint paths for secure communication
Lecture Notes in Computer Science | 2010-02-23 | Paper |
Succinct greedy geometric routing in the Euclidean plane
Algorithms and Computation | 2009-12-17 | Paper |
On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Succinct Greedy Graph Drawing in the Hyperbolic Plane
Graph Drawing | 2009-03-03 | Paper |
Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton’s Identities and Invertible Bloom Filters
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Guard placement for efficient point-in-polygon proofs
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 | 2009-02-12 | Paper |
Planar separators and parallel polygon triangulation.
Journal of Computer and System Sciences | 2008-12-21 | Paper |
Pipelined algorithms to detect cheating in long-term grid computations
Theoretical Computer Science | 2008-12-12 | Paper |
Straight Skeletons of Three-Dimensional Polyhedra
Algorithms - ESA 2008 | 2008-11-25 | Paper |
SKIP QUADTREES: DYNAMIC DATA STRUCTURES FOR MULTIDIMENSIONAL POINT SETS
International Journal of Computational Geometry & Applications | 2008-08-26 | Paper |
Checking Value-Sensitive Data Structures in Sublinear Space
Algorithms and Computation | 2008-05-27 | Paper |
Super-Efficient Verification of Dynamic Outsourced Databases
Topics in Cryptology – CT-RSA 2008 | 2008-04-24 | Paper |
Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis
Journal of Combinatorial Optimization | 2008-04-23 | Paper |
Improved Combinatorial Group Testing Algorithms for Real‐World Problem Sizes
SIAM Journal on Computing | 2007-10-22 | Paper |
Indexing Information for Data Forensics
Applied Cryptography and Network Security | 2007-09-24 | Paper |
Searching for High-Value Rare Events with Uncheatable Grid Computing
Applied Cryptography and Network Security | 2007-09-24 | Paper |
Choosing Colors for Geometric Graphs Via Color Space Embeddings
Graph Drawing | 2007-08-28 | Paper |
Confluent layered drawings
Algorithmica | 2007-05-10 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
Journal of Graph Algorithms and Applications | 2006-04-03 | Paper |
Financial Cryptography and Data Security
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2005-12-07 | Paper |
Advances in Cryptology – CRYPTO 2004
Lecture Notes in Computer Science | 2005-08-23 | Paper |
scientific article; zbMATH DE number 2185614 (Why is no real title available?)
| 2005-07-04 | Paper |
Drawing Planar Graphs with Large Vertices and Thick Edges
Journal of Graph Algorithms and Applications | 2005-05-25 | Paper |
Biased skip lists
Algorithmica | 2005-05-13 | Paper |
Optimizing a constrained convex polygonal annulus
Journal of Discrete Algorithms | 2005-05-04 | Paper |
Contour interpolation by straight skeletons
Graphical Models | 2004-11-12 | Paper |
A multi-dimensional approach to force-directed layouts of large graphs
Computational Geometry | 2004-10-13 | Paper |
Three-dimensional layers of maxima
Algorithmica | 2004-10-01 | Paper |
scientific article; zbMATH DE number 2089751 (Why is no real title available?)
| 2004-08-12 | Paper |
scientific article; zbMATH DE number 2080100 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2079329 (Why is no real title available?)
| 2004-07-28 | Paper |
scientific article; zbMATH DE number 2044545 (Why is no real title available?)
| 2004-02-18 | Paper |
scientific article; zbMATH DE number 2031582 (Why is no real title available?)
| 2004-01-25 | Paper |
scientific article; zbMATH DE number 1979482 (Why is no real title available?)
| 2003-09-14 | Paper |
scientific article; zbMATH DE number 1962158 (Why is no real title available?)
| 2003-08-10 | Paper |
scientific article; zbMATH DE number 1947398 (Why is no real title available?)
| 2003-07-08 | Paper |
scientific article; zbMATH DE number 1941253 (Why is no real title available?)
| 2003-06-29 | Paper |
Planarity-preserving clustering and embedding for large planar graphs
Computational Geometry | 2003-04-28 | Paper |
Optimizing area and aspect ratio in straight-line orthogonal tree drawings
Computational Geometry | 2003-03-10 | Paper |
A randomized algorithm for triangulating a simple polygon in linear time
Discrete & Computational Geometry | 2002-09-11 | Paper |
Efficiently approximating polygonal paths in three and higher dimensions
Algorithmica | 2002-06-17 | Paper |
Algorithm design: Foundations, analysis, and Internet examples
| 2001-11-29 | Paper |
scientific article; zbMATH DE number 1670652 (Why is no real title available?)
| 2001-11-11 | Paper |
scientific article; zbMATH DE number 1670657 (Why is no real title available?)
| 2001-11-11 | Paper |
Drawing planar graphs with circular arcs
Discrete & Computational Geometry | 2001-10-10 | Paper |
Balanced aspect ratio trees: Combining the advantages of \(k\)-\(d\) trees and octrees
Journal of Algorithms | 2001-10-07 | Paper |
scientific article; zbMATH DE number 1424298 (Why is no real title available?)
| 2001-10-07 | Paper |
scientific article; zbMATH DE number 1263244 (Why is no real title available?)
| 2001-08-28 | Paper |
Voronoi diagrams for convex polygon-offset distance functions
Discrete & Computational Geometry | 2001-06-20 | Paper |
scientific article; zbMATH DE number 1445339 (Why is no real title available?)
| 2001-03-15 | Paper |
Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs
Journal of Graph Algorithms and Applications | 2001-01-03 | Paper |
scientific article; zbMATH DE number 1857638 (Why is no real title available?)
| 2001-01-01 | Paper |
A Framework for Drawing Planar Graphs with Curves and Polylines
Journal of Algorithms | 2000-12-19 | Paper |
An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction
International Journal of Computational Geometry & Applications | 2000-11-07 | Paper |
scientific article; zbMATH DE number 1500683 (Why is no real title available?)
| 2000-09-04 | Paper |
scientific article; zbMATH DE number 1445368 (Why is no real title available?)
| 2000-05-10 | Paper |
scientific article; zbMATH DE number 1305419 (Why is no real title available?)
| 2000-04-13 | Paper |
Communication-Efficient Parallel Sorting
SIAM Journal on Computing | 1999-10-28 | Paper |
scientific article; zbMATH DE number 1256741 (Why is no real title available?)
| 1999-05-09 | Paper |
scientific article; zbMATH DE number 1182929 (Why is no real title available?)
| 1999-03-02 | Paper |
Offset-polygon annulus placement problems
Computational Geometry | 1999-02-02 | Paper |
Dynamic Trees and Dynamic Point Location
SIAM Journal on Computing | 1998-09-21 | Paper |
Bounded-independance derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming
Discrete & Computational Geometry | 1998-03-11 | Paper |
Sorting on a parallel pointer machine with applications to set expression evaluation
Journal of the ACM | 1998-01-21 | Paper |
Fast randomized parallel methods for planar convex hull construction
Computational Geometry | 1998-01-04 | Paper |
On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees
Computational Geometry | 1997-11-09 | Paper |
PLANAR UPWARD TREE DRAWINGS WITH OPTIMAL AREA
International Journal of Computational Geometry & Applications | 1997-06-30 | Paper |
Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations
Journal of Algorithms | 1997-04-27 | Paper |
scientific article; zbMATH DE number 1003255 (Why is no real title available?)
| 1997-04-23 | Paper |
Geometric pattern matching under Euclidean motion
Computational Geometry | 1997-03-18 | Paper |
A nearly optimal deterministic parallel Voronoi diagram algorithm
Algorithmica | 1997-01-29 | Paper |
scientific article; zbMATH DE number 910869 (Why is no real title available?)
| 1996-11-04 | Paper |
Blocking for external graph searching
Algorithmica | 1996-08-12 | Paper |
scientific article; zbMATH DE number 871908 (Why is no real title available?)
| 1996-04-28 | Paper |
Almost optimal set covers in finite VC-dimension
Discrete & Computational Geometry | 1996-02-06 | Paper |
Efficient piecewise-linear function approximation using the uniform metric
Discrete & Computational Geometry | 1996-02-06 | Paper |
Parallel algorithms for evaluating sequences of set-manipulation operations
Journal of the ACM | 1995-04-10 | Paper |
P-COMPLETE GEOMETRIC PROBLEMS
International Journal of Computational Geometry & Applications | 1995-01-02 | Paper |
scientific article; zbMATH DE number 432757 (Why is no real title available?)
| 1994-09-20 | Paper |
Output-sensitive methods for rectilinear hidden surface removal
Information and Computation | 1994-03-24 | Paper |
Stabbing parallel segments with a convex polygon
Computer Vision, Graphics, and Image Processing | 1993-08-24 | Paper |
Constructing the convex hull of a partially sorted set of points
Computational Geometry | 1993-06-29 | Paper |
An addendum to parallel methods for visibility and shortest-path problems in simple polygons
Algorithmica | 1993-06-29 | Paper |
Constructing arrangements optimally in parallel
Discrete & Computational Geometry | 1993-06-16 | Paper |
scientific article; zbMATH DE number 177849 (Why is no real title available?)
| 1993-05-18 | Paper |
scientific article; zbMATH DE number 177831 (Why is no real title available?)
| 1993-05-18 | Paper |
Constructing the Voronoi diagram of a set of line segments in parallel
Algorithmica | 1993-04-01 | Paper |
scientific article; zbMATH DE number 140472 (Why is no real title available?)
| 1993-03-28 | Paper |
scientific article; zbMATH DE number 140455 (Why is no real title available?)
| 1993-03-28 | Paper |
Parallel methods for visibility and shortest-path problems in simple polygons
Algorithmica | 1993-01-17 | Paper |
Optimal parallel algorithms for point-set and polygon problems
Algorithmica | 1992-06-28 | Paper |
Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors
SIAM Journal on Computing | 1992-06-25 | Paper |
Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
SIAM Journal on Computing | 1989-01-01 | Paper |
Triangulating a polygon in parallel
Journal of Algorithms | 1989-01-01 | Paper |
Parallel algorithms for some functions of two convex polygons
Algorithmica | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4060711 (Why is no real title available?)
| 1988-01-01 | Paper |
Parallel algorithms for shortest path problems in polygons
The Visual Computer | 1988-01-01 | Paper |
Finding the convex hull of a sorted point set in parallel
Information Processing Letters | 1987-01-01 | Paper |
