Joseph S. B. Mitchell - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Convex TransversalsEsther M. Arkin, Claudia Dieckmann, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Lena Schlipf, Shang Yang. wads 2011: 49-60 [doi]

The snowblower problemEsther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Valentin Polishchuk. comgeo, 44(8):370-384, 2011. [doi]

Guarding polyominoesTherese C. Biedl, Mohammad Tanvir Irfan, Justin Iwerks, Joondong Kim, Joseph S. B. Mitchell. compgeom 2011: 387-396 [doi]

Connecting a Set of Circles with Minimum Sum of RadiiErin W. Chambers, Sándor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Venkatesh Srinivasan, Ulrike Stege, Sue Whitesides. wads 2011: 183-194 [doi]

Exploring and Triangulating a Region by a Swarm of RobotsSándor P. Fekete, Tom Kamphans, Alexander Kröller, Joseph S. B. Mitchell, Christiane Schmidt. approx 2011: 206-217 [doi]

2010

Locating Guards for Visibility Coverage of PolygonsYoav Amit, Joseph S. B. Mitchell, Eli Packer. ijcga, 20(5):601-630, 2010. [doi]

Data transmission and base-station placement for optimizing network lifetimeEsther M. Arkin, Valentin Polishchuk, Alon Efrat, Srinivasan Ramasubramanian, Javad Taheri, Joseph S. B. Mitchell, Swaminathan Sankararaman. dialm 2010: 23-32 [doi]

Maximum thick paths in static and dynamic environmentsEsther M. Arkin, Joseph S. B. Mitchell, Valentin Polishchuk. comgeo, 43(3):279-294, 2010. [doi]

Locked and Unlocked Chains of Planar ShapesRobert Connelly, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Stefan Langerman, Joseph S. B. Mitchell, Ares Ribó, Günter Rote. dcg, 44(2):439-462, 2010. [doi]

Optimizing Restriction Site Placement for Synthetic GenomesPablo Montes, Heraldo Memelli, Charles B. Ward, Joondong Kim, Joseph S. B. Mitchell, Steven Skiena. cpm 2010: 323-337 [doi]

Proceedings of the 26th ACM Symposium on Computational Geometry, Snowbird, Utah, USA, June 13-16, 2010Jack Snoeyink, Mark de Berg, Joseph S. B. Mitchell, Günter Rote, Monique Teillaud, editors, ACM, 2010.

Preprocessing Imprecise Points and Splitting TriangulationsMarc J. van Kreveld, Maarten Löffler, Joseph S. B. Mitchell. siamcomp, 39(7):2990-3000, 2010. [doi]

2009

Geometric stable roommatesEsther M. Arkin, Sang Won Bae, Alon Efrat, Kazuya Okamoto, Joseph S. B. Mitchell, Valentin Polishchuk. ipl, 109(4):219-224, 2009. [doi]

Not being (super)thin or solid is hard: A study of grid HamiltonicityEsther 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. comgeo, 42(6-7):582-605, 2009. [doi]

Geometric algorithms for optimal airspace design and air traffic controller workload balancingAmitabh Basu, Joseph S. B. Mitchell, Girishkumar Sabhnani. jea, 14, 2009. [doi]

Minimum Covering with Travel CostSÃ¡ndor P. Fekete, Joseph S. B. Mitchell, Christiane Schmidt. isaac 2009: 393-402 [doi]

Scheduling Aircraft to Reduce Controller WorkloadJoondong Kim, Alexander Kroeller, Joseph S. B. Mitchell. atmos 2009: [doi]

Approximating Maximum Flow in Polygonal Domains using SpannersJoondong Kim, Joseph S. B. Mitchell, Jingyu Zou. cccg 2009: 115-118 [doi]

A Near-Tight Approximation Algorithm for the Robot Localization ProblemSven Koenig, Joseph S. B. Mitchell, Apurva Mudgal, Craig A. Tovey. siamcomp, 39(2):461-490, 2009. [doi]

Algorithmic Problems in Air Traffic ManagementJoseph S. B. Mitchell. alenex 2009: 62 [doi]

Reconstructing sharp features of triangular meshesJoseph S. B. Mitchell, Eli Packer. compgeom 2009: 102-103 [doi]

Matching Points with SquaresBernardo M. Ábrego, Esther M. Arkin, Silvia Fernández-Merchant, Ferran Hurtado, Mikio Kano, Joseph S. B. Mitchell, Jorge Urrutia. dcg, 41(1):77-95, 2009. [doi]

2008

The Embroidery ProblemEsther M. Arkin, George Hart, Joondong Kim, Irina Kostitsyna, Joseph S. B. Mitchell, Girishkumar Sabhnani, Steven Skiena. cccg 2008:

