William Sims
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
William Sims has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Derek Kitson
Department of Mathematics and Computer Studies Mary Immaculate College Thurles Ireland
1 shared publication - Eleftherios Kastis
School of Mathematical Sciences Lancaster University Lancaster UK
1 shared publication Meera Sitharam
1 shared publication- Sean Dewar
Department of Computer Science KU Leuven Leuven Belgium
1 shared publication
Latest Publications
- Open Access
- 18 April 2026
- Published by Wiley in Journal of Graph Theory
- Vol. 112 (4) , 491-506
Edge‐Length Preserving Embeddings of Graphs Between Normed Spaces
The concept of graph embeddability, initially formalized by Belk and Connelly and later expanded by Sitharam and Willoughby, extends the question of embedding finite metric spaces into a given normed space. A finite simple graph is said to be ‐embeddable if any set of induced edge lengths from an embedding of into a normed space can also be realised by an embedding of into a normed space . This property, being minor‐closed, can be characterized by a finite list of forbidden minors. Following the establishment of fundamental results about ‐embeddability, we identify sufficient conditions under which it implies independence with respect to the associated rigidity matroids for and . We show that the spaces and serve as two natural extreme spaces of embeddability and discuss ‐embeddability for varying . We provide a complete characterization of ‐embeddable graphs for the specific case when is 2‐dimensional and is infinite‐dimensional.
- 18 April 2026
- Published by Wiley in Journal of Graph Theory
- Vol. 112 (4) , 491-506
Open AccessEdge‐Length Preserving Embeddings of Graphs Between Normed Spaces
The concept of graph embeddability, initially formalized by Belk and Connelly and later expanded by Sitharam and Willoughby, extends the question of embedding finite metric spaces into a given normed space. A finite simple graph is said to be ‐embeddable if any set of induced edge lengths from an embedding of into a normed space can also be realised by an embedding of into a normed space . This property, being minor‐closed, can be characterized by a finite list of forbidden minors. Following the establishment of fundamental results about ‐embeddability, we identify sufficient conditions under which it implies independence with respect to the associated rigidity matroids for and . We show that the spaces and serve as two natural extreme spaces of embeddability and discuss ‐embeddability for varying . We provide a complete characterization of ‐embeddable graphs for the specific case when is 2‐dimensional and is infinite‐dimensional.
- 26 August 2023
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 341, 140-163
Flip paths between lattice triangulations
- 26 August 2023
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 341, 140-163
Flip paths between lattice triangulations