Ray shooting and other applications of spanning trees with low stabbing number
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Walking on an arrangement topologically
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
There is a universal topological plane
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
An optimal algorithm for the (≤ k)-levels, with applications to separation and transversal problems
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Computing the visibility graph via pseudo-triangulations
Proceedings of the eleventh annual symposium on Computational geometry
Concept learning with geometric hypotheses
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Computing the discrepancy with applications to supersampling patterns
ACM Transactions on Graphics (TOG)
On the number of arrangements of pseudolines
Proceedings of the twelfth annual symposium on Computational geometry
On triangulating three-dimensional polygons
Proceedings of the twelfth annual symposium on Computational geometry
Multi-criteria geometric optimization problems in layered manufacturing
Proceedings of the fourteenth annual symposium on Computational geometry
Determining an optimal penetration among weighted regions in two and three dimensions
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Iterated nearest neighbors and finding minimal polytypes
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Lower bounds for linear satisfiability problems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A practical approximation algorithm for the LMS line estimator
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Partial matching of planar polylines under similarity transformations
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Fast implementation of depth contours using topological sweep
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Efficient and small representation of line arrangements with applications
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
A sum of squares theorem for visibility
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Monotone paths in line arrangement
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
A dual-space approach to tracking and sensor management in wireless sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Shattering a set of objects in 2D
Discrete Applied Mathematics
Monotone paths in line arrangements
Computational Geometry: Theory and Applications
Nordic Journal of Computing
Improved Optimal Weighted Links Algorithms
ICCS '02 Proceedings of the International Conference on Computational Science-Part III
Parallel Optimal Weighted Links
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
A New Competitive Strategy for Reaching the Kernel of an Unknown Polygon
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Optimal Beam Penetrations in Two and Three Dimensions
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Topological Peeling and Implementation
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Topological Sweep in Degenerate Cases
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
An Experimental Study and Comparison of Topological Peeling and Topological Walk
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
MAXIMUM CLIQUE and MINIMUM CLIQUE PARTITION in Visibility Graphs
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Finding an Optimal Path without Growing the Tree
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Optimal and suboptimal robust algorithms for proximity graphs
Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01
Algorithms for bivariate medians and a Fermat--Torricelli problem for lines
Computational Geometry: Theory and Applications - Special issue on the thirteenth canadian conference on computational geometry - CCCG'01
Finding an optimal path without growing the tree
Journal of Algorithms
On some monotone path problems in line arrangements
Computational Geometry: Theory and Applications
Heuristics for estimating contact area of supports in layered manufacturing
Journal of Experimental Algorithmics (JEA)
A practical approximation algorithm for the LMS line estimator
Computational Statistics & Data Analysis
On the number of tetrahedra with minimum, unit, and distinct volumes in three-space
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Combinatorial Approaches for Mass Spectra Recalibration
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
On the number of tetrahedra with minimum, unit, and distinct volumes in three-space
Combinatorics, Probability and Computing
Computational Geometric Approach to Submodular Function Minimization for Multiclass Queueing Systems
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Topological sweep of the complete graph
Discrete Applied Mathematics
Connected Rectilinear Graphs on Point Sets
Graph Drawing
Parallel Optimal Weighted Links
Transactions on Computational Science III
Arrangements of double pseudolines: extended abstract
Proceedings of the twenty-fifth annual symposium on Computational geometry
On some monotone path problems in line arrangements
Computational Geometry: Theory and Applications
Computing a closest point to a query hyperplane in three and higher dimensions
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Generalized shooter location problem
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Stabbers of line segments in the plane
Computational Geometry: Theory and Applications
Proceedings of the twenty-seventh annual symposium on Computational geometry
Empty pseudo-triangles in point sets
Discrete Applied Mathematics
Computing the least median of squares estimator in time O(nd)
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and its Applications - Volume Part I
How to place efficiently guards and paintings in an art gallery
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
On a class of O(n2) problems in computational geometry
Computational Geometry: Theory and Applications
Computational Geometry: Theory and Applications
Computing shortest paths among curved obstacles in the plane
Proceedings of the twenty-ninth annual symposium on Computational geometry
All-maximum and all-minimum problems under some measures
Journal of Discrete Algorithms
| Hi-index | 0.00 |