Mitchell Jones, Ph.D.

Software engineer & computational geometer

Education
Ph.D. in Computer Science,
University of Illinois Urbana-Champaign, USA (2021)

Bachelor of Computer Science and Technology
(Advanced) (Honors Class I and University Medal),
University of Sydney, Australia (2015)
Research interests
Computational geometry, randomized & approximation algorithms, optimization
Other info
RésuméLinkedInGoogle ScholarGitHub

Publications

See also my arXiv page and DBLPs listing.

Conferences

  1. MJ, M. Haas-Heger, and J. van den Berg. Lane-Level Route Planning for Autonomous Vehicles. Workshop on the Algorithmic Foundations of Robotics (WAFR 2022).
  2. S. Har-Peled and MJ. Stabbing convex bodies with lines and flats. Symposium on Computational Geometry (SoCG 2021).
  3. S. Har-Peled and MJ. Some geometric applications of anti-chains. Canadian Conference on Computational Geometry (CCCG 2020), 1–6, 2020. [CCCG video] [CCCG slides]
  4. S. Har-Peled, MJ, and R. Saladi. Active learning a convex body in low dimensions. International Colloquium on Automata, Languages and Programming (ICALP 2020), 64:1–64:17, 2020. [ICALP video] [ICALP slides] [SoCG YRF slides] [UIUC slides]
  5. S. Har-Peled and MJ. Fast algorithms for geometric consensuses. Symposium on Computational Geometry (SoCG 2020), 50:1–50:16, 2020. [SoCG video] [SoCG slides]
  6. S. Har-Peled and MJ. Journey to the center of the point set. Symposium on Computational Geometry (SoCG 2019), 41:1–41:14, 2019. [SoCG slides]
  7. T. M. Chan, S. Har-Peled, and MJ. On locality-sensitive orderings and their applications. Innovations in Theoretical Computer Science Conference (ITCS 2019), 21:1–21:17, 2019. [ITCS slides] [USYD slides] [UIUC slides]
  8. S. Har-Peled and MJ. On separating points by lines. Symposium on Discrete Algorithms (SODA 2018), 918–932, 2018. [SODA slides]
  9. MJ, J. Mestre, and B. Scholz. Towards memory-optimal schedules for SDF. Parallel Processing Workshops (Auto-DaSP 2017), 94–105, 2017.
  10. S. Gaspers, J. Gudmundsson, MJ, J. Mestre, and S. Rummele. Turbocharging treewidth heuristics. International Symposium on Parameterized and Exact Computation (IPEC 2016), 13:1–13:13, 2016. [UIUC slides]

Journals

  1. S. Har-Peled and MJ. A Note on Stabbing Convex Bodies with Points, Lines, and Flats. Discrete & Computational Geometry, 2023.
  2. S. Har-Peled and MJ. Few Cuts Meet Many Point Sets. Algorithmica, 85, 965–975, 2023.
  3. T. M. Chan, S. Har-Peled, and MJ. Optimal Algorithms for Geometric Centers and Depth. SIAM Journal on Computing, 51(3): 627–663, 2022.
  4. S. Har-Peled, MJ, and R. Saladi. Active-learning a convex body in low dimensions. Algorithmica, 83, 1885–1917, 2021.
  5. S. Har-Peled, and MJ. Journey to the center of the point set. ACM Transactions on Algorithms, 17(1): 1–20, 2020.
  6. T. M. Chan, S. Har-Peled, and MJ. On locality-sensitive orderings and their applications. SIAM Journal on Computing, 49(3): 583–600, 2020.
  7. S. Har-Peled and MJ. On separating points by lines. Discrete & Computational Geometry, 63(3): 705–730, 2020.
  8. S. Gaspers, J. Gudmundsson, MJ, J. Mestre, and S. Rummele. Turbocharging treewidth heuristics. Algorithmica, 81(2): 439–475, 2019.
  9. D. M. Budden and MJ. Cautionary tales of inapproximability. Journal of Computational Biology, 24(3): 213–216, 2017.
  10. S. Canzar, K. M. Elbassioni, MJ, and J. Mestre. Resolving conflicting predictions from multimapping reads. Journal of Computational Biology, 23(3): 203–217, 2016. [Preprint]

Current submissions & other manuscripts

  1. MJ, M. Haas-Heger, and J. van den Berg. Lane-Level Route Planning for Autonomous Vehicles. Submitted.
  2. MJ. On the Search for Geometric Orders, Centers, and Separation. Ph.D. thesis, University of Illinois at Urbana-Champaign, 2021.
  3. MJ. Cutting cycles of rods in space is FPT. 2020.
  4. MJ. The Maximum Facility Location Problem. Undergraduate honors thesis, University of Sydney. 2015.

Teaching

University of Illinois at Urbana-Champaign

Course Role Semester Instructor(s)
Algorithms (CS473) TA Fall, 2019 Chandra Chekuri & Michael Forbes
Intro to Algorithms & Models of Computation (CS374) Head TA Spring, 2019 Sariel Har-Peled, Timothy Chan & Haitham Hassanieh
Algorithms (CS473) TA Fall, 2017 Timothy Chan

University of Sydney

Course Role Semester Instructor(s)
Formal Languages & Logic (COMP2022) TA Semester 1, 2016 Kalina Yacef
Algorithms & Complexity (COMP2007/2907) Head TA Semester 2, 2015 Julian Mestre
Formal Languages & Logic (COMP2022) TA Semester 1, 2015 Kalina Yacef
Algorithms & Complexity (COMP2007/2907) TA Semester 2, 2014 Julian Mestre
Formal Languages & Logic (COMP2022) TA Semester 1, 2014 Kalina Yacef
Database Systems I (INFO2120) TA Semester 1, 2014 Bryn Jeffries
Data Structures (INFO1105) TA Semester 2, 2013 Kalina Yacef

Miscellaneous

  1. R. Andrews, MJ, P. Lin, and the UIUC Theory CS group. Need more RAM? Just invent time travel!. Special Interest Group on Harry Q. Bovik! (SIGBOVIK 2019), 188-192, 2019.