| Year | Rank | Type | Title / Venue / Authors |
|---|---|---|---|
| 2026 | J | jnl |
Oper. Res. Lett.
|
| 2026 | J | jnl |
CoRR
|
| 2026 | J | jnl |
CoRR
|
| 2025 | J | jnl |
CoRR
|
| 2025 | J | jnl |
Oper. Res. Lett.
|
| 2025 | J | jnl |
Dagstuhl Reports
|
| 2025 | A* | conf |
ICALP
|
| 2025 | J | jnl |
CoRR
|
| 2025 | J | jnl |
ACM Trans. Algorithms
|
| 2025 | J | jnl |
Oper. Res.
|
| 2025 | B | conf |
IPCO
|
| 2025 | J | jnl |
CoRR
|
| 2024 | J | jnl |
SIAM J. Comput.
|
| 2024 | A | conf |
AISTATS
|
| 2024 | J | jnl |
CoRR
|
| 2024 | J | jnl |
Math. Oper. Res.
|
| 2024 | J | jnl |
J. Mach. Learn. Res.
|
| 2024 | A* | conf |
FOCS
|
| 2024 | J | jnl |
Oper. Res.
|
| 2023 | J | jnl |
Transp. Sci.
|
| 2023 | J | jnl |
CoRR
|
| 2023 | — | conf |
SOSA
|
| 2023 | J | jnl |
CoRR
|
| 2023 | A* | ed. |
SODA
|
| 2023 | J | jnl |
CoRR
|
| 2022 | A* | conf |
NeurIPS
|
| 2022 | J | jnl |
CoRR
|
| 2022 | A* | conf |
ICML
|
| 2022 | J | jnl |
CoRR
|
| 2022 | J | jnl |
Oper. Res.
|
| 2022 | J | jnl |
INFORMS J. Comput.
|
| 2022 | J | jnl |
CoRR
|
| 2022 | B | conf |
IPCO
|
| 2022 | J | jnl |
Oper. Res. Lett.
|
| 2022 | J | jnl |
Math. Oper. Res.
|
| 2022 | J | jnl |
Math. Program.
|
| 2021 | J | jnl |
CoRR
|
| 2021 | J | jnl |
CoRR
|
| 2021 | J | jnl |
CoRR
|
| 2021 | A* | conf |
SODA
|
| 2021 | J | jnl |
Math. Oper. Res.
|
| 2021 | A* | conf |
ICML
|
| 2021 | J | jnl |
CoRR
|
| 2020 | J | jnl |
Oper. Res.
|
| 2020 | J | jnl |
Oper. Res. Lett.
|
| 2020 | J | jnl |
SIAM J. Comput.
|
| 2020 | J | jnl |
CoRR
|
| 2020 | J | jnl |
Math. Program.
|
| 2020 | A* | conf |
SODA
|
| 2020 | B | conf |
IPCO
|
| 2020 | J | jnl |
CoRR
|
| 2020 | J | jnl |
Math. Oper. Res.
|
| 2019 | J | jnl |
CoRR
|
| 2019 | B | ed. |
IPCO
|
| 2019 | J | jnl |
J. Sched.
|
| 2019 | A* | conf |
NeurIPS
|
| 2019 | J | jnl |
CoRR
|
| 2018 | J | jnl |
CoRR
|
| 2018 | J | jnl |
Oper. Res. Lett.
|
| 2018 | J | jnl |
CoRR
|
| 2018 | J | jnl |
Math. Program.
|
| 2018 | J | jnl |
Oper. Res. Lett.
|
| 2018 | A* | conf |
SODA
|
| 2017 | B | conf |
IPCO
|
| 2017 | A* | conf |
SODA
|
| 2017 | J | jnl |
Math. Oper. Res.
|
| 2017 | — | conf |
FSTTCS
|
| 2017 | B | conf |
CPAIOR
|
| 2017 | J | jnl |
CoRR
|
| 2017 | A* | conf |
ICALP
|
| 2016 | J | jnl |
CoRR
|
| 2016 | J | jnl |
CoRR
|
| 2016 | A* | conf |
SODA
|
| 2016 | J | jnl |
ACM Trans. Algorithms
|
| 2016 | J | jnl |
CoRR
|
| 2016 | J | jnl |
Math. Program.
|
| 2016 | B | conf |
IPCO
|
| 2016 | J | jnl |
Math. Oper. Res.
|
| 2016 | J | jnl |
Networks
|
| 2016 | B | conf |
IPCO
|
| 2016 | J | jnl |
ACM Trans. Algorithms
|
| 2016 | A* | conf |
FOCS
|
| 2016 | J | jnl |
ACM Trans. Algorithms
|
| 2016 | — | ch. |
Encyclopedia of Algorithms
|
| 2015 | J | jnl |
CoRR
|
| 2015 | J | jnl |
CoRR
|
| 2015 | J | jnl |
Math. Oper. Res.
|
| 2015 | J | jnl |
CoRR
|
| 2015 | J | jnl |
SIAM J. Comput.
|
| 2015 | J | jnl |
ACM Trans. Algorithms
|
| 2015 | J | jnl |
Math. Program.
|
| 2015 | J | jnl |
Math. Oper. Res.
|
| 2015 | — | conf |
APPROX-RANDOM
|
| 2014 | J | jnl |
Math. Oper. Res.
|
| 2014 | J | jnl |
ACM Trans. Algorithms
|
| 2014 | J | jnl |
CoRR
|
| 2014 | A* | conf |
STOC
|
| 2014 | A* | conf |
SODA
|
| 2014 | J | jnl |
SIAM J. Comput.
|
| 2014 | B | conf |
IPCO
|
| 2014 | J | jnl |
CoRR
|
| 2014 | — | conf |
Middleware (Industry Track)
|
| 2014 | J | jnl |
Math. Program.
|
| 2013 | J | jnl |
CoRR
|
| 2013 | B | conf |
IPCO
|
| 2013 | — | conf |
ICALP (1)
|
| 2013 | A | conf |
Middleware
|
| 2013 | J | jnl |
Math. Program.
|
| 2013 | J | jnl |
CoRR
|
| 2013 | — | conf |
APPROX-RANDOM
|
| 2013 | B | conf |
IPCO
|
| 2013 | J | jnl |
CoRR
|
| 2013 | B | conf |
IPCO
|
| 2012 | J | jnl |
CoRR
|
| 2012 | — | conf |
ICALP (1)
|
| 2012 | J | jnl |
Networks
|
| 2012 | A* | conf |
SODA
|
| 2012 | — | conf |
ICALP (1)
|
| 2012 | — | conf |
MedAlg
|
| 2012 | J | jnl |
Theory Comput.
|
| 2012 | J | jnl |
CoRR
|
| 2012 | — | conf |
ICALP (1)
|
| 2012 | J | jnl |
Oper. Res.
|
| 2012 | J | jnl |
Algorithmica
|
| 2011 | B | conf |
IPCO
|
| 2011 | J | jnl |
CoRR
|
| 2011 | — | conf |
APPROX-RANDOM
|
| 2011 | J | jnl |
CoRR
|
| 2011 | A* | conf |
FOCS
|
| 2011 | J | jnl |
CoRR
|
| 2011 | J | jnl |
CoRR
|
| 2011 | A* | conf |
PODC
|
| 2011 | J | jnl |
Algorithmica
|
| 2011 | A* | conf |
SODA
|
| 2010 | J | jnl |
Math. Oper. Res.
|
| 2010 | J | jnl |
Oper. Res. Lett.
|
| 2010 | J | jnl |
CoRR
|
| 2010 | — | conf |
ICALP (1)
|
| 2010 | J | jnl |
Algorithmica
|
| 2010 | — | conf |
ICALP (1)
|
| 2010 | J | jnl |
CoRR
|
| 2010 | J | jnl |
ACM Trans. Algorithms
|
| 2010 | J | jnl |
SIAM J. Discret. Math.
|
| 2010 | B | conf |
IPCO
|
| 2010 | J | jnl |
CoRR
|
| 2010 | B | conf |
IPCO
|
| 2010 | J | jnl |
CoRR
|
| 2010 | J | jnl |
Simpler analysis of LP extreme points for traveling salesman and survivable network design problems.
Oper. Res. Lett.
|
| 2010 | — | conf |
ICALP (1)
|
| 2010 | — | conf |
ESA (2)
|
| 2010 | J | jnl |
CoRR
|
| 2009 | J | jnl |
SIAM J. Comput.
|
| 2009 | A | conf |
ESA
|
| 2009 | J | jnl |
CoRR
|
| 2009 | A* | conf |
STOC
|
| 2009 | J | jnl |
CoRR
|
| 2009 | J | jnl |
Math. Oper. Res.
|
| 2009 | A* | conf |
SODA
|
| 2009 | J | jnl |
CoRR
|
| 2009 | J | jnl |
Math. Oper. Res.
|
| 2008 | A* | conf |
SODA
|
| 2008 | A* | conf |
STOC
|
| 2008 | J | jnl |
J. Sched.
|
| 2008 | J | jnl |
Theory Comput.
|
| 2008 | — | conf |
APPROX-RANDOM
|
| 2008 | B | conf |
IPCO
|
| 2007 | A | conf |
ESA
|
| 2007 | J | jnl |
CoRR
|
| 2007 | — | conf |
APPROX-RANDOM
|
| 2006 | A* | conf |
SODA
|
| 2006 | — | conf |
APPROX-RANDOM
|
| 2005 | — | conf |
APPROX-RANDOM
|
| 2005 | A* | conf |
EC
|