- List coloring with requests2019 | Faculty of Mathematics and Physics
- (3a:a)-List-Colorability of Embedded Graphs of Girth at Least Five2020 | Faculty of Mathematics and Physics
- List-Coloring Squares of Sparse Subcubic Graphs2008 | Faculty of Mathematics and Physics
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 82018 | Faculty of Mathematics and Physics
- A note on Hajos' theorem for list coloring2004 | Faculty of Mathematics and Physics
- New trends in graph coloring. Choosability and list colorings1999 | Publication without faculty affiliation
- List-coloring embedded graphs2013 | Faculty of Mathematics and Physics
- Algorithmic complexity of list colorings1994 | Publication without faculty affiliation
- List colorings with measurable sets2008 | Faculty of Mathematics and Physics
- List coloring of Cartesian products of graphs2006 | Faculty of Mathematics and Physics
- Akbari, Saieed; Mirrokni, Vahab S.; Sadjad, Bashir S.: A relation between choosability and uniquely list colorability2007 | Faculty of Mathematics and Physics
- New trends in the theory of graph colorings:Choosability and list coloring1999 | Faculty of Mathematics and Physics
- List Colorings with Distinct List Sizes, the Case of Complete Bipartite Graphs2016 | Faculty of Mathematics and Physics
- Flexibility of planar graphs without 4-cycles2019 | Faculty of Mathematics and Physics
- 3-choosability of planar graphs with ({= 4)-cycles far apart2014 | Faculty of Mathematics and Physics
- 5-list-coloring planar graphs with distant precolored vertices2017 | Faculty of Mathematics and Physics
- 5-choosability of graphs with. crossings far apart2017 | Faculty of Mathematics and Physics
- 3-choosability of triangle-free planar graphs with constraints on 4-cycles2010 | Faculty of Mathematics and Physics
- Coloring graphs from lists with bounded size of their union +12005 | Faculty of Mathematics and Physics
- Workshop on Graph Colorings and their GeneralizationsPublication without faculty affiliation
- A Thomassen-type method for planar graph recoloring2021 | Faculty of Mathematics and Physics
- Choosability of Graphs with Infinite Sets of Forbidden Differences2007 | Faculty of Mathematics and Physics