| Year | Rank | Type | Title / Venue / Authors |
|---|---|---|---|
| 2018 | J | jnl |
Discret. Appl. Math.
|
| 2017 | J | jnl |
Discret. Math. Theor. Comput. Sci.
|
| 2016 | J | jnl |
Theor. Comput. Sci.
|
| 2015 | J | jnl |
CoRR
|
| 2014 | J | jnl |
SIAM J. Discret. Math.
|
| 2014 | J | jnl |
CoRR
|
| 2012 | J | jnl |
CoRR
|
| 2012 | J | jnl |
Formaliz. Math.
|
| 2011 | J | jnl |
CoRR
|
| 2011 | J | jnl |
On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two.
Discret. Math.
|
| 2011 | J | jnl |
Formaliz. Math.
|
| 2010 | J | jnl |
CoRR
|
| 2009 | B | conf |
MFCS
|
| 2009 | J | jnl |
CoRR
|
| 2009 | J | jnl |
SIAM J. Discret. Math.
|
| 2007 | J | jnl |
Discret. Math. Theor. Comput. Sci.
|
| 2007 | J | jnl |
Inf. Process. Lett.
|
| 2006 | J | jnl |
Discret. Appl. Math.
|
| 2006 | J | jnl |
SIAM J. Discret. Math.
|
| 2005 | J | jnl |
Discret. Math. Theor. Comput. Sci.
|
| 2003 | J | jnl |
Discret. Appl. Math.
|
| 2002 | J | jnl |
SIAM J. Discret. Math.
|
| 2001 | B | conf |
WG
|
| 1999 | A | conf |
STACS
|
| 1999 | J | jnl |
Electron. Notes Discret. Math.
|
| 1999 | A* | conf |
SODA
|
| 1999 | J | jnl |
SIAM J. Comput.
|
| 1998 | A* | conf |
SODA
|
| 1997 | J | jnl |
SIAM J. Discret. Math.
|
| 1997 | J | jnl |
Inf. Process. Lett.
|
| 1995 | J | jnl |
Inf. Process. Lett.
|
| 1995 | B | conf |
WADS
|
| 1995 | A* | conf |
ICALP
|
| 1994 | J | jnl |
Discret. Appl. Math.
|
| 1993 | B | conf |
WG
|
| 1993 | J | jnl |
SIAM J. Discret. Math.
|
| 1987 | J | jnl |
Discret. Appl. Math.
|
| 1985 | — | — |