Subhash Suri

According to our database1, Subhash Suri authored at least 222 papers between 1985 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Awards

ACM Fellow

ACM Fellow 2010, "For algorithmic contributions in computational geometry, networks, and computational economics.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
K-dominance in multidimensional data: Theory and applications.
Comput. Geom., 2020

Improved approximation bounds for the minimum constraint removal problem.
Comput. Geom., 2020

Shortest Paths in the Plane with Obstacle Violations.
Algorithmica, 2020

Dynamic Geometric Set Cover and Hitting Set.
Proceedings of the 36th International Symposium on Computational Geometry, 2020

2019
Approximating dominating set on intersection graphs of rectangles and L-frames.
Comput. Geom., 2019

On Multi-Dimensional Team Formation.
Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

The Maximum Exposure Problem.
Proceedings of the Approximation, 2019

2018
Quantiles on Streams.
Proceedings of the Encyclopedia of Database Systems, Second Edition, 2018

Analytic tractography: A closed-form solution for estimating local white matter connectivity with diffusion MRI.
NeuroImage, 2018

Range-max queries on uncertain data.
J. Comput. Syst. Sci., 2018

Approximating Dominating Set on Intersection Graphs of L-frames.
CoRR, 2018

Tight bounds for conflict-free chromatic guarding of orthogonal art galleries.
Comput. Geom., 2018

Computing Shortest Paths in the Plane with Removable Obstacles.
Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

Compositional measures of diffusion anisotropy and asymmetry.
Proceedings of the 15th IEEE International Symposium on Biomedical Imaging, 2018

2017
Hyperplane separability and convexity of probabilistic point sets.
JoCG, 2017

Block Crossings in Storyline Visualizations.
J. Graph Algorithms Appl., 2017

Convex Hulls Under Uncertainty.
Algorithmica, 2017

Efficient Algorithms for k-Regret Minimizing Sets.
Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

2016
On the Most Likely Voronoi Diagram and Nearest Neighbor Searching.
Int. J. Comput. Geom. Appl., 2016

Metric embedding, hyperbolic space, and social networks.
Comput. Geom., 2016

Observability of Lattice Graphs.
Algorithmica, 2016

Containment and Evasion in Stochastic Point Data.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Bundled Crossings in Embedded Graphs.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Most Likely Voronoi Diagrams in Higher Dimensions.
Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

Boundary Labeling with Obstacles.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

Counting Convex k-gons in an Arrangement of Line Segments.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015
Capture bounds for visibility-based pursuit evasion.
Comput. Geom., 2015

Computing Klee's Measure of Grounded Boxes.
Algorithmica, 2015

Pursuit Evasion on Polyhedral Surfaces.
Algorithmica, 2015

Geometric <i>k</i> Shortest Paths.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

A reeb graph approach to tractography.
Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2015

Tradeoffs between Bends and Displacement in Anchored Graph Drawing.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014
k-Capture in multiagent pursuit evasion, or the lion and the hyenas.
Theor. Comput. Sci., 2014

Closest pair and the post office problem for stochastic points.
Comput. Geom., 2014

On the Complexity of Time-Dependent Shortest Paths.
Algorithmica, 2014

Erratum to: Conflict-Free Chromatic Art Gallery Coverage.
Algorithmica, 2014

Conflict-Free Chromatic Art Gallery Coverage.
Algorithmica, 2014

Trackability with Imprecise Localization.
Proceedings of the Algorithmic Foundations of Robotics XI, 2014

On the Most Likely Voronoi Diagramand Nearest Neighbor Searching.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

2013
Memory Efficient Minimum Substring Partitioning.
Proc. VLDB Endow., 2013

Euclidean Traveling Salesman Tours through Stochastic Neighborhoods.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

On the Most Likely Convex Hull of Uncertain Points.
Proceedings of the Algorithms - ESA 2013, 2013

A near-optimal algorithm for shortest paths among curved obstacles in the plane.
Proceedings of the Symposuim on Computational Geometry 2013, 2013

2012
Reconstructing visibility graphs with simple robots.
Theor. Comput. Sci., 2012

Capturing an evader in polygonal environments with obstacles: The full visibility case.
I. J. Robotics Res., 2012

Memory Efficient De Bruijn Graph Construction
CoRR, 2012

