Joseph S. B. Mitchell

ORCID

Publication Activity (10 Years)

Years Active: 1984-2024
Publications (10 Years): 82

Top Venues

Publications

Sándor P. Fekete, Joseph S. B. Mitchell, Christian Rieck, Christian Scheffer, Christiane Schmidt
Dispersive Vertex Guarding for Simple and Non-Simple Polygons. CoRR (2024)
Joseph S. B. Mitchell, Linh Nguyen
Multirobot Watchman Routes in a Simple Polygon. CoRR (2024)
Rathish Das, Omrit Filtser, Matthew J. Katz, Joseph S. B. Mitchell
Robustly Guarding Polygons. SoCG (2024)
Kien C. Huynh, Joseph S. B. Mitchell, Linh Nguyen, Valentin Polishchuk
Optimizing Visibility-Based Search in Polygonal Domains. SWAT (2024)
Kien C. Huynh, Joseph S. B. Mitchell, Linh Nguyen, Valentin Polishchuk
Optimizing Visibility-based Search in Polygonal Domains. CoRR (2024)
Rathish Das, Omrit Filtser, Matthew J. Katz, Joseph S. B. Mitchell
Robustly Guarding Polygons. CoRR (2024)
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)
Vishwanath R. Singireddy, Manjanna Basappa, Joseph S. B. Mitchell
Algorithms for k-Dispersion for Points in Convex Position in the Plane. CALDAM (2023)
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)
A. Karim Abu-Affash, Paz Carmi, Ori Luwisch, Joseph S. B. Mitchell
Geometric Spanning Trees Minimizing the Wiener Index. WADS (2023)
A. Karim Abu-Affash, Paz Carmi, Ori Luwisch, Joseph S. B. Mitchell
Geometric Spanning Trees Minimizing the Wiener Index. CoRR (2023)
Omrit Filtser, Mayank Goswami, Joseph S. B. Mitchell, Valentin Polishchuk
On Flipping the Fréchet Distance. ITCS (2023)
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 (2023)
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)
Annika Bonerath, Jan-Henrik Haunert, Joseph S. B. Mitchell, Benjamin Niedermann
Shortcut hulls: Vertex-restricted outer simplifications of polygons. Comput. Geom. 112 (2023)
Omrit Filtser, Mayank Goswami, Joseph S. B. Mitchell, Valentin Polishchuk
How to Stay Socially Distant: A Geometric Approach. CoRR (2022)
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 (2022)
Joseph S. B. Mitchell
Approximating Maximum Independent Set for Rectangles in the Plane. FOCS (2022)
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 (2022)
Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy
The balanced connected subgraph problem. Discret. Appl. Math. 319 (2022)
Annika Bonerath, Jan-Henrik Haunert, Joseph S. B. Mitchell, Benjamin Niedermann
Shortcut Hulls: Vertex-restricted Outer Simplications of Polygons. CCCG (2021)
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 (2021)
Joseph S. B. Mitchell
Approximating Maximum Independent Set for Rectangles in the Plane. FOCS (2021)
Joseph S. B. Mitchell, Supantha Pandit
Minimum Membership Covering and Hitting. Theor. Comput. Sci. 876 (2021)
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Joseph S. B. Mitchell
Planar bichromatic bottleneck spanning trees. J. Comput. Geom. 12 (1) (2021)
Annika Bonerath, Jan-Henrik Haunert, Joseph S. B. Mitchell, Benjamin Niedermann
Shortcut Hulls: Vertex-restricted Outer Simplifications of Polygons. CoRR (2021)
Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Joseph S. B. Mitchell
Area-Optimal Simple Polygonalizations: The CG Challenge 2019. CoRR (2021)
Joseph S. B. Mitchell
Approximating Maximum Independent Set for Rectangles in the Plane. CoRR (2021)
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Joseph S. B. Mitchell
Planar Bichromatic Bottleneck Spanning Trees. ESA (2020)
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 (2020)
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)
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)
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 (2020)
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 (2020)
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)
Joseph S. B. Mitchell, Supantha Pandit
Packing and Covering with Segments. WALCOM (2020)
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Joseph S. B. Mitchell
Planar Bichromatic Bottleneck Spanning Trees. CoRR (2020)
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)
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) (2020)
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 (2020)
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 (2020)
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 (2019)
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)
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)
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 (2019)
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) (2019)
Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy
The Balanced Connected Subgraph Problem. CALDAM (2019)
Joseph S. B. Mitchell, Supantha Pandit
New Results on a Family of Geometric Hitting Set Problems in the Plane. COCOA (2019)
Joseph S. B. Mitchell, Supantha Pandit
Minimum Membership Covering and Hitting. WALCOM (2019)
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)
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 (2019)
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) (2018)
Sándor P. Fekete, Qian Li, Joseph S. B. Mitchell, Christian Scheffer
Universal Guard Problems. Int. J. Comput. Geom. Appl. 28 (2) (2018)
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 (2018)
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)
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)
Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy
The Balanced Connected Subgraph Problem. CoRR (2018)
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 (2018)
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 (2017)
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) (2017)
Adrian Dumitrescu, Joseph S. B. Mitchell
Approximation algorithms for TSP with neighborhoods in the plane. CoRR (2017)
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 (2017)
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 (2017)
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 (2017)
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)
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 (2017)
Joseph S. B. Mitchell
A PTAS for TSP with Neighborhoods Among Fat Regions in the Plane. CoRR (2017)
Gui Citovsky, Tyler Mayer, Joseph S. B. Mitchell
TSP With Locational Uncertainty: The Adversarial Model. CoRR (2017)
Gui Citovsky, Tyler Mayer, Joseph S. B. Mitchell
TSP With Locational Uncertainty: The Adversarial Model. SoCG (2017)
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)
Sang Won Bae, Matias Korman, Joseph S. B. Mitchell, Yoshio Okamoto, Valentin Polishchuk, Haitao Wang
Geodesic Diameter and Center of a Polygonal Domain. Discret. Comput. Geom. 57 (3) (2017)
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)
Jie Gao, Su Jia, Joseph S. B. Mitchell, Lu Zhao
Approximation Algorithms for Time-Window TSP and Prize Collecting TSP Problems. WAFR (2016)
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) (2016)
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)
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)
Sándor P. Fekete, Kan Huang, Joseph S. B. Mitchell, Ojas Parekh, Cynthia A. Phillips
Geometric Hitting Set for Segments of Few Orientations. CoRR (2016)
Sándor P. Fekete, Qian Li, Joseph S. B. Mitchell, Christian Scheffer
Universal Guard Problems. ISAAC (2016)
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 (2016)
Sándor P. Fekete, Qian Li, Joseph S. B. Mitchell, Christian Scheffer
Universal Guard Problems. CoRR (2016)
Esther M. Arkin, Jie Gao, Adam Hesterberg, Joseph S. B. Mitchell, Jiemin Zeng
The Shortest Separating Cycle Problem. WAOA (2016)
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) (2016)
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)
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)
Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, Marina Simakov
Conflict-free Covering. CCCG (2015)
Gui Citovsky, Jie Gao, Joseph S. B. Mitchell, Jiemin Zeng
Exact and Approximation Algorithms for Data Mule Scheduling in a Sensor Network. ALGOSENSORS (2015)
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)
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) (2015)
J. Mark Keil, Joseph S. B. Mitchell, Dinabandhu Pradhan, Martin Vatshelle
An Algorithm for the Maximum Weight Independent Set Problem onOutersting Graphs. CCCG (2015)
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) (2015)
Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, Marina Simakov
Choice Is Hard. ISAAC (2015)
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 (2015)
Alon Efrat, Sándor P. Fekete, Joseph S. B. Mitchell, Valentin Polishchuk, Jukka Suomela
Improved Approximation Algorithms for Relay Placement. CoRR (2015)
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)
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)
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)
Sang Won Bae, Matias Korman, Joseph S. B. Mitchell, Yoshio Okamoto, Valentin Polishchuk, Haitao Wang
Geodesic Diameter and Center of a Polygonal Domain. CoRR (2015)
Joseph S. B. Mitchell, Valentin Polishchuk, Mikko Sysikaski, Haitao Wang
An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains. CoRR (2015)
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)
Adrian Dumitrescu, Joseph S. B. Mitchell, Pawel Zylinski
Watchman routes for lines and line segments. Comput. Geom. 47 (4) (2014)

Joseph S. B. Mitchell.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Joseph S. B. Mitchell