Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoseph S. B. Mitchell
Person information
- affiliation: Stony Brook University, NY, USA
- award (2010): Gödel Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2023
[j122]Annika Bonerath, Jan-Henrik Haunert
, Joseph S. B. Mitchell, Benjamin Niedermann:
Shortcut hulls: Vertex-restricted outer simplifications of polygons. Comput. Geom. 112: 101983 (2023)- 2022
- [j121]Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy:
The balanced connected subgraph problem. Discret. Appl. Math. 319: 111-120 (2022) - [j120]Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Joseph S. B. Mitchell:
Area-Optimal Simple Polygonalizations: The CG Challenge 2019. ACM J. Exp. Algorithmics 27: 2.4:1-2.4:12 (2022) - [j119]Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Joseph S. B. Mitchell:
Computing Coordinated Motion Plans for Robot Swarms: The CG: SHOP Challenge 2021. ACM J. Exp. Algorithmics 27: 3.1:1-3.1:12 (2022) - 2021
- [j118]A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Joseph S. B. Mitchell:
Planar bichromatic bottleneck spanning trees. J. Comput. Geom. 12(1): 109-127 (2021) - [j117]Joseph S. B. Mitchell, Supantha Pandit:
Minimum Membership Covering and Hitting. Theor. Comput. Sci. 876: 1-11 (2021) - 2020
- [j116]Molly Baird, Sara C. Billey, Erik D. Demaine, Martin L. Demaine, David Eppstein, Sándor P. Fekete, Graham Gordon, Sean Griffin, Joseph S. B. Mitchell, Joshua P. Swanson:
Existence and Hardness of Conveyor Belts. Electron. J. Comb. 27(4): 4 (2020) - [j115]Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, André van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno:
Symmetric assembly puzzles are hard, beyond a few pieces. Comput. Geom. 90: 101648 (2020) - 2019
- [j114]Joseph S. B. Mitchell, Valentin Polishchuk, Mikko Sysikaski, Haitao Wang:
An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains. Algorithmica 81(1): 289-316 (2019) - [j113]Esther M. Arkin, Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell, Michael Segal:
Locating battery charging stations to facilitate almost shortest paths. Discret. Appl. Math. 254: 10-16 (2019) - 2018
- [j112]Erin W. Chambers, Sándor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Srinivasan Venkatesh, Ulrike Stege, Sue Whitesides:
Connecting a set of circles with minimum sum of radii. Comput. Geom. 68: 62-76 (2018) - [j111]Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, Marina Simakov:
Selecting and covering colored points. Discret. Appl. Math. 250: 75-86 (2018) - [j110]Sándor P. Fekete, Qian Li, Joseph S. B. Mitchell, Christian Scheffer:
Universal Guard Problems. Int. J. Comput. Geom. Appl. 28(2): 129-160 (2018) - [j109]Sándor P. Fekete, Kan Huang, Joseph S. B. Mitchell, Ojas Parekh, Cynthia A. Phillips:
Geometric Hitting Set for Segments of Few Orientations. Theory Comput. Syst. 62(2): 268-303 (2018) - 2017
- [j108]J. Mark Keil, Joseph S. B. Mitchell, Dinabandhu Pradhan, Martin Vatshelle:
An algorithm for the maximum weight independent set problem on outerstring graphs. Comput. Geom. 60: 19-25 (2017) - [j107]Sang Won Bae, Matias Korman, Joseph S. B. Mitchell, Yoshio Okamoto, Valentin Polishchuk, Haitao Wang:
Computing the L1 Geodesic Diameter and Center of a Polygonal Domain. Discret. Comput. Geom. 57(3): 674-701 (2017) - [j106]Sándor P. Fekete, Andreas Haas, Michael Hemmer, Michael Hoffmann, Irina Kostitsyna, Dominik Krupke, Florian Maurer, Joseph S. B. Mitchell, Arne Schmidt, Christiane Schmidt, Julian Troegel:
Computing nonsimple polygons of minimum perimeter. J. Comput. Geom. 8(1): 340-365 (2017) - [j105]Yair Allouche, Esther M. Arkin, Yuval Cassuto, Alon Efrat, Guy Grebla, Joseph S. B. Mitchell, Swaminathan Sankararaman, Michael Segal:
Secure communication through jammers jointly optimized in geography and time. Pervasive Mob. Comput. 41: 83-105 (2017) - 2016
- [j104]Valentin Polishchuk, Esther M. Arkin, Alon Efrat, Christian Knauer, Joseph S. B. Mitchell, Günter Rote, Lena Schlipf, Topi Talvitie:
Shortest path to a segment and quickest visibility queries. J. Comput. Geom. 7(2): 77-100 (2016) - [j103]Alon Efrat, Sándor P. Fekete, Joseph S. B. Mitchell, Valentin Polishchuk, Jukka Suomela:
Improved Approximation Algorithms for Relay Placement. ACM Trans. Algorithms 12(2): 20:1-20:28 (2016) - 2015
- [j102]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. Comput. Geom. 48(2): 94-107 (2015) - [j101]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. Comput. Geom. 48(2): 134-146 (2015) - [j100]Michael A. Bender, Sándor P. Fekete, Alexander Kröller, Vincenzo Liberatore, Joseph S. B. Mitchell, Valentin Polishchuk, Jukka Suomela:
The minimum backlog problem. Theor. Comput. Sci. 605: 51-61 (2015) - 2014
- [j99]Esther M. Arkin, Alon Efrat, Joseph S. B. Mitchell, Valentin Polishchuk, Srinivasan Ramasubramanian, Swaminathan Sankararaman, Javad Taheri:
Data transmission and base-station placement for optimizing the lifetime of wireless sensor networks. Ad Hoc Networks 12: 201-218 (2014) - [j98]Esther M. Arkin, Claudia Dieckmann, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Lena Schlipf, Shang Yang:
Convex transversals. Comput. Geom. 47(2): 224-239 (2014) - [j97]Adrian Dumitrescu, Joseph S. B. Mitchell, Pawel Zylinski:
Watchman routes for lines and line segments. Comput. Geom. 47(4): 527-538 (2014) - [j96]Joseph S. B. Mitchell, Valentin Polishchuk, Mikko Sysikaski:
Minimum-link paths revisited. Comput. Geom. 47(6): 651-667 (2014) - [j95]Adrian Dumitrescu, Joseph S. B. Mitchell, Pawel Zylinski:
The Minimum Guarding Tree Problem. Discret. Math. Algorithms Appl. 6(1) (2014) - [j94]Erik D. Demaine, Martin L. Demaine, Yair N. Minsky, Joseph S. B. Mitchell, Ronald L. Rivest, Mihai Patrascu:
Picture-Hanging Puzzles. Theory Comput. Syst. 54(4): 531-550 (2014) - [j93]Helmut Alt, Esther M. Arkin, Alon Efrat, George Hart, Ferran Hurtado, Irina Kostitsyna, Alexander Kröller, Joseph S. B. Mitchell, Valentin Polishchuk:
Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing. Theory Comput. Syst. 54(4): 689-714 (2014) - 2012
- [j92]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) - [j91]Therese Biedl, Mohammad Tanvir Irfan, Justin Iwerks, Joondong Kim, Joseph S. B. Mitchell:
The Art Gallery Theorem for Polyominoes. Discret. Comput. Geom. 48(3): 711-720 (2012) - [j90]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) - [j89]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. Geom. Appl. 22(2): 143-166 (2012) - [j88]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) - [j87]Sándor P. Fekete, Joseph S. B. Mitchell, Christiane Schmidt:
Minimum covering with travel cost. J. Comb. Optim. 24(1): 32-51 (2012) - 2011
- [j86]Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Valentin Polishchuk:
The snowblower problem. Comput. Geom. 44(8): 370-384 (2011) - 2010
- [j85]Esther M. Arkin, Joseph S. B. Mitchell, Valentin Polishchuk:
Maximum thick paths in static and dynamic environments. Comput. Geom. 43(3): 279-294 (2010) - [j84]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. Discret. Comput. Geom. 44(2): 439-462 (2010) - [j83]Yoav Amit, Joseph S. B. Mitchell, Eli Packer:
Locating Guards for Visibility Coverage of Polygons. Int. J. Comput. Geom. Appl. 20(5): 601-630 (2010) - [j82]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) - 2009
- [j81]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) - [j80]Bernardo M. Ábrego, Esther M. Arkin, Silvia Fernández-Merchant, Ferran Hurtado, Mikio Kano, Joseph S. B. Mitchell, Jorge Urrutia:
Matching Points with Squares. Discret. Comput. Geom. 41(1): 77-95 (2009) - [j79]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) - [j78]Amitabh Basu, Joseph S. B. Mitchell, Girishkumar Sabhnani:
Geometric algorithms for optimal airspace design and air traffic controller workload balancing. ACM J. Exp. Algorithmics 14 (2009) - [j77]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) - 2008
- [j76]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) - [j75]Marc J. van Kreveld, Joseph S. B. Mitchell, Peter J. Rousseeuw, Micha Sharir, Jack Snoeyink, Bettina Speckmann:
Efficient Algorithms for Maximum Regression Depth. Discret. Comput. Geom. 39(4): 656-677 (2008) - [j74]Joseph S. B. Mitchell, Valentin Polishchuk:
Minimum-perimeter enclosures. Inf. Process. Lett. 107(3-4): 120-124 (2008) - [j73]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) - [j72]Martin Held, Joseph S. B. Mitchell:
Triangulating input-constrained planar point sets. Inf. Process. Lett. 109(1): 54-56 (2008) - 2007
- [j71]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) - [j70]Ferran Hurtado, Joseph S. B. Mitchell:
Editorial. Comput. Geom. 37(1): 1-2 (2007) - [j69]Joseph S. B. Mitchell:
Guest Editor's Foreword. Discret. Comput. Geom. 37(1): 1-2 (2007) - [j68]Esther M. Arkin, Joseph S. B. Mitchell, Valentin Polishchuk:
Two New Classes of Hamiltonian Graphs: (Extended Abstract). Electron. Notes Discret. Math. 29: 565-569 (2007) - [j67]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) - 2006
- [j66]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) - [j65]Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell:
The minimum-area spanning tree problem. Comput. Geom. 35(3): 218-225 (2006) - [j64]Esther M. Arkin, Ferran Hurtado, Joseph S. B. Mitchell, Carlos Seara, Steven Skiena:
Some Lower Bounds on Geometric Separability Problems. Int. J. Comput. Geom. Appl. 16(1): 1-26 (2006) - 2005
- [j63]Matthew J. Katz, Joseph S. B. Mitchell, Yuval Nir:
Orthogonal segment stabbing. Comput. Geom. 30(2): 197-205 (2005) - [j62]Sándor P. Fekete, Joseph S. B. Mitchell, Karin Beurer:
On the Continuous Fermat-Weber Problem. Oper. Res. 53(1): 61-76 (2005) - [j61]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) - 2004
- [j60]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) - [j59]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) - [j58]Adrian Dumitrescu, Joseph S. B. Mitchell, Micha Sharir:
Binary Space Partitions for Axis-Parallel Segments, Rectangles, and Hyperrectangles. Discret. Comput. Geom. 31(2): 207-227 (2004) - [j57]D. T. Lee, Joseph S. B. Mitchell:
A note from the editors-in-chief. Int. J. Comput. Geom. Appl. 14(1-2) (2004) - [j56]Joseph S. B. Mitchell:
Editor's foreword. Int. J. Comput. Geom. Appl. 14(4-5): 231-232 (2004) - [j55]Marcelo O. Sztainberg, Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell:
Theoretical and experimental analysis of heuristics for the "freeze-tag" robot awakening problem. IEEE Trans. Robotics 20(4): 691-701 (2004) - 2003
- [j54]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) - [j53]Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Steven Skiena:
The Lazy Bureaucrat scheduling problem. Inf. Comput. 184(1): 129-146 (2003) - [j52]Esther M. Arkin, Joseph S. B. Mitchell, Christine D. Piatko:
Minimum-link watchman tours. Inf. Process. Lett. 86(4): 203-207 (2003) - [j51]Adrian Dumitrescu, Joseph S. B. Mitchell:
Approximation algorithms for TSP with neighborhoods in the plane. J. Algorithms 48(1): 135-159 (2003) - [j50]Piyush Kumar, Joseph S. B. Mitchell, E. Alper Yildirim:
Approximate minimum enclosing balls in high dimensions using core-sets. ACM J. Exp. Algorithmics 8 (2003) - 2002
- [j49]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. Discret. Comput. Geom. 28(4): 535-569 (2002) - [j48]Ora Arbell, Gad M. Landau, Joseph S. B. Mitchell:
Edit distance of run-length encoded strings. Inf. Process. Lett. 83(6): 307-314 (2002) - 2001
- [j47]Ferran Hurtado, Joseph S. B. Mitchell, Marc Noy:
Foreword. Discret. Appl. Math. 109(1-2): 1 (2001) - [j46]Joseph S. B. Mitchell, Joseph O'Rourke:
Computational Geometry Column 42. Int. J. Comput. Geom. Appl. 11(5): 573-582 (2001) - [j45]Sándor P. Fekete, Joseph S. B. Mitchell:
Terrain Decomposition and Layered Manufacturing. Int. J. Comput. Geom. Appl. 11(6): 647-668 (2001) - [j44]Joseph S. B. Mitchell, Joseph O'Rourke:
Computational geometry. SIGACT News 32(3): 63-72 (2001) - 2000
- [j43]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) - [j42]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) - [j41]Shakhar Smorodinsky, Joseph S. B. Mitchell, Micha Sharir:
Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls in Rd. Discret. Comput. Geom. 23(2): 247-259 (2000) - 1999
- [j40]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) - [j39]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) - [j38]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) - [j37]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) - 1998
- [j36]Esther M. Arkin, Yi-Jen Chiang, Martin Held, Joseph S. B. Mitchell, Vera Sacristán, Steven Skiena, Tae-Heng Yang:
On Minimum-Area Hulls. Algorithmica 21(1): 119-136 (1998) - [j35]Esther M. Arkin, Martin Held, Joseph S. B. Mitchell, Steven Skiena:
Recognizing polygonal parts from width measurements. Comput. Geom. 9(4): 237-246 (1998) - [j34]Esther M. Arkin, Henk Meijer, Joseph S. B. Mitchell, David Rappaport, Steven Skiena:
Decision trees for geometric models. Int. J. Comput. Geom. Appl. 8(3): 343-364 (1998) - [j33]Gerhard Albers, Leonidas J. Guibas, Joseph S. B. Mitchell, Thomas Roos:
Voronoi Diagrams of Moving Points. Int. J. Comput. Geom. Appl. 8(3): 365-380 (1998) - [j32]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) - [j31]Joseph S. B. Mitchell, Avrim Blum, Prasad Chalasani, Santosh S. Vempala:
A Constant-Factor Approximation Algorithm for the Geometric k-MST Problem in the Plane. SIAM J. Comput. 28(3): 771-781 (1998) - [j30]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) - 1997
- [j29]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) - [j28]Sanjiv Kapoor, S. N. Maheshwari, Joseph S. B. Mitchell:
An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane. Discret. Comput. Geom. 18(4): 377-383 (1997) - [j27]Esther M. Arkin, Joseph S. B. Mitchell, Steven Skiena:
Guest Editors' Foreword. Int. J. Comput. Geom. Appl. 7(1/2): 1-4 (1997) - [j26]Joseph S. B. Mitchell, David M. Mount, Subhash Suri:
Query-Sensitive Ray Shooting. Int. J. Comput. Geom. Appl. 7(4): 317-347 (1997) - [j25]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) - 1996
- [j24]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) - [j23]Chong Zhu, Gopalakrishnan Sundaram, Jack Snoeyink, Joseph S. B. Mitchell:
Generating Random Polygons with Given Vertices. Comput. Geom. 6: 277-290 (1996) - [j22]Joseph S. B. Mitchell:
Shortest paths among obstacles in the plane. Int. J. Comput. Geom. Appl. 6(3): 309-332 (1996) - [j21]Esther M. Arkin, Martin Held, Joseph S. B. Mitchell, Steven Skiena:
Hamiltonian triangulations for fast rendering. Vis. Comput. 12(9): 429-444 (1996) - 1995
- [j20]Joseph S. B. Mitchell, Subhash Suri:
Separation and Approximation of Polyhedral Objects. Comput. Geom. 5: 95-114 (1995) - [j19]Esther M. Arkin, Dan Halperin, Klara Kedem, Joseph S. B. Mitchell, Nir Naor:
Arrangements of Segments that Share Endpoints Single Face Results. Discret. Comput. Geom. 13: 257-270 (1995) - [j18]Esther M. Arkin, Joseph S. B. Mitchell, Subhash Suri:
Logarithmic-time link path queries in a simple polygon. Int. J. Comput. Geom. Appl. 5(4): 369-395 (1995) - [j17]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) - [j16]Paul J. Heffernan, Joseph S. B. Mitchell:
An Optimal Algorithm for Computing Visibility in the Plane. SIAM J. Comput. 24(1): 184-201 (1995) - 1993
- [j15]Esther M. Arkin, Samir Khuller, Joseph S. B. Mitchell:
Geometric Knapsack Problems. Algorithmica 10(5): 399-427 (1993) - [j14]Leonidas J. Guibas, John Hershberger, Joseph S. B. Mitchell, Jack Snoeyink:
Approximating Polygons and Subdivisions with Minimum Link Paths. Int. J. Comput. Geom. Appl. 3(4): 383-415 (1993) - 1992
- [j13]Joseph S. B. Mitchell:
L_1 Shortest Paths Among Polygonal Obstacles in the Plane. Algorithmica 8(1): 55-88 (1992) - [j12]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) - [j11]Joseph S. B. Mitchell, Jan Karel Lenstra:
Guest Editors' Introduction. INFORMS J. Comput. 4(4): 357-359 (1992) - [j10]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 J. Comput. 4(4): 375-386 (1992) - 1991
- [j9]Joseph S. B. Mitchell:
A New Algorithm for Shortest Paths Among Obstacles in the Plane. Ann. Math. Artif. Intell. 3(1): 83-105 (1991) - [j8]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) - [j7]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) - 1990
- [j6]Laxmi P. Gewali, Alex C. Meng, Joseph S. B. Mitchell, Simeon C. Ntafos:
Path Planning in 0/1/ Weighted Regions with Applications. INFORMS J. Comput. 2(3): 253-272 (1990) - [j5]Samir Khuller, Joseph S. B. Mitchell:
On a Triangle Counting Problem. Inf. Process. Lett. 33(6): 319-321 (1990) - [j4]Joseph S. B. Mitchell:
On Maximum Flows in Polyhedral Domains. J. Comput. Syst. Sci. 40(1): 88-123 (1990) - 1988
- [j3]Joseph S. B. Mitchell:
An Algorithmic Approach to Some Problems in Terrain Navigation. Artif. Intell. 37(1-3): 171-201 (1988) - 1987
- [j2]Joseph S. B. Mitchell:
98%-Effective Lot-Sizing for One-Warehouse, Multi-Retailer Inventory Systems with Backlogging. Oper. Res. 35(3): 399-404 (1987) - [j1]Joseph S. B. Mitchell, David M. Mount, Christos H. Papadimitriou:
The Discrete Geodesic Problem. SIAM J. Comput. 16(4): 647-668 (1987)
Conference and Workshop Papers
- 2023
- [c177]Vishwanath R. Singireddy, Manjanna Basappa, Joseph S. B. Mitchell:
Algorithms for k-Dispersion for Points in Convex Position in the Plane. CALDAM 2023: 59-70 - [c176]Kerem Geva, Matthew J. Katz, Joseph S. B. Mitchell, Eli Packer:
Minimum-Link C-Oriented Paths Visiting a Sequence of Regions in the Plane. CIAC 2023: 247-262 - [c175]Reilly Browne, Prahlad Narasimhan Kasthurirangan, Joseph S. B. Mitchell, Valentin Polishchuk:
Constant-Factor Approximation Algorithms for Convex Cover and Hidden Set in a Simple Polygon. FOCS 2023: 1357-1365 - [c174]Omrit Filtser, Mayank Goswami, Joseph S. B. Mitchell, Valentin Polishchuk:
On Flipping the Fréchet Distance. ITCS 2023: 51:1-51:22 - [c173]Esther M. Arkin, Rezaul Alam Chowdhury, Mayank Goswami, Jason Huang, Joseph S. B. Mitchell, Valentin Polishchuk, Rakesh Ravindran:
Fair subgraph selection for contagion containment (Brief Announcement). LAGOS 2023: 370-372 - [c172]A. Karim Abu-Affash, Paz Carmi, Ori Luwisch, Joseph S. B. Mitchell:
Geometric Spanning Trees Minimizing the Wiener Index. WADS 2023: 1-14 - 2021
- [c171]Annika Bonerath, Jan-Henrik Haunert, Joseph S. B. Mitchell, Benjamin Niedermann:
Shortcut Hulls: Vertex-restricted Outer Simplications of Polygons. CCCG 2021: 12-23 - [c170]Joseph S. B. Mitchell:
Approximating Maximum Independent Set for Rectangles in the Plane. FOCS 2021: 339-350 - 2020
- [c169]A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Joseph S. B. Mitchell:
Planar Bichromatic Bottleneck Spanning Trees. ESA 2020: 1:1-1:16 - [c168]Esther M. Arkin, Rathish Das, Jie Gao, Mayank Goswami, Joseph S. B. Mitchell, Valentin Polishchuk, Csaba D. Tóth:
Cutting Polygons into Small Pieces with Chords: Laser-Based Localization. ESA 2020: 7:1-7:23 - [c167]Yanjun Pan, Alon Efrat, Ming Li, Boyang Wang, Hanyu Quan, Joseph S. B. Mitchell, Jie Gao, Esther M. Arkin:
Data inference from encrypted databases: a multi-dimensional order-preserving matching approach. MobiHoc 2020: 151-160 - [c166]Esther M. Arkin, Faryad Darabi Sahneh, Alon Efrat, Fabian Frank, Radoslav Fulek, Stephen G. Kobourov, Joseph S. B. Mitchell:
Computing β-Stretch Paths in Drawings of Graphs. SWAT 2020: 7:1-7:20 - [c165]Joseph S. B. Mitchell, Supantha Pandit:
Packing and Covering with Segments. WALCOM 2020: 198-210 - [c164]Sándor P. Fekete, Alexander Hill, Dominik Krupke, Tyler Mayer, Joseph S. B. Mitchell, Ojas Parekh, Cynthia A. Phillips:
Probing a Set of Trajectories to Maximize Captured Information. SEA 2020: 5:1-5:14 - 2019
- [c163]Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Joseph S. B. Mitchell, Nabil H. Mustafa:
Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint. APPROX-RANDOM 2019: 32:1-32:21 - [c162]Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy:
The Balanced Connected Subgraph Problem. CALDAM 2019: 201-215 - [c161]Joseph S. B. Mitchell, Supantha Pandit:
New Results on a Family of Geometric Hitting Set Problems in the Plane. COCOA 2019: 387-399 - [c160]Kin Sum Liu, Brent Schiller, Jie Gao, Shan Lin, Joseph S. B. Mitchell:
Optimizing Sensor Deployment With Line-Of-Sight Constraints: Theory and Practice. EWSN 2019: 95-105 - [c159]Rathish Das, Shih-Yu Tsai, Sharmila Duppala, Jayson Lynch, Esther M. Arkin, Rezaul Chowdhury, Joseph S. B. Mitchell, Steven Skiena:
Data Races and the Discrete Resource-time Tradeoff Problem with Resource Reuse over Paths. SPAA 2019: 359-368 - [c158]Joseph S. B. Mitchell, Supantha Pandit:
Minimum Membership Covering and Hitting. WALCOM 2019: 394-406 - 2018
- [c157]Sándor P. Fekete, Sven von Höveling, Joseph S. B. Mitchell, Christian Rieck, Christian Scheffer, Arne Schmidt, James R. Zuber:
Don't Rock the Boat: Algorithms for Balanced Dynamic Loading and Unloading. LATIN 2018: 448-460 - [c156]Boris Aronov, Alon Efrat, Ming Li, Jie Gao, Joseph S. B. Mitchell, Valentin Polishchuk, Boyang Wang, Hanyu Quan, Jiaxin Ding:
Are Friends of My Friends Too Social?: Limitations of Location Privacy in a Socially-Connected World. MobiHoc 2018: 280-289 - 2017
- [c155]Gui Citovsky, Tyler Mayer, Joseph S. B. Mitchell:
TSP With Locational Uncertainty: The Adversarial Model. SoCG 2017: 32:1-32:16 - [c154]Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Su Jia, Matthew J. Katz, Tyler Mayer, Joseph S. B. Mitchell:
Network Optimization on Partitioned Pairs of Points. ISAAC 2017: 6:1-6:12 - [c153]Jiemin Zeng, Gaurish Telang, Matthew P. Johnson, Rik Sarkar, Jie Gao, Esther M. Arkin, Joseph S. B. Mitchell:
Mobile r-gather: Distributed and Geographic Clustering for Location Anonymity. MobiHoc 2017: 7:1-7:10 - 2016
- [c152]Sándor P. Fekete, Qian Li, Joseph S. B. Mitchell, Christian Scheffer:
Universal Guard Problems. ISAAC 2016: 32:1-32:13 - [c151]Kin Sum Liu, Brent Schiller, Jie Gao, Shan Lin, Joseph S. B. Mitchell:
Combinatorics, algorithms and systems for sensor deployment with line-of-sight constraints: poster. MobiHoc 2016: 371-372 - [c150]Sang Won Bae, Matias Korman, Joseph S. B. Mitchell, Yoshio Okamoto, Valentin Polishchuk, Haitao Wang:
Computing the L1 Geodesic Diameter and Center of a Polygonal Domain. STACS 2016: 14:1-14:14 - [c149]Jie Gao, Su Jia, Joseph S. B. Mitchell, Lu Zhao:
Approximation Algorithms for Time-Window TSP and Prize Collecting TSP Problems. WAFR 2016: 560-575 - [c148]Esther M. Arkin, Jie Gao, Adam Hesterberg, Joseph S. B. Mitchell, Jiemin Zeng:
The Shortest Separating Cycle Problem. WAOA 2016: 1-13 - [c147]Sándor P. Fekete, Andreas Haas, Michael Hemmer, Michael Hoffmann, Irina Kostitsyna, Dominik Krupke, Florian Maurer, Joseph S. B. Mitchell, Arne Schmidt, Christiane Schmidt, Julian Troegel:
Computing Nonsimple Polygons of Minimum Perimeter. SEA 2016: 134-149 - 2015
- [c146]Gui Citovsky, Jie Gao, Joseph S. B. Mitchell, Jiemin Zeng:
Exact and Approximation Algorithms for Data Mule Scheduling in a Sensor Network. ALGOSENSORS 2015: 57-70 - [c145]Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, Marina Simakov:
Conflict-free Covering. CCCG 2015 - [c144]J. Mark Keil, Joseph S. B. Mitchell, Dinabandhu Pradhan, Martin Vatshelle:
An Algorithm for the Maximum Weight Independent Set Problem onOutersting Graphs. CCCG 2015 - [c143]Esther M. Arkin, Alon Efrat, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Günter Rote, Lena Schlipf, Topi Talvitie:
Shortest Path to a Segment and Quickest Visibility Queries. SoCG 2015: 658-673 - [c142]Joseph S. B. Mitchell, Valentin Polishchuk, Mikko Sysikaski, Haitao Wang:
An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains. ICALP (1) 2015: 947-959 - [c141]Esther M. Arkin, Yuval Cassuto, Alon Efrat, Guy Grebla, Joseph S. B. Mitchell, Swaminathan Sankararaman, Michael Segal:
Optimal placement of protective jammers for securing wireless transmissions in a geographic domain. IPSN 2015: 37-46 - [c140]Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, Marina Simakov:
Choice Is Hard. ISAAC 2015: 318-328 - [c139]Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, André van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno:
Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces. JCDCGG 2015: 180-192 - [c138]Yair Allouche, Yuval Cassuto, Alon Efrat, Michael Segal, Esther M. Arkin, Guy Grebla, Joseph S. B. Mitchell, Swaminathan Sankararaman:
Secure Communication through Jammers Jointly Optimized in Geography and Time. MobiHoc 2015: 227-236 - [c137]Zhong Sichen, Lu Zhao, Yan Liang, Mohammadzaman Zamani, Rob Patro, Rezaul Chowdhury, Esther M. Arkin, Joseph S. B. Mitchell, Steven Skiena:
Optimizing Read Reversals for Sequence Compression - (Extended Abstract). WABI 2015: 189-202 - [c136]Sándor P. Fekete, Kan Huang, Joseph S. B. Mitchell, Ojas Parekh, Cynthia A. Phillips:
Geometric Hitting Set for Segments of Few Orientations. WAOA 2015: 145-157 - 2014
- [c135]Esther M. Arkin, Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell, Michael Segal:
Locating Battery Charging Stations to Facilitate Almost Shortest Paths. ATMOS 2014: 25-33 - [c134]Sándor P. Fekete, Stephan Friedrichs, Michael Hemmer, Joseph S. B. Mitchell, Christiane Schmidt:
On the Chromatic Art Gallery Problem. CCCG 2014 - [c133]Kan Huang, Chien-Chun Ni, Rik Sarkar, Jie Gao, Joseph S. B. Mitchell:
Bounded stretch geographic homotopic routing in sensor networks. INFOCOM 2014: 979-987 - 2013
- [c132]Michael Biro, Jie Gao, Justin Iwerks, Irina Kostitsyna, Joseph S. B. Mitchell:
Combinatorics of Beacon Routing and Coverage. CCCG 2013 - [c131]Joseph S. B. Mitchell:
Open Problems from CCCG 2012. CCCG 2013 - [c130]Joseph S. B. Mitchell:
Approximating Watchman Routes. SODA 2013: 844-855 - [c129]Michael Biro, Justin Iwerks, Irina Kostitsyna, Joseph S. B. Mitchell:
Beacon-Based Algorithms for Geometric Routing. WADS 2013: 158-169 - 2012
- [c128]Joseph S. B. Mitchell:
Invited talk: Computational Geometry in Air Traffic Management. CCCG 2012: 283 - [c127]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 - [c126]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 - [c125]Alon Efrat, Joseph S. B. Mitchell, Swaminathan Sankararaman, Parrish Myers:
Efficient algorithms for pursuing moving evaders in terrains. SIGSPATIAL/GIS 2012: 33-42 - [c124]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 - [c123]Adrian Dumitrescu, Joseph S. B. Mitchell, Pawel Zylinski:
Watchman Routes for Lines and Segments. SWAT 2012: 36-47 - 2011
- [c122]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 - [c121]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 - [c120]Therese Biedl, Mohammad Tanvir Irfan, Justin Iwerks, Joondong Kim, Joseph S. B. Mitchell:
Guarding polyominoes. SCG 2011: 387-396 - [c119]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 - [c118]Justin Iwerks, Joseph S. B. Mitchell:
Spiral Serpentine Polygonization of a Planar Point Set. EGC 2011: 146-154 - [c117]Esther M. Arkin, Claudia Dieckmann, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Lena Schlipf, Shang Yang:
Convex Transversals. WADS 2011: 49-60 - [c116]Erin W. Chambers, Sándor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Srinivasan Venkatesh, Ulrike Stege, Sue Whitesides:
Connecting a Set of Circles with Minimum Sum of Radii. WADS 2011: 183-194 - 2010
- [c115]Joseph S. B. Mitchell:
A constant-factor approximation algorithm for TSP with pairwise-disjoint connected neighborhoods in the plane. SCG 2010: 183-191 - [c114]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 - [c113]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 - 2009
- [c112]Joseph S. B. Mitchell:
Algorithmic Problems in Air Traffic Management. ALENEX 2009: 62 - [c111]Joondong Kim, Alexander Kroeller, Joseph S. B. Mitchell:
Scheduling Aircraft to Reduce Controller Workload. ATMOS 2009 - [c110]Joondong Kim, Joseph S. B. Mitchell, Jingyu Zou:
Approximating Maximum Flow in Polygonal Domains using Spanners. CCCG 2009: 115-118 - [c109]Joseph S. B. Mitchell, Eli Packer:
Reconstructing sharp features of triangular meshes. SCG 2009: 102-103 - [c108]Sándor P. Fekete, Joseph S. B. Mitchell, Christiane Schmidt:
Minimum Covering with Travel Cost. ISAAC 2009: 393-402 - 2008
- [c107]Amitabh Basu, Joseph S. B. Mitchell, Girishkumar Sabhnani:
Geometric Algorithms for Optimal Airspace Design and Air Traffic Controller Workload Balancing. ALENEX 2008: 75-89 - [c106]Esther M. Arkin, George Hart, Joondong Kim, Irina Kostitsyna, Joseph S. B. Mitchell, Girishkumar Sabhnani, Steven Skiena:
The Embroidery Problem. CCCG 2008 - [c105]Esther M. Arkin, Joseph S. B. Mitchell, Valentin Polishchuk:
Maximum thick paths in static and dynamic environments. SCG 2008: 20-27 - [c104]Joondong Kim, Joseph S. B. Mitchell, Valentin Polishchuk, Arto Vihavainen:
Routing a maximum number of disks through a scene of moving obstacles. SCG 2008: 230-231 - [c103]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 - [c102]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 - [c101]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 - [c100]Xianjin Zhu, Rik Sarkar, Jie Gao, Joseph S. B. Mitchell:
Light-Weight Contour Tracking in Wireless Sensor Networks. INFOCOM 2008: 1175-1183 - [c99]Marc J. van Kreveld, Maarten Löffler, Joseph S. B. Mitchell:
Preprocessing Imprecise Points and Splitting Triangulations. ISAAC 2008: 544-555 - 2007
- [c98]Yoav Amit, Joseph S. B. Mitchell, Eli Packer:
Locating Guards for Visibility Coverage of Polygons. ALENEX 2007 - [c97]Esther M. Arkin, Joseph S. B. Mitchell, Jack Snoeyink:
Capturing Crossings: Convex Hulls of Segment and Plane Intersections. CCCG 2007: 9-11 - [c96]Valentin Polishchuk, Joseph S. B. Mitchell:
Thick non-crossing paths and minimum-cost flows in polygonal domains. SCG 2007: 56-65 - [c95]Joseph S. B. Mitchell:
A PTAS for TSP with neighborhoods among fat regions in the plane. SODA 2007: 11-18 - 2006
- [c94]Valentin Polishchuk, Esther M. Arkin, Joseph S. B. Mitchell:
Hamiltonian Cycles in Triangular Grids. CCCG 2006 - [c93]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. SCG 2006: 61-70 - [c92]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. SCG 2006: 449-458 - [c91]Esther M. Arkin, Gill Barequet, Joseph S. B. Mitchell:
Algorithms for two-box covering. SCG 2006: 459-467 - [c90]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. SCG 2006: 483-484 - [c89]Yue Wang, Jie Gao, Joseph S. B. Mitchell:
Boundary recognition in sensor networks by topological methods. MobiCom 2006: 122-133 - [c88]Amitabh Basu, Jie Gao, Joseph S. B. Mitchell, Girishkumar Sabhnani:
Distributed localization using noisy distance and angle information. MobiHoc 2006: 262-273 - [c87]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 - [c86]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 - [c85]Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Valentin Polishchuk:
The Snowblower Problem. WAFR 2006: 219-234 - 2005
- [c84]Alon Efrat, Sariel Har-Peled, Joseph S. B. Mitchell:
Approximation algorithms for location problems in sensor networks. BROADNETS 2005: 767-776 - [c83]Valentin Polishchuk, Joseph S. B. Mitchell:
k-Link Rectilinear Shortest Paths Among Rectilinear Obstacles in the Plane. CCCG 2005: 101-104 - [c82]Valentin Polishchuk, Joseph S. B. Mitchell:
Touring Convex Bodies - A Conic Programming Solution. CCCG 2005: 290-293 - [c81]Iris Reinbacher, Marc Benkert, Marc J. van Kreveld, Joseph S. B. Mitchell, Alexander Wolff:
Delineating Boundaries for Imprecise Regions. ESA 2005: 143-154 - [c80]Boaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell:
A constant-factor approximation algorithm for optimal terrain guarding. SODA 2005: 515-524 - [c79]Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell:
The Minimum-Area Spanning Tree Problem. WADS 2005: 195-204 - [c78]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 - 2004
- [c77]Erik D. Demaine, Satyan L. Devadoss, Joseph S. B. Mitchell, Joseph O'Rourke:
Continuous foldability of polygonal paper. CCCG 2004: 64-67 - [c76]Boaz Ben-Moshe, Olaf A. Hall-Holt, Matthew J. Katz, Joseph S. B. Mitchell:
Computing the visibility graph of points within a polygon. SCG 2004: 27-35 - [c75]Joseph S. B. Mitchell, Micha Sharir:
New results on shortest paths in three dimensions. SCG 2004: 124-133 - [c74]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 - 2003
- [c73]Piyush Kumar, Joseph S. B. Mitchell, E. Alper Yildirim:
Comuting Core-Sets and Approximate Smallest Enclosing HyperSpheres in High Dimensions. ALENEX 2003: 45-55 - [c72]Tien-Ruey Hsiang, Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell:
Online dispersion algorithms for swarms of robots. SCG 2003: 382-383 - [c71]Moshe Dror, Alon Efrat, Anna Lubiw, Joseph S. B. Mitchell:
Touring a sequence of polygons. STOC 2003: 473-482 - [c70]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 - 2002
- [c69]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 - [c68]Regina Estkowski, Joseph S. B. Mitchell, Xinyu Xiang:
Optimal decomposition of polygonal models into triangle strips. SCG 2002: 254-263 - [c67]Boaz Ben-Moshe, Joseph S. B. Mitchell, Matthew J. Katz, Yuval Nir:
Visibility preserving terrain simplification: an experimental study. SCG 2002: 303-311 - [c66]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 - [c65]Christos Levcopoulos, Andrzej Lingas, Joseph S. B. Mitchell:
Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains. SWAT 2002: 80-89 - [c64]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 - [c63]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. WAFR 2002: 77-94 - 2001
- [c62]Saurabh Sethia, Martin Held, Joseph S. B. Mitchell:
PVD: A Stable Implementation for Computing Voronoi Diagrams of Polygonal Pockets. ALENEX 2001: 105-116 - [c61]Erik D. Demaine, Joseph S. B. Mitchell:
Reaching folded states of a rectangular piece of paper. CCCG 2001: 73-75 - [c60]Regina Estkowski, Joseph S. B. Mitchell:
Simplifying a polygonal subdivision while keeping it simple. SCG 2001: 40-49 - [c59]Adrian Dumitrescu, Joseph S. B. Mitchell, Micha Sharir:
Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles. SCG 2001: 141-150 - [c58]Boaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell:
Farthest neighbors and center points in the presence of rectangular obstacles. SCG 2001: 164-171 - [c57]Adrian Dumitrescu, Joseph S. B. Mitchell:
Approximation algorithms for TSP with neighborhoods in the plane. SODA 2001: 38-46 - [c56]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 - [c55]Esther M. Arkin, Sándor P. Fekete, Ferran Hurtado, Joseph S. B. Mitchell, Marc Noy, Vera Sacristán, Saurabh Sethia:
On the Reflexivity of Point Sets. WADS 2001: 192-204 - [c54]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 - 2000
- [c53]Sándor P. Fekete, Joseph S. B. Mitchell, Karin Weinbrecht:
On the continuous Weber and k-median problems (extended abstract). SCG 2000: 70-79 - [c52]Ricardo C. Farias, Joseph S. B. Mitchell, Cláudio T. Silva, Brian N. Wylie:
Time-Critical Rendering of Irregular Grids. SIBGRAPI 2000: 243-250 - [c51]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 - [c50]Ricardo C. Farias, Joseph S. B. Mitchell, Cláudio T. Silva:
ZSWEEP: an efficient and exact projection algorithm for unstructured volume rendering. VVS 2000: 91-99 - 1999
- [c49]Marc J. van Kreveld, Joseph S. B. Mitchell, Peter J. Rousseeuw, Micha Sharir, Jack Snoeyink, Bettina Speckmann:
Efficient Algorithms for Maximum Regression Depth. SCG 1999: 31-40 - [c48]Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell:
Folding Flat Silhouettes and Wrapping Polyhedral Packages: New Results in Computational Origami. SCG 1999: 105-114 - [c47]Shakhar Smorodinsky, Joseph S. B. Mitchell, Micha Sharir:
Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls inRd. SCG 1999: 400-406 - [c46]Xinyu Xiang, Martin Held, Joseph S. B. Mitchell:
Fast and effective stripification of polygonal surface models. SI3D 1999: 71-78 - [c45]Yi-Jen Chiang, Joseph S. B. Mitchell:
Two-Point Euclidean Shortest Path Queries in the Plane. SODA 1999: 215-224 - [c44]Xinyu Xiang, Martin Held, Joseph S. B. Mitchell:
Fast and Effective Stripification of Polygonal Surface Models. SODA 1999: 985-986 - [c43]Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Steven Skiena:
The Lazy Bureaucrat Scheduling Problem. WADS 1999: 122-133 - 1998
- [c42]Esther M. Arkin, Joseph S. B. Mitchell, Giri Narasimhan:
Resource-Constrained Geometric Network Optimization. SCG 1998: 307-316 - [c41]Cláudio T. Silva, Joseph S. B. Mitchell:
Greedy Cuts: An Advancing Front Terrain Triangulation Algorithm. ACM-GIS 1998: 137-144 - [c40]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
- [c39]Cristian S. Mata, Joseph S. B. Mitchell:
A New Algorithm for Computing Shortest Paths in Weighted Planar Subdivisions (Extended Abstract). SCG 1997: 264-273 - [c38]George N. Sazaklis, Esther M. Arkin, Joseph S. B. Mitchell, Steven Skiena:
Geometric Decision Trees for Optical Character Recognition (Extended Abstract). SCG 1997: 394-396 - [c37]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
- [c36]Martin Held, James T. Klosowski, Joseph S. B. Mitchell:
Collision Detection for Fly-Throughs in Virtual Environments. SCG 1996: V-13-V-14 - [c35]Esther M. Arkin, Yi-Jen Chiang, Martin Held, Joseph S. B. Mitchell, Vera Sacristán, Steven Skiena, Tae-Heng Yang:
On Minimum-Area Hulls (Extended Abstract). ESA 1996: 334-348 - [c34]Martin Held, James T. Klosowski, Joseph S. B. Mitchell:
Real-time collision detection for motion simulation within complex environments. SIGGRAPH Visual Proceedings 1996: 151 - [c33]Joseph S. B. Mitchell:
Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple New Method for the Geometric k-MST Problem. SODA 1996: 402-408 - [c32]Cláudio T. Silva, Joseph S. B. Mitchell, Arie E. Kaufman:
Fast Rendering of Irregular Grids. VVS 1996: 15-22 - [c31]Joseph S. B. Mitchell:
On Some Applications of Computational Geometry in Manufacturing and Virtual Environments. WACG 1996: 37-40 - 1995
- [c30]Cristian S. Mata, Joseph S. B. Mitchell:
Approximation Algorithms for Geometric Tour and Network Design Problems (Extended Abstract). SCG 1995: 360-369 - [c29]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
- [c28]Chong Zhu, Gopalakrishnan Sundaram, Jack Snoeyink, Joseph S. B. Mitchell:
Generating Random x-Monotone Polygons with Given Vertices. CCCG 1994: 189-194 - [c27]Michael T. Goodrich, Joseph S. B. Mitchell, Mark W. Orletsky:
Practical Methods for Approximate Geometric Pattern Matching Under Rigid Motions (Preliminary Version). SCG 1994: 103-112 - [c26]Joseph S. B. Mitchell, David M. Mount, Subhash Suri:
Query-Sensitive Ray Shooting. SCG 1994: 359-368 - [c25]Esther M. Arkin, Martin Held, Joseph S. B. Mitchell, Steven Skiena:
Hamilton Triangulations for Fast Rendering. ESA 1994: 36-47 - 1993
- [c24]Erik L. Wynters, Joseph S. B. Mitchell:
Shortest Paths for a Two-robot Rendez-vous. CCCG 1993: 216-221 - [c23]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 - [c22]Esther M. Arkin, Sándor P. Fekete, Joseph S. B. Mitchell:
The Lawnmower Problem. CCCG 1993: 461-466 - [c21]Joseph S. B. Mitchell:
Shortest Paths Among Obstacles in the Plane. SCG 1993: 308-317 - [c20]Esther M. Arkin, Henk Meijer, Joseph S. B. Mitchell, David Rappaport, Steven Skiena:
Decision Trees for Geometric Models. SCG 1993: 369-378 - [c19]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
- [c18]Joseph S. B. Mitchell, Christine D. Piatko, Esther M. Arkin:
Computing a Shortest k-Link Path in a Polygon. FOCS 1992: 573-582 - [c17]Esther M. Arkin, Joseph S. B. Mitchell, Subhash Suri:
Optimal Link Path Queries in a Simple Polygon. SODA 1992: 269-279 - [c16]Joseph S. B. Mitchell, Subhash Suri:
Separation and Approximation of Polyhedral Objects. SODA 1992: 296-306 - 1991
- [c15]Esther M. Arkin, Dan Halperin, Klara Kedem, Joseph S. B. Mitchell, Nir Naor:
Arrangements of Segments that Share Endpoints: Single Face Results. SCG 1991: 324-333 - [c14]Leonidas J. Guibas, John Hershberger, Joseph S. B. Mitchell, Jack Snoeyink:
Approximating Polygons and Subdivisions with Minimum Link Paths. ISA 1991: 151-162 - [c13]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 - [c12]Esther M. Arkin, Samir Khuller, Joseph S. B. Mitchell:
Geometric Knapsack Problems. WADS 1991: 165-176 - [c11]Joseph S. B. Mitchell, Erik L. Wynters:
Finding Optimal Bipartitions of Points and Polygons. WADS 1991: 202-213 - [c10]Paul J. Heffernan, Joseph S. B. Mitchell:
An Optimal Algorithm for Computing Visibility in the Plane. WADS 1991: 437-448 - [c9]Leonidas J. Guibas, Joseph S. B. Mitchell:
Voronoi Diagrams of Moving Points in the Plane. WG 1991: 113-125 - 1990
- [c8]Paul J. Heffernan, Joseph S. B. Mitchell:
Structured Visibility Profiles with Applications to Problems in Simple Polygons (Extended Abstract). SCG 1990: 53-62 - [c7]Joseph S. B. Mitchell, Günter Rote, Gerhard J. Woeginger:
Minimum-Link Paths Among Obstacles in the Plane. SCG 1990: 63-72 - [c6]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
- [c5]Esther M. Arkin, Robert Connelly, Joseph S. B. Mitchell:
On Monotone Paths Among Obstacles with Applications to Planning Assemblies. SCG 1989: 334-343 - 1988
- [c4]Laxmi P. Gewali, Alex C. Meng, Joseph S. B. Mitchell, Simeon C. Ntafos:
Path Planning in 0/1/infinity Weighted Regions with Applications. SCG 1988: 266-278 - [c3]Joseph S. B. Mitchell:
On Maximum Flows in Polyhedral Domains. SCG 1988: 341-351 - 1987
- [c2]Joseph S. B. Mitchell, Christos H. Papadimitriou:
The Weighted Region Problem. SCG 1987: 30-38 - 1984
- [c1]David M. Keirsey, E. Koch, J. McKisson, Alex Meystel, Joseph S. B. Mitchell:
Algorithm of navigation for a mobile robot. ICRA 1984: 574-583
Parts in Books or Collections
- 2000
- [p1]Joseph S. B. Mitchell:
Geometric Shortest Paths and Network Optimization. Handbook of Computational Geometry 2000: 633-701
Editorship
- 2010
- [e2]David G. Kirkpatrick, Joseph S. B. Mitchell:
Proceedings of the 26th ACM Symposium on Computational Geometry, Snowbird, Utah, USA, June 13-16, 2010. ACM 2010, ISBN 978-1-4503-0016-2 [contents] - 2005
- [e1]Joseph S. B. Mitchell, Günter Rote:
Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005. ACM 2005, ISBN 1-58113-991-8 [contents]
Reference Works
- 2016
- [r2]Joseph S. B. Mitchell:
Approximation Schemes for Geometric Network Optimization Problems. Encyclopedia of Algorithms 2016: 126-130 - 2004
- [r1]Joseph S. B. Mitchell:
Shortest Paths and Networks. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 607-641
Informal and Other Publications
- 2024
- [i50]Kien C. Huynh, Joseph S. B. Mitchell, Linh Nguyen, Valentin Polishchuk:
Optimizing Visibility-based Search in Polygonal Domains. CoRR abs/2402.05420 (2024) - [i49]Rathish Das, Omrit Filtser, Matthew J. Katz, Joseph S. B. Mitchell:
Robustly Guarding Polygons. CoRR abs/2403.11861 (2024) - 2023
- [i48]Kerem Geva, Matthew J. Katz, Joseph S. B. Mitchell, Eli Packer:
Minimum-link C-Oriented Paths Visiting a Sequence of Regions in the Plane. CoRR abs/2302.06776 (2023) - [i47]A. Karim Abu-Affash, Paz Carmi, Ori Luwisch, Joseph S. B. Mitchell:
Geometric Spanning Trees Minimizing the Wiener Index. CoRR abs/2303.01096 (2023) - 2022
- [i46]Omrit Filtser, Mayank Goswami, Joseph S. B. Mitchell, Valentin Polishchuk:
How to Stay Socially Distant: A Geometric Approach. CoRR abs/2203.04548 (2022) - 2021
- [i45]Joseph S. B. Mitchell:
Approximating Maximum Independent Set for Rectangles in the Plane. CoRR abs/2101.00326 (2021) - [i44]Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Joseph S. B. Mitchell:
Computing Coordinated Motion Plans for Robot Swarms: The CG: SHOP Challenge 2021. CoRR abs/2103.15381 (2021) - [i43]Annika Bonerath, Jan-Henrik Haunert, Joseph S. B. Mitchell, Benjamin Niedermann:
Shortcut Hulls: Vertex-restricted Outer Simplifications of Polygons. CoRR abs/2106.13620 (2021) - [i42]Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Joseph S. B. Mitchell:
Area-Optimal Simple Polygonalizations: The CG Challenge 2019. CoRR abs/2111.07304 (2021) - 2020
- [i41]Yanjun Pan, Alon Efrat, Ming Li, Boyang Wang, Hanyu Quan, Joseph S. B. Mitchell, Jie Gao, Esther M. Arkin:
Data Inference from Encrypted Databases: A Multi-dimensional Order-Preserving Matching Approach. CoRR abs/2001.08773 (2020) - [i40]Sándor P. Fekete, Alexander Hill, Dominik Krupke, Tyler Mayer, Joseph S. B. Mitchell, Ojas Parekh, Cynthia A. Phillips:
Probing a Set of Trajectories to Maximize Captured Information. CoRR abs/2004.03486 (2020) - [i39]Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Joseph S. B. Mitchell:
Computing Convex Partitions for Point Sets in the Plane: The CG: SHOP Challenge 2020. CoRR abs/2004.04207 (2020) - [i38]A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Joseph S. B. Mitchell:
Planar Bichromatic Bottleneck Spanning Trees. CoRR abs/2004.08854 (2020) - [i37]Esther M. Arkin, Rathish Das, Jie Gao, Mayank Goswami, Joseph S. B. Mitchell, Valentin Polishchuk, Csaba D. Tóth:
Cutting Polygons into Small Pieces with Chords: Laser-Based Localization. CoRR abs/2006.15089 (2020) - 2019
- [i36]Rathish Das, Shih-Yu Tsai, Sharmila Duppala, Jayson Lynch, Esther M. Arkin, Rezaul Chowdhury, Joseph S. B. Mitchell, Steven Skiena:
Data Races and the Discrete Resource-time Tradeoff Problem with Resource Reuse over Paths. CoRR abs/1904.09283 (2019) - [i35]Molly Baird, Sara C. Billey, Erik D. Demaine, Martin L. Demaine, David Eppstein, Sándor P. Fekete, Graham Gordon, Sean Griffin, Joseph S. B. Mitchell, Joshua P. Swanson:
Existence and hardness of conveyor belts. CoRR abs/1908.07668 (2019) - 2018
- [i34]Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy:
The Balanced Connected Subgraph Problem. CoRR abs/1809.08856 (2018) - 2017
- [i33]Adrian Dumitrescu, Joseph S. B. Mitchell:
Approximation algorithms for TSP with neighborhoods in the plane. CoRR abs/1703.01640 (2017) - [i32]Joseph S. B. Mitchell:
A PTAS for TSP with Neighborhoods Among Fat Regions in the Plane. CoRR abs/1703.01646 (2017) - [i31]Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, André van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno:
Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces. CoRR abs/1703.02671 (2017) - [i30]Gui Citovsky, Tyler Mayer, Joseph S. B. Mitchell:
TSP With Locational Uncertainty: The Adversarial Model. CoRR abs/1705.06180 (2017) - [i29]Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Su Jia, Matthew J. Katz, Tyler Mayer, Joseph S. B. Mitchell:
Network Optimization on Partitioned Pairs of Points. CoRR abs/1710.00876 (2017) - [i28]Sándor P. Fekete, Sven von Höveling, Joseph S. B. Mitchell, Christian Rieck, Christian Scheffer, Arne Schmidt, James R. Zuber:
Don't Rock the Boat: Algorithms for Balanced Dynamic Loading and Unloading. CoRR abs/1712.06498 (2017) - 2016
- [i27]Sándor P. Fekete, Kan Huang, Joseph S. B. Mitchell, Ojas Parekh, Cynthia A. Phillips:
Geometric Hitting Set for Segments of Few Orientations. CoRR abs/1603.06077 (2016) - [i26]Sándor P. Fekete, Andreas Haas, Michael Hemmer, Michael Hoffmann, Irina Kostitsyna, Dominik Krupke, Florian Maurer, Joseph S. B. Mitchell, Arne Schmidt, Christiane Schmidt, Julian Troegel:
Computing Nonsimple Polygons of Minimum Perimeter. CoRR abs/1603.07077 (2016) - [i25]Sándor P. Fekete, Qian Li, Joseph S. B. Mitchell, Christian Scheffer:
Universal Guard Problems. CoRR abs/1611.08315 (2016) - 2015
- [i24]Joseph S. B. Mitchell, Valentin Polishchuk, Mikko Sysikaski, Haitao Wang:
An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains. CoRR abs/1504.06842 (2015) - [i23]Alon Efrat, Sándor P. Fekete, Joseph S. B. Mitchell, Valentin Polishchuk, Jukka Suomela:
Improved Approximation Algorithms for Relay Placement. CoRR abs/1511.02525 (2015) - [i22]Sang Won Bae, Matias Korman, Joseph S. B. Mitchell, Yoshio Okamoto, Valentin Polishchuk, Haitao Wang:
Computing the L1 Geodesic Diameter and Center of a Polygonal Domain. CoRR abs/1512.07160 (2015) - 2013
- [i21]Irina Kostitsyna, Joseph S. B. Mitchell:
Local Redesigning of Airspace Sectors. CoRR abs/1302.1089 (2013) - [i20]Joseph S. B. Mitchell, Valentin Polishchuk, Mikko Sysikaski:
Minimum-Link Paths Revisited. CoRR abs/1302.3091 (2013) - 2012
- [i19]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
- [i18]Sándor P. Fekete, Joseph S. B. Mitchell, Christiane Schmidt:
Minimum Covering with Travel Cost. CoRR abs/1101.2360 (2011) - [i17]Erin W. Chambers, Sándor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Srinivasan Venkatesh, Ulrike Stege, Sue Whitesides:
Connecting a Set of Circles with Minimum Sum of Radii. CoRR abs/1105.0791 (2011) - [i16]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) - 2009
- [i15]Joseph S. B. Mitchell:
Open Problem Session. Computational Geometry 2009 - 2006
- [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) - 2004
- [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
- [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
- [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 Sacristán, 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
- [i3]Joseph S. B. Mitchell, Joseph O'Rourke:
Computational Geometry Column 42. CoRR cs.CG/0108021 (2001) - 2000
- [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)
Coauthor Index
[j113] [j111] [j105] [j104] [j102] [j101] [j99] [j98] [j93] [j89] [j86] [j85] [j81] [j80] [j79] [j73] [j68] [j66] [j64] [j61] [j59] [j55] [j54] [j53] [j52] [j42] [j37] [j36] [j35] [j34] [j29] [j27] [j21] [j19] [j18] [j15] [j10] [j7] [c173] [c168] [c167] [c166] [c159] [c154] [c153] [c148] [c145] [c143] [c141] [c140] [c138] [c137] [c135] [c127] [c124] [c121] [c117] [c113] [c106] [c105] [c97] [c94] [c92] [c91] [c85] [c74] [c72] [c69] [c66] [c64] [c63] [c56] [c55] [c54] [c43] [c42] [c38] [c37] [c35] [c25] [c23] [c22] [c20] [c19] [c18] [c17] [c15] [c13] [c12] [c6] [c5] [i41] [i37] [i36] [i29] [i16] [i14] [i13] [i11] [i9] [i7] [i6] [i5] [i4] [i2] [i1]
[j120] [j119] [j116] [j112] [j110] [j109] [j106] [j103] [j100] [j87] [j84] [j81] [j66] [j62] [j61] [j54] [j45] [j42] [c164] [c157] [c152] [c147] [c136] [c134] [c122] [c116] [c108] [c103] [c93] [c92] [c72] [c66] [c63] [c56] [c55] [c53] [c22] [i44] [i42] [i40] [i39] [i35] [i28] [i27] [i26] [i25] [i23] [i18] [i17] [i13] [i12] [i11] [i10] [i9] [i7] [i6] [i4]
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 01:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