On Klee's measure problem for grounded boxes.
Proceedings of the Symposuim on Computational Geometry 2012, 2012

Geometric Computing over Uncertain Data.
Proceedings of the Algorithms for Sensor Systems, 2012

Catch Me If You Can: Pursuit and Capture in Polygonal Environments with Obstacles.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
Multiple-Target Tracking With Binary Proximity Sensors.
ACM Trans. Sens. Networks, 2011

Capturing an Evader in Polygonal Environments: A Complete Information Game
CoRR, 2011

Efficiently Measuring Bandwidth at All Time Scales.
Proceedings of the 8th USENIX Symposium on Networked Systems Design and Implementation, 2011

The Union of Probabilistic Boxes: Maintaining the Volume.
Proceedings of the Algorithms - ESA 2011, 2011

Stochastic minimum spanning trees in euclidean spaces.
Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

A Discrete and Dynamic Version of Klee's Measure Problem.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

Stochastic Minimum Spanning Trees and Related Problems.
Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics, 2011

Complete Information Pursuit Evasion in Polygonal Environments.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010
Multiagent Pursuit Evasion, or Playing Kabaddi.
Proceedings of the Algorithmic Foundations of Robotics IX, 2010

Space-efficient online approximation of time series data: Streams, amnesia, and out-of-order.
Proceedings of the 26th International Conference on Data Engineering, 2010

Robot kabaddi.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

Untangling the Braid: Finding Outliers in a Set of Streams.
Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments, 2010

2009
Quantiles on Streams.
Proceedings of the Encyclopedia of Database Systems, 2009

Target tracking with binary proximity sensors.
ACM Trans. Sens. Networks, 2009

Catching elephants with mice: Sparse sampling for monitoring sensor networks.
ACM Trans. Sens. Networks, 2009

GAMPS: compressing multi sensor data by grouping and amplitude scaling.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2009

09371 Abstracts Collection - Algorithmic Methods for Distributed Cooperative Systems.
Proceedings of the Algorithmic Methods for Distributed Cooperative Systems, 06.09., 2009

2008
Detecting cuts in sensor networks.
ACM Trans. Sens. Networks, 2008

Formulating and implementing profiling over adaptive ranges.
TACO, 2008

Summarizing spatial data streams using ClusterHulls.
ACM J. Exp. Algorithmics, 2008

Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry.
I. J. Robotics Res., 2008

Adaptive sampling for geometric problems over data streams.
Comput. Geom., 2008

A game-theoretic analysis of wireless access point selection by mobile users.
Comput. Commun., 2008

Towards real-time dynamic spectrum auctions.
Comput. Networks, 2008

Bandwidth-Constrained Allocation in Grid Computing.
Algorithmica, 2008

Simplified Planar Coresets for Data Streams.
Proceedings of the Algorithm Theory, 2008

Angle Optimization in Target Tracking.
Proceedings of the Algorithm Theory, 2008

eBay in the Sky: strategy-proof wireless spectrum auctions.
Proceedings of the 14th Annual International Conference on Mobile Computing and Networking, 2008

Target Counting under Minimal Sensing: Complexity and Approximations.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2008

Simple Robots in Polygonal Environments: A Hierarchy.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2008

2007
On the difficulty of some shortest path problems.
ACM Trans. Algorithms, 2007

Finding the <i>k</i> shortest simple paths: A new algorithm and its implementation.
ACM Trans. Algorithms, 2007

Attribute-based access to distributed data over P2P networks.
Int. J. Comput. Sci. Eng., 2007

Selfish Load Balancing and Atomic Congestion Games.
Algorithmica, 2007

Tracking multiple targets using binary proximity sensors.
Proceedings of the 6th International Conference on Information Processing in Sensor Networks, 2007

Approximate isocontours and spatial summaries for sensor networks.
Proceedings of the 6th International Conference on Information Processing in Sensor Networks, 2007

Space Efficient Streaming Algorithms for the Maximum Error Histogram.
Proceedings of the 23rd International Conference on Data Engineering, 2007

07151 Abstracts Collection -- Geometry in Sensor Networks.
Proceedings of the Geometry in Sensor Networks, 09.04. - 13.04.2007, 2007

Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

Counting Targets with Mobile Sensors in an Unknown Environment.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2007

2006
Side constraints and non-price attributes in markets.
Games Econ. Behav., 2006

