Michel X. Goemans

10.6k citations
79 papers · 5.4k indexed · 2 hit papers · h-index 33

Michel X. Goemans

77 papers receiving 4.9k citations

Hit Papers

Improved approximation algorithms for maximum cut and sat...2.0k199520262005201550010001.5k

Peers

Michel X. Goemans
Comparison fields: 5 of 123
  • Computational Theory and Mathematics 2.7k
  • Numerical Analysis 639
  • Industrial and Manufacturing Engineering 1.2k
  • Computer Graphics and Computer-Aided Design 397
  • Computer Networks and Communications 1.9k
Replace David P. Williamson with:
David P. Williamson United States
Adam N. Letchford United Kingdom
Martin Grötschel Germany
Martin Dyer United Kingdom
Nimrod Megiddo United States
Rainer E. Burkard Austria
Narendra Karmarkar United States
Franz Rendl Austria
Jack Edmonds Canada
Katta G. Murty United States
Michel X. Goemans relative to David P. Williamson United States David P. Williamson's profile →
Citations per field
00.5×1.5×
David P. Williamson · 1×
Citations per year

Countries citing papers authored by Michel X. Goemans

Since Specialization
Citations

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

Fields of papers citing papers by Michel X. Goemans

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network

The 25 scholars most cited alongside Michel X. Goemans, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Michel X. Goemans Line = papers co-authored together Michel X. Goemans links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown
#Work
1 200935
2 2006103
3 20041
4 20041
5
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
200377
6 20035
7 200355
8 20010
9 199767
10
The Constrained Minimum Spanning Tree Problem (Extended Abstract)
199631
11
Primal-Dual Approximation Algorithms for Feedback Problems
19961
12
The primal-dual method for approximation algorithms and its application to network design problems
1996174
13 199651
14 199526
15
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingbreakdown →
19951956
16 199458
17
A new \frac34-approximation algorithm for MAX SAT.
19938
18
A general approximation technique for constrained forest problems
199237
19
Polyhedral Description of Trees and Arborescences.
19924
20 19909

About Michel X. Goemans

Michel X. Goemans is a scholar working on Computational Theory and Mathematics, Industrial and Manufacturing Engineering and Discrete Mathematics and Combinatorics, having authored 79 papers that have together received 5.4k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (36 papers), Complexity and Algorithms in Graphs (36 papers), Optimization and Search Problems (23 papers), Optimization and Packing Problems (14 papers), Vehicle Routing Optimization Methods (12 papers), VLSI and FPGA Design Techniques (7 papers), Scheduling and Optimization Algorithms (7 papers) and graph theory and CDMA systems (7 papers). The work is most often cited by research in Computational Theory and Mathematics (2.7k citations), Numerical Analysis (639 citations) and Industrial and Manufacturing Engineering (1.2k citations). Michel X. Goemans has collaborated with scholars based in United States, Germany and Japan. Frequent co-authors include David P. Williamson, Jon Kleinberg, Dimitris Bertsimas, Martin Skutella, Brian C. Dean, Vahab Mirrokni, Young‐Soo Myung, Daniel Bienstock, David Simchi‐Levi and Jan Vondrák. Their work appears in journals such as Operations Research, Journal of the ACM and Mathematical Programming.

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

Rankless by CCL
2026