Jack Spalding-Jamieson

Orcid: 0000-0002-1209-4345

According to our database1, Jack Spalding-Jamieson authored at least 20 papers between 2020 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
A Fast Approximation Algorithm for the Minimum Balanced Vertex Separator in a Graph.
CoRR, March, 2026

The Presort Hierarchy for Geometric Problems.
CoRR, February, 2026

Engineering Greedy Heuristics and Simulated Annealing Methods for the Median Triangulation Under the Parallel Flip Distance (CG Challenge).
Proceedings of the 42nd International Symposium on Computational Geometry, 2026

2025
Subquadratic Approximation Algorithms for Separating Two Points with Objects in the Plane.
CoRR, July, 2025

Reweighted Spectral Partitioning Works: Bounds for Special Graph Classes.
CoRR, June, 2025

Slant/Gokigen Naname is NP-complete, and Some Variations are in P.
CoRR, February, 2025

Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search.
CoRR, February, 2025

Separating Two Points with Obstacles in the Plane: Improved Upper and Lower Bounds.
Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

Polynomial-Time Algorithms for Contiguous Art Gallery and Related Problems.
Proceedings of the 41st International Symposium on Computational Geometry, 2025

2024
The Analytic Arc Cover Problem and its Applications to Contiguous Art Gallery, Polygon Separation, and Shape Carving.
CoRR, 2024

Morphing Planar Graph Drawings via Orthogonal Box Drawings.
Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

Carving Polytopes with Saws in 3D.
Proceedings of the 36th Canadian Conference on Computational Geometry, 2024

Slant/Gokigen Naname is NP-complete.
Proceedings of the 36th Canadian Conference on Computational Geometry, 2024

2023
Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring.
ACM J. Exp. Algorithmics, December, 2023

2022
Coordinated Motion Planning Through Randomized <i>k</i>-Opt.
ACM J. Exp. Algorithmics, 2022

Conflict-Based Local Search for Minimum Partition into Plane Subgraphs (CG Challenge).
Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021
Coordinated Motion Planning Through Randomized k-Opt.
CoRR, 2021

Coordinated Motion Planning Through Randomized k-Opt (CG Challenge).
Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020
Angle Covers: Algorithms and Complexity.
Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized Local Search and Constraint Programming (CG Challenge).
Proceedings of the 36th International Symposium on Computational Geometry, 2020


  Loading...