Capturing crossings: Convex hulls of segment and plane intersectionsEsther M. Arkin, Joseph S. B. Mitchell, Jack Snoeyink. ipl, 107(5):194-197, 2008. [doi]

Maximum thick paths in static and dynamic environmentsEsther M. Arkin, Joseph S. B. Mitchell, Valentin Polishchuk. compgeom 2008: 20-27 [doi]

Geometric Algorithms for Optimal Airspace Design and Air Traffic Controller Workload BalancingAmitabh Basu, Joseph S. B. Mitchell, Girishkumar Sabhnani. alenex 2008: 75-89 [doi]

Improved Approximation Algorithms for Relay PlacementAlon Efrat, Sándor P. Fekete, Poornananda R. Gaddehosur, Joseph S. B. Mitchell, Valentin Polishchuk, Jukka Suomela. esa 2008: 356-367 [doi]

Triangulating input-constrained planar point setsMartin Held, Joseph S. B. Mitchell. ipl, 109(1):54-56, 2008. [doi]

Routing a maximum number of disks through a scene of moving obstaclesJoondong Kim, Joseph S. B. Mitchell, Valentin Polishchuk, Arto Vihavainen. compgeom 2008: 230-231 [doi]

Minimum-perimeter enclosuresJoseph S. B. Mitchell, Valentin Polishchuk. ipl, 107(3-4):120-124, 2008. [doi]

Delineating Boundaries for Imprecise RegionsIris Reinbacher, Marc Benkert, Marc J. van Kreveld, Joseph S. B. Mitchell, Jack Snoeyink, Alexander Wolff. algorithmica, 50(3):386-414, 2008. [doi]

Iso-Contour Queries and Gradient Descent with Guaranteed Delivery in Sensor NetworksRik Sarkar, Xianjin Zhu, Jie Gao, Leonidas J. Guibas, Joseph S. B. Mitchell. infocom 2008: 960-967 [doi]

Efficient Algorithms for Maximum Regression DepthMarc J. van Kreveld, Joseph S. B. Mitchell, Peter Rousseeuw, Micha Sharir, Jack Snoeyink, Bettina Speckmann. dcg, 39(4):656-677, 2008. [doi]

Preprocessing Imprecise Points and Splitting TriangulationsMarc J. van Kreveld, Maarten Löffler, Joseph S. B. Mitchell. isaac 2008: 544-555 [doi]

Light-Weight Contour Tracking in Wireless Sensor NetworksXianjin Zhu, Rik Sarkar, Jie Gao, Joseph S. B. Mitchell. infocom 2008: 1175-1183 [doi]

2007

Locating Guards for Visibility Coverage of PolygonsYoav Amit, Joseph S. B. Mitchell, Eli Packer. alenex 2007: [doi]

Capturing Crossings: Convex Hulls of Segment and Plane IntersectionsEsther M. Arkin, Joseph S. B. Mitchell, Jack Snoeyink. cccg 2007: 9-11

Two New Classes of Hamiltonian Graphs: (Extended Abstract)Esther M. Arkin, Joseph S. B. Mitchell, Valentin Polishchuk. endm, 29:565-569, 2007. [doi]

A Constant-Factor Approximation Algorithm for Optimal 1.5D Terrain GuardingBoaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell. siamcomp, 36(6):1631-1647, 2007. [doi]

On simultaneous planar graph embeddingsPeter Braß, Eowyn Cenek, Christian A. Duncan, Alon Efrat, Cesim Erten, Dan Ismailescu, Stephen G. Kobourov, Anna Lubiw, Joseph S. B. Mitchell. comgeo, 36(2):117-130, 2007. [doi]

EditorialFerran Hurtado, Joseph S. B. Mitchell. comgeo, 37(1):1-2, 2007. [doi]

Guest Editor s ForewordJoseph S. B. Mitchell. dcg, 37(1):1-2, 2007. [doi]

A PTAS for TSP with neighborhoods among fat regions in the planeJoseph S. B. Mitchell. soda 2007: 11-18 [doi]

Thick non-crossing paths and minimum-cost flows in polygonal domainsValentin Polishchuk, Joseph S. B. Mitchell. compgeom 2007: 56-65 [doi]

2006

Minimum-cost coverage of point sets by disksHelmut Alt, Esther M. Arkin, Hervé Brönnimann, Jeff Erickson, Sándor P. Fekete, Christian Knauer, Jonathan Lenchner, Joseph S. B. Mitchell, Kim Whittlesey. compgeom 2006: 449-458 [doi]

Some Lower Bounds on Geometric Separability ProblemsEsther M. Arkin, Ferran Hurtado, Joseph S. B. Mitchell, Carlos Seara, Steven Skiena. ijcga, 16(1):1-26, 2006. [doi]

