default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJack Spalding-Jamieson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[c10]Jacobus Conradi, Benedikt Kolbe, Philip Mayer, Jonas Sauer, Jack Spalding-Jamieson:
Engineering Greedy Heuristics and Simulated Annealing Methods for the Median Triangulation Under the Parallel Flip Distance (CG Challenge). SoCG 2026: 106:1-106:7- [i13]Ivor van der Hoog, Eva Rotenberg, Jack Spalding-Jamieson, Lasse Wulf:
The Presort Hierarchy for Geometric Problems. CoRR abs/2602.08843 (2026) - [i12]Vladimir Kolmogorov, Jack Spalding-Jamieson:
A Fast Approximation Algorithm for the Minimum Balanced Vertex Separator in a Graph. CoRR abs/2603.15782 (2026) - 2025
- [c9]Ahmad Biniaz, Anil Maheshwari, Magnus Christian Ring Merrild, Joseph S. B. Mitchell, Saeed Odak, Valentin Polishchuk, Eliot W. Robson, Casper Moldrup Rysgaard
, Jens Kristian Refsgaard Schou, Thomas C. Shermer, Jack Spalding-Jamieson, Rolf Svenning, Da Wei Zheng:
Polynomial-Time Algorithms for Contiguous Art Gallery and Related Problems. SoCG 2025: 20:1-20:21 - [c8]Jack Spalding-Jamieson, Anurag Murty Naredla:
Separating Two Points with Obstacles in the Plane: Improved Upper and Lower Bounds. ESA 2025: 90:1-90:18 - [i11]Jack Spalding-Jamieson, Eliot Wong Robson, Da Wei Zheng:
Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search. CoRR abs/2502.06163 (2025) - [i10]Jayson Lynch, Jack Spalding-Jamieson:
Slant/Gokigen Naname is NP-complete, and Some Variations are in P. CoRR abs/2502.13536 (2025) - [i9]Jack Spalding-Jamieson, Anurag Murty Naredla:
Separating Two Points with Obstacles in the Plane: Improved Upper and Lower Bounds. CoRR abs/2504.17289 (2025) - [i8]Jack Spalding-Jamieson:
Reweighted Spectral Partitioning Works: Bounds for Special Graph Classes. CoRR abs/2506.01228 (2025) - [i7]Jayson Lynch, Jack Spalding-Jamieson:
Subquadratic Approximation Algorithms for Separating Two Points with Objects in the Plane. CoRR abs/2507.22293 (2025) - 2024
- [c7]Eliot W. Robson, Jack Spalding-Jamieson, Da Wei Zheng:
Carving Polytopes with Saws in 3D. CCCG 2024: 145-151 - [c6]Jayson Lynch, Jack Spalding-Jamieson:
Slant/Gokigen Naname is NP-complete. CCCG 2024: 325-332 - [c5]Therese Biedl, Anna Lubiw, Jack Spalding-Jamieson:
Morphing Planar Graph Drawings via Orthogonal Box Drawings. GD 2024: 40:1-40:16 - [i6]Eliot W. Robson, Jack Spalding-Jamieson, Da Wei Zheng:
Carving Polytopes with Saws in 3D. CoRR abs/2407.15981 (2024) - [i5]Therese Biedl, Anna Lubiw, Jack Spalding-Jamieson:
Morphing Planar Graph Drawings via Orthogonal Box Drawings. CoRR abs/2409.04074 (2024) - [i4]Eliot W. Robson, Jack Spalding-Jamieson, Da Wei Zheng:
The Analytic Arc Cover Problem and its Applications to Contiguous Art Gallery, Polygon Separation, and Shape Carving. CoRR abs/2412.15567 (2024) - 2023
- [j3]Loïc Crombez, Guilherme Dias da Fonseca, Florian Fontan, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso, Benjamin Momège, Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng:
Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring. ACM J. Exp. Algorithmics 28: 1.2:1-1.2:13 (2023) - [i3]Loïc Crombez, Guilherme Dias da Fonseca, Florian Fontan, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso, Benjamin Momège, Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng:
Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring. CoRR abs/2303.09632 (2023) - 2022
- [j2]Paul Liu, Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng:
Coordinated Motion Planning Through Randomized k-Opt. ACM J. Exp. Algorithmics 27: 3.4:1-3.4:9 (2022) - [c4]Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng:
Conflict-Based Local Search for Minimum Partition into Plane Subgraphs (CG Challenge). SoCG 2022: 72:1-72:6 - 2021
- [j1]William S. Evans, Ellen Gethner, Jack Spalding-Jamieson, Alexander Wolff:
Angle Covers: Algorithms and Complexity. J. Graph Algorithms Appl. 25(2): 643-661 (2021) - [c3]Paul Liu, Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng:
Coordinated Motion Planning Through Randomized k-Opt (CG Challenge). SoCG 2021: 64:1-64:8 - [i2]Paul Liu, Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng:
Coordinated Motion Planning Through Randomized k-Opt. CoRR abs/2103.15062 (2021) - 2020
- [c2]Da Wei Zheng, Jack Spalding-Jamieson, Brandon Zhang:
Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized Local Search and Constraint Programming (CG Challenge). SoCG 2020: 83:1-83:7 - [c1]William S. Evans, Ellen Gethner, Jack Spalding-Jamieson, Alexander Wolff:
Angle Covers: Algorithms and Complexity. WALCOM 2020: 94-106
2010 – 2019
- 2019
- [i1]William S. Evans, Ellen Gethner, Jack Spalding-Jamieson, Alexander Wolff:
Angle Covers: Algorithms and Complexity. CoRR abs/1911.02040 (2019)
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 2026-05-30 00:59 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
