Procopiuc, Journal of Algorithms , 46 , Procopiuc, Algorithmica , 33 , Procopiuc, M. Jones, and T. Bhattacharya and S. Sen, Algorithmica , 32 , Sharir and E. Varadarajan, Information Processing Letters , 62 , Sharir and S. Toledo, Journal of Algorithms , 17 , Sharir, Algorithmica , 11 , Proximity " Improved dynamic geodesic nearest neighbor searching in a simple polygon ," with L. Arge and F.
Klein, C. Knauer, S. Langerman, P. Morin, M. Sharir, and M. Wang and P. Hagerup, R. Ray, M. Sharir, M.
Smid, and E. Sen, Journal of Algorithms , 20 , Aronov, M. Suri, Algorithmica , 9 , Matousek and S. Shing, European Journal of Operational Research, 62 , Aggarwal, B. Kosaraju, B.
On finding a guard that sees most and a shop that sells most
Shieber, and S. Suri, Discrete Applied Mathematics , 31 , Edelsbrunner, O. Schwarzkopf, and E. Points on the boundary of a rectangle ," with M. Shing, Networks , 20 , Kinetic Algorithms " Maintaining Reeb graphs of triangulated 2-manifolds ," with K. Fox and A. Kaplan, N. Rubin, and M. Sharir, Discrete and Computational Geometry , 54 , Gao, L.
- Market, Class, and Employment;
- Management and Technology in Knowledge, Service, Tourism & Hospitality;
- Dynamic Modeling of Transport Process Systems!
- Broken Chain: How the White and Indian Worlds Remembered Henry Hudson and the Dutch.
- A General Approach to Online Network Optimization Problems.
- Cooking Korean Food With Maangchi: Traditional Korean Recipes!
Guibas, H. Kaplan, V. Koltun, N.
Sadri and H. Wang and H. Abam, M. Yu, in Fourteenth European Symposium on Algorithms , Guibas, and S. Arge, J.
Citations en double
Erickson, and H. Yu, in Twelfth European Symposium on Algorithms , Guibas, J. Hershberger, and E. Arge and J. Erickson and L. Geometric Data Structures " Approximate nearest neighbor search amid higher-dimensional flats ," with N. Rubin and M.
- Algorithms for Media-on-Demand Systems.
- Control and Automation in Anaesthesia.
- Shape Analysis;
- Debating Brain Drain: May Governments Restrict Emigration?.
- Recent Advances in Adsorption Processes for Environmental Protection and Security?
- Symposium on Discrete Algorithms (SODA);
Arge, S. Govindrajan, J.
Yang, and K. Yi, Computational Geometry: Theory and Applications , 46 , Arge, H. Kaplan, E. Molad, R. Tarjan, K. Arge and K. Arge, A. Danner, and B. Yi, in Eleventh European Symposium on Algorithms , Gudmundsson, M. Hammar, and H. Govindarajan and S. Muthukrishnan, in Tenth European Symposium on Algorithms , Arge, G. Brodal, and J. Sharir, Journal of Algorithms , 21 , Matousek, Algorithmica , 13 , Sharir, Journal of Algorithms 14 , Overmars, Journal of Algorithms 15 , Overmars, BIT 32 , Arrangements " Algorithms for center and Tverberg points ," with M.
Kaplan and M. Cabello, J. Independent set of intersection graphs of convex objects in 2D ," with N. Mustafa, Computational Geometry: Theory and Applications , 34 , Efrat and M. Matousek, and O. Aronov, T. Chan, and M. Proceedings of the 40th annual ACM symposium on Theory of computing, , Approximation, Randomization, and Combinatorial Optimization.. International Computing and Combinatorics Conference, , Planar graphs, negative weight edges, shortest paths, and near linear time J Fakcharoenphol, S Rao Journal of Computer and System Sciences 72 5 , , Graph in graph theory.
NSF Award Search: Award# - CAREER: Algorithms for fitting, matching, and simplifying shapes
Vertex of a graph. Access to Document Link to publication in Scopus. Link to citation list in Scopus.
Related Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms
Copyright 2019 - All Right Reserved