Range Counting over Multidimensional Data Streams.
Discret. Comput. Geom., 2006

Fast packet classification for two-dimensional conflict-free filters.
Comput. Networks, 2006

Adaptive Spatial Partitioning for Multidimensional Data Streams.
Algorithmica, 2006

Target tracking with binary proximity sensors: fundamental limits, minimal descriptions, and algorithms.
Proceedings of the 4th International Conference on Embedded Networked Sensor Systems, 2006

Search-quality Tradeoffs for Routing in Non-ideal Wireless Networks.
Proceedings of the Third Annual IEEE Communications Society Conference on Sensor, 2006

Distributed Navigation Algorithms for Sensor Networks.
Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006

Cluster Hull: A Technique for Summarizing Spatial Data Streams.
Proceedings of the 22nd International Conference on Data Engineering, 2006

Contour Approximation in Sensor Networks.
Proceedings of the Distributed Computing in Sensor Systems, 2006

Profiling over Adaptive Ranges.
Proceedings of the Fourth IEEE/ACM International Symposium on Code Generation and Optimization (CGO 2006), 2006

2005
Binary Space Partitions of Orthogonal Subdivisions.
SIAM J. Comput., 2005

CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions.
Manag. Sci., 2005

Real-world environment models for mobile network evaluation.
IEEE J. Sel. Areas Commun., 2005

Approximately-strategyproof and tractable multiunit auctions.
Decis. Support Syst., 2005

A lower bound for multicast key distribution.
Comput. Networks, 2005

Space complexity of hierarchical heavy hitters in multi-dimensional data streams.
Proceedings of the Twenty-fourth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2005

Power aware routing for sensor databases.
Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

Interval Subset Sum and Uniform-Price Auction Clearing.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
Polygons.
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

Guest Editor's Foreword.
Discret. Comput. Geom., 2004

Multiway range trees: scalable IP lookup with fast updates.
Comput. Networks, 2004

Routing bandwidth-guaranteed paths with restoration in label-switched networks .
Comput. Networks, 2004

Medians and beyond: new aggregation techniques for sensor networks.
Proceedings of the 2nd International Conference on Embedded Networked Sensor Systems, 2004

Uncoordinated Load Balancing and Congestion Games in P2P Systems.
Proceedings of the Peer-to-Peer Systems III, Third International Workshop, 2004

Congestion Games, Load Balancing, and Price of Anarchy.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 2004

2003
A Constant Bound for Geometric Permutations of Disjoint Unit Balls.
Discret. Comput. Geom., 2003

Geometric permutations of balls with bounded size disparity.
Comput. Geom., 2003

Profile-based routing and traffic engineering.
Comput. Commun., 2003

Compressing Two-Dimensional Routing Tables.
Algorithmica, 2003

BOB: Improved winner determination in combinatorial auctions and generalizations.
Artif. Intell., 2003

Binary space partitions for 3D subdivisions.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Solving combinatorial exchanges: optimality via a few partial bids.
Proceedings of the Proceedings 4th ACM Conference on Electronic Commerce (EC-2003), 2003

Approximately-strategyproof and tractable multi-unit auctions.
Proceedings of the Proceedings 4th ACM Conference on Electronic Commerce (EC-2003), 2003

Range Addressable Network: A P2P Cache Architecture for Data Ranges.
Proceedings of the 3rd International Conference on Peer-to-Peer Computing (P2P 2003), 2003

A Game Theoretic Framework for Incentives in P2P Systems.
Proceedings of the 3rd International Conference on Peer-to-Peer Computing (P2P 2003), 2003

Towards realistic mobility models for mobile ad hoc networks.
Proceedings of the Ninth Annual International Conference on Mobile Computing and Networking, 2003

Finding the k Shortest Simple Paths: A New Algorithm and Its Implementation.
Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, 2003

2002
Algorithms for a Minimum Volume Enclosing Simplex in Three Dimensions.
SIAM J. Comput., 2002

Curvature-Constrained Shortest Paths in a Convex Polygon.
SIAM J. Comput., 2002

Silo, rainbow, and caching token: schemes for scalable, fault tolerant stream caching.
IEEE J. Sel. Areas Commun., 2002

Algorithmic issues in modeling motion.
ACM Comput. Surv., 2002

