| [1] | J. Fink and P. Gregor. Long cycles in hypercubes with optimal number of faulty vertices. To appear in J. Comb. Opt., doi:10.1007/s10878-011-9379-1, 2011. [ bib | .pdf ] |
| [2] | T. Dvořák, J. Fink, P. Gregor, V. Koubek, and T. Radzik. Efficient connectivity testing of hypercubic networks with faults. Lecture notes in computer science, 6460:181-191, 2011. [ bib | .pdf ] |
| [3] | V. Andova, D. Dimitrov, J. Fink, and R. Škrekovski. Bounds on Gutman Index. Accepted, 2011. [ bib | .pdf ] |
| [4] | J. Fink. Probabilistic Methods in Discrete Applied Mathematics. PhD thesis, Department of Applied Mathematics, Charles Univesity in Prague, 2010. [ bib | .pdf ] |
| [5] | J. Fink. Towards a theory of ground state uniqueness. Submitted, 2010. [ bib | .pdf ] |
| [6] | T. Dvořák, J. Fink, P. Gregor, and V. Koubek. Gray codes with bounded weights. Submitted, 2010. [ bib | .pdf ] |
| [7] | J. Fink, B. Lužar, and R. Škrekovski. Some remarks on inverse wiener index problem. Submitted, 2010. [ bib | .pdf ] |
| [8] | T. Dvořák, J. Fink, P. Gregor, V. Koubek, and T. Radzik. Testing connectivity of faulty networks in sublinear time. Submitted, 2010. [ bib ] |
| [9] | J. Fink. Connectivity of matching graph of hypercube. SIAM J. Discrete Math, 23:1100-1109, 2009. [ bib | .pdf ] |
| [10] | J. Fink. Matching graphs of hypercubes and complete bipartite graphs. European J. Comb., 30:1624-1629, 2009. [ bib | .pdf ] |
| [11] | J. Fink and P. Gregor. Long paths and cycles in hypercubes with faulty vertices. Information Sciences, 179:3634-3644, 2009. [ bib | .pdf ] |
| [12] | T. Dvořák, J. Fink, P. Gregor, and V. Koubek. Long paths and cycles in faulty hypercubes: existence, optimality, complexity. El. Notes in Disc. Math., 34:35-39, 2009. Extended abstract on Eurocomb 2009. [ bib | .pdf ] |
| [13] | J. Fink. Perfect matchings extend to Hamilton cycles in hypercubes. J. Comb. Theory, Ser. B, 97(6):1074-1076, 2007. [ bib | .pdf ] |
| [14] | J. Fink. Optimization and statistics. Master's thesis, Department of Applied Mathematics, Charles Univesity in Prague, 2006. [ bib | .pdf ] |