David P. Williamson

11.6k total citations · 3 hit papers
102 papers, 6.0k citations indexed

About

David P. Williamson is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Industrial and Manufacturing Engineering. According to data from OpenAlex, David P. Williamson has authored 102 papers receiving a total of 6.0k indexed citations (citations by other indexed papers that have themselves been cited), including 66 papers in Computational Theory and Mathematics, 49 papers in Computer Networks and Communications and 26 papers in Industrial and Manufacturing Engineering. Recurrent topics in David P. Williamson's work include Complexity and Algorithms in Graphs (56 papers), Optimization and Search Problems (39 papers) and Advanced Graph Theory Research (33 papers). David P. Williamson is often cited by papers focused on Complexity and Algorithms in Graphs (56 papers), Optimization and Search Problems (39 papers) and Advanced Graph Theory Research (33 papers). David P. Williamson collaborates with scholars based in United States, Canada and France. David P. Williamson's co-authors include Michel X. Goemans, David B. Shmoys, Madhu Sudan, Joel Wein, Luca Trevisan, Jon Kleinberg, Prabhakar Raghavan, Allan Borodin, Paat Rusmevichientong and Anke van Zuylen and has published in prestigious journals such as Proceedings of the National Academy of Sciences, Management Science and Operations Research.

In The Last Decade

David P. Williamson

99 papers receiving 5.4k citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

1995 2.0k citations Michel X. Goemans, David P. Williamson profile →
A General Approximation Technique for Constrained Forest Problems

1995 453 citations Michel X. Goemans, David P. Williamson profile →
The Design of Approximation Algorithms

2011 349 citations David P. Williamson, David B. Shmoys profile →

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
David P. Williamson United States	35	2.9k	2.4k	1.2k	1.1k	814	102	6.0k
Michel X. Goemans United States	33	2.7k 0.9×	1.9k 0.8×	1.2k 1.0×	1.1k 0.9×	856 1.1×	79	5.4k
Martin Grötschel Germany	36	4.2k 1.4×	1.9k 0.8×	2.2k 1.8×	1.1k 1.0×	1.4k 1.7×	107	8.4k
Toshihide Ibaraki Japan	40	2.1k 0.7×	1.7k 0.7×	1.9k 1.6×	1.4k 1.2×	515 0.6×	266	5.9k
Dorit S. Hochbaum United States	40	1.8k 0.6×	2.3k 1.0×	1.8k 1.5×	823 0.7×	571 0.7×	163	6.2k
Gérard Cornuéjols United States	36	2.6k 0.9×	1.2k 0.5×	2.3k 1.9×	537 0.5×	798 1.0×	147	6.2k
Alan Frieze United States	47	3.8k 1.3×	2.2k 0.9×	725 0.6×	2.4k 2.1×	606 0.7×	363	9.1k
Adam N. Letchford United Kingdom	26	1.5k 0.5×	1.1k 0.4×	1.8k 1.5×	709 0.6×	773 0.9×	114	5.1k
Jack Edmonds Canada	20	3.4k 1.2×	2.0k 0.8×	1.0k 0.8×	1.1k 1.0×	1.1k 1.4×	42	6.9k
Nimrod Megiddo United States	43	2.7k 0.9×	2.6k 1.1×	1000 0.8×	1.7k 1.5×	480 0.6×	150	8.5k
Alexander Schrijver Netherlands	39	6.2k 2.1×	2.8k 1.2×	1.9k 1.6×	2.1k 1.8×	2.1k 2.6×	152	12.1k

Countries citing papers authored by David P. Williamson

Since Specialization

Citations

This map shows the geographic impact of David P. Williamson'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 David P. Williamson with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites David P. Williamson more than expected).

Fields of papers citing papers by David P. Williamson

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by David P. Williamson. 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 David P. Williamson. The network helps show where David P. Williamson may publish in the future.

Co-authorship network of co-authors of David P. Williamson

This figure shows the co-authorship network connecting the top 25 collaborators of David P. Williamson. A scholar is included among the top collaborators of David P. Williamson 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 David P. Williamson. David P. Williamson 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

