Peter Horák

Orcid: 0000-0003-4536-9306

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

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Alignment Properties of Finite-Size and Non-Spherical Optical Microresonators.
Proceedings of the 24th International Conference on Transparent Optical Networks, 2024

2023
On the Maximum Size of a Prefix Code.
IEEE Trans. Inf. Theory, May, 2023

CIViCdb 2022: evolution of an open-access cancer variant interpretation knowledgebase.
Nucleic Acids Res., January, 2023

2022
Connected cubic graphs with the maximum number of perfect matchings.
J. Graph Theory, 2022

2021
Characterization of Basic 5-Value Spectrum Functions Through Walsh-Hadamard Transform.
IEEE Trans. Inf. Theory, 2021

A Cipher Based on Prefix Codes.
Sensors, 2021

2020
An Approach To Creating A Simple Digital Twin For Optimizing A Small Electric Concept Vehicle Drivetrain.
Proceedings of the 34th International ECMS Conference on Modelling and Simulation, 2020

2019
Ultra-Broadband Bragg Scattering Four Wave Mixing in Silicon Rich Silicon Nitride Waveguides.
Proceedings of the Optical Fiber Communications Conference and Exhibition, 2019

Channel Selective Wavelength Conversion by Means of Inter Modal Four Wave Mixing.
Proceedings of the Optical Fiber Communications Conference and Exhibition, 2019

Finding Options Beyond Standard of Care in Oncology: A Proposal for Workflows Utilizing Knowledge Databases.
Proceedings of the MEDINFO 2019: Health and Wellbeing e-Networks for All, 2019

Tilted Bragg Gratings as an Efficient Platform for Integrated Multimode Interference Devices.
Proceedings of the 21st International Conference on Transparent Optical Networks, 2019

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

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

Multi-Band Nonlinear Schrödinger Equation for Efficient Simulation of Parametric Optical Amplifiers and Oscillators.
Proceedings of the 2018 20th International Conference on Transparent Optical Networks (ICTON), 2018

Broadband Study of Inter-Modal Bragg Scattering Four Wave Mixing in Multi-Mode Fibres.
Proceedings of the European Conference on Optical Communication, 2018

2017
On a mnemonic construction of permutations.
J. Math. Cryptol., 2017

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

Hollow core fibres and their applications.
Proceedings of the Optical Fiber Communications Conference and Exhibition, 2017

C- to L-band wavelength conversion enabled by parametric processes in a few mode fiber.
Proceedings of the Optical Fiber Communications Conference and Exhibition, 2017

Polarization Insensitive Wavelength Conversion in a Few Mode Fibre.
Proceedings of the European Conference on Optical Communication, 2017

Novel Fiber Design for Wideband Conversion and Amplification in Multimode Fibers.
Proceedings of the European Conference on Optical Communication, 2017

2016
Four-wave-mixing enhancement in optical microfibers.
Proceedings of the Optical Fiber Communications Conference and Exhibition, 2016

Optimising fibre-tip microcavities with Gaussian-shaped mirrors for quantum networks.
Proceedings of the 18th International Conference on Transparent Optical Networks, 2016

2015
Partitioning ℝ<sup><i>n</i></sup> into Connected Components.
Am. Math. Mon., 2015

An application of Combinatorics in Cryptography.
Electron. Notes Discret. Math., 2015

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

Development of Indium Phosphide MEMS for tunable optical buffering.
Proceedings of the 17th International Conference on Transparent Optical Networks, 2015

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

On graphs with many cycles.
Discret. Math., 2014

Tiling R 5 by Crosses.
Discret. Comput. Geom., 2014

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

Electrical current-driven dual-core optical fiber with embedded metal electrodes.
Proceedings of the Optical Fiber Communications Conference and Exhibition, 2014

An optical phase quantiser exhibiting suppressed phase dependent gain variation.
Proceedings of the Optical Fiber Communications Conference and Exhibition, 2014

Mechanical actuation of reconfigurable optical fibres.
Proceedings of the 16th International Conference on Transparent Optical Networks, 2014

Efficient binary phase quantizer based on phase sensitive four wave mixing.
Proceedings of the European Conference on Optical Communication, 2014

2013
Nanomechanical functionality of dual-core fibres.
Proceedings of the 2013 Optical Fiber Communication Conference and Exposition and the National Fiber Optic Engineers Conference (OFC/NFOEC), 2013

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

Non-periodic Tilings of ℝ n by Crosses.
Discret. Comput. Geom., 2012

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

A Tiling Paradox
CoRR, 2012

Towards a Solution of the Golomb-Welch Conjecture ?
CoRR, 2012

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

2009
Preface.
Discret. Math., 2009

On perfect Lee codes.
Discret. Math., 2009

On complexity of round transformations.
Discret. Math., 2009

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

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

2008
Equitable Specialized Block-Colourings for Steiner Triple Systems.
Graphs Comb., 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.
Discret. Math., 2005

On the chromatic number of Steiner triple systems of order 25.
Discret. Math., 2005

2004
The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors.
Discret. Math., 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. Discret. Math., 2000

Partitioning infinite trees.
J. Graph Theory, 2000

A lower bound on the number of hamiltonian cycles.
Discret. Math., 2000

On the Strong Chromatic Index of Cyclic Multigraphs.
Discret. Appl. Math., 2000

The train marshalling problem.
Discret. Appl. Math., 2000

1999
A Combinatorial Problem in Database Security.
Discret. Appl. Math., 1999

1998
Minimal Oriented Graphs of Diameter 2.
Graphs Comb., 1998

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

Kirkman's school projects.
Discret. Math., 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.
J. Graph Theory, 1995

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

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

1993
Induced matchings in cubic graphs.
J. Graph Theory, 1993

Large s-representable set systems with low maximum degree.
Discret. Math., 1993

1991
Extending partial systems of distinct representatives.
Discret. Math., 1991

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

Solution of two problems of P. Erdös concerning Hamiltonian cycles.
Discret. Math., 1990

1989
On Alspach's conjecture.
Discret. Math., 1989

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

1987
A construction of thickness-minimal graphs.
Discret. Math., 1987

1986
On a construction of Thomassen.
Graphs Comb., 1986

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

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


  Loading...