Joseph S. B. Mitchell
Orcid: 0000-0002-0152-2279Affiliations:
- Stony Brook University, NY, USA
According to our database1,
Joseph S. B. Mitchell
authored at least 264 papers
between 1984 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on viaf.org
-
on orcid.org
-
on id.loc.gov
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
2023
Comput. Geom., June, 2023
Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023
Constant-Factor Approximation Algorithms for Convex Cover and Hidden Set in a Simple Polygon.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023
Proceedings of the Algorithms and Complexity - 13th International Conference, 2023
Proceedings of the Algorithms and Discrete Applied Mathematics, 2023
2022
ACM J. Exp. Algorithmics, 2022
ACM J. Exp. Algorithmics, 2022
2021
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021
Shortcut Hulls: Vertex-restricted Outer Simplications of Polygons.
Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021
2020
Computing Convex Partitions for Point Sets in the Plane: The CG: SHOP Challenge 2020.
CoRR, 2020
Proceedings of the 18th International Symposium on Experimental Algorithms, 2020
Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020
Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020
Data inference from encrypted databases: a multi-dimensional order-preserving matching approach.
Proceedings of the Mobihoc '20: The Twenty-first ACM International Symposium on Theory, 2020
Proceedings of the 28th Annual European Symposium on Algorithms, 2020
2019
Discret. Appl. Math., 2019
An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains.
Algorithmica, 2019
Data Races and the Discrete Resource-time Tradeoff Problem with Resource Reuse over Paths.
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019
Proceedings of the 2019 International Conference on Embedded Wireless Systems and Networks, 2019
Proceedings of the Combinatorial Optimization and Applications, 2019
Proceedings of the Approximation, 2019
2018
Are Friends of My Friends Too Social?: Limitations of Location Privacy in a Socially-Connected World.
Proceedings of the Nineteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2018
Proceedings of the LATIN 2018: Theoretical Informatics, 2018
2017
Pervasive Mob. Comput., 2017
Discret. Comput. Geom., 2017
Comput. Geom., 2017
Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2017
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017
Proceedings of the 33rd International Symposium on Computational Geometry, 2017
2016
Encyclopedia of Algorithms, 2016
Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016
Proceedings of the Algorithmic Foundations of Robotics XII, 2016
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016
Combinatorics, algorithms and systems for sensor deployment with line-of-sight constraints: poster.
Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2016
2015
Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in d-dimensions.
Comput. Geom., 2015
Proceedings of the Algorithms in Bioinformatics - 15th International Workshop, 2015
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015
Optimal placement of protective jammers for securing wireless transmissions in a geographic domain.
Proceedings of the 14th International Conference on Information Processing in Sensor Networks, 2015
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015
Proceedings of the Algorithms for Sensor Systems, 2015
2014
Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing.
Theory Comput. Syst., 2014
Data transmission and base-station placement for optimizing the lifetime of wireless sensor networks.
Ad Hoc Networks, 2014
Proceedings of the 2014 IEEE Conference on Computer Communications, 2014
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014
2013
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013
2012
The art gallery theorem for simple polygons in terms of the number of reflex and convex vertices.
Inf. Process. Lett., 2012
Int. J. Comput. Geom. Appl., 2012
Proceedings of the Algorithm Theory - SWAT 2012, 2012
Proceedings of the SIGSPATIAL 2012 International Conference on Advances in Geographic Information Systems (formerly known as GIS), 2012
Proceedings of the Fun with Algorithms - 6th International Conference, 2012
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012
2011
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011
Distributed localization and clustering using data correlation and the Occam's razor principle.
Proceedings of the Distributed Computing in Sensor Systems, 2011
Proceedings of the 27th ACM Symposium on Computational Geometry, 2011
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011
2010
Int. J. Comput. Geom. Appl., 2010
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2010
A constant-factor approximation algorithm for TSP with pairwise-disjoint connected neighborhoods in the plane.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010
2009
SIAM J. Comput., 2009
Geometric algorithms for optimal airspace design and air traffic controller workload balancing.
ACM J. Exp. Algorithmics, 2009
Comput. Geom., 2009
Proceedings of the Computational Geometry, 08.03. - 13.03.2009, 2009
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009
Proceedings of the ATMOS 2009, 2009
Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments, 2009
2008
Inf. Process. Lett., 2008
Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008
Iso-Contour Queries and Gradient Descent with Guaranteed Delivery in Sensor Networks.
Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008
Proceedings of the Selected Papers of the Sixth International Conference on Computational Sciences and Its Applications, 2008
Proceedings of the Algorithms, 2008
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008
The Embroidery Problem.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008
2007
SIAM J. Comput., 2007
Electron. Notes Discret. Math., 2007
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007
Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007
2006
Int. J. Comput. Geom. Appl., 2006
Proceedings of the Algorithmic Foundation of Robotics VII, 2006
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006
Proceedings of the 7th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2006
Proceedings of the 12th Annual International Conference on Mobile Computing and Networking, 2006
Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006
2005
Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005
Proceedings of the 2nd International Conference on Broadband Networks (BROADNETS 2005), 2005
2004
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004
Theoretical and experimental analysis of heuristics for the "freeze-tag" robot awakening problem.
IEEE Trans. Robotics, 2004
Discret. Comput. Geom., 2004
Comput. Geom., 2004
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004
2003
ACM J. Exp. Algorithmics, 2003
J. Algorithms, 2003
Comput. Geom., 2003
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003
Comuting Core-Sets and Approximate Smallest Enclosing HyperSpheres in High Dimensions.
Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, 2003
2002
New Similarity Measures between Polylines with Applications to Morphing and Polygon Sweeping.
Discret. Comput. Geom., 2002
Proceedings of the Algorithmic Foundations of Robotics V, 2002
Proceedings of the Algorithm Theory, 2002
Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains.
Proceedings of the Algorithm Theory, 2002
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002
Proceedings of the 18th Annual Symposium on Computational Geometry, 2002
Processor Allocation on Cplant: Achieving General Processor Locality Using One-Dimensional Allocation Strategies.
Proceedings of the 2002 IEEE International Conference on Cluster Computing (CLUSTER 2002), 2002
2001
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001
Proceedings of the Algorithm Engineering and Experimentation, Third International Workshop, 2001
2000
Discret. Comput. Geom., 2000
Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami.
Comput. Geom., 2000
ZSWEEP: an efficient and exact projection algorithm for unstructured volume rendering.
Proceedings of the Proceeding of the 2000 Volume Visualization and Graphics Symposium, 2000
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000
Proceedings of the 13th Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI 2000), 2000
Some Separability Problems in the Plane.
EuroCG, 2000
Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000
Proceedings of the Handbook of Computational Geometry, 2000
1999
Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems.
SIAM J. Comput., 1999
IEEE Trans. Pattern Anal. Mach. Intell., 1999
Comput. Graph. Forum, 1999
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999
1998
IEEE Trans. Vis. Comput. Graph., 1998
A Constant-Factor Approximation Algorithm for the Geometric k-MST Problem in the Plane.
SIAM J. Comput., 1998
A maximum b-matching problem arising from median location models with applications to the roommates problem.
Math. Program., 1998
An Exact Interactive Time Visibility Ordering Algorithm for Polyhedral Cell Complexes.
Proceedings of the Proceeding of the 1998 IEEE Symposium on Volume Visualization, 1998
Proceedings of the ACM-GIS '98, 1998
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998
1997
IEEE Trans. Vis. Comput. Graph., 1997
An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane.
Discret. Comput. Geom., 1997
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997
A New Algorithm for Computing Shortest Paths in Weighted Planar Subdivisions (Extended Abstract).
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997
1996
Comput. Graph. Forum, 1996
On Some Applications of Computational Geometry in Manufacturing and Virtual Environments.
Proceedings of the Applied Computational Geormetry, 1996
Proceedings of the Proceeding of the 1996 Symposium on Volume Visualization, 1996
Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple New Method for the Geometric k-MST Problem.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996
Proceedings of the ACM SIGGRAPH 96 Visual Proceedings: The art and interdisciplinary programs of SIGGRAPH 1996, 1996
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996
1995
Int. J. Comput. Geom. Appl., 1995
Discret. Comput. Geom., 1995
Proceedings of the 6th IEEE Visualization Conference, 1995
Approximation Algorithms for Geometric Tour and Network Design Problems (Extended Abstract).
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995
1994
Practical Methods for Approximate Geometric Pattern Matching Under Rigid Motions (Preliminary Version).
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994
Generating Random x-Monotone Polygons with Given Vertices.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994
1993
Int. J. Comput. Geom. Appl., 1993
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993
Shortest Paths for a Two-robot Rendez-vous.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993
The Lawnmower Problem.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993
1992
Matching Points into Pairwise-Disjoint Noise Regions: Combinatorial Bounds and Algorithms.
INFORMS J. Comput., 1992
Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992
1991
IEEE Trans. Pattern Anal. Mach. Intell., 1991
The Weighted Region Problem: Finding Shortest Paths Through a Weighted Planar Subdivision.
J. ACM, 1991
Ann. Math. Artif. Intell., 1991
Proceedings of the 17th International Workshop, 1991
Proceedings of the Algorithms and Data Structures, 1991
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991
1990
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990
Structured Visibility Profiles with Applications to Problems in Simple Polygons (Extended Abstract).
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990
1989
Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989
1988
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988
1987
98%-Effective Lot-Sizing for One-Warehouse, Multi-Retailer Inventory Systems with Backlogging.
Oper. Res., 1987
Proceedings of the Third Annual Symposium on Computational Geometry, 1987
1984
Proceedings of the 1984 IEEE International Conference on Robotics and Automation, 1984