Rusmevichientong, Paat, et al.. (2023). Fluid Approximations for Revenue Management Under High-Variance Demand. Management Science. 69(7). 4016–4026. 4 indexed citations

Williamson, David P., et al.. (2023). An Experimental Evaluation of Semidefinite Programming and Spectral Algorithms for Max Cut. ACM Journal of Experimental Algorithmics. 28. 1–18. 2 indexed citations

Nagarajan, Chandrashekhar & David P. Williamson. (2013). Offline and online facility leasing. Discrete Optimization. 10(4). 361–370. 12 indexed citations

Sharma, Yogeshwer, Chaitanya Swamy, & David P. Williamson. (2007). Approximation algorithms for prize collecting forest problems with submodular penalty functions. Symposium on Discrete Algorithms. 1275–1284. 18 indexed citations

Fischetti, Matteo & David P. Williamson. (2007). Integer programming and combinatorial optimization : 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007 : proceedings. DIAL (Catholic University of Leuven). 1 indexed citations

Zuylen, Anke van, et al.. (2007). Deterministic pivoting algorithms for constrained ranking and clustering problems. Symposium on Discrete Algorithms. 405–414. 17 indexed citations

Lin, Guolong, Chandrashekhar Nagarajan, Rajmohan Rajaraman, & David P. Williamson. (2006). A general approach for incremental approximation and hierarchical clustering. Symposium on Discrete Algorithms. 1147–1156. 10 indexed citations

Uma, RN, Joel Wein, & David P. Williamson. (2006). On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems. Theoretical Computer Science. 361(2-3). 241–256. 4 indexed citations

Goemans, Michel X. & David P. Williamson. (2003). Approximation algorithms for Max-3-Cut and other problems via complex semidefinite programming. Journal of Computer and System Sciences. 68(2). 442–470. 55 indexed citations

10.

Asano, Takao & David P. Williamson. (2000). Improved approximation algorithms for MAX SAT. Symposium on Discrete Algorithms. 96–105. 13 indexed citations

11.

Williamson, David P.. (1999). Lecture notes on approximation algorithms: Fall 1998. eCommons (Cornell University). 263(31). 16364–71. 2 indexed citations

12.

Jain, Kamal, Ion Măndoiu, Vijay V. Vazirani, & David P. Williamson. (1999). A primal-dual schema based approximation algorithm for the element connectivity problem. Symposium on Discrete Algorithms. 484–489. 14 indexed citations

13.

Goemans, Michel X. & David P. Williamson. (1996). Primal-Dual Approximation Algorithms for Feedback Problems. 147–161. 1 indexed citations

14.

Khanna, Sanjeev, Madhu Sudan, & David P. Williamson. (1996). A Complete Characterization of the Approximability of Maximization Problems Derived from Boolean Constraint Satisfaction. Electronic colloquium on computational complexity. 3. 1 indexed citations

15.

Goemans, Michel X. & David P. Williamson. (1996). The primal-dual method for approximation algorithms and its application to network design problems. 144–191. 174 indexed citations

16.

Trevisan, Luca, Gregory B. Sorkin, Madhu Sudan, & David P. Williamson. (1996). Gadgets, Approximation, and Linear Programming (extended abstract).. 617–626. 6 indexed citations

17.

Ravi, R. & David P. Williamson. (1995). An approximation algorithm for minimum-cost vertex-connectivity problems. Symposium on Discrete Algorithms. 1000–1001. 7 indexed citations

18.

Goemans, M. X., Andrew V. Goldberg, Serge Plotkin, et al.. (1994). Improved approximation algorithms for network design problems. Symposium on Discrete Algorithms. 223–232. 99 indexed citations

19.

Goemans, Michel X. & David P. Williamson. (1993). A new \frac34-approximation algorithm for MAX SAT.. 57(38). 313–321. 8 indexed citations

20.

Goemans, Michel X. & David P. Williamson. (1992). A general approximation technique for constrained forest problems. Symposium on Discrete Algorithms. 307–316. 37 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