Jan Kratochvíl

1. KRATOCHVÍL, Jan (gostujoči urednik). Second workshop on graph classes, optimization, and width parameters. Amsterdam: Elsevier, 2009. Str. 2575-2762. Discrete applied mathematics, Vol. 157, iss. 12. ISSN 0166-218X. http://www.sciencedirect.com/science/journal/0166218X. [COBISS.SI-ID 15217753]

2. KRATOCHVÍL, Jan (urednik), NEŠETŘIL, Jaroslav (urednik), RYJÁČEK, Zdeněk (urednik). Sixth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications : Prague, Czech republic, July 10-15, 2006. Amsterdam: Elsevier, 2010. 299 str. Discrete mathematics, Vol. 310, Issues 3. ISSN 0012-365X. [COBISS.SI-ID 2048275219]

3. HORVAT, Boris, KRATOCHVÍL, Jan, PISANSKI, Tomaž. On the computational complexity of degenerate unit distance representations of graphs. V: ILIOPOULOS, Costas S. (ur.), SMYTH, Bill (ur.). Combinatorial algorithms : 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010 : revised selected papers. 21st International Workshop on Combinatorial Algoriths, IWOCA 2010, London, UK, July 26-28, 2010. Berlin: Springer, 2011. Str. 274-285. Lecture notes in computer science, 6460. ISBN 978-3-642-19221-0. ISSN 0302-9743. http://dx.doi.org/10.1007/978-3-642-19222-7_28. [COBISS.SI-ID 15878745]

4. HEGGERNES, Pinar (gostujoči urednik), KRATOCHVÍL, Jan (gostujoči urednik), PROSKUROWSKI, Andrzej (gostujoči urednik). Forth workshop on graph classes, optimization, and width parameters. Amsterdam: Elsevier, 2012. str. 683-924. Discrete applied mathematics, Vol. 160, iss. 6. ISSN 0166-218X. http://www.sciencedirect.com/science/journal/0166218X, Repozitorij Univerze na Primorskem - RUP. [COBISS.SI-ID 1024418644]