The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Joseph S. B. Mitchell: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Esther M. Arkin, L. Paul Chew, Daniel P. Huttenlocher, Klara Kedem, Joseph S. B. Mitchell
    An Efficiently Computable Metric for Comparing Polygonal Shapes. [Citation Graph (1, 0)][DBLP]
    SODA, 1990, pp:129-137 [Conf]
  2. Joseph S. B. Mitchell
    Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple New Method for the Geometric k-MST Problem. [Citation Graph (1, 0)][DBLP]
    SODA, 1996, pp:402-408 [Conf]
  3. Saurabh Sethia, Martin Held, Joseph S. B. Mitchell
    PVD: A Stable Implementation for Computing Voronoi Diagrams of Polygonal Pockets. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2001, pp:105-116 [Conf]
  4. Piyush Kumar, Joseph S. B. Mitchell, E. Alper Yildirim
    Comuting Core-Sets and Approximate Smallest Enclosing HyperSpheres in High Dimensions. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2003, pp:45-55 [Conf]
  5. Alon Efrat, Sariel Har-Peled, Joseph S. B. Mitchell
    Approximation algorithms for location problems in sensor networks. [Citation Graph (0, 0)][DBLP]
    BROADNETS, 2005, pp:767-776 [Conf]
  6. Esther M. Arkin, Patrice Belleville, Joseph S. B. Mitchell, David M. Mount, Kathleen Romanik, Steven Salzberg, Diane L. Souvaine
    Testing Simple Polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:387- [Conf]
  7. Esther M. Arkin, Sándor P. Fekete, Joseph S. B. Mitchell
    The Lawnmower Problem. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:461-466 [Conf]
  8. Erik D. Demaine, Satyan L. Devadoss, Joseph S. B. Mitchell, Joseph O'Rourke
    Continuous foldability of polygonal paper. [Citation Graph (0, 0)][DBLP]
    CCCG, 2004, pp:64-67 [Conf]
  9. Erik D. Demaine, Joseph S. B. Mitchell
    Reaching folded states of a rectangular piece of paper. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:73-75 [Conf]
  10. Valentin Polishchuk, Joseph S. B. Mitchell
    k-Link Rectilinear Shortest Paths Among Rectilinear Obstacles in the Plane. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:101-104 [Conf]
  11. Valentin Polishchuk, Joseph S. B. Mitchell
    Touring Convex Bodies - A Conic Programming Solution. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:290-293 [Conf]
  12. Erik L. Wynters, Joseph S. B. Mitchell
    Shortest Paths for a Two-robot Rendez-vous. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:216-221 [Conf]
  13. Chong Zhu, Gopalakrishnan Sundaram, Jack Snoeyink, Joseph S. B. Mitchell
    Generating Random x-Monotone Polygons with Given Vertices. [Citation Graph (0, 0)][DBLP]
    CCCG, 1994, pp:189-194 [Conf]
  14. Vitus J. Leung, Esther M. Arkin, Michael A. Bender, David P. Bunde, Jeanette Johnston, Alok Lal, Joseph S. B. Mitchell, Cynthia A. Phillips, Steven S. Seiden
    Processor Allocation on Cplant: Achieving General Processor Locality Using One-Dimensional Allocation Strategies. [Citation Graph (0, 0)][DBLP]
    CLUSTER, 2002, pp:296-304 [Conf]
  15. Esther M. Arkin, Gill Barequet, Joseph S. B. Mitchell
    Algorithms for two-box covering. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:459-467 [Conf]
  16. Esther M. Arkin, Robert Connelly, Joseph S. B. Mitchell
    On Monotone Paths Among Obstacles with Applications to Planning Assemblies. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:334-343 [Conf]
  17. Esther M. Arkin, Dan Halperin, Klara Kedem, Joseph S. B. Mitchell, Nir Naor
    Arrangements of Segments that Share Endpoints: Single Face Results. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:324-333 [Conf]
  18. Esther M. Arkin, Henk Meijer, Joseph S. B. Mitchell, David Rappaport, Steven Skiena
    Decision Trees for Geometric Models. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:369-378 [Conf]
  19. Esther M. Arkin, Joseph S. B. Mitchell, Giri Narasimhan
    Resource-Constrained Geometric Network Optimization. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:307-316 [Conf]
  20. Helmut Alt, Esther M. Arkin, Hervé Brönnimann, Jeff Erickson, Sándor P. Fekete, Christian Knauer, Jonathan Lenchner, Joseph S. B. Mitchell, Kim Whittlesey
    Minimum-cost coverage of point sets by disks. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:449-458 [Conf]
  21. Boaz Ben-Moshe, Olaf Hall-Holt, Matthew J. Katz, Joseph S. B. Mitchell
    Computing the visibility graph of points within a polygon. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:27-35 [Conf]
  22. Boaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell
    Farthest neighbors and center points in the presence of rectangular obstacles. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:164-171 [Conf]
  23. Boaz Ben-Moshe, Joseph S. B. Mitchell, Matthew J. Katz, Yuval Nir
    Visibility preserving terrain simplification: an experimental study. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:303-311 [Conf]
  24. Robert Connelly, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Stefan Langerman, Joseph S. B. Mitchell, Ares Ribó, Günter Rote
    Locked and unlocked chains of planar shapes. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:61-70 [Conf]
  25. Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap
    Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:483-484 [Conf]
  26. Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell
    Folding Flat Silhouettes and Wrapping Polyhedral Packages: New Results in Computational Origami. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:105-114 [Conf]
  27. Adrian Dumitrescu, Joseph S. B. Mitchell, Micha Sharir
    Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:141-150 [Conf]
  28. Regina Estkowski, Joseph S. B. Mitchell
    Simplifying a polygonal subdivision while keeping it simple. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:40-49 [Conf]
  29. Regina Estkowski, Joseph S. B. Mitchell, Xinyu Xiang
    Optimal decomposition of polygonal models into triangle strips. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:254-263 [Conf]
  30. Sándor P. Fekete, Joseph S. B. Mitchell, Karin Weinbrecht
    On the continuous Weber and k-median problems (extended abstract). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:70-79 [Conf]
  31. Laxmi Gewali, Alex Meng, Joseph S. B. Mitchell, Simeon C. Ntafos
    Path Planning in 0/1/infinity Weighted Regions with Applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:266-278 [Conf]
  32. Michael T. Goodrich, Joseph S. B. Mitchell, Mark W. Orletsky
    Practical Methods for Approximate Geometric Pattern Matching Under Rigid Motions (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:103-112 [Conf]
  33. Paul J. Heffernan, Joseph S. B. Mitchell
    Structured Visibility Profiles with Applications to Problems in Simple Polygons (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:53-62 [Conf]
  34. Martin Held, James T. Klosowski, Joseph S. B. Mitchell
    Collision Detection for Fly-Throughs in Virtual Environments. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:0-13 [Conf]
  35. Tien-Ruey Hsiang, Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell
    Online dispersion algorithms for swarms of robots. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:382-383 [Conf]
  36. Marc J. van Kreveld, Joseph S. B. Mitchell, Peter Rousseeuw, Micha Sharir, Jack Snoeyink, Bettina Speckmann
    Efficient Algorithms for Maximum Regression Depth. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:31-40 [Conf]
  37. Cristian S. Mata, Joseph S. B. Mitchell
    Approximation Algorithms for Geometric Tour and Network Design Problems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:360-369 [Conf]
  38. Cristian S. Mata, Joseph S. B. Mitchell
    A New Algorithm for Computing Shortest Paths in Weighted Planar Subdivisions (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:264-273 [Conf]
  39. Joseph S. B. Mitchell
    On Maximum Flows in Polyhedral Domains. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:341-351 [Conf]
  40. Joseph S. B. Mitchell
    Shortest Paths Among Obstacles in the Plane. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:308-317 [Conf]
  41. Joseph S. B. Mitchell, David M. Mount, Subhash Suri
    Query-Sensitive Ray Shooting. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:359-368 [Conf]
  42. Joseph S. B. Mitchell, Christos H. Papadimitriou
    The Weighted Region Problem. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:30-38 [Conf]
  43. Joseph S. B. Mitchell, Günter Rote, Gerhard J. Woeginger
    Minimum-Link Paths Among Obstacles in the Plane. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:63-72 [Conf]
  44. Joseph S. B. Mitchell, Micha Sharir
    New results on shortest paths in three dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:124-133 [Conf]
  45. George N. Sazaklis, Esther M. Arkin, Joseph S. B. Mitchell, Steven Skiena
    Geometric Decision Trees for Optical Character Recognition (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:394-396 [Conf]
  46. Shakhar Smorodinsky, Joseph S. B. Mitchell, Micha Sharir
    Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls inRd. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:400-406 [Conf]
  47. Valentin Polishchuk, Joseph S. B. Mitchell
    Thick non-crossing paths and minimum-cost flows in polygonal domains. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:56-65 [Conf]
  48. Esther M. Arkin, Yi-Jen Chiang, Martin Held, Joseph S. B. Mitchell, Vera Sacristan, Steven Skiena, Tae-Heng Yang
    On Minimum-Area Hulls (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:334-348 [Conf]
  49. Esther M. Arkin, Martin Held, Joseph S. B. Mitchell, Steven Skiena
    Hamilton Triangulations for Fast Rendering. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:36-47 [Conf]
  50. Iris Reinbacher, Marc Benkert, Marc J. van Kreveld, Joseph S. B. Mitchell, Alexander Wolff
    Delineating Boundaries for Imprecise Regions. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:143-154 [Conf]
  51. Esther M. Arkin, Ferran Hurtado, Joseph S. B. Mitchell, Carlos Seara, Steven Skiena
    Some Separability Problems in the Plane. [Citation Graph (0, 0)][DBLP]
    EWCG, 2000, pp:51-54 [Conf]
  52. Joseph S. B. Mitchell, Christine D. Piatko, Esther M. Arkin
    Computing a Shortest k-Link Path in a Polygon [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:573-582 [Conf]
  53. Cláudio T. Silva, Joseph S. B. Mitchell
    Greedy Cuts: An Advancing Front Terrain Triangulation Algorithm. [Citation Graph (0, 0)][DBLP]
    ACM-GIS, 1998, pp:137-144 [Conf]
  54. Leonidas J. Guibas, John Hershberger, Joseph S. B. Mitchell, Jack Snoeyink
    Approximating Polygons and Subdivisions with Minimum Link Paths. [Citation Graph (0, 0)][DBLP]
    ISA, 1991, pp:151-162 [Conf]
  55. Bernardo M. Ábrego, Esther M. Arkin, Silvia Fernández-Merchant, Ferran Hurtado, Mikio Kano, Joseph S. B. Mitchell, Jorge Urrutia
    Matching Points with Circles and Squares. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2004, pp:1-15 [Conf]
  56. Yue Wang, Jie Gao, Joseph S. B. Mitchell
    Boundary recognition in sensor networks by topological methods. [Citation Graph (0, 0)][DBLP]
    MOBICOM, 2006, pp:122-133 [Conf]
  57. Amitabh Basu, Jie Gao, Joseph S. B. Mitchell, Girishkumar Sabhnani
    Distributed localization using noisy distance and angle information. [Citation Graph (0, 0)][DBLP]
    MobiHoc, 2006, pp:262-273 [Conf]
  58. Xinyu Xiang, Martin Held, Joseph S. B. Mitchell
    Fast and effective stripification of polygonal surface models. [Citation Graph (0, 0)][DBLP]
    SI3D, 1999, pp:71-78 [Conf]
  59. Ricardo C. Farias, Joseph S. B. Mitchell, Cláudio T. Silva, Brian N. Wylie
    Time-Critical Rendering of Irregular Grids. [Citation Graph (0, 0)][DBLP]
    SIBGRAPI, 2000, pp:243-250 [Conf]
  60. Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Sándor P. Fekete, Joseph S. B. Mitchell, Saurabh Sethia
    Optimal covering tours with turn costs. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:138-147 [Conf]
  61. Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell, Martin Skutella
    The freeze-tag problem: how to wake up a swarm of robots. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:568-577 [Conf]
  62. Esther M. Arkin, Yi-Jen Chiang, Joseph S. B. Mitchell, Steven Skiena, Tae-Cheon Yang
    On the Maximum Scatter TSP (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:211-220 [Conf]
  63. Esther M. Arkin, Klara Kedem, Joseph S. B. Mitchell, Josef Sprinzak, Michael Werman
    Matching Points into Noise Regions: Combinatorial Bounds and Algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:42-51 [Conf]
  64. Esther M. Arkin, Joseph S. B. Mitchell, Subhash Suri
    Optimal Link Path Queries in a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:269-279 [Conf]
  65. Boaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell
    A constant-factor approximation algorithm for optimal terrain guarding. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:515-524 [Conf]
  66. Yi-Jen Chiang, Joseph S. B. Mitchell
    Two-Point Euclidean Shortest Path Queries in the Plane. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:215-224 [Conf]
  67. Adrian Dumitrescu, Joseph S. B. Mitchell
    Approximation algorithms for TSP with neighborhoods in the plane. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:38-46 [Conf]
  68. Alon Efrat, Leonidas J. Guibas, Sariel Har-Peled, David C. Lin, Joseph S. B. Mitchell, T. M. Murali
    Sweeping simple polygons with a chain of guards. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:927-936 [Conf]
  69. Olaf Hall-Holt, Matthew J. Katz, Piyush Kumar, Joseph S. B. Mitchell, Arik Sityon
    Finding large sticks and potatoes in polygons. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:474-483 [Conf]
  70. Joseph S. B. Mitchell, Subhash Suri
    Separation and Approximation of Polyhedral Objects. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:296-306 [Conf]
  71. Xinyu Xiang, Martin Held, Joseph S. B. Mitchell
    Fast and Effective Stripification of Polygonal Surface Models. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:985-986 [Conf]
  72. Moshe Dror, Alon Efrat, Anna Lubiw, Joseph S. B. Mitchell
    Touring a sequence of polygons. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:473-482 [Conf]
  73. Christos Levcopoulos, Andrzej Lingas, Joseph S. B. Mitchell
    Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:80-89 [Conf]
  74. Marcelo O. Sztainberg, Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell
    Analysis of Heuristics for the Freeze-Tag Problem. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:270-279 [Conf]
  75. Cláudio T. Silva, Joseph S. B. Mitchell, Arie E. Kaufman
    Automatic Generation of Triangular Irregular Networks Using Greedy Cuts. [Citation Graph (0, 0)][DBLP]
    IEEE Visualization, 1995, pp:201-208 [Conf]
  76. Ricardo C. Farias, Joseph S. B. Mitchell, Cláudio T. Silva
    ZSWEEP: an efficient and exact projection algorithm for unstructured volume rendering. [Citation Graph (0, 0)][DBLP]
    Volviz, 2000, pp:91-99 [Conf]
  77. Cláudio T. Silva, Joseph S. B. Mitchell, Arie E. Kaufman
    Fast Rendering of Irregular Grids. [Citation Graph (0, 0)][DBLP]
    VVS, 1996, pp:15-0 [Conf]
  78. Cláudio T. Silva, Joseph S. B. Mitchell, Peter L. Williams
    An Exact Interactive Time Visibility Ordering Algorithm for Polyhedral Cell Complexes. [Citation Graph (0, 0)][DBLP]
    VVS, 1998, pp:87-94 [Conf]
  79. Joseph S. B. Mitchell
    On Some Applications of Computational Geometry in Manufacturing and Virtual Environments. [Citation Graph (0, 0)][DBLP]
    WACG, 1996, pp:37-40 [Conf]
  80. Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell, Saurabh Sethia, Steven Skiena
    When Can You Fold a Map? [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:401-413 [Conf]
  81. Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Steven Skiena
    The Lazy Bureaucrat Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:122-133 [Conf]
  82. Peter Braß, Eowyn Cenek, Christian A. Duncan, Alon Efrat, Cesim Erten, Dan Ismailescu, Stephen G. Kobourov, Anna Lubiw, Joseph S. B. Mitchell
    On Simultaneous Planar Graph Embeddings. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:243-255 [Conf]
  83. Esther M. Arkin, Sándor P. Fekete, Ferran Hurtado, Joseph S. B. Mitchell, Marc Noy, Vera Sacristan, Saurabh Sethia
    On the Reflexivity of Point Sets. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:192-204 [Conf]
  84. Esther M. Arkin, Michael T. Goodrich, Joseph S. B. Mitchell, David M. Mount, Christine D. Piatko, Steven Skiena
    Point Probe Decision Trees for Geometric Concept Classes. [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:95-106 [Conf]
  85. Esther M. Arkin, Samir Khuller, Joseph S. B. Mitchell
    Geometric Knapsack Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:165-176 [Conf]
  86. Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell
    The Minimum-Area Spanning Tree Problem. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:195-204 [Conf]
  87. Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap
    k-Link Shortest Paths in Weighted Subdivisions. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:325-337 [Conf]
  88. 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]
  89. 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]
  90. Leonidas J. Guibas, Joseph S. B. Mitchell
    Voronoi Diagrams of Moving Points in the Plane. [Citation Graph (0, 0)][DBLP]
    WG, 1991, pp:113-125 [Conf]
  91. Joseph S. B. Mitchell
    An Algorithmic Approach to Some Problems in Terrain Navigation. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1988, v:37, n:1-3, pp:171-201 [Journal]
  92. Esther M. Arkin, Samir Khuller, Joseph S. B. Mitchell
    Geometric Knapsack Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:10, n:5, pp:399-427 [Journal]
  93. Esther M. Arkin, Yi-Jen Chiang, Martin Held, Joseph S. B. Mitchell, Vera Sacristan, Steven Skiena, Tae-Heng Yang
    On Minimum-Area Hulls. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:21, n:1, pp:119-136 [Journal]
  94. Joseph S. B. Mitchell
    L_1 Shortest Paths Among Polygonal Obstacles in the Plane. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:8, n:1, pp:55-88 [Journal]
  95. Joseph S. B. Mitchell, Günter Rote, Gerhard J. Woeginger
    Minimum-Link Paths Among Obstacles in the Plan. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:8, n:5&6, pp:431-459 [Journal]
  96. Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell, Martin Skutella
    The Freeze-Tag Problem: How to Wake Up a Swarm ofRobots. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:46, n:2, pp:193-221 [Journal]
  97. Joseph S. B. Mitchell
    A New Algorithm for Shortest Paths Among Obstacles in the Plane. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1991, v:3, n:1, pp:83-105 [Journal]
  98. Gill Barequet, Bernard Chazelle, Leonidas J. Guibas, Joseph S. B. Mitchell, Ayellet Tal
    BOXTREE: A Hierarchical Representation for Surfaces in 3D. [Citation Graph (0, 0)][DBLP]
    Comput. Graph. Forum, 1996, v:15, n:3, pp:387-396 [Journal]
  99. João Comba, James T. Klosowski, Nelson L. Max, Joseph S. B. Mitchell, Cláudio T. Silva, Peter L. Williams
    Fast Polyhedral Cell Sorting for Interactive Rendering of Unstructured Grids. [Citation Graph (0, 0)][DBLP]
    Comput. Graph. Forum, 1999, v:18, n:3, pp:369-376 [Journal]
  100. Boaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell, Yuval Nir
    Visibility preserving terrain simplification-- an experimental study. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:28, n:2-3, pp:175-190 [Journal]
  101. Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell, Saurabh Sethia, Steven Skiena
    When can you fold a map? [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:29, n:1, pp:23-46 [Journal]
  102. Esther M. Arkin, Patrice Belleville, Joseph S. B. Mitchell, David M. Mount, Kathleen Romanik, Steven Salzberg, Diane L. Souvaine
    Testing Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:97-114 [Journal]
  103. Esther M. Arkin, Sándor P. Fekete, Joseph S. B. Mitchell
    Approximation algorithms for lawn mowing and milling. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:17, n:1-2, pp:25-50 [Journal]
  104. Esther M. Arkin, Sándor P. Fekete, Joseph S. B. Mitchell
    An algorithmic study of manufacturing paperclips and other folded structures. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:25, n:1-2, pp:117-138 [Journal]
  105. Esther M. Arkin, Martin Held, Joseph S. B. Mitchell, Steven Skiena
    Recognizing polygonal parts from width measurements. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:9, n:4, pp:237-246 [Journal]
  106. Zhu Chong, Gopalakrishnan Sundaram, Jack Snoeyink, Joseph S. B. Mitchell
    Generating Random Polygons with Given Vertices. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1996, v:6, n:, pp:277-290 [Journal]
  107. Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell
    Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:16, n:1, pp:3-21 [Journal]
  108. Matthew J. Katz, Joseph S. B. Mitchell, Yuval Nir
    Orthogonal segment stabbing. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:30, n:2, pp:197-205 [Journal]
  109. Joseph S. B. Mitchell, Subhash Suri
    Separation and Approximation of Polyhedral Objects. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1995, v:5, n:, pp:95-114 [Journal]
  110. Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell
    The minimum-area spanning tree problem. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:35, n:3, pp:218-225 [Journal]
  111. Peter Braß, Eowyn Cenek, Christian A. Duncan, Alon Efrat, Cesim Erten, Dan Ismailescu, Stephen G. Kobourov, Anna Lubiw, Joseph S. B. Mitchell
    On simultaneous planar graph embeddings. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:36, n:2, pp:117-130 [Journal]
  112. Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell, Saurabh Sethia, Steven Skiena
    When Can You Fold a Map? [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  113. Joseph S. B. Mitchell, Joseph O'Rourke
    Computational Geometry Column 42 [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  114. Christian A. Duncan, Alon Efrat, Cesim Erten, Stephen G. Kobourov, Joseph S. B. Mitchell
    On Simultaneous Graph Embedding [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  115. Esther M. Arkin, Sándor P. Fekete, Joseph S. B. Mitchell
    An Algorithmic Study of Manufacturing Paperclips and Other Folded Structures [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  116. Esther M. Arkin, Sándor P. Fekete, Ferran Hurtado, Joseph S. B. Mitchell, Marc Noy, Vera Sacristan, Saurabh Sethia
    On the Reflexivity of Point Sets [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  117. Sándor P. Fekete, Joseph S. B. Mitchell, Karin Beurer
    On the continuous Fermat-Weber problem [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  118. Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Steven Skiena
    The Lazy Bureaucrat Scheduling Problem [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  119. Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Sándor P. Fekete, Joseph S. B. Mitchell, Saurabh Sethia
    Optimal Covering Tours with Turn Costs [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  120. Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell, Martin Skutella
    The Freeze-Tag Problem: How to Wake Up a Swarm of Robots [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  121. Tien-Ruey Hsiang, Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell
    Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  122. Ferran Hurtado, Joseph S. B. Mitchell, Marc Noy
    Foreword. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:109, n:1-2, pp:1- [Journal]
  123. Esther M. Arkin, Dan Halperin, Klara Kedem, Joseph S. B. Mitchell, Nir Naor
    Arrangements of Segments that Share Endpoints Single Face Results. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:13, n:, pp:257-270 [Journal]
  124. Adrian Dumitrescu, Joseph S. B. Mitchell, Micha Sharir
    Binary Space Partitions for Axis-Parallel Segments, Rectangles, and Hyperrectangles. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:31, n:2, pp:207-227 [Journal]
  125. Alon Efrat, Leonidas J. Guibas, Sariel Har-Peled, Joseph S. B. Mitchell, T. M. Murali
    New Similarity Measures between Polylines with Applications to Morphing and Polygon Sweeping. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2002, v:28, n:4, pp:535-569 [Journal]
  126. Sanjiv Kapoor, S. N. Maheshwari, Joseph S. B. Mitchell
    An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1997, v:18, n:4, pp:377-383 [Journal]
  127. Shakhar Smorodinsky, Joseph S. B. Mitchell, Micha Sharir
    Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls in Rd. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:23, n:2, pp:247-259 [Journal]
  128. Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Steven Skiena
    The Lazy Bureaucrat scheduling problem. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:184, n:1, pp:129-146 [Journal]
  129. Gerhard Albers, Leonidas J. Guibas, Joseph S. B. Mitchell, Thomas Roos
    Voronoi Diagrams of Moving Points. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1998, v:8, n:3, pp:365-380 [Journal]
  130. Esther M. Arkin, Ferran Hurtado, Joseph S. B. Mitchell, Carlos Seara, Steven Skiena
    Some Lower Bounds on Geometric Separability Problems. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2006, v:16, n:1, pp:1-26 [Journal]
  131. Esther M. Arkin, Henk Meijer, Joseph S. B. Mitchell, David Rappaport, Steven Skiena
    Decision trees for geometric models. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1998, v:8, n:3, pp:343-364 [Journal]
  132. Esther M. Arkin, Joseph S. B. Mitchell, Subhash Suri
    Logarithmic-time link path queries in a simple polygon. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1995, v:5, n:4, pp:369-395 [Journal]
  133. Esther M. Arkin, Joseph S. B. Mitchell, Steven Skiena
    Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1997, v:7, n:1/2, pp:1-0 [Journal]
  134. Sándor P. Fekete, Joseph S. B. Mitchell
    Terrain Decomposition and Layered Manufacturing. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2001, v:11, n:6, pp:647-668 [Journal]
  135. Leonidas J. Guibas, John Hershberger, Joseph S. B. Mitchell, Jack Snoeyink
    Approximating Polygons and Subdivisions with Minimum Link Paths. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1993, v:3, n:4, pp:383-415 [Journal]
  136. D. T. Lee, Joseph S. B. Mitchell
    A note from the editors-in-chief. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2004, v:14, n:1-2, pp:- [Journal]
  137. Joseph S. B. Mitchell
    Editor's foreword. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2004, v:14, n:4-5, pp:231-232 [Journal]
  138. Joseph S. B. Mitchell
    Shortest paths among obstacles in the plane. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1996, v:6, n:3, pp:309-332 [Journal]
  139. Joseph S. B. Mitchell, David M. Mount, Subhash Suri
    Query-Sensitive Ray Shooting. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1997, v:7, n:4, pp:317-347 [Journal]
  140. Joseph S. B. Mitchell, Joseph O'Rourke
    Computational Geometry Column 42. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2001, v:11, n:5, pp:573-582 [Journal]
  141. Ora Arbell, Gad M. Landau, Joseph S. B. Mitchell
    Edit distance of run-length encoded strings. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:83, n:6, pp:307-314 [Journal]
  142. Esther M. Arkin, Joseph S. B. Mitchell, Christine D. Piatko
    Minimum-link watchman tours. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:86, n:4, pp:203-207 [Journal]
  143. Samir Khuller, Joseph S. B. Mitchell
    On a Triangle Counting Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:33, n:6, pp:319-321 [Journal]
  144. Joseph S. B. Mitchell, Günter Rote, Gopalakrishnan Sundaram, Gerhard J. Woeginger
    Counting Convex Polygons in Planar Point Sets. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:1, pp:45-49 [Journal]
  145. Joseph S. B. Mitchell, Christos H. Papadimitriou
    The Weighted Region Problem: Finding Shortest Paths Through a Weighted Planar Subdivision. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1991, v:38, n:1, pp:18-73 [Journal]
  146. Adrian Dumitrescu, Joseph S. B. Mitchell
    Approximation algorithms for TSP with neighborhoods in the plane. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:48, n:1, pp:135-159 [Journal]
  147. Joseph S. B. Mitchell
    On Maximum Flows in Polyhedral Domains. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1990, v:40, n:1, pp:88-123 [Journal]
  148. Piyush Kumar, Joseph S. B. Mitchell, E. Alper Yildirim
    Approximate minimum enclosing balls in high dimensions using core-sets. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2003, v:8, n:, pp:- [Journal]
  149. Arie Tamir, Joseph S. B. Mitchell
    A maximum b-matching problem arising from median location models with applications to the roommates problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:80, n:, pp:171-194 [Journal]
  150. Esther M. Arkin, L. Paul Chew, Daniel P. Huttenlocher, Klara Kedem, Joseph S. B. Mitchell
    An Efficiently Computable Metric for Comparing Polygonal Shapes. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 1991, v:13, n:3, pp:209-216 [Journal]
  151. Michael T. Goodrich, Joseph S. B. Mitchell, Mark W. Orletsky
    Approximate Geometric Pattern Matching Under Rigid Motions. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 1999, v:21, n:4, pp:371-379 [Journal]
  152. Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Sándor P. Fekete, Joseph S. B. Mitchell, Saurabh Sethia
    Optimal Covering Tours with Turn Costs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:3, pp:531-566 [Journal]
  153. Esther M. Arkin, Yi-Jen Chiang, Joseph S. B. Mitchell, Steven Skiena, Tae-Cheon Yang
    On the Maximum Scatter Traveling Salesperson Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:2, pp:515-544 [Journal]
  154. Paul J. Heffernan, Joseph S. B. Mitchell
    An Optimal Algorithm for Computing Visibility in the Plane. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:1, pp:184-201 [Journal]
  155. Joseph S. B. Mitchell
    Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:4, pp:1298-1309 [Journal]
  156. Joseph S. B. Mitchell, Avrim Blum, Prasad Chalasani, Santosh Vempala
    A Constant-Factor Approximation Algorithm for the Geometric k-MST Problem in the Plane. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:3, pp:771-781 [Journal]
  157. Joseph S. B. Mitchell, David M. Mount, Christos H. Papadimitriou
    The Discrete Geodesic Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:4, pp:647-668 [Journal]
  158. Boaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell
    A Constant-Factor Approximation Algorithm for Optimal 1.5D Terrain Guarding. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:6, pp:1631-1647 [Journal]
  159. James T. Klosowski, Martin Held, Joseph S. B. Mitchell, Henry Sowizral, Karel Zikan
    Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Vis. Comput. Graph., 1998, v:4, n:1, pp:21-36 [Journal]
  160. Cláudio T. Silva, Joseph S. B. Mitchell
    The Lazy Sweep Ray Casting Algorithm for Rendering Irregular Grids. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Vis. Comput. Graph., 1997, v:3, n:2, pp:142-157 [Journal]
  161. Esther M. Arkin, Martin Held, Joseph S. B. Mitchell, Steven Skiena
    Hamiltonian triangulations for fast rendering. [Citation Graph (0, 0)][DBLP]
    The Visual Computer, 1996, v:12, n:9, pp:429-444 [Journal]
  162. Yoav Amit, Joseph S. B. Mitchell, Eli Packer
    Locating Guards for Visibility Coverage of Polygons. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2007, pp:- [Conf]
  163. Valentin Polishchuk, Esther M. Arkin, Joseph S. B. Mitchell
    Hamiltonian Cycles in Triangular Grids. [Citation Graph (0, 0)][DBLP]
    CCCG, 2006, pp:- [Conf]
  164. Esther M. Arkin, Joseph S. B. Mitchell, Jack Snoeyink
    Capturing Crossings: Convex Hulls of Segment and Plane Intersections. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:9-11 [Conf]
  165. Joseph S. B. Mitchell
    A PTAS for TSP with neighborhoods among fat regions in the plane. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:11-18 [Conf]
  166. Ferran Hurtado, Joseph S. B. Mitchell
    Editorial. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:37, n:1, pp:1-2 [Journal]
  167. Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Valentin Polishchuk
    The Snowblower Problem [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  168. Esther M. Arkin, Hervé Brönnimann, Jeff Erickson, Sándor P. Fekete, Christian Knauer, Jonathan Lenchner, Joseph S. B. Mitchell, Kim Whittlesey
    Minimum-Cost Coverage of Point Sets by Disks [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  169. Robert Connelly, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Stefan Langerman, Joseph S. B. Mitchell, Ares Ribó, Günter Rote
    Locked and Unlocked Chains of Planar Shapes [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  170. Joseph S. B. Mitchell
    Guest Editor's Foreword. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2007, v:37, n:1, pp:1-2 [Journal]

  171. Algorithmic Problems in Air Traffic Management. [Citation Graph (, )][DBLP]


  172. Geometric Algorithms for Optimal Airspace Design and Air Traffic Controller Workload Balancing. [Citation Graph (, )][DBLP]


  173. The Embroidery Problem. [Citation Graph (, )][DBLP]


  174. Approximating Maximum Flow in Polygonal Domains using Spanners. [Citation Graph (, )][DBLP]


  175. Routing a maximum number of disks through a scene of moving obstacles. [Citation Graph (, )][DBLP]


  176. Maximum thick paths in static and dynamic environments. [Citation Graph (, )][DBLP]


  177. Reconstructing sharp features of triangular meshes. [Citation Graph (, )][DBLP]


  178. A constant-factor approximation algorithm for TSP with pairwise-disjoint connected neighborhoods in the plane. [Citation Graph (, )][DBLP]


  179. Optimizing Restriction Site Placement for Synthetic Genomes. [Citation Graph (, )][DBLP]


  180. Data transmission and base-station placement for optimizing network lifetime. [Citation Graph (, )][DBLP]


  181. Improved Approximation Algorithms for Relay Placement. [Citation Graph (, )][DBLP]


  182. Light-Weight Contour Tracking in Wireless Sensor Networks. [Citation Graph (, )][DBLP]


  183. Iso-Contour Queries and Gradient Descent with Guaranteed Delivery in Sensor Networks. [Citation Graph (, )][DBLP]


  184. Preprocessing Imprecise Points and Splitting Triangulations. [Citation Graph (, )][DBLP]


  185. Minimum Covering with Travel Cost. [Citation Graph (, )][DBLP]


  186. Scheduling Aircraft to Reduce Controller Workload. [Citation Graph (, )][DBLP]


  187. The Snowblower Problem. [Citation Graph (, )][DBLP]


  188. An Experimental Study of Weighted k-Link Shortest Path Algorithms. [Citation Graph (, )][DBLP]


  189. Delineating Boundaries for Imprecise Regions. [Citation Graph (, )][DBLP]


  190. Not being (super)thin or solid is hard: A study of grid Hamiltonicity. [Citation Graph (, )][DBLP]


  191. Maximum thick paths in static and dynamic environments. [Citation Graph (, )][DBLP]


  192. Efficient Algorithms for Maximum Regression Depth. [Citation Graph (, )][DBLP]


  193. Matching Points with Squares. [Citation Graph (, )][DBLP]


  194. Locked and Unlocked Chains of Planar Shapes. [Citation Graph (, )][DBLP]


Search in 0.010secs, Finished in 0.016secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002