Euiwoong Lee

652 total citations
42 papers, 122 citations indexed

About

Euiwoong Lee is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Euiwoong Lee has authored 42 papers receiving a total of 122 indexed citations (citations by other indexed papers that have themselves been cited), including 30 papers in Computational Theory and Mathematics, 15 papers in Computer Networks and Communications and 8 papers in Artificial Intelligence. Recurrent topics in Euiwoong Lee's work include Complexity and Algorithms in Graphs (27 papers), Advanced Graph Theory Research (20 papers) and Optimization and Search Problems (9 papers). Euiwoong Lee is often cited by papers focused on Complexity and Algorithms in Graphs (27 papers), Advanced Graph Theory Research (20 papers) and Optimization and Search Problems (9 papers). Euiwoong Lee collaborates with scholars based in United States, France and Switzerland. Euiwoong Lee's co-authors include Venkatesan Guruswami, Katrina Ligett, Jason Li, Anupam Gupta, Madhur Tulsiani, Kijung Shin, Sahil Singla, Mrinal K. Ghosh, Ariel D. Procaccia and Christos Faloutsos and has published in prestigious journals such as IEEE Transactions on Information Theory, Journal of the ACM and Mathematical Programming.

In The Last Decade

Euiwoong Lee

36 papers receiving 115 citations

Peers

Euiwoong Lee
Rajesh Chitnis United States
Parinya Chalermsook Germany
Davide Bilò Italy
Markus Sortland Dregi Norway
Robert Ganian Austria
Tamás Király Hungary
Yuri Faenza United States
A. V. Karzanov Russia
Russell Martin United Kingdom
Kristoffer Arnsfelt Hansen Denmark
Rajesh Chitnis United States
Euiwoong Lee
Citations per year, relative to Euiwoong Lee Euiwoong Lee (= 1×) peers Rajesh Chitnis

Countries citing papers authored by Euiwoong Lee

Since Specialization
Citations

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

Fields of papers citing papers by Euiwoong Lee

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Euiwoong Lee

This figure shows the co-authorship network connecting the top 25 collaborators of Euiwoong Lee. A scholar is included among the top collaborators of Euiwoong Lee 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 Euiwoong Lee. Euiwoong Lee is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Lee, Euiwoong, et al.. (2023). On Lifting Integrality Gaps to SSEH Hardness for Globally Constrained CSPs. 7. 26–36. 1 indexed citations
2.
Ghosh, Mrinal K., et al.. (2023). Inapproximability of Matrix \(\boldsymbol{p \rightarrow q}\) Norms. SIAM Journal on Computing. 52(1). 132–155. 4 indexed citations
3.
Cohen-Addad, Vincent, Euiwoong Lee, Shi Li, & Alantha Newman. (2023). Handling Correlated Rounding Error via Preclustering: A 1.73-approximation for Correlation Clustering. SPIRE - Sciences Po Institutional REpository. 1082–1104.
4.
Lee, Euiwoong, et al.. (2022). A characterization of approximability for biased CSPs. 989–997. 1 indexed citations
5.
Lee, Euiwoong, et al.. (2021). A framework for quadratic form maximization over convex sets through nonconvex relaxations. 870–881. 2 indexed citations
6.
Gupta, Anupam, Euiwoong Lee, & Jason Li. (2020). The Karger-Stein algorithm is optimal for k-cut. 473–484. 7 indexed citations
7.
Gupta, Anupam, et al.. (2019). Losing tree-width by separating subsets. Symposium on Discrete Algorithms. 1731–1749. 1 indexed citations
8.
Guruswami, Venkatesan, et al.. (2018). Inapproximability of Matrix p→q Norms.. arXiv (Cornell University). 25. 37. 2 indexed citations
9.
Lee, Euiwoong & Sahil Singla. (2018). Optimal Online Contention Resolution Schemes via Ex-Ante Prophet Inequalities.. arXiv (Cornell University). 2 indexed citations
10.
Lee, Euiwoong. (2018). Partitioning a graph into small pieces with applications to path transversal. Mathematical Programming. 177(1-2). 1–19. 12 indexed citations
11.
Guruswami, Venkatesan, et al.. (2017). Weak Decoupling, Polynomial Folds and Approximate Optimization over the Sphere. 1008–1019. 1 indexed citations
12.
Guruswami, Venkatesan & Euiwoong Lee. (2017). Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs. COMBINATORICA. 38(3). 547–599. 10 indexed citations
13.
Ghosh, Mrinal K., et al.. (2016). Multiplicative Approximations for Polynomial Optimization Over the Unit Sphere. arXiv (Cornell University). 23. 185. 4 indexed citations
14.
Guruswami, Venkatesan & Euiwoong Lee. (2016). . Theory of Computing. 12(1). 1–11. 4 indexed citations
15.
Guruswami, Venkatesan & Euiwoong Lee. (2015). Towards a Characterization of Approximation Resistance for Symmetric CSPs.. Electronic colloquium on computational complexity. 22. 105. 1 indexed citations
16.
Guruswami, Venkatesan & Euiwoong Lee. (2015). Complexity of Approximating CSP with Balance / Hard Constraints. Theory of Computing Systems. 59(1). 76–98. 1 indexed citations
17.
Lee, Euiwoong. (2015). Hardness of Graph Pricing Through Generalized Max-Dicut. 391–399. 2 indexed citations
18.
Guruswami, Venkatesan & Euiwoong Lee. (2015). Inapproximability of H-Transversal/Packing. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
19.
Guruswami, Venkatesan & Euiwoong Lee. (2014). Inapproximability of Feedback Vertex Set for Bounded Length Cycles.. Electronic colloquium on computational complexity. 21. 6. 7 indexed citations
20.
Lee, Euiwoong & Leonard J. Schulman. (2013). Clustering Affine Subspaces: Hardness and Algorithms. 810–827. 1 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

Breakdown of academic impact, for papers by Rajesh Chitnis Breakdown of academic impact, for papers by Parinya Chalermsook Breakdown of academic impact, for papers by Davide Bilò Breakdown of academic impact, for papers by Markus Sortland Dregi Breakdown of academic impact, for papers by Robert Ganian Breakdown of academic impact, for papers by Tamás Király Breakdown of academic impact, for papers by Yuri Faenza Breakdown of academic impact, for papers by A. V. Karzanov Breakdown of academic impact, for papers by Russell Martin Breakdown of academic impact, for papers by Kristoffer Arnsfelt Hansen
Rankless by CCL
2026