Market Clearing with Supply and Demand Curves.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Erratum to "Vickrey Pricing and Shortest Paths: What is an Edge Worth?".
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

Winner determination in combinatorial auction generalizations.
Proceedings of the First International Joint Conference on Autonomous Agents & Multiagent Systems, 2002

2001
Kinetic Connectivity for Unit Disks.
Discret. Comput. Geom., 2001

Shape sensitive geometric permutations.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Simplified kinetic connectivity for rectangles and hypercubes.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Fast firewall implementations for software-based and hardware-based routers.
Proceedings of the Joint International Conference on Measurements and Modeling of Computer Systems, 2001

Profile-Based Routing: A New Framework for MPLS Traffic Engineering.
Proceedings of the Quality of Future Internet Services, 2001

Fast Packet Classification for Two-Dimensional Conflict-Free Filters.
Proceedings of the Proceedings IEEE INFOCOM 2001, 2001

CABOB: A Fast Optimal Algorithm for Combinatorial Auctions.
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001

Market Clearability.
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001

Fast Firewall Implementations for Software and Hardware-Based Routers.
Proceedings of the 9th International Conference on Network Protocols (ICNP 2001), 2001

Vickrey Prices and Shortest Paths: What is an Edge Worth?.
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000
Rectangular Tiling in Multidimensional Arrays.
J. Algorithms, 2000

Online Scheduling with Hard Deadlines.
J. Algorithms, 2000

Morphing Simple Polygons.
Discret. Comput. Geom., 2000

Optimal Flow Aggregation.
Proceedings of the Algorithm Theory, 2000

Algorithms for minimum volume enclosing simplex in R<sup>3</sup>.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Detecting and Resolving Packet Filter Conflicts.
Proceedings of the Proceedings IEEE INFOCOM 2000, 2000

Collision Detection Using Bounding Boxes: Convexity Helps.
Proceedings of the Algorithms, 2000

Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations.
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

1999
Analyzing bounding boxes for object intersection.
ACM Trans. Graph., 1999

An Optimal Algorithm for Euclidean Shortest Paths in the Plane.
SIAM J. Comput., 1999

Analysis of a bounding box heuristic for object intersection.
J. ACM, 1999

Packet Filtering in High Speed Networks.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Rectangular Tiling in Multi-dimensional Arrays.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Packet Classification Using Tuple Space Search.
Proceedings of the ACM SIGCOMM 1999 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, August 30, 1999

Space Decomposition Techniques for Fast Layer-4 Switching.
Proceedings of the Protocols for High Speed Networks VI, 1999

Kinetic Connectivity of Rectangles.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998
Surface Approximation and Geometric Partitions.
SIAM J. Comput., 1998

Noise-Tolerant Distribution-Free Learning of General Geometric Concepts.
J. ACM, 1998

Practical methods for approximating shortest paths on a convex polytope in R3.
Comput. Geom., 1998

Label placement by maximum independent set in rectangles.
Comput. Geom., 1998

Collision Detection in Aspect and Scale Bounded Polyhedra.
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

Fast and Scalable Layer Four Switching.
Proceedings of the ACM SIGCOMM 1998 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, August 31, 1998

Curvature-Constrained Shortest Paths in a Convex Polygon (Extended Abstract).
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997
Matrix Searching with the Shortest-Path Metric.
SIAM J. Comput., 1997

Designing Least-Cost Nonblocking Broadband Networks.
J. Algorithms, 1997

Query-Sensitive Ray Shooting.
Int. J. Comput. Geom. Appl., 1997

Finding a Shortest Diagonal of a Simple Polygon in Linear Time.
Comput. Geom., 1997

Efficient Breakout Routing in Printed Circuit Boards (Extended Abstract).
Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

On-line Scheduling with Hard Deadlines (Extended Abstract).
Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

Leap Forward Virtual Clock: A New Fair Queuing Scheme with Guaranteed Delays and Throughput Fairness.
Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

Leap Forward Virtual Clock: A New Fair Queueing Scheme with Guaranteed Delays and Throughput Fairness.
Proceedings of the Proceedings IEEE INFOCOM '97, 1997

Efficient Breakout Routing in Printed Circuit Boards.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996
Off-Line Maintenance of Planar Configurations.
J. Algorithms, 1996

Simple and Practical Geometric Algorithms.
ACM Comput. Surv., 1996

