Peter Horák

According to our database1, Peter Horák authored at least 55 papers between 1980 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
50 Years of the Golomb-Welch Conjecture.
IEEE Trans. Information Theory, 2018

Prospective Use of High-Refractive Index Materials for Single Molecule Detection in Flow Cytometry.
Sensors, 2018

2017
On a mnemonic construction of permutations.
J. Mathematical Cryptology, 2017

A combinatorial problem related to sparse systems of equations.
Des. Codes Cryptogr., 2017

2015
Partitioning ℝn into Connected Components.
The American Mathematical Monthly, 2015

An application of Combinatorics in Cryptography.
Electronic Notes in Discrete Mathematics, 2015

Speeding up deciphering by hypergraph ordering.
Des. Codes Cryptogr., 2015

2014
A new approach towards the Golomb-Welch conjecture.
Eur. J. Comb., 2014

On graphs with many cycles.
Discrete Mathematics, 2014

Tiling R 5 by Crosses.
Discrete & Computational Geometry, 2014

A generalization of Lee codes.
Des. Codes Cryptogr., 2014

2012
Diameter Perfect Lee Codes.
IEEE Trans. Information Theory, 2012

Non-periodic Tilings of ℝ n by Crosses.
Discrete & Computational Geometry, 2012

On quasigroups with few associative triples.
Des. Codes Cryptogr., 2012

2011
On hamiltonian cycles in the prism over the odd graphs.
Journal of Graph Theory, 2011

2009
Preface.
Discrete Mathematics, 2009

On perfect Lee codes.
Discrete Mathematics, 2009

On complexity of round transformations.
Discrete Mathematics, 2009

Enumerating and decoding perfect linear Lee codes.
Des. Codes Cryptogr., 2009

On a Problem of Marco Buratti.
Electr. J. Comb., 2009

2008
Equitable Specialized Block-Colourings for Steiner Triple Systems.
Graphs and Combinatorics, 2008

2006
Fast decoding of quasi-perfect Lee distance codes.
Des. Codes Cryptogr., 2006

2005
The Prism Over the Middle-levels Graph is Hamiltonian.
Order, 2005

Extended Petersen graphs.
Discrete Mathematics, 2005

On the chromatic number of Steiner triple systems of order 25.
Discrete Mathematics, 2005

2004
The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors.
Discrete Mathematics, 2004

On Non-Polynomial Latin Squares.
Des. Codes Cryptogr., 2004

2002
Premature partial latin squares.
Ars Comb., 2002

2001
Small 2-factors of Bipartite Graphs.
Ars Comb., 2001

2000
An Optimization Problem in Statistical Databases.
SIAM J. Discrete Math., 2000

Partitioning infinite trees.
Journal of Graph Theory, 2000

A lower bound on the number of hamiltonian cycles.
Discrete Mathematics, 2000

On the Strong Chromatic Index of Cyclic Multigraphs.
Discrete Applied Mathematics, 2000

The train marshalling problem.
Discrete Applied Mathematics, 2000

1999
A Combinatorial Problem in Database Security.
Discrete Applied Mathematics, 1999

1998
Minimal Oriented Graphs of Diameter 2.
Graphs and Combinatorics, 1998

1997
Decomposing 4-Regular Graphs into Triangle-Free 2-Factors.
SIAM J. Discrete Math., 1997

Kirkman's school projects.
Discrete Mathematics, 1997

Maximal Orthogonal Latin Rectangles.
Ars Comb., 1997

Counting frequencies of configurations in Steiner Triple Systems.
Ars Comb., 1997

Usability of Compromise-Free Statistical Databases
Proceedings of the Ninth International Conference on Scientific and Statistical Database Management, 1997

1995
Isomorphic factorizations of trees.
Journal of Graph Theory, 1995

On a Matrix Partition Conjecture.
J. Comb. Theory, Ser. A, 1995

1994
Local and global average degree in graphs and multigraphs.
Journal of Graph Theory, 1994

1993
Induced matchings in cubic graphs.
Journal of Graph Theory, 1993

Large s-representable set systems with low maximum degree.
Discrete Mathematics, 1993

1991
Extending partial systems of distinct representatives.
Discrete Mathematics, 1991

1990
A coloring problem related to the Erdös-Faber-Lovász conjecture.
J. Comb. Theory, Ser. B, 1990

Solution of two problems of P. Erdös concerning Hamiltonian cycles.
Discrete Mathematics, 1990

1989
On Alspach's conjecture.
Discrete Mathematics, 1989

1988
Subgraphs intersecting any hamiltonian cycle.
J. Comb. Theory, Ser. B, 1988

1987
A construction of thickness-minimal graphs.
Discrete Mathematics, 1987

1986
On a construction of Thomassen.
Graphs and Combinatorics, 1986

1982
Latin Parallelepipeds and Cubes.
J. Comb. Theory, Ser. A, 1982

1980
Note on a new coloring number of a graph.
Journal of Graph Theory, 1980


  Loading...