| Year | Rank | Type | Title / Venue / Authors |
|---|---|---|---|
| 2022 | J | jnl |
Discret. Appl. Math.
|
| 2017 | J | jnl |
Discret. Appl. Math.
|
| 2017 | J | jnl |
Discret. Appl. Math.
|
| 2015 | J | jnl |
CoRR
|
| 2015 | B | conf |
WG
|
| 2014 | J | jnl |
Discret. Appl. Math.
|
| 2013 | B | conf |
WG
|
| 2012 | J | jnl |
Graphs Comb.
|
| 2011 | J | jnl |
CoRR
|
| 2011 | J | jnl |
Discret. Appl. Math.
|
| 2011 | J | jnl |
On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two.
Discret. Math.
|
| 2010 | J | jnl |
Discret. Math.
|
| 2009 | J | jnl |
CoRR
|
| 2009 | J | jnl |
CoRR
|
| 2009 | J | jnl |
CoRR
|
| 2008 | J | jnl |
Electron. Notes Discret. Math.
|
| 2008 | J | jnl |
Ars Comb.
|
| 2008 | J | jnl |
Discret. Math.
|
| 2007 | J | jnl |
Graphs Comb.
|
| 2007 | — | conf |
CLA
|
| 2007 | J | jnl |
SIAM J. Discret. Math.
|
| 2007 | J | jnl |
Theor. Comput. Sci.
|
| 2006 | J | jnl |
Electron. Notes Discret. Math.
|
| 2005 | J | jnl |
J. Graph Theory
|
| 2004 | J | jnl |
Australas. J Comb.
|
| 2004 | A* | conf |
SODA
|
| 2003 | — | conf |
CSB
|
| 2003 | J | jnl |
Discret. Math.
|
| 2003 | J | jnl |
Discret. Appl. Math.
|
| 1999 | J | jnl |
SIAM J. Comput.
|
| 1995 | J | jnl |
J. Comb. Theory B
|
| 1993 | A* | conf |
SODA
|