Algorithms for two-box coveringEsther M. Arkin, Gill Barequet, Joseph S. B. Mitchell. compgeom 2006: 459-467 [doi]

The Snowblower ProblemEsther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Valentin Polishchuk. wafr 2008: 219-234 [doi]

The Freeze-Tag Problem: How to Wake Up a Swarm ofRobotsEsther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell, Martin Skutella. algorithmica, 46(2):193-221, 2006. [doi]

Distributed localization using noisy distance and angle informationAmitabh Basu, Jie Gao, Joseph S. B. Mitchell, Girishkumar Sabhnani. mobihoc 2006: 262-273 [doi]

The minimum-area spanning tree problemPaz Carmi, Matthew J. Katz, Joseph S. B. Mitchell. comgeo, 35(3):218-225, 2006. [doi]

Locked and unlocked chains of planar shapesRobert Connelly, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Stefan Langerman, Joseph S. B. Mitchell, Ares Ribó, Günter Rote. compgeom 2006: 61-70 [doi]

An Experimental Study of Weighted k-Link Shortest Path AlgorithmsOvidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap. wafr 2008: 187-202 [doi]

Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisionsOvidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap. compgeom 2006: 483-484 [doi]

Finding large sticks and potatoes in polygonsOlaf Hall-Holt, Matthew J. Katz, Piyush Kumar, Joseph S. B. Mitchell, Arik Sityon. soda 2006: 474-483 [doi]

Hamiltonian Cycles in Triangular GridsValentin Polishchuk, Esther M. Arkin, Joseph S. B. Mitchell. cccg 2006: [doi]

Boundary recognition in sensor networks by topological methodsYue Wang, Jie Gao, Joseph S. B. Mitchell. mobicom 2006: 122-133 [doi]

2005

Optimal Covering Tours with Turn CostsEsther M. Arkin, Michael A. Bender, Erik D. Demaine, Sándor P. Fekete, Joseph S. B. Mitchell, Saurabh Sethia. siamcomp, 35(3):531-566, 2005. [doi]

A constant-factor approximation algorithm for optimal terrain guardingBoaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell. soda 2005: 515-524 [doi]

The Minimum-Area Spanning Tree ProblemPaz Carmi, Matthew J. Katz, Joseph S. B. Mitchell. wads 2005: 195-204 [doi]

::::k::::-Link Shortest Paths in Weighted SubdivisionsOvidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap. wads 2005: 325-337 [doi]

Approximation algorithms for location problems in sensor networksAlon Efrat, Sariel Har-Peled, Joseph S. B. Mitchell. broadnets 2005: 767-776

On the Continuous Fermat-Weber ProblemSÃ¡ndor P. Fekete, Joseph S. B. Mitchell, Karin Beurer. ior, 53(1):61-76, 2005. [doi]

Orthogonal segment stabbingMatthew J. Katz, Joseph S. B. Mitchell, Yuval Nir. comgeo, 30(2):197-205, 2005. [doi]

Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005Joseph S. B. Mitchell, Günter Rote, editors, ACM, 2005.

k-Link Rectilinear Shortest Paths Among Rectilinear Obstacles in the PlaneValentin Polishchuk, Joseph S. B. Mitchell. cccg 2005: 101-104 [doi]

Touring Convex Bodies - A Conic Programming SolutionValentin Polishchuk, Joseph S. B. Mitchell. cccg 2005: 290-293 [doi]

Delineating Boundaries for Imprecise RegionsIris Reinbacher, Marc Benkert, Marc J. van Kreveld, Joseph S. B. Mitchell, Alexander Wolff. esa 2005: 143-154 [doi]

2004

When can you fold a map?Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell, Saurabh Sethia, Steven Skiena. comgeo, 29(1):23-46, 2004. [doi]

Visibility preserving terrain simplification-- an experimental studyBoaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell, Yuval Nir. comgeo, 28(2-3):175-190, 2004. [doi]

Computing the visibility graph of points within a polygonBoaz Ben-Moshe, Olaf Hall-Holt, Matthew J. Katz, Joseph S. B. Mitchell. compgeom 2004: 27-35 [doi]

Continuous foldability of polygonal paperErik D. Demaine, Satyan L. Devadoss, Joseph S. B. Mitchell, Joseph O Rourke. cccg 2004: 64-67 [doi]

Binary Space Partitions for Axis-Parallel Segments, Rectangles, and HyperrectanglesAdrian Dumitrescu, Joseph S. B. Mitchell, Micha Sharir. dcg, 31(2):207-227, 2004. [doi]

A note from the editors-in-chiefD. T. Lee, Joseph S. B. Mitchell. ijcga, 14(1-2), 2004. [doi]

