- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| c125 |      | |
| i20 | | Irina Kostitsyna, Joseph S. B. Mitchell: Local Redesigning of Airspace Sectors. CoRR abs/1302.1089 (2013) |
| i19 | | Joseph S. B. Mitchell, Valentin Polishchuk, Mikko Sysikaski: Minimum-Link Paths Revisited. CoRR abs/1302.3091 (2013) |
| 2012 | ||
| j90 | | Joondong Kim, Joseph S. B. Mitchell, Valentin Polishchuk, Shang Yang, Jingyu Zou: Routing multi-class traffic flows in the plane. Comput. Geom. 45(3): 99-114 (2012) |
| j89 | | Therese C. Biedl, Mohammad Tanvir Irfan, Justin Iwerks, Joondong Kim, Joseph S. B. Mitchell: The Art Gallery Theorem for Polyominoes. Discrete & Computational Geometry 48(3): 711-720 (2012) |
| j88 | | Pablo Montes, Heraldo Memelli, Charles B. Ward, Joondong Kim, Joseph S. B. Mitchell, Steven Skiena: Optimizing restriction site placement for synthetic genomes. Inf. Comput. 213: 59-69 (2012) |
| j87 | | Esther M. Arkin, Delia Garijo, Alberto Márquez, Joseph S. B. Mitchell, Carlos Seara: Separability of Point Sets by k-Level Linear Classification Trees. Int. J. Comput. Geometry Appl. 22(2): 143-166 (2012) |
| j86 | | Justin Iwerks, Joseph S. B. Mitchell: The art gallery theorem for simple polygons in terms of the number of reflex and convex vertices. Inf. Process. Lett. 112(20): 778-782 (2012) |
| j85 | | Sándor P. Fekete, Joseph S. B. Mitchell, Christiane Schmidt: Minimum covering with travel cost. J. Comb. Optim. 24(1): 32-51 (2012) |
| c124 | | Joseph S. B. Mitchell: Invited talk: Computational Geometry in Air Traffic Management. CCCG 2012: 283 |
| c123 | | Esther M. Arkin, Alon Efrat, George Hart, Irina Kostitsyna, Alexander Kröller, Joseph S. B. Mitchell, Valentin Polishchuk: Scandinavian Thins on Top of Cake: On the Smallest One-Size-Fits-All Box. FUN 2012: 16-27 |
| c122 | | Erik D. Demaine, Martin L. Demaine, Yair N. Minsky, Joseph S. B. Mitchell, Ronald L. Rivest, Mihai Patrascu: Picture-Hanging Puzzles. FUN 2012: 81-93 |
| c121 | | Alon Efrat, Joseph S. B. Mitchell, Swaminathan Sankararaman, Parrish Myers: Efficient algorithms for pursuing moving evaders in terrains. SIGSPATIAL/GIS 2012: 33-42 |
| c120 | | Esther M. Arkin, José Miguel Díaz-Báñez, Ferran Hurtado, Piyush Kumar, Joseph S. B. Mitchell, Belén Palop, Pablo Pérez-Lantero, Maria Saumell, Rodrigo I. Silveira: Bichromatic 2-Center of Pairs of Points. LATIN 2012: 25-36 |
| c119 | | Adrian Dumitrescu, Joseph S. B. Mitchell, Pawel Zylinski: Watchman Routes for Lines and Segments. SWAT 2012: 36-47 |
| i18 | | Erik D. Demaine, Martin L. Demaine, Yair N. Minsky, Joseph S. B. Mitchell, Ronald L. Rivest, Mihai Patrascu: Picture-Hanging Puzzles. CoRR abs/1203.3602 (2012) |
| 2011 | ||
| j84 | | Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Valentin Polishchuk: The snowblower problem. Comput. Geom. 44(8): 370-384 (2011) |
| c118 | | Sándor P. Fekete, Tom Kamphans, Alexander Kröller, Joseph S. B. Mitchell, Christiane Schmidt: Exploring and Triangulating a Region by a Swarm of Robots. APPROX-RANDOM 2011: 206-217 |
| c117 | | Esther M. Arkin, Antonio Fernández Anta, Joseph S. B. Mitchell, Miguel A. Mosteiro: Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in d-Dimensions. CCCG 2011 |
| c116 | | Therese C. Biedl, Mohammad Tanvir Irfan, Justin Iwerks, Joondong Kim, Joseph S. B. Mitchell: Guarding polyominoes. Symposium on Computational Geometry 2011: 387-396 |
| c115 | | Pankaj K. Agarwal, Alon Efrat, Chris Gniady, Joseph S. B. Mitchell, Valentin Polishchuk, Girishkumar Sabhnani: Distributed localization and clustering using data correlation and the Occam's razor principle. DCOSS 2011: 1-8 |
| c114 | | Esther M. Arkin, Claudia Dieckmann, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Lena Schlipf, Shang Yang: Convex Transversals. WADS 2011: 49-60 |
| c113 | | Erin W. Chambers, Sándor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Venkatesh Srinivasan, Ulrike Stege, Sue Whitesides: Connecting a Set of Circles with Minimum Sum of Radii. WADS 2011: 183-194 |
| i17 | | Sándor P. Fekete, Joseph S. B. Mitchell, Christiane Schmidt: Minimum Covering with Travel Cost. CoRR abs/1101.2360 (2011) |
| i16 | | Erin W. Chambers, Sándor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Venkatesh Srinivasan, Ulrike Stege, Sue Whitesides: Connecting a Set of Circles with Minimum Sum of Radii. CoRR abs/1105.0791 (2011) |
| i15 | | Esther M. Arkin, Antonio Fernández Anta, Joseph S. B. Mitchell, Miguel A. Mosteiro: Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in d-Dimensions. CoRR abs/1106.4927 (2011) |
| 2010 | ||
| j83 | | Esther M. Arkin, Joseph S. B. Mitchell, Valentin Polishchuk: Maximum thick paths in static and dynamic environments. Comput. Geom. 43(3): 279-294 (2010) |
| j82 | | 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. Discrete & Computational Geometry 44(2): 439-462 (2010) |
| j81 | | Yoav Amit, Joseph S. B. Mitchell, Eli Packer: Locating Guards for Visibility Coverage of Polygons. Int. J. Comput. Geometry Appl. 20(5): 601-630 (2010) |
| j80 | | Marc J. van Kreveld, Maarten Löffler, Joseph S. B. Mitchell: Preprocessing Imprecise Points and Splitting Triangulations. SIAM J. Comput. 39(7): 2990-3000 (2010) |
| c112 | | Joseph S. B. Mitchell: A constant-factor approximation algorithm for TSP with pairwise-disjoint connected neighborhoods in the plane. Symposium on Computational Geometry 2010: 183-191 |
| c111 | | Pablo Montes, Heraldo Memelli, Charles B. Ward, Joondong Kim, Joseph S. B. Mitchell, Steven Skiena: Optimizing Restriction Site Placement for Synthetic Genomes. CPM 2010: 323-337 |
| c110 | | Esther M. Arkin, Valentin Polishchuk, Alon Efrat, Srinivasan Ramasubramanian, Javad Taheri, Joseph S. B. Mitchell, Swaminathan Sankararaman: Data transmission and base-station placement for optimizing network lifetime. DIALM-PODC 2010: 23-32 |
| e2 |  | Jack Snoeyink, Mark de Berg, Joseph S. B. Mitchell, Günter Rote, Monique Teillaud (Eds.): Proceedings of the 26th ACM Symposium on Computational Geometry, Snowbird, Utah, USA, June 13-16, 2010. ACM 2010, isbn 978-1-4503-0016-2 |
| 2009 | ||
| j79 | | Esther M. Arkin, Sándor P. Fekete, Kamrul Islam, Henk Meijer, Joseph S. B. Mitchell, Yurai Núñez Rodríguez, Valentin Polishchuk, David Rappaport, Henry Xiao: Not being (super)thin or solid is hard: A study of grid Hamiltonicity. Comput. Geom. 42(6-7): 582-605 (2009) |
| j78 | | Bernardo M. Ábrego, Esther M. Arkin, Silvia Fernández-Merchant, Ferran Hurtado, Mikio Kano, Joseph S. B. Mitchell, Jorge Urrutia: Matching Points with Squares. Discrete & Computational Geometry 41(1): 77-95 (2009) |
| j77 | | Esther M. Arkin, Sang Won Bae, Alon Efrat, Kazuya Okamoto, Joseph S. B. Mitchell, Valentin Polishchuk: Geometric stable roommates. Inf. Process. Lett. 109(4): 219-224 (2009) |
| j76 | | Amitabh Basu, Joseph S. B. Mitchell, Girishkumar Sabhnani: Geometric algorithms for optimal airspace design and air traffic controller workload balancing. ACM Journal of Experimental Algorithmics 14 (2009) |
| j75 | | Sven Koenig, Joseph S. B. Mitchell, Apurva Mudgal, Craig A. Tovey: A Near-Tight Approximation Algorithm for the Robot Localization Problem. SIAM J. Comput. 39(2): 461-490 (2009) |
| c109 | | |
| c108 | | Joondong Kim, Alexander Kroeller, Joseph S. B. Mitchell: Scheduling Aircraft to Reduce Controller Workload. ATMOS 2009 |
| c107 | | Joondong Kim, Joseph S. B. Mitchell, Jingyu Zou: Approximating Maximum Flow in Polygonal Domains using Spanners. CCCG 2009: 115-118 |
| c106 | | Joseph S. B. Mitchell, Eli Packer: Reconstructing sharp features of triangular meshes. Symposium on Computational Geometry 2009: 102-103 |
| c105 | | Sándor P. Fekete, Joseph S. B. Mitchell, Christiane Schmidt: Minimum Covering with Travel Cost. ISAAC 2009: 393-402 |
| 2008 | ||
| j74 | | Iris Reinbacher, Marc Benkert, Marc J. van Kreveld, Joseph S. B. Mitchell, Jack Snoeyink, Alexander Wolff: Delineating Boundaries for Imprecise Regions. Algorithmica 50(3): 386-414 (2008) |
| j73 | | Marc J. van Kreveld, Joseph S. B. Mitchell, Peter Rousseeuw, Micha Sharir, Jack Snoeyink, Bettina Speckmann: Efficient Algorithms for Maximum Regression Depth. Discrete & Computational Geometry 39(4): 656-677 (2008) |
| j72 | | Joseph S. B. Mitchell, Valentin Polishchuk: Minimum-perimeter enclosures. Inf. Process. Lett. 107(3-4): 120-124 (2008) |
| j71 | | Esther M. Arkin, Joseph S. B. Mitchell, Jack Snoeyink: Capturing crossings: Convex hulls of segment and plane intersections. Inf. Process. Lett. 107(5): 194-197 (2008) |
| j70 | | Martin Held, Joseph S. B. Mitchell: Triangulating input-constrained planar point sets. Inf. Process. Lett. 109(1): 54-56 (2008) |
| c104 | | Amitabh Basu, Joseph S. B. Mitchell, Girishkumar Sabhnani: Geometric Algorithms for Optimal Airspace Design and Air Traffic Controller Workload Balancing. ALENEX 2008: 75-89 |
| c103 | | Esther M. Arkin, George Hart, Joondong Kim, Irina Kostitsyna, Joseph S. B. Mitchell, Girishkumar Sabhnani, Steven Skiena: The Embroidery Problem. CCCG 2008 |
| c102 | | Esther M. Arkin, Joseph S. B. Mitchell, Valentin Polishchuk: Maximum thick paths in static and dynamic environments. Symposium on Computational Geometry 2008: 20-27 |
| c101 | | Joondong Kim, Joseph S. B. Mitchell, Valentin Polishchuk, Arto Vihavainen: Routing a maximum number of disks through a scene of moving obstacles. Symposium on Computational Geometry 2008: 230-231 |
| c100 | | Alon Efrat, Sándor P. Fekete, Poornananda R. Gaddehosur, Joseph S. B. Mitchell, Valentin Polishchuk, Jukka Suomela: Improved Approximation Algorithms for Relay Placement. ESA 2008: 356-367 |
| c99 | | Uday Chebrolu, Piyush Kumar, Joseph S. B. Mitchell: On Finding Large Empty Convex Bodies in 3D Scenes of Polygonal Models. ICCSA Workshops 2008: 382-393 |
| c98 | | Rik Sarkar, Xianjin Zhu, Jie Gao, Leonidas J. Guibas, Joseph S. B. Mitchell: Iso-Contour Queries and Gradient Descent with Guaranteed Delivery in Sensor Networks. INFOCOM 2008: 960-967 |
| c97 | | Xianjin Zhu, Rik Sarkar, Jie Gao, Joseph S. B. Mitchell: Light-Weight Contour Tracking in Wireless Sensor Networks. INFOCOM 2008: 1175-1183 |
| c96 | | Marc J. van Kreveld, Maarten Löffler, Joseph S. B. Mitchell: Preprocessing Imprecise Points and Splitting Triangulations. ISAAC 2008: 544-555 |
| 2007 | ||
| j69 | | 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. Comput. Geom. 36(2): 117-130 (2007) |
| j68 | | |
| j67 | | |
| j66 | | Esther M. Arkin, Joseph S. B. Mitchell, Valentin Polishchuk: Two New Classes of Hamiltonian Graphs: (Extended Abstract). Electronic Notes in Discrete Mathematics 29: 565-569 (2007) |
| j65 | | Boaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell: A Constant-Factor Approximation Algorithm for Optimal 1.5D Terrain Guarding. SIAM J. Comput. 36(6): 1631-1647 (2007) |
| c95 | | Yoav Amit, Joseph S. B. Mitchell, Eli Packer: Locating Guards for Visibility Coverage of Polygons. ALENEX 2007 |
| c94 | | Esther M. Arkin, Joseph S. B. Mitchell, Jack Snoeyink: Capturing Crossings: Convex Hulls of Segment and Plane Intersections. CCCG 2007: 9-11 |
| c93 | | Valentin Polishchuk, Joseph S. B. Mitchell: Thick non-crossing paths and minimum-cost flows in polygonal domains. Symposium on Computational Geometry 2007: 56-65 |
| c92 | | Joseph S. B. Mitchell: A PTAS for TSP with neighborhoods among fat regions in the plane. SODA 2007: 11-18 |
| 2006 | ||
| j64 | | 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. Algorithmica 46(2): 193-221 (2006) |
| j63 | | Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell: The minimum-area spanning tree problem. Comput. Geom. 35(3): 218-225 (2006) |
| j62 | | Esther M. Arkin, Ferran Hurtado, Joseph S. B. Mitchell, Carlos Seara, Steven Skiena: Some Lower Bounds on Geometric Separability Problems. Int. J. Comput. Geometry Appl. 16(1): 1-26 (2006) |
| c91 | | Valentin Polishchuk, Esther M. Arkin, Joseph S. B. Mitchell: Hamiltonian Cycles in Triangular Grids. CCCG 2006 |
| c90 | | 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. Symposium on Computational Geometry 2006: 61-70 |
| c89 | | 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. Symposium on Computational Geometry 2006: 449-458 |
| c88 | | Esther M. Arkin, Gill Barequet, Joseph S. B. Mitchell: Algorithms for two-box covering. Symposium on Computational Geometry 2006: 459-467 |
| c87 | | 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. Symposium on Computational Geometry 2006: 483-484 |
| c86 | | Yue Wang, Jie Gao, Joseph S. B. Mitchell: Boundary recognition in sensor networks by topological methods. MOBICOM 2006: 122-133 |
| c85 | | Amitabh Basu, Jie Gao, Joseph S. B. Mitchell, Girishkumar Sabhnani: Distributed localization using noisy distance and angle information. MobiHoc 2006: 262-273 |
| c84 | | Olaf A. Hall-Holt, Matthew J. Katz, Piyush Kumar, Joseph S. B. Mitchell, Arik Sityon: Finding large sticks and potatoes in polygons. SODA 2006: 474-483 |
| c83 | | Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap: An Experimental Study of Weighted k-Link Shortest Path Algorithms. WAFR 2006: 187-202 |
| c82 | | Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Valentin Polishchuk: The Snowblower Problem. WAFR 2006: 219-234 |
| i14 | | Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Valentin Polishchuk: The Snowblower Problem. CoRR abs/cs/0603026 (2006) |
| i13 | | 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. CoRR abs/cs/0604008 (2006) |
| i12 | | 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. CoRR abs/cs/0604022 (2006) |
| 2005 | ||
| j61 | | Matthew J. Katz, Joseph S. B. Mitchell, Yuval Nir: Orthogonal segment stabbing. Comput. Geom. 30(2): 197-205 (2005) |
| j60 | | Sándor P. Fekete, Joseph S. B. Mitchell, Karin Beurer: On the Continuous Fermat-Weber Problem. Operations Research 53(1): 61-76 (2005) |
| j59 | | 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. SIAM J. Comput. 35(3): 531-566 (2005) |
| c81 | | Alon Efrat, Sariel Har-Peled, Joseph S. B. Mitchell: Approximation algorithms for location problems in sensor networks. BROADNETS 2005: 767-776 |
| c80 | | Valentin Polishchuk, Joseph S. B. Mitchell: k-Link Rectilinear Shortest Paths Among Rectilinear Obstacles in the Plane. CCCG 2005: 101-104 |
| c79 | | Valentin Polishchuk, Joseph S. B. Mitchell: Touring Convex Bodies - A Conic Programming Solution. CCCG 2005: 290-293 |
| c78 | | Iris Reinbacher, Marc Benkert, Marc J. van Kreveld, Joseph S. B. Mitchell, Alexander Wolff: Delineating Boundaries for Imprecise Regions. ESA 2005: 143-154 |
| c77 | | Boaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell: A constant-factor approximation algorithm for optimal terrain guarding. SODA 2005: 515-524 |
| c76 | | Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell: The Minimum-Area Spanning Tree Problem. WADS 2005: 195-204 |
| c75 | | Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap: k-Link Shortest Paths in Weighted Subdivisions. WADS 2005: 325-337 |
| e1 | | Joseph S. B. Mitchell, Günter Rote (Eds.): Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005. ACM 2005, isbn 1-58113-991-8 |
| 2004 | ||
| j58 | | Boaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell, Yuval Nir: Visibility preserving terrain simplification-- an experimental study. Comput. Geom. 28(2-3): 175-190 (2004) |
| j57 | | 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? Comput. Geom. 29(1): 23-46 (2004) |
| j56 | | Adrian Dumitrescu, Joseph S. B. Mitchell, Micha Sharir: Binary Space Partitions for Axis-Parallel Segments, Rectangles, and Hyperrectangles. Discrete & Computational Geometry 31(2): 207-227 (2004) |
| j55 | | D. T. Lee, Joseph S. B. Mitchell: A note from the editors-in-chief. Int. J. Comput. Geometry Appl. 14(1-2) (2004) |
| j54 | | |
| c74 | | Erik D. Demaine, Satyan L. Devadoss, Joseph S. B. Mitchell, Joseph O'Rourke: Continuous foldability of polygonal paper. CCCG 2004: 64-67 |
| c73 | | Boaz Ben-Moshe, Olaf A. Hall-Holt, Matthew J. Katz, Joseph S. B. Mitchell: Computing the visibility graph of points within a polygon. Symposium on Computational Geometry 2004: 27-35 |
| c72 | | Joseph S. B. Mitchell, Micha Sharir: New results on shortest paths in three dimensions. Symposium on Computational Geometry 2004: 124-133 |
| c71 | | 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. JCDCG 2004: 1-15 |
| i11 | | 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. CoRR cs.DS/0402045 (2004) |
| 2003 | ||
| j53 | | Esther M. Arkin, Sándor P. Fekete, Joseph S. B. Mitchell: An algorithmic study of manufacturing paperclips and other folded structures. Comput. Geom. 25(1-2): 117-138 (2003) |
| j52 | | Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Steven Skiena: The Lazy Bureaucrat scheduling problem. Inf. Comput. 184(1): 129-146 (2003) |
| j51 | | Esther M. Arkin, Joseph S. B. Mitchell, Christine D. Piatko: Minimum-link watchman tours. Inf. Process. Lett. 86(4): 203-207 (2003) |
| j50 | | Adrian Dumitrescu, Joseph S. B. Mitchell: Approximation algorithms for TSP with neighborhoods in the plane. J. Algorithms 48(1): 135-159 (2003) |
| j49 | | Piyush Kumar, Joseph S. B. Mitchell, E. Alper Yildirim: Approximate minimum enclosing balls in high dimensions using core-sets. ACM Journal of Experimental Algorithmics 8 (2003) |
| c70 | | Piyush Kumar, Joseph S. B. Mitchell, E. Alper Yildirim: Comuting Core-Sets and Approximate Smallest Enclosing HyperSpheres in High Dimensions. ALENEX 2003: 45-55 |
| c69 | | Tien-Ruey Hsiang, Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell: Online dispersion algorithms for swarms of robots. Symposium on Computational Geometry 2003: 382-383 |
| c68 | | Moshe Dror, Alon Efrat, Anna Lubiw, Joseph S. B. Mitchell: Touring a sequence of polygons. STOC 2003: 473-482 |
| c67 | | 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. WADS 2003: 243-255 |
| i10 | | Sándor P. Fekete, Joseph S. B. Mitchell, Karin Beurer: On the continuous Fermat-Weber problem. CoRR cs.CG/0310027 (2003) |
| i9 | | 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. CoRR cs.DS/0309014 (2003) |
| 2002 | ||
| j48 | | 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. Discrete & Computational Geometry 28(4): 535-569 (2002) |
| j47 | | Ora Arbell, Gad M. Landau, Joseph S. B. Mitchell: Edit distance of run-length encoded strings. Inf. Process. Lett. 83(6): 307-314 (2002) |
| c66 | | 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. CLUSTER 2002: 296-304 |
| c65 | | Regina Estkowski, Joseph S. B. Mitchell, Xinyu Xiang: Optimal decomposition of polygonal models into triangle strips. Symposium on Computational Geometry 2002: 254-263 |
| c64 | | Boaz Ben-Moshe, Joseph S. B. Mitchell, Matthew J. Katz, Yuval Nir: Visibility preserving terrain simplification: an experimental study. Symposium on Computational Geometry 2002: 303-311 |
| c63 | | 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. SODA 2002: 568-577 |
| c62 | | Christos Levcopoulos, Andrzej Lingas, Joseph S. B. Mitchell: Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains. SWAT 2002: 80-89 |
| c61 | | Marcelo O. Sztainberg, Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell: Analysis of Heuristics for the Freeze-Tag Problem. SWAT 2002: 270-279 |
| i8 | | Christian A. Duncan, Alon Efrat, Cesim Erten, Stephen G. Kobourov, Joseph S. B. Mitchell: On Simultaneous Graph Embedding. CoRR cs.CG/0206018 (2002) |
| i7 | | Esther M. Arkin, Sándor P. Fekete, Joseph S. B. Mitchell: An Algorithmic Study of Manufacturing Paperclips and Other Folded Structures. CoRR cs.CG/0209034 (2002) |
| i6 | | 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. CoRR cs.CG/0210003 (2002) |
| i5 | | Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Steven Skiena: The Lazy Bureaucrat Scheduling Problem. CoRR cs.DS/0210024 (2002) |
| i4 | | 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. CoRR cs.RO/0212022 (2002) |
| 2001 | ||
| j46 | | Ferran Hurtado, Joseph S. B. Mitchell, Marc Noy: Foreword. Discrete Applied Mathematics 109(1-2): 1 (2001) |
| j45 | | Joseph S. B. Mitchell, Joseph O'Rourke: Computational Geometry Column 42. Int. J. Comput. Geometry Appl. 11(5): 573-582 (2001) |
| j44 | | Sándor P. Fekete, Joseph S. B. Mitchell: Terrain Decomposition and Layered Manufacturing. Int. J. Comput. Geometry Appl. 11(6): 647-668 (2001) |
| j43 | | |
| c60 | | Saurabh Sethia, Martin Held, Joseph S. B. Mitchell: PVD: A Stable Implementation for Computing Voronoi Diagrams of Polygonal Pockets. ALENEX 2001: 105-116 |
| c59 | | Erik D. Demaine, Joseph S. B. Mitchell: Reaching folded states of a rectangular piece of paper. CCCG 2001: 73-75 |
| c58 | | Regina Estkowski, Joseph S. B. Mitchell: Simplifying a polygonal subdivision while keeping it simple. Symposium on Computational Geometry 2001: 40-49 |
| c57 | | Adrian Dumitrescu, Joseph S. B. Mitchell, Micha Sharir: Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles. Symposium on Computational Geometry 2001: 141-150 |
| c56 | | Boaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell: Farthest neighbors and center points in the presence of rectangular obstacles. Symposium on Computational Geometry 2001: 164-171 |
| c55 | | Adrian Dumitrescu, Joseph S. B. Mitchell: Approximation algorithms for TSP with neighborhoods in the plane. SODA 2001: 38-46 |
| c54 | | 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. SODA 2001: 138-147 |
| c53 | | 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. WADS 2001: 192-204 |
| c52 | | 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? WADS 2001: 401-413 |
| i3 | | |
| 2000 | ||
| j42 | | Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell: Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami. Comput. Geom. 16(1): 3-21 (2000) |
| j41 | | Esther M. Arkin, Sándor P. Fekete, Joseph S. B. Mitchell: Approximation algorithms for lawn mowing and milling. Comput. Geom. 17(1-2): 25-50 (2000) |
| j40 | | Shakhar Smorodinsky, Joseph S. B. Mitchell, Micha Sharir: Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls in Rd. Discrete & Computational Geometry 23(2): 247-259 (2000) |
| c51 | | Sándor P. Fekete, Joseph S. B. Mitchell, Karin Weinbrecht: On the continuous Weber and k-median problems (extended abstract). Symposium on Computational Geometry 2000: 70-79 |
| c50 | | Ricardo C. Farias, Joseph S. B. Mitchell, Cláudio T. Silva, Brian N. Wylie: Time-Critical Rendering of Irregular Grids. SIBGRAPI 2000: 243-250 |
| c49 | | 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. SODA 2000: 927-936 |
| c48 | | Ricardo C. Farias, Joseph S. B. Mitchell, Cláudio T. Silva: ZSWEEP: an efficient and exact projection algorithm for unstructured volume rendering. Volviz 2000: 91-99 |
| i2 | | Esther M. Arkin, Ferran Hurtado, Joseph S. B. Mitchell, Carlos Seara, Steven Skiena: Some Separability Problems in the Plane. EuroCG 2000: 51-54 |
| i1 | | 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? CoRR cs.CG/0011026 (2000) |
| 1999 | ||
| j39 | | 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. Comput. Graph. Forum 18(3): 369-376 (1999) |
| j38 | | Michael T. Goodrich, Joseph S. B. Mitchell, Mark W. Orletsky: Approximate Geometric Pattern Matching Under Rigid Motions. IEEE Trans. Pattern Anal. Mach. Intell. 21(4): 371-379 (1999) |
| j37 | | Joseph S. B. Mitchell: Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems. SIAM J. Comput. 28(4): 1298-1309 (1999) |
| j36 | | Esther M. Arkin, Yi-Jen Chiang, Joseph S. B. Mitchell, Steven Skiena, Tae-Cheon Yang: On the Maximum Scatter Traveling Salesperson Problem. SIAM J. Comput. 29(2): 515-544 (1999) |
| c47 | | Marc J. van Kreveld, Joseph S. B. Mitchell, Peter Rousseeuw, Micha Sharir, Jack Snoeyink, Bettina Speckmann: Efficient Algorithms for Maximum Regression Depth. Symposium on Computational Geometry 1999: 31-40 |
| c46 | | Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell: Folding Flat Silhouettes and Wrapping Polyhedral Packages: New Results in Computational Origami. Symposium on Computational Geometry 1999: 105-114 |
| c45 | | Shakhar Smorodinsky, Joseph S. B. Mitchell, Micha Sharir: Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls inRd. Symposium on Computational Geometry 1999: 400-406 |
| c44 | | Xinyu Xiang, Martin Held, Joseph S. B. Mitchell: Fast and effective stripification of polygonal surface models. SI3D 1999: 71-78 |
| c43 | | Yi-Jen Chiang, Joseph S. B. Mitchell: Two-Point Euclidean Shortest Path Queries in the Plane. SODA 1999: 215-224 |
| c42 | | Xinyu Xiang, Martin Held, Joseph S. B. Mitchell: Fast and Effective Stripification of Polygonal Surface Models. SODA 1999: 985-986 |
| c41 | | Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Steven Skiena: The Lazy Bureaucrat Scheduling Problem. WADS 1999: 122-133 |
| 1998 | ||
| j35 | | Esther M. Arkin, Yi-Jen Chiang, Martin Held, Joseph S. B. Mitchell, Vera Sacristan, Steven Skiena, Tae-Heng Yang: On Minimum-Area Hulls. Algorithmica 21(1): 119-136 (1998) |
| j34 | | Esther M. Arkin, Martin Held, Joseph S. B. Mitchell, Steven Skiena: Recognizing polygonal parts from width measurements. Comput. Geom. 9(4): 237-246 (1998) |
| j33 | | Esther M. Arkin, Henk Meijer, Joseph S. B. Mitchell, David Rappaport, Steven Skiena: Decision trees for geometric models. Int. J. Comput. Geometry Appl. 8(3): 343-364 (1998) |
| j32 | | Gerhard Albers, Leonidas J. Guibas, Joseph S. B. Mitchell, Thomas Roos: Voronoi Diagrams of Moving Points. Int. J. Comput. Geometry Appl. 8(3): 365-380 (1998) |
| j31 | | Arie Tamir, Joseph S. B. Mitchell: A maximum b-matching problem arising from median location models with applications to the roommates problem. Math. Program. 80: 171-194 (1998) |
| j30 | | Joseph S. B. Mitchell, Avrim Blum, Prasad Chalasani, Santosh Vempala: A Constant-Factor Approximation Algorithm for the Geometric k-MST Problem in the Plane. SIAM J. Comput. 28(3): 771-781 (1998) |
| j29 | | James T. Klosowski, Martin Held, Joseph S. B. Mitchell, Henry Sowizral, Karel Zikan: Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs. IEEE Trans. Vis. Comput. Graph. 4(1): 21-36 (1998) |
| c40 | | Esther M. Arkin, Joseph S. B. Mitchell, Giri Narasimhan: Resource-Constrained Geometric Network Optimization. Symposium on Computational Geometry 1998: 307-316 |
| c39 | | Cláudio T. Silva, Joseph S. B. Mitchell: Greedy Cuts: An Advancing Front Terrain Triangulation Algorithm. ACM-GIS 1998: 137-144 |
| c38 | | Cláudio T. Silva, Joseph S. B. Mitchell, Peter L. Williams: An Exact Interactive Time Visibility Ordering Algorithm for Polyhedral Cell Complexes. VVS 1998: 87-94 |
| 1997 | ||
| j28 | | Esther M. Arkin, Patrice Belleville, Joseph S. B. Mitchell, David M. Mount, Kathleen Romanik, Steven Salzberg, Diane L. Souvaine: Testing Simple Polygons. Comput. Geom. 8: 97-114 (1997) |
| j27 | | Sanjiv Kapoor, S. N. Maheshwari, Joseph S. B. Mitchell: An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane. Discrete & Computational Geometry 18(4): 377-383 (1997) |
| j26 | | Esther M. Arkin, Joseph S. B. Mitchell, Steven Skiena: Guest Editors' Foreword. Int. J. Comput. Geometry Appl. 7(1/2): 1-4 (1997) |
| j25 | | Joseph S. B. Mitchell, David M. Mount, Subhash Suri: Query-Sensitive Ray Shooting. Int. J. Comput. Geometry Appl. 7(4): 317-347 (1997) |
| j24 | | Cláudio T. Silva, Joseph S. B. Mitchell: The Lazy Sweep Ray Casting Algorithm for Rendering Irregular Grids. IEEE Trans. Vis. Comput. Graph. 3(2): 142-157 (1997) |
| c37 | | Cristian S. Mata, Joseph S. B. Mitchell: A New Algorithm for Computing Shortest Paths in Weighted Planar Subdivisions (Extended Abstract). Symposium on Computational Geometry 1997: 264-273 |
| c36 | | George N. Sazaklis, Esther M. Arkin, Joseph S. B. Mitchell, Steven Skiena: Geometric Decision Trees for Optical Character Recognition (Extended Abstract). Symposium on Computational Geometry 1997: 394-396 |
| c35 | | Esther M. Arkin, Yi-Jen Chiang, Joseph S. B. Mitchell, Steven Skiena, Tae-Cheon Yang: On the Maximum Scatter TSP (Extended Abstract). SODA 1997: 211-220 |
| 1996 | ||
| j23 | | Gill Barequet, Bernard Chazelle, Leonidas J. Guibas, Joseph S. B. Mitchell, Ayellet Tal: BOXTREE: A Hierarchical Representation for Surfaces in 3D. Comput. Graph. Forum 15(3): 387-396 (1996) |
| j22 | | Zhu Chong, Gopalakrishnan Sundaram, Jack Snoeyink, Joseph S. B. Mitchell: Generating Random Polygons with Given Vertices. Comput. Geom. 6: 277-290 (1996) |
| j21 | | Joseph S. B. Mitchell: Shortest paths among obstacles in the plane. Int. J. Comput. Geometry Appl. 6(3): 309-332 (1996) |
| j20 | | Esther M. Arkin, Martin Held, Joseph S. B. Mitchell, Steven Skiena: Hamiltonian triangulations for fast rendering. The Visual Computer 12(9): 429-444 (1996) |
| c34 | | Martin Held, James T. Klosowski, Joseph S. B. Mitchell: Collision Detection for Fly-Throughs in Virtual Environments. Symposium on Computational Geometry 1996: V-13-V-14 |
| c33 | | 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). ESA 1996: 334-348 |
| c32 | | Joseph S. B. Mitchell: Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple New Method for the Geometric k-MST Problem. SODA 1996: 402-408 |
| c31 | | Cláudio T. Silva, Joseph S. B. Mitchell, Arie E. Kaufman: Fast Rendering of Irregular Grids. VVS 1996: 15- |
| c30 | | Joseph S. B. Mitchell: On Some Applications of Computational Geometry in Manufacturing and Virtual Environments. WACG 1996: 37-40 |
| 1995 | ||
| j19 | | Joseph S. B. Mitchell, Subhash Suri: Separation and Approximation of Polyhedral Objects. Comput. Geom. 5: 95-114 (1995) |
| j18 | | Esther M. Arkin, Dan Halperin, Klara Kedem, Joseph S. B. Mitchell, Nir Naor: Arrangements of Segments that Share Endpoints Single Face Results. Discrete & Computational Geometry 13: 257-270 (1995) |
| j17 | | Esther M. Arkin, Joseph S. B. Mitchell, Subhash Suri: Logarithmic-time link path queries in a simple polygon. Int. J. Comput. Geometry Appl. 5(4): 369-395 (1995) |
| j16 | | Joseph S. B. Mitchell, Günter Rote, Gopalakrishnan Sundaram, Gerhard J. Woeginger: Counting Convex Polygons in Planar Point Sets. Inf. Process. Lett. 56(1): 45-49 (1995) |
| j15 | | Paul J. Heffernan, Joseph S. B. Mitchell: An Optimal Algorithm for Computing Visibility in the Plane. SIAM J. Comput. 24(1): 184-201 (1995) |
| c29 | | Cristian S. Mata, Joseph S. B. Mitchell: Approximation Algorithms for Geometric Tour and Network Design Problems (Extended Abstract). Symposium on Computational Geometry 1995: 360-369 |
| c28 | | Cláudio T. Silva, Joseph S. B. Mitchell, Arie E. Kaufman: Automatic Generation of Triangular Irregular Networks Using Greedy Cuts. IEEE Visualization 1995: 201-208 |
| 1994 | ||
| c27 | | Chong Zhu, Gopalakrishnan Sundaram, Jack Snoeyink, Joseph S. B. Mitchell: Generating Random x-Monotone Polygons with Given Vertices. CCCG 1994: 189-194 |
| c26 | | Michael T. Goodrich, Joseph S. B. Mitchell, Mark W. Orletsky: Practical Methods for Approximate Geometric Pattern Matching Under Rigid Motions (Preliminary Version). Symposium on Computational Geometry 1994: 103-112 |
| c25 | | Joseph S. B. Mitchell, David M. Mount, Subhash Suri: Query-Sensitive Ray Shooting. Symposium on Computational Geometry 1994: 359-368 |
| c24 | | Esther M. Arkin, Martin Held, Joseph S. B. Mitchell, Steven Skiena: Hamilton Triangulations for Fast Rendering. ESA 1994: 36-47 |
| 1993 | ||
| j14 | | Esther M. Arkin, Samir Khuller, Joseph S. B. Mitchell: Geometric Knapsack Problems. Algorithmica 10(5): 399-427 (1993) |
| j13 | | Leonidas J. Guibas, John Hershberger, Joseph S. B. Mitchell, Jack Snoeyink: Approximating Polygons and Subdivisions with Minimum Link Paths. Int. J. Comput. Geometry Appl. 3(4): 383-415 (1993) |
| c23 | | Erik L. Wynters, Joseph S. B. Mitchell: Shortest Paths for a Two-robot Rendez-vous. CCCG 1993: 216-221 |
| c22 | | Esther M. Arkin, Patrice Belleville, Joseph S. B. Mitchell, David M. Mount, Kathleen Romanik, Steven Salzberg, Diane L. Souvaine: Testing Simple Polygons. CCCG 1993: 387-392 |
| c21 | | |
| c20 | | Joseph S. B. Mitchell: Shortest Paths Among Obstacles in the Plane. Symposium on Computational Geometry 1993: 308-317 |
| c19 | | Esther M. Arkin, Henk Meijer, Joseph S. B. Mitchell, David Rappaport, Steven Skiena: Decision Trees for Geometric Models. Symposium on Computational Geometry 1993: 369-378 |
| c18 | | 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. WADS 1993: 95-106 |
| 1992 | ||
| j12 | | Joseph S. B. Mitchell: L_1 Shortest Paths Among Polygonal Obstacles in the Plane. Algorithmica 8(1): 55-88 (1992) |
| j11 | | Joseph S. B. Mitchell, Günter Rote, Gerhard J. Woeginger: Minimum-Link Paths Among Obstacles in the Plan. Algorithmica 8(5&6): 431-459 (1992) |
| j10 | | Joseph S. B. Mitchell, Jan Karel Lenstra: Guest Editors' Introduction. INFORMS Journal on Computing 4(4): 357-359 (1992) |
| j9 | | Esther M. Arkin, Klara Kedem, Joseph S. B. Mitchell, Josef Sprinzak, Michael Werman: Matching Points into Pairwise-Disjoint Noise Regions: Combinatorial Bounds and Algorithms. INFORMS Journal on Computing 4(4): 375-386 (1992) |
| c17 | | Joseph S. B. Mitchell, Christine D. Piatko, Esther M. Arkin: Computing a Shortest k-Link Path in a Polygon. FOCS 1992: 573-582 |
| c16 | | Esther M. Arkin, Joseph S. B. Mitchell, Subhash Suri: Optimal Link Path Queries in a Simple Polygon. SODA 1992: 269-279 |
| c15 | | Joseph S. B. Mitchell, Subhash Suri: Separation and Approximation of Polyhedral Objects. SODA 1992: 296-306 |
| 1991 | ||
| j8 | | Joseph S. B. Mitchell: A New Algorithm for Shortest Paths Among Obstacles in the Plane. Ann. Math. Artif. Intell. 3(1): 83-105 (1991) |
| j7 | | Joseph S. B. Mitchell, Christos H. Papadimitriou: The Weighted Region Problem: Finding Shortest Paths Through a Weighted Planar Subdivision. J. ACM 38(1): 18-73 (1991) |
| j6 | | Esther M. Arkin, L. Paul Chew, Daniel P. Huttenlocher, Klara Kedem, Joseph S. B. Mitchell: An Efficiently Computable Metric for Comparing Polygonal Shapes. IEEE Trans. Pattern Anal. Mach. Intell. 13(3): 209-216 (1991) |
| c14 | | Esther M. Arkin, Dan Halperin, Klara Kedem, Joseph S. B. Mitchell, Nir Naor: Arrangements of Segments that Share Endpoints: Single Face Results. Symposium on Computational Geometry 1991: 324-333 |
| c13 | | Leonidas J. Guibas, John Hershberger, Joseph S. B. Mitchell, Jack Snoeyink: Approximating Polygons and Subdivisions with Minimum Link Paths. ISA 1991: 151-162 |
| c12 | | Esther M. Arkin, Klara Kedem, Joseph S. B. Mitchell, Josef Sprinzak, Michael Werman: Matching Points into Noise Regions: Combinatorial Bounds and Algorithms. SODA 1991: 42-51 |
| c11 | | Esther M. Arkin, Samir Khuller, Joseph S. B. Mitchell: Geometric Knapsack Problems. WADS 1991: 165-176 |
| c10 | | Joseph S. B. Mitchell, Erik L. Wynters: Finding Optimal Bipartitions of Points and Polygons. WADS 1991: 202-213 |
| c9 | | Paul J. Heffernan, Joseph S. B. Mitchell: An Optimal Algorithm for Computing Visibility in the Plane. WADS 1991: 437-448 |
| c8 | | Leonidas J. Guibas, Joseph S. B. Mitchell: Voronoi Diagrams of Moving Points in the Plane. WG 1991: 113-125 |
| 1990 | ||
| j5 | | Laxmi Gewali, Alex C. Meng, Joseph S. B. Mitchell, Simeon C. Ntafos: Path Planning in 0/1/ Weighted Regions with Applications. INFORMS Journal on Computing 2(3): 253-272 (1990) |
| j4 | | Samir Khuller, Joseph S. B. Mitchell: On a Triangle Counting Problem. Inf. Process. Lett. 33(6): 319-321 (1990) |
| j3 | | Joseph S. B. Mitchell: On Maximum Flows in Polyhedral Domains. J. Comput. Syst. Sci. 40(1): 88-123 (1990) |
| c7 | | Paul J. Heffernan, Joseph S. B. Mitchell: Structured Visibility Profiles with Applications to Problems in Simple Polygons (Extended Abstract). Symposium on Computational Geometry 1990: 53-62 |
| c6 | | Joseph S. B. Mitchell, Günter Rote, Gerhard J. Woeginger: Minimum-Link Paths Among Obstacles in the Plane. Symposium on Computational Geometry 1990: 63-72 |
| c5 | | Esther M. Arkin, L. Paul Chew, Daniel P. Huttenlocher, Klara Kedem, Joseph S. B. Mitchell: An Efficiently Computable Metric for Comparing Polygonal Shapes. SODA 1990: 129-137 |
| 1989 | ||
| c4 | | Esther M. Arkin, Robert Connelly, Joseph S. B. Mitchell: On Monotone Paths Among Obstacles with Applications to Planning Assemblies. Symposium on Computational Geometry 1989: 334-343 |
| 1988 | ||
| j2 | | Joseph S. B. Mitchell: An Algorithmic Approach to Some Problems in Terrain Navigation. Artif. Intell. 37(1-3): 171-201 (1988) |
| c3 | | Laxmi Gewali, Alex C. Meng, Joseph S. B. Mitchell, Simeon C. Ntafos: Path Planning in 0/1/infinity Weighted Regions with Applications. Symposium on Computational Geometry 1988: 266-278 |
| c2 | | Joseph S. B. Mitchell: On Maximum Flows in Polyhedral Domains. Symposium on Computational Geometry 1988: 341-351 |
| 1987 | ||
| j1 | | Joseph S. B. Mitchell, David M. Mount, Christos H. Papadimitriou: The Discrete Geodesic Problem. SIAM J. Comput. 16(4): 647-668 (1987) |
| c1 | | Joseph S. B. Mitchell, Christos H. Papadimitriou: The Weighted Region Problem. Symposium on Computational Geometry 1987: 30-38 |
Colors in the list of coauthors
Last update Sun May 26 03:04:07 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page