default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMitchell Jones
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Mitchell Jones
, Maximilian Haas-Heger, Jur van den Berg:
Lane-level route planning for autonomous vehicles. Int. J. Robotics Res. 43(9): 1425-1440 (2024)- 2023
- [j10]Sariel Har-Peled, Mitchell Jones:
Few Cuts Meet Many Point Sets. Algorithmica 85(4): 965-975 (2023) - [j9]Sariel Har-Peled, Mitchell Jones:
A Note on Stabbing Convex Bodies with Points, Lines, and Flats. Discret. Comput. Geom. 69(4): 1241-1254 (2023) - 2022
- [j8]Timothy M. Chan, Sariel Har-Peled, Mitchell Jones:
Optimal Algorithms for Geometric Centers and Depth. SIAM J. Comput. 51(3): 627-663 (2022) - [c10]Mitchell Jones, Maximilian Haas-Heger, Jur van den Berg:
Lane-Level Route Planning for Autonomous Vehicles. WAFR 2022: 312-327 - [i11]Mitchell Jones, Maximilian Haas-Heger, Jur van den Berg:
Lane-Level Route Planning for Autonomous Vehicles. CoRR abs/2206.02883 (2022) - 2021
- [b1]Mitchell Jones:
On the search for geometric orders, centers, and separation. University of Illinois Urbana-Champaign, USA, 2021 - [j7]Sariel Har-Peled, Mitchell Jones, Saladi Rahul:
Active-Learning a Convex Body in Low Dimensions. Algorithmica 83(6): 1885-1917 (2021) - [j6]Sariel Har-Peled, Mitchell Jones:
Journey to the Center of the Point Set. ACM Trans. Algorithms 17(1): 9:1-9:21 (2021) - [c9]Sariel Har-Peled, Mitchell Jones:
Stabbing Convex Bodies with Lines and Flats. SoCG 2021: 42:1-42:12 - 2020
- [j5]Sariel Har-Peled, Mitchell Jones:
On Separating Points by Lines. Discret. Comput. Geom. 63(3): 705-730 (2020) - [j4]Timothy M. Chan, Sariel Har-Peled, Mitchell Jones:
On Locality-Sensitive Orderings and Their Applications. SIAM J. Comput. 49(3): 583-600 (2020) - [c8]Sariel Har-Peled, Mitchell Jones:
Some Geometric Applications of Anti-Chains. CCCG 2020: 326-331 - [c7]Sariel Har-Peled, Mitchell Jones:
Fast Algorithms for Geometric Consensuses. SoCG 2020: 50:1-50:16 - [c6]Sariel Har-Peled, Mitchell Jones, Saladi Rahul:
Active Learning a Convex Body in Low Dimensions. ICALP 2020: 64:1-64:17 - [i10]Mitchell Jones:
Cutting cycles of rods in space is FPT. CoRR abs/2004.03693 (2020) - [i9]Sariel Har-Peled, Mitchell Jones:
Stabbing Convex Bodies with Lines and Flats. CoRR abs/2007.09874 (2020)
2010 – 2019
- 2019
- [j3]Serge Gaspers, Joachim Gudmundsson, Mitchell Jones, Julián Mestre, Stefan Rümmele:
Turbocharging Treewidth Heuristics. Algorithmica 81(2): 439-475 (2019) - [c5]Sariel Har-Peled, Mitchell Jones:
Journey to the Center of the Point Set. SoCG 2019: 41:1-41:14 - [c4]Timothy M. Chan, Sariel Har-Peled, Mitchell Jones:
On Locality-Sensitive Orderings and Their Applications. ITCS 2019: 21:1-21:17 - [i8]Sariel Har-Peled, Mitchell Jones, Saladi Rahul:
Active Learning a Convex Body in Low Dimensions. CoRR abs/1903.03693 (2019) - [i7]Sariel Har-Peled, Mitchell Jones:
Some Geometric Applications of Anti-Chains. CoRR abs/1910.07586 (2019) - [i6]Sariel Har-Peled, Mitchell Jones:
Fast Algorithms for Geometric Consensuses. CoRR abs/1912.01639 (2019) - [i5]Sariel Har-Peled, Mitchell Jones:
Proof of Dudley's Convex Approximation. CoRR abs/1912.01977 (2019) - 2018
- [c3]Sariel Har-Peled, Mitchell Jones:
On Separating Points by Lines. SODA 2018: 918-932 - [i4]Sariel Har-Peled, Mitchell Jones:
Few Cuts Meet Many Point Sets. CoRR abs/1808.03260 (2018) - [i3]Timothy M. Chan, Sariel Har-Peled, Mitchell Jones:
On Locality-Sensitive Orderings and their Applications. CoRR abs/1809.11147 (2018) - 2017
- [j2]David M. Budden, Mitchell Jones:
Cautionary Tales of Inapproximability. J. Comput. Biol. 24(3): 213-216 (2017) - [c2]Mitchell Jones, Julián Mestre, Bernhard Scholz:
Towards Memory-Optimal Schedules for SDF. Euro-Par Workshops 2017: 94-105 - [i2]Sariel Har-Peled, Mitchell Jones:
On Separating Points by Lines. CoRR abs/1706.02004 (2017) - [i1]Sariel Har-Peled, Mitchell Jones:
How to Net a Convex Shape. CoRR abs/1712.02949 (2017) - 2016
- [j1]Stefan Canzar, Khaled M. Elbassioni, Mitchell Jones, Julián Mestre:
Resolving Conflicting Predictions from Multimapping Reads. J. Comput. Biol. 23(3): 203-217 (2016) - [c1]Serge Gaspers, Joachim Gudmundsson, Mitchell Jones, Julián Mestre, Stefan Rümmele:
Turbocharging Treewidth Heuristics. IPEC 2016: 13:1-13:13
Coauthor Index
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 2025-01-21 00:10 CET 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:
