| Year | Rank | Type | Title / Venue / Authors |
|---|---|---|---|
| 2025 | J | jnl |
CoRR
|
| 2025 | J | jnl |
CoRR
|
| 2025 | J | jnl |
Algorithms
|
| 2025 | J | jnl |
CoRR
|
| 2024 | A | conf |
AAMAS
|
| 2024 | A | conf |
ESA
|
| 2024 | J | jnl |
CoRR
|
| 2024 | A | conf |
IPDPS
|
| 2024 | J | jnl |
CoRR
|
| 2023 | — | conf |
FORC
|
| 2023 | J | jnl |
CoRR
|
| 2023 | A | conf |
APPROX/RANDOM
|
| 2023 | J | jnl |
CoRR
|
| 2023 | J | jnl |
J. Sched.
|
| 2022 | B | conf |
SPAA
|
| 2022 | J | jnl |
CoRR
|
| 2022 | A | conf |
ESA
|
| 2022 | J | jnl |
CoRR
|
| 2022 | A* | conf |
ICML
|
| 2022 | J | jnl |
CoRR
|
| 2022 | J | jnl |
Discret. Optim.
|
| 2021 | A* | ed. |
STOC
|
| 2021 | — | conf |
UCC Companion
|
| 2020 | A* | conf |
ICML
|
| 2020 | J | jnl |
CoRR
|
| 2020 | A* | conf |
IJCAI
|
| 2020 | J | jnl |
SIAM J. Discret. Math.
|
| 2020 | A* | conf |
SODA
|
| 2020 | J | jnl |
CoRR
|
| 2020 | J | jnl |
Algorithmica
|
| 2019 | J | jnl |
CoRR
|
| 2019 | B | conf |
IPCO
|
| 2019 | J | jnl |
CoRR
|
| 2019 | B | conf |
SPAA
|
| 2019 | J | jnl |
CoRR
|
| 2019 | — | conf |
APPROX-RANDOM
|
| 2019 | J | jnl |
Algorithmica
|
| 2019 | J | jnl |
Theor. Comput. Sci.
|
| 2018 | B | conf |
SPAA
|
| 2018 | — | conf |
FSTTCS
|
| 2018 | — | ch. |
Handbook of Approximation Algorithms and Metaheuristics (1)
|
| 2018 | J | jnl |
CoRR
|
| 2018 | Misc | conf |
ITA
|
| 2018 | — | conf |
SIGGRAPH ASIA Posters
|
| 2018 | J | jnl |
Algorithmica
|
| 2018 | B | conf |
LATIN
|
| 2017 | B | conf |
WADS
|
| 2017 | J | jnl |
J. Sched.
|
| 2017 | B | conf |
IPCO
|
| 2017 | J | jnl |
CoRR
|
| 2016 | — | ch. |
Encyclopedia of Algorithms
|
| 2016 | B | conf |
SPAA
|
| 2016 | — | ch. |
Encyclopedia of Algorithms
|
| 2016 | J | jnl |
CoRR
|
| 2016 | — | conf |
CCCG
|
| 2016 | J | jnl |
CoRR
|
| 2016 | J | jnl |
Algorithmica
|
| 2016 | — | conf |
APPROX-RANDOM
|
| 2016 | J | jnl |
CoRR
|
| 2016 | A | conf |
ESA
|
| 2015 | — | conf |
FSTTCS
|
| 2015 | J | jnl |
CoRR
|
| 2014 | J | jnl |
Algorithmica
|
| 2014 | A* | conf |
SODA
|
| 2014 | J | jnl |
Oper. Res. Lett.
|
| 2014 | — | ch. |
Computing Handbook, 3rd ed. (1)
|
| 2014 | B | conf |
SPAA
|
| 2014 | J | jnl |
VLDB J.
|
| 2013 | A | conf |
ALENEX
|
| 2013 | A | conf |
IPDPS
|
| 2013 | J | jnl |
CoRR
|
| 2013 | J | jnl |
CoRR
|
| 2013 | J | jnl |
NII Shonan Meet. Rep.
|
| 2013 | B | conf |
WADS
|
| 2013 | J | jnl |
Algorithms Mol. Biol.
|
| 2013 | A* | conf |
INFOCOM
|
| 2012 | J | jnl |
CoRR
|
| 2012 | A | conf |
ESA
|
| 2012 | J | jnl |
SIGACT News
|
| 2012 | J | jnl |
Algorithmica
|
| 2012 | J | jnl |
CoRR
|
| 2012 | A* | conf |
FOCS
|
| 2012 | — | conf |
APPROX-RANDOM
|
| 2012 | J | jnl |
J. Parallel Distributed Comput.
|
| 2012 | C | conf |
WABI
|
| 2012 | A* | conf |
SIGMETRICS
|
| 2012 | — | conf |
ICALP (1)
|
| 2012 | J | jnl |
Theory Comput.
|
| 2012 | J | jnl |
Networks
|
| 2011 | J | jnl |
ACM Trans. Algorithms
|
| 2011 | J | jnl |
Algorithmica
|
| 2011 | A* | conf |
SODA
|
| 2011 | — | conf |
ISWC (1)
|
| 2011 | J | jnl |
Comput. Geom.
|
| 2011 | J | jnl |
ACM Trans. Algorithms
|
| 2010 | J | jnl |
ACM Trans. Algorithms
|
| 2010 | J | jnl |
Algorithmica
|
| 2010 | B | conf |
RECOMB
|
| 2010 | — | conf |
Scheduling
|
| 2010 | A* | conf |
SODA
|
| 2010 | B | conf |
New Models and Algorithms for Throughput Maximization in Broadcast Scheduling - (Extended Abstract).
WAOA
|
| 2010 | A* | conf |
INFOCOM
|
| 2010 | J | jnl |
SIGACT News
|
| 2009 | J | jnl |
ACM Trans. Algorithms
|
| 2009 | J | jnl |
CoRR
|
| 2009 | A* | conf |
ICDE
|
| 2009 | J | jnl |
CoRR
|
| 2009 | — | conf |
ICALP (1)
|
| 2009 | A | conf |
IPDPS
|
| 2009 | — | conf |
KDD Workshop on Data Mining and Audience Intelligence for Advertising
|
| 2008 | A | conf |
ESA
|
| 2008 | — | ch. |
Encyclopedia of Algorithms
|
| 2008 | A* | conf |
SODA
|
| 2008 | J | jnl |
IEEE Trans. Mob. Comput.
|
| 2008 | B | conf |
LATIN
|
| 2008 | — | ch. |
Encyclopedia of Algorithms
|
| 2008 | — | conf |
APPROX-RANDOM
|
| 2007 | J | jnl |
Algorithmica
|
| 2007 | — | ch. |
Handbook of Parallel Computing
|
| 2007 | J | jnl |
Ann. Math. Artif. Intell.
|
| 2007 | — | conf |
SUM
|
| 2007 | — | ch. |
Handbook of Approximation Algorithms and Metaheuristics
|
| 2007 | J | jnl |
Comput. Networks
|
| 2007 | J | jnl |
SIGACT News
|
| 2007 | J | jnl |
ACM Trans. Algorithms
|
| 2007 | A | conf |
ESA
|
| 2006 | A* | conf |
SODA
|
| 2006 | A* | conf |
PODS
|
| 2006 | J | jnl |
J. Algorithms
|
| 2006 | J | jnl |
J. Comput. Syst. Sci.
|
| 2006 | J | jnl |
Discret. Event Dyn. Syst.
|
| 2006 | J | jnl |
Networks
|
| 2006 | J | jnl |
Algorithmica
|
| 2006 | J | jnl |
J. ACM
|
| 2006 | A | conf |
ALENEX
|
| 2006 | — | conf |
APPROX-RANDOM
|
| 2006 | J | jnl |
Comput. Networks
|
| 2006 | J | jnl |
J. Algorithms
|
| 2006 | J | jnl |
ACM Trans. Algorithms
|
| 2006 | B | conf |
EDBT
|
| 2006 | A* | conf |
INFOCOM
|
| 2005 | B | conf |
SPAA
|
| 2005 | J | jnl |
SIGACT News
|
| 2005 | A | conf |
ESA
|
| 2005 | J | jnl |
ACM Trans. Algorithms
|
| 2004 | J | jnl |
IEEE J. Sel. Areas Commun.
|
| 2004 | J | jnl |
SIAM J. Comput.
|
| 2004 | J | jnl |
Algorithmica
|
| 2004 | — | conf |
APPROX-RANDOM
|
| 2004 | J | jnl |
J. Algorithms
|
| 2004 | A | conf |
ESA
|
| 2004 | J | jnl |
Oper. Res. Lett.
|
| 2004 | J | jnl |
Algorithmica
|
| 2004 | A* | conf |
SODA
|
| 2003 | — | conf |
FSTTCS
|
| 2003 | A* | conf |
PODS
|
| 2003 | A* | conf |
ICALP
|
| 2003 | — | conf |
RANDOM-APPROX
|
| 2003 | J | jnl |
Commun. ACM
|
| 2003 | J | jnl |
J. Algorithms
|
| 2003 | A* | conf |
INFOCOM
|
| 2003 | A* | conf |
INFOCOM
|
| 2003 | A | conf |
ESA
|
| 2003 | J | jnl |
SIAM J. Comput.
|
| 2002 | J | jnl |
CoRR
|
| 2002 | J | jnl |
CoRR
|
| 2002 | J | jnl |
SIGMETRICS Perform. Evaluation Rev.
|
| 2002 | J | jnl |
SIGACT News
|
| 2002 | B | conf |
IPCO
|
| 2002 | J | jnl |
CoRR
|
| 2002 | J | jnl |
CoRR
|
| 2002 | A* | conf |
SODA
|
| 2002 | A* | conf |
FOCS
|
| 2002 | J | jnl |
CoRR
|
| 2002 | J | jnl |
CoRR
|
| 2002 | J | jnl |
CoRR
|
| 2002 | A* | conf |
SODA
|
| 2002 | — | conf |
DG.O
|
| 2002 | J | jnl |
Inf. Process. Lett.
|
| 2001 | A* | conf |
INFOCOM
|
| 2001 | J | jnl |
SIGACT News
|
| 2001 | J | jnl |
SIAM J. Comput.
|
| 2001 | A* | conf |
SODA
|
| 2001 | A* | conf |
ICALP
|
| 2001 | J | jnl |
Math. Soc. Sci.
|
| 2001 | J | jnl |
J. Algorithms
|
| 2000 | J | jnl |
Inf. Process. Lett.
|
| 2000 | — | ed. |
APPROX
|
| 2000 | J | jnl |
Algorithmica
|
| 2000 | A* | conf |
SODA
|
| 2000 | J | jnl |
SIGMETRICS Perform. Evaluation Rev.
|
| 2000 | J | jnl |
Discret. Appl. Math.
|
| 2000 | J | jnl |
Theor. Comput. Sci.
|
| 2000 | A* | conf |
SODA
|
| 2000 | J | jnl |
SIAM J. Discret. Math.
|
| 2000 | J | jnl |
J. Algorithms
|
| 2000 | J | jnl |
Networks
|
| 1999 | A* | conf |
SODA
|
| 1999 | — | ch. |
Algorithms and Theory of Computation Handbook
|
| 1999 | J | jnl |
Inf. Process. Lett.
|
| 1999 | J | jnl |
J. Algorithms
|
| 1999 | — | ch. |
Algorithms and Theory of Computation Handbook
|
| 1999 | J | jnl |
J. Algorithms
|
| 1999 | J | jnl |
Inf. Comput.
|
| 1999 | J | jnl |
J. Algorithms
|
| 1999 | J | jnl |
SIGACT News
|
| 1999 | J | jnl |
Inf. Process. Lett.
|
| 1999 | A* | conf |
SODA
|
| 1998 | A* | conf |
STOC
|
| 1998 | J | jnl |
Algorithmica
|
| 1998 | — | conf |
FSTTCS
|
| 1998 | J | jnl |
SIGACT News
|
| 1998 | — | conf |
SWAT
|
| 1998 | J | jnl |
J. Comb. Optim.
|
| 1998 | J | jnl |
IEEE Trans. Syst. Man Cybern. Part C
|
| 1998 | A* | conf |
SODA
|
| 1998 | — | conf |
FSTTCS
|
| 1998 | J | jnl |
SIGACT News
|
| 1998 | J | jnl |
J. Algorithms
|
| 1997 | J | jnl |
J. Algorithms
|
| 1997 | — | conf |
Network Design: Connectivity and Facilities Location
|
| 1997 | C | conf |
CIAC
|
| 1997 | — | ch. |
The Computer Science and Engineering Handbook
|
| 1997 | J | jnl |
SIGACT News
|
| 1997 | J | jnl |
J. Algorithms
|
| 1996 | B | conf |
IPCO
|
| 1996 | A | conf |
ESA
|
| 1996 | J | jnl |
ACM Comput. Surv.
|
| 1996 | J | jnl |
J. Algorithms
|
| 1996 | J | jnl |
Discret. Appl. Math.
|
| 1996 | J | jnl |
SIAM J. Comput.
|
| 1996 | J | jnl |
Discret. Appl. Math.
|
| 1996 | J | jnl |
SIGACT News
|
| 1996 | J | jnl |
SIGACT News
|
| 1996 | A | conf |
ESA
|
| 1995 | J | jnl |
Inf. Comput.
|
| 1995 | J | jnl |
SIAM J. Comput.
|
| 1995 | J | jnl |
Algorithmica
|
| 1995 | J | jnl |
J. Algorithms
|
| 1995 | A* | conf |
ICALP
|
| 1995 | A* | conf |
STOC
|
| 1995 | J | jnl |
SIGACT News
|
| 1995 | A* | conf |
FOCS
|
| 1994 | J | jnl |
J. Algorithms
|
| 1994 | A* | conf |
SODA
|
| 1994 | J | jnl |
J. ACM
|
| 1994 | J | jnl |
Inf. Process. Lett.
|
| 1994 | J | jnl |
Algorithmica
|
| 1994 | A* | conf |
STOC
|
| 1994 | J | jnl |
Inf. Process. Lett.
|
| 1994 | J | jnl |
Theor. Comput. Sci.
|
| 1993 | B | conf |
IPCO
|
| 1993 | J | jnl |
J. Algorithms
|
| 1993 | A* | conf |
SODA
|
| 1993 | B | conf |
WADS
|
| 1993 | J | jnl |
Algorithmica
|
| 1993 | J | jnl |
SIAM J. Discret. Math.
|
| 1992 | A* | conf |
ICALP
|
| 1992 | A* | conf |
STOC
|
| 1992 | A* | conf |
FOCS
|
| 1992 | J | jnl |
Inf. Process. Lett.
|
| 1992 | J | jnl |
SIAM J. Comput.
|
| 1991 | J | jnl |
SIAM J. Comput.
|
| 1991 | — | conf |
Planar Graphs
|
| 1991 | B | conf |
WADS
|
| 1991 | A* | conf |
ICALP
|
| 1991 | J | jnl |
Theor. Comput. Sci.
|
| 1990 | J | jnl |
Inf. Process. Lett.
|
| 1990 | — | — |
Efficient Parallel Algorithms for Disjoint Paths and Connectivity.
|
| 1990 | J | jnl |
Inf. Comput.
|
| 1990 | B | conf |
IPCO
|
| 1990 | J | jnl |
Inf. Process. Lett.
|
| 1990 | J | jnl |
SIGACT News
|
| 1989 | A* | conf |
FOCS
|
| 1989 | J | jnl |
Inf. Process. Lett.
|
| 1989 | J | jnl |
SIGACT News
|
| 1989 | B | conf |
WADS
|
| 1989 | A* | conf |
FOCS
|
| 1988 | — | conf |
FSTTCS
|