1995
A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk.
J. Algorithms, 1995

Logarithmic-time link path queries in a simple polygon.
Int. J. Comput. Geom. Appl., 1995

Long Non-Crossing Configurations in the Plane.
Fundam. Inform., 1995

Separation and Approximation of Polyhedral Objects.
Comput. Geom., 1995

Practical Methods for Approximating Shortest Paths on a Convex Polytope in R<sup>3</sup>.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

Morphing Binary Trees.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

The Centroid of Points with Approximate Weights.
Proceedings of the Algorithms, 1995

Stabbing Triangulations by Lines in 3D.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994
Data Structures for Two-Edge Connectivity in Planar Graphs.
Theor. Comput. Sci., 1994

Can Visibility Graphs Be Represented Compactly?.
Discret. Comput. Geom., 1994

A Comparative Evaluation of Space Priority Strategies in ATM Networks.
Proceedings of the Proceedings IEEE INFOCOM '94, 1994

1993
Computing the Intersection-Depth of Polyhedra.
Algorithmica, 1993

Selecting Distances in the Plane.
Algorithmica, 1993

Efficient Computation of Euclidean Shortest Paths in the Plane
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992
Transitions in Geometric Minimum Spanning Trees.
Discret. Comput. Geom., 1992

Applications of a Semi-Dynamic Convex Hull Algorithm.
BIT Comput. Sci. Sect., 1992

Fully Dynamic 2-Edge-Connectivity in Planar Graphs.
Proceedings of the Algorithm Theory, 1992

Optimal Link Path Queries in a Simple Polygon.
Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

1991
Fast Matching Algorithms for Points on a Polygon.
SIAM J. Comput., 1991

Finding Tailored Partitions.
J. Algorithms, 1991

Finding k Points with Minimum Diameter and Related Problems.
J. Algorithms, 1991

Maintenance of Geometric Extrema.
J. ACM, 1991

Computing external farthest neighbors for a simple polygon.
Discret. Appl. Math., 1991

Farthest Neighbors, Maximum Spanning Trees and Related Problems in Higher Dimensions.
Comput. Geom., 1991

Farthest Neighbours, Maximum Spanning Trees and Related Problems in Higher Dimensions.
Proceedings of the Algorithms and Data Structures, 1991

Offline Maintenance of Planar Configurations.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

Transitions in Geometric Minimum Spanning Trees (Extended Abstract).
Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1990
On some link distance problems in a simple polygon.
IEEE Trans. Robotics Autom., 1990

An Optimal Algorithm for Detecting Weak Visibility of a Polygon.
IEEE Trans. Computers, 1990

Computing the Longest Diagonal of a Simple Polygon.
Inf. Process. Lett., 1990

Computing Euclidean Maximum Spanning Trees.
Algorithmica, 1990

Implicitly Searching Convolutions and Computing Depth of Collision.
Proceedings of the Algorithms, 1990

1989
Finding Minimal Convex Nested Polygons
Inf. Comput., October, 1989

Computing Geodesic Furthest Neighbors in Simple Polygons.
J. Comput. Syst. Sci., 1989

Computing the Minimum Visible Vertex Distance between Two Polygons (Preliminary Version).
Proceedings of the Algorithms and Data Structures, 1989

Fast Matching Algorithms for Points on a Polygon (Extended Abstract)
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

Dynamically Computing the Maxima of Decomposable Functions, with Applications
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

On Geometric Matching.
Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

Fining <i>k</i> Points with Minimum Spanning Trees and Related Problems.
Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

1988
Computing the Link Center of a Simple Polygon.
Discret. Comput. Geom., 1988

An Optimal Algorithm for Detecting Weak Visibility of a Polygon (Preliminary Version).
Proceedings of the STACS 88, 1988

1987
The All-Geodesic-Furthest Neighbor Problem for Simple Polygons.
Proceedings of the Third Annual Symposium on Computational Geometry, 1987

Fast Algorithms for Computing the Largest Empty Rectangle.
Proceedings of the Third Annual Symposium on Computational Geometry, 1987

1986
Worst-Case Optimal Algorithms for Constructing Visibility Polygons with Holes.
Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986

1985
Shortest Paths on Polyhedral Surfaces.
Proceedings of the STACS 85, 1985


  Loading...