New results on shortest paths in three dimensionsJoseph S. B. Mitchell, Micha Sharir. compgeom 2004: 124-133 [doi]

Editor s forewordJoseph S. B. Mitchell. ijcga, 14(4-5):231-232, 2004. [doi]

Matching Points with Circles and SquaresBernardo M. Ábrego, Esther M. Arkin, Silvia Fernández-Merchant, Ferran Hurtado, Mikio Kano, Joseph S. B. Mitchell, Jorge Urrutia. jcdcg 2005: 1-15 [doi]

2003

An algorithmic study of manufacturing paperclips and other folded structuresEsther M. Arkin, Sándor P. Fekete, Joseph S. B. Mitchell. comgeo, 25(1-2):117-138, 2003.

Minimum-link watchman toursEsther M. Arkin, Joseph S. B. Mitchell, Christine D. Piatko. ipl, 86(4):203-207, 2003. [doi]

The Lazy Bureaucrat scheduling problemEsther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Steven Skiena. iandc, 184(1):129-146, 2003. [doi]

On Simultaneous Planar Graph EmbeddingsPeter Braß, Eowyn Cenek, Christian A. Duncan, Alon Efrat, Cesim Erten, Dan Ismailescu, Stephen G. Kobourov, Anna Lubiw, Joseph S. B. Mitchell. wads 2003: 243-255 [doi]

Touring a sequence of polygonsMoshe Dror, Alon Efrat, Anna Lubiw, Joseph S. B. Mitchell. stoc 2003: 473-482 [doi]

Approximation algorithms for TSP with neighborhoods in the planeAdrian Dumitrescu, Joseph S. B. Mitchell. jal, 48(1):135-159, 2003. [doi]

Online dispersion algorithms for swarms of robotsTien-Ruey Hsiang, Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell. compgeom 2003: 382-383 [doi]

Comuting Core-Sets and Approximate Smallest Enclosing HyperSpheres in High DimensionsPiyush Kumar, Joseph S. B. Mitchell, E. Alper Yildirim. alenex 2003: 45-55

Approximate minimum enclosing balls in high dimensions using core-setsPiyush Kumar, Joseph S. B. Mitchell, E. Alper Yildirim. jea, 8, 2003. [doi]

2002

Edit distance of run-length encoded stringsOra Arbell, Gad M. Landau, Joseph S. B. Mitchell. ipl, 83(6):307-314, 2002. [doi]

The freeze-tag problem: how to wake up a swarm of robotsEsther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell, Martin Skutella. soda 2002: 568-577 [doi]

Visibility preserving terrain simplification: an experimental studyBoaz Ben-Moshe, Joseph S. B. Mitchell, Matthew J. Katz, Yuval Nir. compgeom 2002: 303-311 [doi]

New Similarity Measures between Polylines with Applications to Morphing and Polygon SweepingAlon Efrat, Leonidas J. Guibas, Sariel Har-Peled, Joseph S. B. Mitchell, T. M. Murali. dcg, 28(4):535-569, 2002. [doi]

Optimal decomposition of polygonal models into triangle stripsRegina Estkowski, Joseph S. B. Mitchell, Xinyu Xiang. compgeom 2002: 254-263 [doi]

Processor Allocation on Cplant: Achieving General Processor Locality Using One-Dimensional Allocation StrategiesVitus 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. cluster 2002: 296-304 [doi]

Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal ChainsChristos Levcopoulos, Andrzej Lingas, Joseph S. B. Mitchell. swat 2002: 80-89 [doi]

Analysis of Heuristics for the Freeze-Tag ProblemMarcelo O. Sztainberg, Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell. swat 2002: 270-279 [doi]

2001

When Can You Fold a Map?Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell, Saurabh Sethia, Steven Skiena. wads 2001: 401-413 [doi]

On the Reflexivity of Point SetsEsther M. Arkin, Sándor P. Fekete, Ferran Hurtado, Joseph S. B. Mitchell, Marc Noy, Vera Sacristan, Saurabh Sethia. wads 2001: 192-204 [doi]

Farthest neighbors and center points in the presence of rectangular obstaclesBoaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell. compgeom 2001: 164-171 [doi]

Simplifying a polygonal subdivision while keeping it simpleRegina Estkowski, Joseph S. B. Mitchell. compgeom 2001: 40-49 [doi]

ForewordFerran Hurtado, Joseph S. B. Mitchell, Marc Noy. DAM, 109(1-2):1, 2001.

PVD: A Stable Implementation for Computing Voronoi Diagrams of Polygonal PocketsSaurabh Sethia, Martin Held, Joseph S. B. Mitchell. alenex 2001: 105-116 [doi]

PreviousNext