| Year | Rank | Type | Title / Venue / Authors |
|---|---|---|---|
| 2026 | J | jnl |
CoRR
|
| 2026 | A* | conf |
SODA
|
| 2025 | A* | conf |
SODA
|
| 2025 | J | jnl |
CoRR
|
| 2025 | A | conf |
APPROX/RANDOM
|
| 2025 | J | jnl |
CoRR
|
| 2024 | J | jnl |
CoRR
|
| 2024 | J | jnl |
CoRR
|
| 2024 | A* | conf |
ICALP
|
| 2024 | J | jnl |
CoRR
|
| 2024 | J | jnl |
Math. Program.
|
| 2024 | J | jnl |
Math. Program.
|
| 2024 | A* | conf |
SODA
|
| 2024 | A* | conf |
STOC
|
| 2023 | A | conf |
APPROX/RANDOM
|
| 2023 | J | jnl |
CoRR
|
| 2023 | A | conf |
ESA
|
| 2023 | J | jnl |
CoRR
|
| 2023 | J | jnl |
CoRR
|
| 2023 | J | jnl |
CoRR
|
| 2022 | A* | conf |
SODA
|
| 2022 | — | conf |
FAccT
|
| 2022 | J | jnl |
CoRR
|
| 2022 | A* | conf |
COLT
|
| 2022 | J | jnl |
CoRR
|
| 2021 | J | jnl |
CoRR
|
| 2021 | A* | conf |
COLT
|
| 2021 | J | jnl |
CoRR
|
| 2021 | J | jnl |
CoRR
|
| 2021 | A* | conf |
ICML
|
| 2021 | J | jnl |
CoRR
|
| 2021 | A* | conf |
SoCG
|
| 2020 | A | conf |
ITCS
|
| 2020 | A* | conf |
ICML
|
| 2020 | — | ch. |
Beyond the Worst-Case Analysis of Algorithms
|
| 2020 | A* | ed. |
STOC
|
| 2019 | J | jnl |
SIAM J. Comput.
|
| 2019 | A* | conf |
STOC
|
| 2019 | J | jnl |
CoRR
|
| 2019 | J | jnl |
SIAM J. Comput.
|
| 2018 | J | jnl |
CoRR
|
| 2018 | A* | conf |
STOC
|
| 2018 | J | jnl |
CoRR
|
| 2017 | J | jnl |
Theory Comput.
|
| 2017 | A* | conf |
SODA
|
| 2017 | A* | conf |
STOC
|
| 2017 | B | conf |
IPCO
|
| 2017 | — | ch. |
The Constraint Satisfaction Problem
|
| 2017 | A* | conf |
SODA
|
| 2017 | A* | conf |
SODA
|
| 2016 | — | conf |
APPROX-RANDOM
|
| 2016 | J | jnl |
CoRR
|
| 2016 | J | jnl |
CoRR
|
| 2016 | J | jnl |
ACM Trans. Algorithms
|
| 2016 | J | jnl |
Theory Comput.
|
| 2016 | A* | conf |
COLT
|
| 2016 | J | jnl |
CoRR
|
| 2016 | J | jnl |
CoRR
|
| 2016 | J | jnl |
CoRR
|
| 2015 | J | jnl |
CoRR
|
| 2015 | A* | conf |
COLT
|
| 2015 | J | jnl |
CoRR
|
| 2015 | J | jnl |
CoRR
|
| 2015 | A* | conf |
FOCS
|
| 2014 | J | jnl |
CoRR
|
| 2014 | J | jnl |
Theory Comput.
|
| 2014 | — | conf |
APPROX-RANDOM
|
| 2014 | J | jnl |
CoRR
|
| 2014 | A* | conf |
SODA
|
| 2014 | B | conf |
ALT
|
| 2014 | J | jnl |
CoRR
|
| 2014 | J | jnl |
CoRR
|
| 2014 | A* | conf |
STOC
|
| 2014 | — | conf |
ICALP (1)
|
| 2014 | J | jnl |
CoRR
|
| 2013 | — | conf |
APPROX-RANDOM
|
| 2013 | J | jnl |
CoRR
|
| 2013 | A | conf |
ITCS
|
| 2013 | — | conf |
NIPS
|
| 2013 | J | jnl |
CoRR
|
| 2012 | J | jnl |
CoRR
|
| 2012 | — | conf |
APPROX-RANDOM
|
| 2012 | J | jnl |
CoRR
|
| 2012 | A* | conf |
SODA
|
| 2012 | A* | conf |
STOC
|
| 2012 | J | jnl |
IEEE Trans. Inf. Theory
|
| 2012 | J | jnl |
CoRR
|
| 2012 | — | conf |
APPROX-RANDOM
|
| 2012 | J | jnl |
Oper. Res. Lett.
|
| 2011 | J | jnl |
CoRR
|
| 2011 | A | conf |
ICS
|
| 2011 | A* | conf |
FOCS
|
| 2011 | J | jnl |
CoRR
|
| 2011 | A* | conf |
SODA
|
| 2011 | A* | conf |
FOCS
|
| 2011 | J | jnl |
CoRR
|
| 2010 | B | conf |
WAOA
|
| 2010 | J | jnl |
SIAM J. Comput.
|
| 2010 | J | jnl |
CoRR
|
| 2010 | A* | conf |
FOCS
|
| 2010 | J | jnl |
CoRR
|
| 2010 | A* | conf |
STOC
|
| 2009 | J | jnl |
CoRR
|
| 2009 | J | jnl |
CoRR
|
| 2009 | J | jnl |
Electron. Colloquium Comput. Complex.
|
| 2009 | A* | conf |
STOC
|
| 2009 | J | jnl |
ACM Trans. Algorithms
|
| 2009 | J | jnl |
CoRR
|
| 2007 | A* | conf |
SODA
|
| 2007 | A* | conf |
FOCS
|
| 2007 | J | jnl |
Electron. Colloquium Comput. Complex.
|
| 2007 | A* | conf |
SODA
|
| 2007 | A* | conf |
FOCS
|
| 2007 | J | jnl |
Electron. Colloquium Comput. Complex.
|
| 2006 | J | jnl |
Electron. Colloquium Comput. Complex.
|
| 2006 | A* | conf |
SODA
|
| 2006 | A* | conf |
FOCS
|
| 2006 | A* | conf |
STOC
|
| 2006 | J | jnl |
Electron. Colloquium Comput. Complex.
|
| 2005 | J | jnl |
CoRR
|
| 2005 | A* | conf |
O(sqrt(log n)) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems.
STOC
|
| 2005 | A* | conf |
STOC
|
| 2002 | J | jnl |
Commun. Inf. Syst.
|
| 1997 | J | jnl |
J. Graph Theory
|