| Publication | Date of Publication | Type |
|---|
On the power of bounded asynchrony: convergence by autonomous robots with limited visibility
Distributed Computing | 2024-09-10 | Paper |
A frequency-competitive query strategy for maintaining low collision potential among moving entities
| 2024-07-19 | Paper |
Minimizing query frequency to bound congestion potential for moving entities at a fixed target time
| 2024-05-29 | Paper |
Separating Bounded and Unbounded Asynchrony for Autonomous Robots
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Approximate majority analyses using tri-molecular chemical reaction networks
Natural Computing | 2024-02-09 | Paper |
Computing common tangents without a separating line
Lecture Notes in Computer Science | 2022-12-16 | Paper |
Minimizing Interference Potential Among Moving Entities
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Preference-based teaching of unions of geometric objects
| 2019-01-10 | Paper |
Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
Pseudo approximation algorithms, with applications to optimal motion planning
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
Swapping colored tokens on graphs
Theoretical Computer Science | 2018-05-17 | Paper |
Simplifying analyses of chemical reaction networks for approximate majority
| 2018-02-02 | Paper |
Curvature-bounded traversals of narrow corridors
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
Kinetic collision detection for simple polygons
Proceedings of the sixteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
Approximating barrier resilience for arrangements of non-identical disk sensors
Algorithms for Sensor Systems | 2016-12-19 | Paper |
Minimizing co-location potential of moving entities
SIAM Journal on Computing | 2016-10-28 | Paper |
Swapping Colored Tokens on Graphs
Lecture Notes in Computer Science | 2015-10-30 | Paper |
On polygonal paths with bounded discrete-curvature: the inflection-free case
Lecture Notes in Computer Science | 2015-09-14 | Paper |
Optimally scheduling video-on-demand to minimize delay when sender and receiver bandwidth may differ
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Optimally scheduling video-on-demand to minimize delay when server and receiver bandwidth may differ
| 2015-08-03 | Paper |
A polynomial-time algorithm for computing the resilience of arrangements of ray sensors
International Journal of Computational Geometry & Applications | 2015-04-22 | Paper |
An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries
Discrete & Computational Geometry | 2015-04-16 | Paper |
Competitive query strategies for minimising the ply of the potential locations of moving points
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
Computational aspects of M. C. Escher's ribbon patterns
Theory of Computing Systems | 2015-01-21 | Paper |
Lower bounds on average-case delay for video-on-demand broadcast protocols
| 2014-12-18 | Paper |
\(\widetilde{O}(\sqrt{n})\)-space and polynomial-time algorithm for planar directed graph reachability
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Multi-path algorithms for minimum-colour path problems with applications to approximating barrier resilience
Theoretical Computer Science | 2014-09-18 | Paper |
On the completeness of a generalized matching problem
Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 | 2014-03-14 | Paper |
Closing a long-standing complexity gap for selection: \(V _{3}(42) = 50\)
Lecture Notes in Computer Science | 2013-09-13 | Paper |
Time-space tradeoffs for all-nearest-larger-neighbors problems
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Input-Thrifty Extrema Testing
Algorithms and Computation | 2011-12-16 | Paper |
Can nearest neighbor searching be simple and always fast?
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Competitive search in symmetric trees
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Constrained equitable \(3\)-cuttings
Lecture Notes in Computer Science | 2010-02-05 | Paper |
Linear-time certifying algorithms for near-graphical sequences
Discrete Mathematics | 2009-12-15 | Paper |
Finding Nearest Larger Neighbors
Lecture Notes in Computer Science | 2009-11-12 | Paper |
Hyperbolic Dovetailing
Lecture Notes in Computer Science | 2009-10-29 | Paper |
The projection median of a set of points
Computational Geometry | 2009-06-18 | Paper |
Finding curvature-constrained paths that avoid polygonal obstacles
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 | 2009-02-12 | Paper |
A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths
Algorithms and Computation | 2009-01-29 | Paper |
BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES
International Journal of Computational Geometry & Applications | 2008-08-26 | Paper |
On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks
Distributed Computing and Networking | 2008-03-06 | Paper |
On the Spanning Ratio of Gabriel Graphs and beta-Skeletons
SIAM Journal on Discrete Mathematics | 2007-05-22 | Paper |
THE STEINER CENTRE OF A SET OF POINTS: STABILITY, ECCENTRICITY, AND APPLICATIONS TO MOBILE FACILITY LOCATION
International Journal of Computational Geometry & Applications | 2006-09-04 | Paper |
Equitable subdivisions within polygonal regions
Computational Geometry | 2006-04-28 | Paper |
COMPUTING THE SET OF ALL THE DISTANT HORIZONS OF A TERRAIN
International Journal of Computational Geometry & Applications | 2006-03-13 | Paper |
Restructuring ordered binary trees
Journal of Algorithms | 2004-10-01 | Paper |
KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
scientific article; zbMATH DE number 2086250 (Why is no real title available?)
| 2004-08-11 | Paper |
Pseudo approximation algorithms with applications to optimal motion planning
Discrete & Computational Geometry | 2004-03-11 | Paper |
Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces
Computational Geometry | 2003-10-14 | Paper |
Tight degree bounds for pseudo-triangulations of points
Computational Geometry | 2003-05-19 | Paper |
scientific article; zbMATH DE number 1786516 (Why is no real title available?)
| 2002-08-21 | Paper |
Efficient algorithms for centers and medians in interval and circular-arc graphs
Networks | 2002-07-01 | Paper |
Right-triangulated irregular networks
Algorithmica | 2002-01-09 | Paper |
scientific article; zbMATH DE number 1670650 (Why is no real title available?)
| 2001-11-11 | Paper |
Generalizing ham sandwich cuts to equitable subdivisions
Discrete & Computational Geometry | 2001-08-16 | Paper |
COMPUTING CONSTRAINED SHORTEST SEGMENTS: BUTTERFLY WINGSPANS IN LOGARITHMIC TIME
International Journal of Computational Geometry & Applications | 2000-11-07 | Paper |
scientific article; zbMATH DE number 1445337 (Why is no real title available?)
| 2000-05-10 | Paper |
Unit disk graph recognition is NP-hard
Computational Geometry | 1998-04-13 | Paper |
Determining bar-representability for ordered weighted graphs
Computational Geometry | 1996-11-04 | Paper |
Rounding in symmetric matrices and undirected graphs
Discrete Applied Mathematics | 1996-10-09 | Paper |
Parallel construction of binary trees with near optimal weighted path length
Algorithmica | 1996-02-20 | Paper |
A compact piecewise-linear Voronoi diagram for convex sites in the plane
Discrete & Computational Geometry | 1996-02-13 | Paper |
scientific article; zbMATH DE number 741008 (Why is no real title available?)
| 1995-04-05 | Paper |
Computing the intersection-depth to polyhedra
Algorithmica | 1993-06-29 | Paper |
scientific article; zbMATH DE number 177829 (Why is no real title available?)
| 1993-05-18 | Paper |
Algorithms for Degree Constrained Graph Factors of Minimum Deficiency
Journal of Algorithms | 1993-05-16 | Paper |
scientific article; zbMATH DE number 140479 (Why is no real title available?)
| 1993-03-28 | Paper |
Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures
Discrete & Computational Geometry | 1992-09-26 | Paper |
Quantitative Steinitz's theorems with applications to multifingered grasping
Discrete & Computational Geometry | 1992-06-28 | Paper |
Parallel recognition of complement reducible graphs and cotree construction
Discrete Applied Mathematics | 1990-01-01 | Paper |
A simple existence criterion for \((g<f)\)-factors
Discrete Mathematics | 1990-01-01 | Paper |
Parallel algorithms for fractional and maximal independent sets in planar graphs
Discrete Applied Mathematics | 1990-01-01 | Paper |
Parallel construction of subdivision hierarchies
Journal of Computer and System Sciences | 1989-01-01 | Paper |
Addition requirements for matrix and transposed matrix products
Journal of Algorithms | 1988-01-01 | Paper |
On Restricted Two-Factors
SIAM Journal on Discrete Mathematics | 1988-01-01 | Paper |
Establishing order in planar subdivisions
Discrete & Computational Geometry | 1988-01-01 | Paper |
The Ultimate Planar Convex Hull Algorithm?
SIAM Journal on Computing | 1986-01-01 | Paper |
Packings by Complete Bipartite Graphs
SIAM Journal on Algebraic Discrete Methods | 1986-01-01 | Paper |
A note on f-factors in directed and undirected multigraphs
Graphs and Combinatorics | 1986-01-01 | Paper |
A linear algorithm for determining the separation of convex polyhedra
Journal of Algorithms | 1985-01-01 | Paper |
Alphabetic Minimax Trees
SIAM Journal on Computing | 1985-01-01 | Paper |
Some Graph-Colouring Theorems with Applications to Generalized Connection Networks
SIAM Journal on Algebraic Discrete Methods | 1985-01-01 | Paper |
Packings by cliques and by finite families of graphs
Discrete Mathematics | 1984-01-01 | Paper |
Upper bounds for sorting integers on random access machines
Theoretical Computer Science | 1984-01-01 | Paper |
On the Complexity of General Graph Factor Problems
SIAM Journal on Computing | 1983-01-01 | Paper |
Optimal Search in Planar Subdivisions
SIAM Journal on Computing | 1983-01-01 | Paper |
On the shape of a set of points in the plane
IEEE Transactions on Information Theory | 1983-01-01 | Paper |
On pseudosimilarity in trees
Journal of Combinatorial Theory. Series B | 1983-01-01 | Paper |
Fast detection of polyhedral intersection
Theoretical Computer Science | 1983-01-01 | Paper |
scientific article; zbMATH DE number 3920497 (Why is no real title available?)
| 1983-01-01 | Paper |
Dynamic Voronoi diagrams
IEEE Transactions on Information Theory | 1983-01-01 | Paper |
Polygonal intersection searching
Information Processing Letters | 1982-01-01 | Paper |
scientific article; zbMATH DE number 3854464 (Why is no real title available?)
| 1982-01-01 | Paper |
scientific article; zbMATH DE number 3778747 (Why is no real title available?)
| 1982-01-01 | Paper |
On generalized matching problems
Information Processing Letters | 1981-01-01 | Paper |
A Unified Lower Bound for Selection and Set Partitioning Problems
Journal of the ACM | 1981-01-01 | Paper |
scientific article; zbMATH DE number 3743308 (Why is no real title available?)
| 1981-01-01 | Paper |
A time-space tradeoff for sorting on non-oblivious machines
Journal of Computer and System Sciences | 1981-01-01 | Paper |
Forest embeddings in regular graphs of large girth
Journal of Combinatorial Theory. Series B | 1981-01-01 | Paper |
A note on Delaunay and optimal triangulations
Information Processing Letters | 1980-01-01 | Paper |
scientific article; zbMATH DE number 3720954 (Why is no real title available?)
| 1980-01-01 | Paper |
A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem
SIAM Journal on Computing | 1980-01-01 | Paper |
Addition Requirements for Rational Functions
SIAM Journal on Computing | 1977-01-01 | Paper |
scientific article; zbMATH DE number 3558963 (Why is no real title available?)
| 1974-01-01 | Paper |
scientific article; zbMATH DE number 3555296 (Why is no real title available?)
| 1972-01-01 | Paper |
