Selected Publications

with Ivan Havel, Jean-Marie Laborde, and Petr Liebl: Generalized hypercubes and graph embeddings with dilation, Rostock. Math. Kolloq. 39 (1990), 13-20 [Zblatt]

On k-connected subgraphs of the hypercube, Ann. Discrete Math. 51 (1992), 63-67 [doi]

On some conjectures on the chromatic index of hypergraphs. Math. Dept., University of South Carolina, Columbia, SC, 1993.

with Ivan Havel and Petr Liebl: Euler cycles in the complete graph K_2m+1, Discrete Math. 171 (1997), 89-102 [doi]

with Ivan Havel, Jean-Marie Laborde, and Michel Mollard: Spanning caterpillars of a hypercube, J. Graph Theory 24 (1997), 9-19 [doi]

with Ivan Havel and Petr Liebl: Euler cycles in the complete graph K_2m plus perfect matching, Eur. J. Comb. 20 (1999), 227-232 [doi]

Chromatic index of hypergraphs and Shannon's theorem, Eur. J. Comb. 21 (2000), 585-591 [doi]

with Ivan Havel and Michel Mollard: On paths and cycles dominating hypercubes, Discrete Math. 262 (2003), 121-129 [doi]

Hamiltonian cycles with prescribed edges in hypercubes, SIAM J. Discrete Math. 19 (2005), 135-144 [doi]

with Petr Gregor and Václav Koubek: Spanning paths in hypercubes, Discrete Math. Theor. Comput. Sci. AE (2005), 363-368 [html]

with Petr Gregor: Hamiltonian paths with prescribed edges in hypercubes, Discrete Math. 307 (2007), 1982-1998 [doi]

Dense sets and embedding binary trees into hypercubes, Discrete Appl. Math. 155 (2007), 506-514 [doi]

with Petr Gregor: Hamiltonian fault-tolerance of hypercubes, Electron. Notes Discrete Math. 29 (2007), 471-477 [doi]

with Petr Gregor: Partitions of faulty hypercubes into paths with prescribed endvertices, SIAM J. Discrete Math. 22 (2008), 1448-1461 [doi]

with Petr Gregor: Path partitions of hypercubes , Inf. Process. Lett. 108 (2008), 402-406 [doi]

with Martin Senft: Sliding CDAWG perfection, Lect. Notes Comput. Sci. 5280 (2008), 109-120 [doi]

with Darko Dimitrov, Petr Gregor, and Riste Škrekovski: Gray codes avoiding matchings, Discrete Math. Theor. Comput. Sci. 11 (2009), 123-148 [html]

with Václav Koubek: Long paths in hypercubes with a quadratic number of faults, Inf. Sci. 179 (2009), 3763-3771 [doi]

with Darko Dimitrov, Petr Gregor, and Riste Škrekovski: Gray code compression, Lect. Notes Comput. Sci. 5874 (2009), 183–193 [doi]

with Jiří Fink, Petr Gregor, and Václav Koubek: Long paths and cycles in faulty hypercubes: existence, optimality, complexity, Electron. Notes Discrete Math. 34 (2009), 35-39 [doi]

with Václav Koubek: Computational complexity of long paths and cycles in faulty hypercubes, Theor. Comput. Sci. 411 (2010), 3774-3786 [doi]

with Jiří Fink, Petr Gregor, Václav Koubek, and Tomasz Radzik: Efficient connectivity testing of hypercubic networks with faults, Lect. Notes Comput. Sci. 6460 (2011), 181-191 [doi]

with Martin Senft: On-line suffix tree construction with reduced branching, J. Discrete Algorithms 12 (2012), 48-60 [doi]

with Jiří Fink, Petr Gregor, Václav Koubek, and Tomasz Radzik: Testing connectivity of faulty networks in sublinear time, J. Discrete Algorithms 14 (2012) 223–231 [doi]

with Jiří Fink, Petr Gregor, and Václav Koubek: Gray codes with bounded weights, Discrete Math. 312 (2012), 2599–2611 [doi]

with Darko Dimitrov, Petr Gregor, and Riste Škrekovski: Linear time construction of a compressed Gray code, Eur. J. Comb. (2012) [doi]

[Home Page] [KSVI]