The Synchronization Problem in Protocol Testing and its Complexity. - Sylvia C. Boyd; Hasan Ural (Inf. Process. Lett., 1991)

Small Travelling Salesman Polytopes. - Sylvia C. Boyd; William H. Cunningham (Math. Oper. Res., 1991)

Optimizing over the subtour polytope of the travelling salesman problem. - Sylvia C. Boyd; William R. Pulleyblank (Math. Program., 1991)

On the Complexity of Generating Optimal Test Sequences. - Sylvia C. Boyd; Hasan Ural (IEEE Trans. Software Eng., 1991)

An Integer Polytope Related to the Design of Survivable Communication Networks. - Sylvia C. Boyd; Tianbao Hao (SIAM J. Discret. Math., 1993)

Ladders for Travelling Salesmen. - Sylvia C. Boyd; William H. Cunningham; Maurice Queyranne; Yaoguang Wang (SIAM J. Optim., 1995)

The Economic Addition of Functionality to a Network. - Sylvia C. Boyd; Karina Marcus (HPCN Europe, 1997)

A new bound for the ratio between the 2-matching problem and its linear programming relaxation. - Sylvia C. Boyd; Robert Carr (Math. Program., 1999)

Computing the integrality gap of the asymmetric travelling salesman problem. - Sylvia C. Boyd; Paul Elliott-Magwood (Electron. Notes Discret. Math., 2005)

On the domino-parity inequalities for the STSP. - Sylvia C. Boyd; Sally Cockburn; Danielle Vella (Math. Program., 2007)

Facet Generating Techniques. - Sylvia C. Boyd; William R. Pulleyblank (Bonn Workshop of Combinatorial Optimization, 2008)

Finding the Exact Integrality Gap for Small Traveling Salesman Problems. - Geneviève Benoit; Sylvia C. Boyd (Math. Oper. Res., 2008)

TSP on Cubic and Subcubic Graphs. - Sylvia C. Boyd; René Sitters; Suzanne van der Ster; Leen Stougie (IPCO, 2011)

Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices. - Sylvia C. Boyd; Robert Carr (Discret. Optim., 2011)

A Fast Method for Large-Scale Multichromosomal Breakpoint Median Problems. - Sylvia C. Boyd; Maryam Haghighi (J. Bioinform. Comput. Biol., 2012)

Mixed and Circular Multichromosomal Genomic Median Problem. - Sylvia C. Boyd; Maryam Haghighi (SIAM J. Discret. Math., 2013)

Finding 2-Factors Closer to TSP Tours in Cubic Graphs. - Sylvia C. Boyd; Satoru Iwata 001; Kenjiro Takazawa (SIAM J. Discret. Math., 2013)

A $ frac{5}{4}$ -Approximation for Subcubic 2EC Using Circulations. - Sylvia C. Boyd; Yao Fu; Yu Sun (IPCO, 2014)

The traveling salesman problem on cubic and subcubic graphs. - Sylvia C. Boyd; René Sitters; Suzanne van der Ster; Leen Stougie (Math. Program., 2014)

Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph Problem. - Sylvia C. Boyd; Philippe Legault (CoRR, 2015)

Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Subgraph Problem. - Sylvia C. Boyd; Philippe Legault (Electron. Notes Discret. Math., 2015)

A -approximation for subcubic 2EC using circulations and obliged edges. - Sylvia C. Boyd; Yao Fu; Yu Sun (Discret. Appl. Math., 2016)

The Saleman's Improved Tours for Fundamental Classes. - Sylvia C. Boyd; András Sebö (IPCO, 2017)

Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph. - Sylvia C. Boyd; Philippe Legault (SIAM J. Discret. Math., 2017)

A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case. - Sylvia C. Boyd; Joseph Cheriyan; Robert Cummings; Logan Grout; Sharat Ibrahimpur; Zoltán Szigeti; Lu Wang (APPROX-RANDOM, 2020)

A 2-Approximation Algorithm for Flexible Graph Connectivity. - Sylvia C. Boyd; Joseph Cheriyan; Arash Haddadan; Sharat Ibrahimpur (CoRR, 2021)

The salesman's improved tours for fundamental classes. - Sylvia C. Boyd; András Sebö (Math. Program., 2021)

A $ frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case. - Sylvia C. Boyd; Joseph Cheriyan; Robert Cummings; Logan Grout; Sharat Ibrahimpur; Zoltán Szigeti; Lu Wang (SIAM J. Discret. Math., 2022)

Approximation algorithms for flexible graph connectivity. - Sylvia C. Boyd; Joseph Cheriyan; Arash Haddadan; Sharat Ibrahimpur (Math. Program., 2024)