2009 |
28 | EE | Bader F. AlBdaiwi,
Peter Horák,
Lorenzo Milazzo:
Enumerating and decoding perfect linear Lee codes.
Des. Codes Cryptography 52(2): 155-162 (2009) |
2006 |
27 | EE | Peter Horák,
Bader F. AlBdaiwi:
Fast decoding of quasi-perfect Lee distance codes.
Des. Codes Cryptography 40(3): 357-367 (2006) |
2005 |
26 | EE | Peter Horák:
On the chromatic number of Steiner triple systems of order 25.
Discrete Mathematics 299(1-3): 120-128 (2005) |
25 | EE | Peter Horák,
Alexander Rosa:
Extended Petersen graphs.
Discrete Mathematics 299(1-3): 129-140 (2005) |
24 | EE | Peter Horák,
Tomás Kaiser,
Moshe Rosenfeld,
Zdenek Ryjácek:
The Prism Over the Middle-levels Graph is Hamiltonian.
Order 22(1): 73-81 (2005) |
2004 |
23 | EE | Otokar Grosek,
Peter Horák,
Tran van Trung:
On Non-Polynomial Latin Squares.
Des. Codes Cryptography 32(1-3): 217-226 (2004) |
22 | EE | Peter Horák,
Roman Nedela,
Alexander Rosa:
The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors.
Discrete Mathematics 284(1-3): 181-188 (2004) |
2002 |
21 | | Ljiljana Brankovic,
Peter Horák,
Mirka Miller,
Alexander Rosa:
Premature partial latin squares.
Ars Comb. 63: (2002) |
2001 |
20 | | Peter Horák,
Edward Bertram,
S. Mohammed:
Small 2-factors of Bipartite Graphs.
Ars Comb. 58: (2001) |
2000 |
19 | | Elias Dahlhaus,
Peter Horák,
Mirka Miller,
Joseph F. Ryan:
The train marshalling problem.
Discrete Applied Mathematics 103(1-3): 41-54 (2000) |
18 | EE | Pavol Gvozdjak,
Peter Horák,
Mariusz Meszka,
Zdzislaw Skupien:
On the Strong Chromatic Index of Cyclic Multigraphs.
Discrete Applied Mathematics 99(1-3): 23-38 (2000) |
17 | EE | Peter Horák,
Ladislav Stacho:
A lower bound on the number of hamiltonian cycles.
Discrete Mathematics 222(1-3): 275-280 (2000) |
16 | EE | Ljiljana Brankovic,
Peter Horák,
Mirka Miller:
An Optimization Problem in Statistical Databases.
SIAM J. Discrete Math. 13(3): 346-353 (2000) |
1999 |
15 | EE | Peter Horák,
Ljiljana Brankovic,
Mirka Miller:
A Combinatorial Problem in Database Security.
Discrete Applied Mathematics 91(1-3): 119-126 (1999) |
1997 |
14 | EE | Ljiljana Brankovic,
Peter Horák,
Mirka Miller,
Graham Wrightson:
Usability of Compromise-Free Statistical Databases
SSDBM 1997: 144-154 |
13 | | Peter Horák,
Nicholas C. K. Phillips,
Walter D. Wallis,
Joseph L. Yucas:
Counting frequencies of configurations in Steiner Triple Systems.
Ars Comb. 46: (1997) |
12 | | Peter Horák,
Alexander Rosa,
Jozef Sirán:
Maximal Orthogonal Latin Rectangles.
Ars Comb. 47: (1997) |
11 | EE | Anton Cerný,
Peter Horák,
Walter D. Wallis:
Kirkman's school projects.
Discrete Mathematics 167-168: 189-196 (1997) |
10 | EE | Edward Bertram,
Peter Horák:
Decomposing 4-Regular Graphs into Triangle-Free 2-Factors.
SIAM J. Discrete Math. 10(2): 309-317 (1997) |
1995 |
9 | | Richard A. Brualdi,
Gena Hahn,
Peter Horák,
Earl S. Kramer,
Stephen Mellendorf,
Dale M. Mesner:
On a Matrix Partition Conjecture.
J. Comb. Theory, Ser. A 69(2): 333-346 (1995) |
1993 |
8 | EE | Peter Horák,
Zsolt Tuza:
Large s-representable set systems with low maximum degree.
Discrete Mathematics 122(1-3): 205-217 (1993) |
1991 |
7 | EE | Peter Horák:
Extending partial systems of distinct representatives.
Discrete Mathematics 91(1): 95-98 (1991) |
1990 |
6 | EE | Peter Horák,
Jozef Sirán:
Solution of two problems of P. Erdös concerning Hamiltonian cycles.
Discrete Mathematics 84(1): 23-29 (1990) |
5 | EE | Peter Horák:
A coloring problem related to the Erdös-Faber-Lovász conjecture.
J. Comb. Theory, Ser. B 50(2): 321-322 (1990) |
1989 |
4 | EE | Katherine Heinrich,
Peter Horák,
Alexander Rosa:
On Alspach's conjecture.
Discrete Mathematics 77(1-3): 97-121 (1989) |
1988 |
3 | EE | Peter Horák:
Subgraphs intersecting any hamiltonian cycle.
J. Comb. Theory, Ser. B 44(1): 75-86 (1988) |
1987 |
2 | EE | Jozef Sirán,
Peter Horák:
A construction of thickness-minimal graphs.
Discrete Mathematics 64(2-3): 263-268 (1987) |
1982 |
1 | | Peter Horák:
Latin Parallelepipeds and Cubes.
J. Comb. Theory, Ser. A 33(2): 213-214 (1982) |