The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Peter Horák: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  28. Enumerating and decoding perfect linear Lee codes. [Citation Graph (, )][DBLP]


  29. On complexity of round transformations. [Citation Graph (, )][DBLP]


  30. On perfect Lee codes. [Citation Graph (, )][DBLP]


  31. Preface. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002