Euiwoong Lee

From MaRDI portal
Revision as of 14:14, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:315528

Available identifiers

zbMath Open lee.euiwoongMaRDI QIDQ315528

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61262482024-04-09Paper
https://portal.mardi4nfdi.de/entity/Q61472532024-01-15Paper
https://portal.mardi4nfdi.de/entity/Q61474142024-01-15Paper
A characterization of approximability for biased CSPs2023-12-08Paper
https://portal.mardi4nfdi.de/entity/Q60908772023-11-20Paper
https://portal.mardi4nfdi.de/entity/Q60654722023-11-14Paper
A framework for quadratic form maximization over convex sets through nonconvex relaxations2023-11-14Paper
Maximum Matching in the Online Batch-arrival Model2023-04-26Paper
Inapproximability of Matrix \(\boldsymbol{p \rightarrow q}\) Norms2023-04-04Paper
Strong hardness of approximation for tree transversals2023-02-03Paper
https://portal.mardi4nfdi.de/entity/Q58754602023-02-03Paper
Matroid-based TSP rounding for half-integral solutions2022-08-16Paper
https://portal.mardi4nfdi.de/entity/Q50911922022-07-21Paper
Optimal Bounds for the k -cut Problem2022-03-31Paper
On some variants of Euclidean \(k\)-supplier2022-03-11Paper
https://portal.mardi4nfdi.de/entity/Q50096222021-08-04Paper
Global and fixed-terminal cuts in digraphs2021-07-28Paper
https://portal.mardi4nfdi.de/entity/Q50026342021-07-28Paper
The Karger-Stein algorithm is optimal for k-cut2021-01-19Paper
https://portal.mardi4nfdi.de/entity/Q51363242020-11-25Paper
https://portal.mardi4nfdi.de/entity/Q51114242020-05-27Paper
The number of minimum k -cuts: improving the Karger-Stein bound2020-01-30Paper
A PTAS for ℓp-Low Rank Approximation2019-10-15Paper
Approximability of p → q Matrix Norms: Generalized Krivine Rounding and Hypercontractive Hardness2019-10-15Paper
Losing Treewidth by Separating Subsets2019-10-15Paper
Partitioning a graph into small pieces with applications to path transversal2019-08-06Paper
Beating the 2-approximation factor for global bicut2019-08-06Paper
Clustering Affine Subspaces: Hardness and Algorithms2019-05-15Paper
Strong inapproximability results on balanced rainbow-colorable hypergraphs2019-02-01Paper
LP/SDP Hierarchy Lower Bounds for Decoding Random LDPC Codes2018-09-14Paper
Nearly Optimal NP-Hardness of Unique Coverage2018-07-16Paper
Partitioning a Graph into Small Pieces with Applications to Path Transversal2018-07-16Paper
Approximating Operator Norms via Generalized Krivine Rounding2018-04-10Paper
https://portal.mardi4nfdi.de/entity/Q46080742018-03-15Paper
APX-hardness of maximizing Nash social welfare with indivisible items2017-11-03Paper
https://portal.mardi4nfdi.de/entity/Q53689042017-10-11Paper
LP/SDP Hierarchy Lower Bounds for Decoding Random LDPC Codes2017-10-05Paper
Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs2017-10-05Paper
Minimum Birkhoff-von Neumann decomposition2017-08-31Paper
Maximum matching in the online batch-arrival model2017-08-31Paper
https://portal.mardi4nfdi.de/entity/Q53518962017-08-31Paper
https://portal.mardi4nfdi.de/entity/Q53519072017-08-31Paper
https://portal.mardi4nfdi.de/entity/Q53519082017-08-31Paper
Inapproximability of $H$-Transversal/Packing2017-08-14Paper
Nearly Optimal NP-Hardness of Unique Coverage2017-06-28Paper
Complexity of approximating CSP with balance / hard constraints2017-05-19Paper
Complexity of approximating CSP with balance/hard constraints2016-09-21Paper
https://portal.mardi4nfdi.de/entity/Q28164122016-08-22Paper
Hardness of Graph Pricing Through Generalized Max-Dicut2015-08-21Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Euiwoong Lee

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:315528&oldid=7898781"
Powered by MediaWiki