Conferences in DBLP
Walter Cunto , J. Ian Munro , Patricio V. Poblete A Case Study in Comparison Based Complexity: Finding the Nearest Value(s). [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:1-12 [Conf ] Boris Aronov , Micha Sharir On the Zone of a Surface in a Hyperplane Arrangement. [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:13-19 [Conf ] Marco Pellegrini Ray-shooting and Isotopy Classes of Lines in 3-Dimensional Space. [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:20-31 [Conf ] Paul F. Dietz Finding Level-Ancestors in Dynamic Trees. [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:32-40 [Conf ] Ravi Sundaram , Karan Sher Singh , C. Pandu Rangan Treewidth of Circular-Arc Graphs (Abstract). [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:41- [Conf ] Olivier Devillers , Stefan Meiser , Monique Teillaud Fully Dynamic Delauney Triangulation in Logarithmic Expected Time per Operation. [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:42-53 [Conf ] Hristo Djidjev , Andrzej Lingas On Computing the Voronoi Diagram for Restricted Planar Figures. [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:54-64 [Conf ] Josep Díaz , Alan Gibbons , Mike Paterson , Jacobo Torán The MINSUMCUT Problem. [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:65-89 [Conf ] Naoki Katoh , Kazuo Iwano Efficient Algorithms for the Minimum Range Cut Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:80-91 [Conf ] Selim G. Akl Memory Access in Models of Parallel Computation: From Folklore to Synergy and Beyond. [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:92-104 [Conf ] Pankaj K. Agarwal , Jirí Matousek , Subhash Suri Farthest Neighbours, Maximum Spanning Trees and Related Problems in Higher Dimensions. [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:105-116 [Conf ] Jeffrey S. Salowe Shallow Interdistnace Selection and Interdistance Enumeration. [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:117-128 [Conf ] Oscar R. Anguilar , Ajoy Kumar Datta , Sukumar Ghosh Sharing Memory in Asynchronous Message Passing Systems. [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:129-140 [Conf ] Lin Yu , Daniel J. Rosenkrantz A Linear-Time Scheme for Version Reconstruction (Extended Abstract). [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:141-152 [Conf ] Eric N. Hanson The Interval Skip List: A Data Structure for Finding All Intervals that Overlap a Point. [Citation Graph (2, 0)][DBLP ] WADS, 1991, pp:153-164 [Conf ] Esther M. Arkin , Samir Khuller , Joseph S. B. Mitchell Geometric Knapsack Problems. [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:165-176 [Conf ] Yijie Han A Fast Derandomization Schemes and Its Applications. [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:177-188 [Conf ] Thomas Lengauer , Dirk Theune Unstructured Path Problems and the Making of Semirings (Preliminary Version). [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:189-200 [Conf ] F. Frances Yao Neighborhood Graphs and Geometric Embedding. [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:201- [Conf ] Joseph S. B. Mitchell , Erik L. Wynters Finding Optimal Bipartitions of Points and Polygons. [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:202-213 [Conf ] Jurek Czyzowicz , Ivan Stojmenovic , Jorge Urrutia Immobilizing a Polytope. [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:214-227 [Conf ] Philippe Jacquet , Wojciech Szpankowski What Can We Learn about Suffix Trees from Independent Tries? [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:228-239 [Conf ] Fabrizio d'Amore , Alberto Marchetti-Spaccamela , Umberto Nanni Competitive Algorithms for the Weighted List Update Problem. [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:240-248 [Conf ] Bengt J. Nilsson , Sven Schuierer An Optimal Algorithm for the Rectilinear Link Center of a Rectangular Polygon. [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:249-260 [Conf ] Gautam Das , Giri Narasimhan Geometric Searching and Link Distance (Extended Abstract). [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:261-272 [Conf ] Dalit Naor , Vijay V. Vazirani Representing and Enumerating Edge Connectivity Cuts in RNC. [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:273-285 [Conf ] Goos Kant , Hans L. Bodlaender Planar Graph Augmentation Problems (Extended Abstract). [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:286-298 [Conf ] Greg N. Frederickson Parametric Search and Locating Supply Centers in Trees. [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:299-319 [Conf ] C. D. Yang , D. T. Lee , C. K. Wong On Bends and Lengths of Rectilinear Paths: A Graph-Theoretic Approach. [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:320-330 [Conf ] John Hershberger , Jack Snoeyink Computing Minimum Length Paths of a Given Homotopy Class (Extended Abstract). [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:331-342 [Conf ] Judit Bar-Ilan , David Peleg Approximation Algorithms for Selecting Network Centers (Preliminary Vesion). [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:343-354 [Conf ] S. S. Ravi , Daniel J. Rosenkrantz , Giri Kumar Tayi Facility Dispersion Problems: Heuristics and Special Cases (Extended Abstract). [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:355-366 [Conf ] Svante Carlsson , Bengt J. Nilsson , Simeon C. Ntafos Optimum Guard Covers and m-Watchmen Routes for Restricted Polygons. [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:367-378 [Conf ] Pankaj K. Agarwal , Micha Sharir Applications of a New Space Partitioning Technique. [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:379-391 [Conf ] David Eppstein Offline Algorithms for Dynamic Minimum Spanning Tree Problems. [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:392-399 [Conf ] Bernard M. E. Moret , Henry D. Shapiro An Emperical Analysis of Algorithms for Constructing a Minimum Spanning Tree. [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:400-411 [Conf ] Binay K. Bhattacharya , Asish Mukhopadhyay , Godfried T. Toussaint A Linear Time Algorithm for Computing the Shortest Line Segment from Which a Polygon is Weakly Externally Visible. [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:412-424 [Conf ] Gert Vegter Dynamically Maintaining the Visibility Graph. [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:425-436 [Conf ] Paul J. Heffernan , Joseph S. B. Mitchell An Optimal Algorithm for Computing Visibility in the Plane. [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:437-448 [Conf ] Giuseppe F. Italiano , Neil Sarnak Fully Persistent Data Structures for Disjoint Set Union Problems. [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:449-460 [Conf ] Sanjiv Kapoor , H. Ramesh Algorithms for Generating All Spanning Trees of Undirected, Directed and Weighted Graphs. [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:461-472 [Conf ] J. Ian Munro , Venkatesh Raman Sorting Multisets and Vectors In-Place. [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:473-480 [Conf ] Karl R. Abrahamson , Andrew Adler , Lisa Higham , David G. Kirkpatrick Probabilistic Leader Election on Rings of Known Size. [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:481-495 [Conf ]