Sylvia Boyd

556 total citations
27 papers, 254 citations indexed

About

Sylvia Boyd is a scholar working on Computational Theory and Mathematics, Industrial and Manufacturing Engineering and Computer Networks and Communications. According to data from OpenAlex, Sylvia Boyd has authored 27 papers receiving a total of 254 indexed citations (citations by other indexed papers that have themselves been cited), including 16 papers in Computational Theory and Mathematics, 13 papers in Industrial and Manufacturing Engineering and 6 papers in Computer Networks and Communications. Recurrent topics in Sylvia Boyd's work include Advanced Graph Theory Research (14 papers), Vehicle Routing Optimization Methods (11 papers) and Complexity and Algorithms in Graphs (10 papers). Sylvia Boyd is often cited by papers focused on Advanced Graph Theory Research (14 papers), Vehicle Routing Optimization Methods (11 papers) and Complexity and Algorithms in Graphs (10 papers). Sylvia Boyd collaborates with scholars based in Canada, United States and Netherlands. Sylvia Boyd's co-authors include Hasan Ural, William H. Cunningham, William R. Pulleyblank, Robert D. Carr, Geneviève Benoît, Arjang Hassibi, Satoru Iwata, René Sitters, Suzanne van der Ster and Leen Stougie and has published in prestigious journals such as IEEE Transactions on Software Engineering, Mathematical Programming and SIAM Journal on Optimization.

In The Last Decade

Sylvia Boyd

26 papers receiving 224 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Sylvia Boyd Canada	11	155	113	69	55	31	27	254
Toshinobu Kashiwabara Japan	7	115 0.7×	39 0.3×	86 1.2×	5 0.1×	50 1.6×	23	256
Eiji Miyano Japan	8	113 0.7×	46 0.4×	97 1.4×	3 0.1×	6 0.2×	47	184
John Staples Australia	8	151 1.0×	8 0.1×	60 0.9×	18 0.3×	35 1.1×	25	216
C. L. McCreary United States	7	28 0.2×	41 0.4×	229 3.3×	26 0.5×	190 6.1×	21	295
Amr Elmasry Egypt	7	91 0.6×	4 0.0×	50 0.7×	13 0.2×	29 0.9×	55	180
Monika Rauch United States	6	134 0.9×	5 0.0×	114 1.7×	7 0.1×	12 0.4×	9	202
N. V. R. Mahadev United States	10	215 1.4×	44 0.4×	75 1.1×	3 0.1×	1 0.0×	30	277
Stephen M. Majercik United States	8	60 0.4×	8 0.1×	78 1.1×	17 0.3×	10 0.3×	16	253
Corinne Ancourt France	8	61 0.4×	4 0.0×	178 2.6×	27 0.5×	273 8.8×	17	334
Daniel Horsley Australia	9	89 0.6×	7 0.1×	27 0.4×	15 0.3×	7 0.2×	44	221

Countries citing papers authored by Sylvia Boyd

Since Specialization

Citations

This map shows the geographic impact of Sylvia Boyd's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Sylvia Boyd with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Sylvia Boyd more than expected).

Fields of papers citing papers by Sylvia Boyd

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Sylvia Boyd. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Sylvia Boyd. The network helps show where Sylvia Boyd may publish in the future.

Co-authorship network of co-authors of Sylvia Boyd

This figure shows the co-authorship network connecting the top 25 collaborators of Sylvia Boyd. A scholar is included among the top collaborators of Sylvia Boyd based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Sylvia Boyd. Sylvia Boyd is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Boyd, Sylvia, et al.. (2023). Approximation algorithms for flexible graph connectivity. Mathematical Programming. 204(1-2). 493–516. 1 indexed citations

Boyd, Sylvia & András Sebö. (2019). The salesman’s improved tours for fundamental classes. Mathematical Programming. 186(1-2). 289–307. 2 indexed citations

Boyd, Sylvia, et al.. (2017). Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph. SIAM Journal on Discrete Mathematics. 31(1). 632–644. 4 indexed citations

Boyd, Sylvia, et al.. (2015). A 54-approximation for subcubic 2EC using circulations and obliged edges. Discrete Applied Mathematics. 209. 48–58. 6 indexed citations

Boyd, Sylvia, et al.. (2013). Finding 2-Factors Closer to TSP Tours in Cubic Graphs. SIAM Journal on Discrete Mathematics. 27(2). 918–939. 13 indexed citations

Boyd, Sylvia, et al.. (2013). Mixed and Circular Multichromosomal Genomic Median Problem. SIAM Journal on Discrete Mathematics. 27(1). 63–74. 1 indexed citations

Boyd, Sylvia & Robert D. Carr. (2011). Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices. Discrete Optimization. 8(4). 525–539. 12 indexed citations

Boyd, Sylvia, et al.. (2011). A FAST METHOD FOR LARGE-SCALE MULTICHROMOSOMAL BREAKPOINT MEDIAN PROBLEMS. Journal of Bioinformatics and Computational Biology. 10(1). 1240008–1240008. 5 indexed citations

Boyd, Sylvia, et al.. (2010). Structure of the Extreme Points of the Subtour Elimination Polytope of the STSP (Combinatorial Optimization and Discrete Algorithms). Kyoto University Research Information Repository (Kyoto University). 23. 33–47. 2 indexed citations

10.

Boyd, Sylvia, et al.. (2008). Structure of the Extreme Points of the Subtour Elimination Polytope of the STSP. 4 indexed citations

11.

Benoît, Geneviève & Sylvia Boyd. (2008). Finding the Exact Integrality Gap for Small Traveling Salesman Problems. Mathematics of Operations Research. 33(4). 921–931. 13 indexed citations

12.

Hansson, Anders & Sylvia Boyd. (2007). Optimal Temperature Profiles for Post-Exposure Bake of Photo-Resist.

13.

Boyd, Sylvia, et al.. (2006). On the domino-parity inequalities for the STSP. Mathematical Programming. 110(3). 501–519. 4 indexed citations

14.

Boyd, Sylvia, et al.. (2005). Computing the integrality gap of the asymmetric travelling salesman problem. Electronic Notes in Discrete Mathematics. 19. 241–247. 4 indexed citations

15.

Boyd, Sylvia & Robert D. Carr. (1999). A new bound for the ratio between the 2-matching problem and its linear programming relaxation. Mathematical Programming. 86(3). 499–499. 4 indexed citations

16.

Boyd, Sylvia, William H. Cunningham, Maurice Queyranne, & Yaoguang Wang. (1995). Ladders for Travelling Salesmen. SIAM Journal on Optimization. 5(2). 408–420. 3 indexed citations

17.

Boyd, Sylvia, et al.. (1993). An Integer Polytope Related to the Design of Survivable Communication Networks. SIAM Journal on Discrete Mathematics. 6(4). 612–630. 15 indexed citations

18.

Boyd, Sylvia & William H. Cunningham. (1991). Small Travelling Salesman Polytopes. Mathematics of Operations Research. 16(2). 259–271. 32 indexed citations

19.

Boyd, Sylvia & William R. Pulleyblank. (1990). Optimizing over the subtour polytope of the travelling salesman problem. Mathematical Programming. 49(1-3). 163–187. 23 indexed citations

20.

Boyd, Sylvia, William R. Pulleyblank, & Gérard Cornuéjols. (1987). TRAVEL — An interactive travelling salesman problem package for the IBM-personal computer. Operations Research Letters. 6(3). 141–143. 10 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact