| Year | Rank | Type | Title / Venue / Authors |
|---|---|---|---|
| 2006 | J | jnl |
J. Discrete Algorithms
|
| 2005 | J | jnl |
Theor. Comput. Sci.
|
| 2005 | J | jnl |
Math. Program.
|
| 2004 | J | jnl |
Theor. Comput. Sci.
|
| 2004 | J | jnl |
Mach. Learn.
|
| 2004 | J | jnl |
Theor. Comput. Sci.
|
| 2004 | J | jnl |
Theor. Comput. Sci.
|
| 2004 | J | jnl |
CoRR
|
| 2004 | J | jnl |
Theor. Comput. Sci.
|
| 2003 | J | jnl |
J. Sched.
|
| 2003 | J | jnl |
Algorithmica
|
| 2003 | J | jnl |
SIAM J. Comput.
|
| 2002 | J | jnl |
Inf. Comput.
|
| 2002 | — | conf |
SWAT
|
| 2002 | A* | conf |
ICALP
|
| 2002 | A* | conf |
SODA
|
| 2002 | J | jnl |
J. ACM
|
| 2002 | A | conf |
ESA
|
| 2002 | C | conf |
CLUSTER
|
| 2001 | A | conf |
ESA
|
| 2001 | J | jnl |
SIAM J. Discret. Math.
|
| 2001 | J | jnl |
Theor. Comput. Sci.
|
| 2001 | A | conf |
ESA
|
| 2001 | J | jnl |
SIGACT News
|
| 2001 | A* | conf |
ICALP
|
| 2001 | J | jnl |
Theor. Comput. Sci.
|
| 2000 | A* | conf |
STOC
|
| 2000 | A* | conf |
ICALP
|
| 2000 | — | conf |
APPROX
|
| 2000 | J | jnl |
Algorithmica
|
| 2000 | J | jnl |
Oper. Res. Lett.
|
| 1999 | J | jnl |
Nord. J. Comput.
|
| 1999 | A* | conf |
SODA
|
| 1999 | J | jnl |
J. Comb. Optim.
|
| 1999 | B | conf |
IPCO
|
| 1999 | J | jnl |
Inf. Comput.
|
| 1998 | J | jnl |
Theor. Comput. Sci.
|
| 1998 | — | conf |
SWAT
|
| 1998 | J | jnl |
Oper. Res. Lett.
|
| 1997 | J | jnl |
IEEE Trans. Parallel Distributed Syst.
|
| 1997 | B | conf |
WADS
|
| 1996 | J | jnl |
Minimization of Memory and Network Contention for Accessing Arbitrary Data Patterns in SIMD Systems.
IEEE Trans. Computers
|
| 1996 | J | jnl |
SIGACT News
|
| 1995 | B | conf |
WADS
|
| 1994 | J | jnl |
Inf. Process. Lett.
|
| 1993 | J | jnl |
Inf. Process. Lett.
|