default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSylvia C. Boyd
Person information
- affiliation: University of Ottawa, Ontario, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j21]Sylvia C. Boyd, Joseph Cheriyan
, Arash Haddadan, Sharat Ibrahimpur:
Approximation algorithms for flexible graph connectivity. Math. Program. 204(1): 493-516 (2024)- 2022
- [j20]Sylvia C. Boyd, Joseph Cheriyan, Robert Cummings, Logan Grout, Sharat Ibrahimpur, Zoltán Szigeti, Lu Wang:
A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case. SIAM J. Discret. Math. 36(3): 1730-1747 (2022) - [i6]Sylvia C. Boyd, Joseph Cheriyan, Arash Haddadan, Sharat Ibrahimpur:
Approximation Algorithms for Flexible Graph Connectivity. CoRR abs/2202.13298 (2022) - 2021
- [j19]Sylvia C. Boyd, András Sebö:
The salesman's improved tours for fundamental classes. Math. Program. 186(1): 289-307 (2021) - [c9]Sylvia C. Boyd, Joseph Cheriyan, Arash Haddadan, Sharat Ibrahimpur:
Approximation Algorithms for Flexible Graph Connectivity. FSTTCS 2021: 9:1-9:14 - [i5]Sylvia C. Boyd, Joseph Cheriyan, Arash Haddadan, Sharat Ibrahimpur:
A 2-Approximation Algorithm for Flexible Graph Connectivity. CoRR abs/2102.03304 (2021) - 2020
- [c8]Sylvia C. Boyd, Joseph Cheriyan, Robert Cummings, Logan Grout, Sharat Ibrahimpur, Zoltán Szigeti, Lu Wang:
A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case. APPROX-RANDOM 2020: 61:1-61:12 - [i4]Sylvia C. Boyd, Joseph Cheriyan, Robert Cummings, Logan Grout, Sharat Ibrahimpur, Zoltán Szigeti, Lu Wang:
A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case. CoRR abs/2008.03327 (2020)
2010 – 2019
- 2017
- [j18]Sylvia C. Boyd, Philippe Legault:
Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph. SIAM J. Discret. Math. 31(1): 632-644 (2017) - [c7]Sylvia C. Boyd, András Sebö:
The Saleman's Improved Tours for Fundamental Classes. IPCO 2017: 111-122 - [i3]Sylvia C. Boyd, András Sebö:
The Salesman's Improved Tours for Fundamental Classes. CoRR abs/1705.02385 (2017) - 2016
- [j17]Sylvia C. Boyd, Yao Fu, Yu Sun:
A -approximation for subcubic 2EC using circulations and obliged edges. Discret. Appl. Math. 209: 48-58 (2016) - 2015
- [j16]Sylvia C. Boyd, Philippe Legault:
Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Subgraph Problem. Electron. Notes Discret. Math. 50: 427-432 (2015) - [i2]Sylvia C. Boyd, Philippe Legault:
Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph Problem. CoRR abs/1512.08070 (2015) - 2014
- [j15]Sylvia C. Boyd, René Sitters, Suzanne van der Ster, Leen Stougie:
The traveling salesman problem on cubic and subcubic graphs. Math. Program. 144(1-2): 227-245 (2014) - [c6]Sylvia C. Boyd, Yao Fu, Yu Sun:
A $\frac{5}{4}$ -Approximation for Subcubic 2EC Using Circulations. IPCO 2014: 186-197 - 2013
- [j14]Sylvia C. Boyd, Maryam Haghighi:
Mixed and Circular Multichromosomal Genomic Median Problem. SIAM J. Discret. Math. 27(1): 63-74 (2013) - [j13]Sylvia C. Boyd, Satoru Iwata, Kenjiro Takazawa:
Finding 2-Factors Closer to TSP Tours in Cubic Graphs. SIAM J. Discret. Math. 27(2): 918-939 (2013) - 2012
- [j12]Sylvia C. Boyd, Maryam Haghighi:
A Fast Method for Large-Scale Multichromosomal Breakpoint Median Problems. J. Bioinform. Comput. Biol. 10(1) (2012) - 2011
- [j11]Sylvia C. Boyd, Robert Carr:
Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices. Discret. Optim. 8(4): 525-539 (2011) - [c5]Maryam Haghighi, Sylvia C. Boyd:
A fast method for large-scale multichromosomal breakpoint median problems. BCB 2011: 162-171 - [c4]Sylvia C. Boyd, René Sitters, Suzanne van der Ster, Leen Stougie:
TSP on Cubic and Subcubic Graphs. IPCO 2011: 65-77 - [i1]Sylvia C. Boyd, René Sitters, Suzanne van der Ster, Leen Stougie:
The traveling salesman problem on cubic and subcubic graphs. CoRR abs/1107.1052 (2011)
2000 – 2009
- 2008
- [j10]Geneviève Benoit, Sylvia C. Boyd:
Finding the Exact Integrality Gap for Small Traveling Salesman Problems. Math. Oper. Res. 33(4): 921-931 (2008) - [c3]Sylvia C. Boyd, William R. Pulleyblank:
Facet Generating Techniques. Bonn Workshop of Combinatorial Optimization 2008: 33-55 - 2007
- [j9]Sylvia C. Boyd, Sally Cockburn, Danielle Vella:
On the domino-parity inequalities for the STSP. Math. Program. 110(3): 501-519 (2007) - 2005
- [j8]Sylvia C. Boyd, Paul Elliott-Magwood:
Computing the integrality gap of the asymmetric travelling salesman problem. Electron. Notes Discret. Math. 19: 241-247 (2005) - 2002
- [c2]Sylvia C. Boyd, Geneviève Labonté:
Finding the Exact Integrality Gap for Small Traveling Salesman Problems. IPCO 2002: 83-92
1990 – 1999
- 1999
- [j7]Sylvia C. Boyd, Robert Carr:
A new bound for the ratio between the 2-matching problem and its linear programming relaxation. Math. Program. 86(3): 499-514 (1999) - 1997
- [c1]Sylvia C. Boyd, Karina Marcus:
The Economic Addition of Functionality to a Network. HPCN Europe 1997: 688-697 - 1995
- [j6]Sylvia C. Boyd, William H. Cunningham, Maurice Queyranne, Yaoguang Wang:
Ladders for Travelling Salesmen. SIAM J. Optim. 5(2): 408-420 (1995) - 1993
- [j5]Sylvia C. Boyd, Tianbao Hao:
An Integer Polytope Related to the Design of Survivable Communication Networks. SIAM J. Discret. Math. 6(4): 612-630 (1993) - 1991
- [j4]Sylvia C. Boyd, Hasan Ural:
The Synchronization Problem in Protocol Testing and its Complexity. Inf. Process. Lett. 40(3): 131-136 (1991) - [j3]Sylvia C. Boyd, William H. Cunningham:
Small Travelling Salesman Polytopes. Math. Oper. Res. 16(2): 259-271 (1991) - [j2]Sylvia C. Boyd, William R. Pulleyblank:
Optimizing over the subtour polytope of the travelling salesman problem. Math. Program. 49: 163-187 (1991) - [j1]Sylvia C. Boyd, Hasan Ural:
On the Complexity of Generating Optimal Test Sequences. IEEE Trans. Software Eng. 17(9): 976-978 (1991)
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 2025-01-09 12:48 CET 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
