Computing shortest transversals of sets (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
The upper envelope of Voronoi surfaces and its applications
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Computing a face in an arrangement of line segments
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Applications of parametric searching in geometric optimization
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
ACM Transactions on Graphics (TOG)
Scalable parallel geometric algorithms for coarse grained multicomputers
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Algorithms for visibility computation on digital terrain models
SAC '93 Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice
Vertical decompositions for triangles in 3-space
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Complete algorithms for reorienting polyhedral parts using a pivoting gripper
Proceedings of the eleventh annual symposium on Computational geometry
Sweeping lines and line segments with a heap
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Geometric algorithms for trap design
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Data structures for mobile data
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
The subtree max gap problem with application to parallel string covering
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
On Computing the Upper Envelope of Segments in Parallel
IEEE Transactions on Parallel and Distributed Systems
Motorcycle graphs and straight skeletons
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Fast Horizon Computation at All Points of a Terrain With Visibility and Shading Applications
IEEE Transactions on Visualization and Computer Graphics
Tight Error Bounds of Geometric Problems on Convex Objects with Imprecise Coordinates
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Cutting a Country for Smallest Square Fit
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Parallel Geometric Algorithms in Coarse-Grain Network Models
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
An Efficient k Nearest Neighbor Searching Algorithm for a Query Line
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope of Line Segments in Parallel
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Translating a regular grid over a point set
Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01
An efficient k nearest neighbors searching algorithm for a query line
Theoretical Computer Science
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Continuous path verification in multi-axis NC-machining
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Algorithms for the placement of diagrams on maps
Proceedings of the 12th annual ACM international workshop on Geographic information systems
Guarding a terrain by two watchtowers
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Conditional location of path and tree shaped facilities on trees
Journal of Algorithms
An improved method for calculating the no-fit polygon
Computers and Operations Research
Tolerance envelopes of planar mechanical parts
SM '04 Proceedings of the ninth ACM symposium on Solid modeling and applications
Journal of Parallel and Distributed Computing
Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor
Theoretical Computer Science
Visibility maps of segments and triangles in 3D
Computational Geometry: Theory and Applications
An Algorithmic Toolbox for Network Calculus
Discrete Event Dynamic Systems
Capturing crossings: Convex hulls of segment and plane intersections
Information Processing Letters
Kinetic maintenance of mobile k-centres on trees
Discrete Applied Mathematics
Decentralised coordination of continuously valued control parameters using the max-sum algorithm
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Computing the dilation of edge-augmented graphs in metric spaces
Computational Geometry: Theory and Applications
Connect the Dot: Computing Feed-Links with Minimum Dilation
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
On a pair of job-machine assignment problems with two stages
Computers and Operations Research
Tolerance envelopes of planar mechanical parts with parametric tolerances
Computer-Aided Design
Precise global collision detection in multi-axis NC-machining
Computer-Aided Design
An improved method for calculating the no-fit polygon
Computers and Operations Research
Querying Two Boundary Points for Shortest Paths in a Polygonal Domain
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Conditional location of path and tree shaped facilities on trees
Journal of Algorithms
Largest empty circle centered on a query line
Journal of Discrete Algorithms
A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning
The Journal of Machine Learning Research
Kinetic maintenance of mobile k-centres on trees
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Uncertain geometry with dependencies
Proceedings of the 14th ACM Symposium on Solid and Physical Modeling
Top-k queries on temporal data
The VLDB Journal — The International Journal on Very Large Data Bases
Finding best swap edges minimizing the routing cost of a spanning tree
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Theoretical Computer Science
Line Transversals of Convex Polyhedra in $\mathbb{R}^3$
SIAM Journal on Computing
Answer-pairs and processing of continuous nearest-neighbor queries
FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
An intersection model for multitolerance graphs: efficient algorithms and hierarchy
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Querying two boundary points for shortest paths in a polygonal domain
Computational Geometry: Theory and Applications
Tight bound for farthest-color voronoi diagrams of line segments
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
One-way and round-trip center location problems
Discrete Optimization
Technical note: Uncertain lines and circles with dependencies
Computer-Aided Design
Loyalty-based selection: retrieving objects that persistently satisfy criteria
Proceedings of the 21st ACM international conference on Information and knowledge management
Computing pure Bayesian-Nash equilibria in games with finite actions and continuous types
Artificial Intelligence
Sweeping a terrain by collaborative aerial vehicles
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
| Hi-index | 0.89 |