Minimum Maximal Matchings in Permutahedra.

Jirí Fink https://mathscinet.ams.org/mathscinet/MRAuthorID/823154 https://mathgenealogy.org/id.php?id=178682 https://orcid.org/0000-0001-5065-1213 https://www.wikidata.org/entity/Q102414378

Sofia Brenner Jirí Fink Hung P. Hoang 0001 Arturo Merino Vincent Pilaud Minimum Maximal Matchings in Permutahedra. 2026 33 Electron. J. Comb. 2 https://doi.org/10.37236/14145 db/journals/combinatorics/combinatorics33.html#BrennerFHMP26 streams/journals/combinatorics

Stefan Edelkamp Jirí Fink Petr Gregor Anders Jonsson 0001 Bernhard Nebel Intermediate Results on the Complexity of STRIPS<sub>1</sub><sup>1</sup>. 2026 February abs/2602.08708 CoRR https://doi.org/10.48550/arXiv.2602.08708 db/journals/corr/corr2602.html#abs-2602-08708 streams/journals/corr

Sofia Brenner Jirí Fink Constant delay Gray code enumeration of ideals and antichains in posets. 2026 March abs/2603.28118 CoRR https://doi.org/10.48550/arXiv.2603.28118 db/journals/corr/corr2603.html#abs-2603-28118 streams/journals/corr

Jirí Fink Torsten Mütze Matchings in Hypercubes Extend to Long Cycles. 1826-1854 2025 39 SIAM J. Discret. Math. 3 https://doi.org/10.1137/24m1670093 db/journals/siamdm/siamdm39.html#FinkM25 streams/journals/siamdm

Jirí Fink Vojtech Hotmar Matchings with Five Directions in Hypercubes Extend to Hamilton Cycles and Paths with Prescribed Ends. 258-269 2025 WG https://doi.org/10.1007/978-3-032-11835-6_19 conf/wg/2025 db/conf/wg/wg2025.html#FinkH25 streams/conf/wg

Jirí Fink Constant time enumeration of perfect bipartite matchings. 2025 September abs/2509.16135 CoRR https://doi.org/10.48550/arXiv.2509.16135 db/journals/corr/corr2509.html#abs-2509-16135 streams/journals/corr

Jirí Fink Torsten Mütze Matchings in Hypercubes Extend to Long Cycles. 14-27 2024 IWOCA https://doi.org/10.1007/978-3-031-63021-7_2 conf/iwoca/2024 db/conf/iwoca/iwoca2024.html#FinkM24

Jirí Fink Johann L. Hurink Greedy algorithm for local heating problem. 100627 2021 39 Discret. Optim. https://doi.org/10.1016/j.disopt.2021.100627 db/journals/disopt/disopt39.html#FinkH21

Jirí Fink Martin Loebl Petra Pelikánová Arc-routing for winter road maintenance. 100644 2021 41 Discret. Optim. https://doi.org/10.1016/j.disopt.2021.100644 db/journals/disopt/disopt41.html#FinkLP21

Jirí Fink Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle. 103111 2020 88 Eur. J. Comb. https://doi.org/10.1016/j.ejc.2020.103111 db/journals/ejc/ejc88.html#Fink20

Jirí Fink Johann L. Hurink A Greedy algorithm for local heating. 2020 abs/2001.08409 CoRR https://arxiv.org/abs/2001.08409 db/journals/corr/corr2001.html#abs-2001-08409

Jirí Fink Martin Loebl Petra Pelikánová Arc-routing for winter road maintenance. 2020 abs/2001.08416 CoRR https://arxiv.org/abs/2001.08416 db/journals/corr/corr2001.html#abs-2001-08416

Jirí Fink Approximation algorithms for scheduling a group of heat pumps. 2020 abs/2001.08632 CoRR https://arxiv.org/abs/2001.08632 db/journals/corr/corr2001.html#abs-2001-08632

Jirí Fink Martin Loebl Petra Pelikánová A New Arc-Routing Algorithm Applied to Winter Road Maintenance. 2020 abs/2001.10828 CoRR https://arxiv.org/abs/2001.10828 db/journals/corr/corr2001.html#abs-2001-10828

Jirí Fink Matchings Extend into 2-Factors in Hypercubes. 77-84 2019 39 Comb. 1 https://doi.org/10.1007/s00493-017-3731-8 https://www.wikidata.org/entity/Q129718577 db/journals/combinatorica/combinatorica39.html#Fink19

Tomás Dvorák Jirí Fink Gray codes extending quadratic matchings. 123-136 2019 90 J. Graph Theory 2 https://doi.org/10.1002/jgt.22371 https://www.wikidata.org/entity/Q129605258 db/journals/jgt/jgt90.html#DvorakF19

Jirí Fink Tomás Dvorák Petr Gregor Tomás Novotný Towards a problem of Ruskey and Savage on matching extendability. 437-443 2017 61 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2017.06.071 db/journals/endm/endm61.html#FinkDGN17

Jirí Fink Johann L. Hurink Minimizing costs is easier than minimizing peaks when supplying the heat demand of a group of houses. 644-650 2015 242 Eur. J. Oper. Res. 2 https://doi.org/10.1016/j.ejor.2014.10.040 db/journals/eor/eor242.html#FinkH15

Jirí Fink Petr Gregor Linear extension diameter of level induced subposets of the Boolean lattice. 221-231 2014 35 Eur. J. Comb. https://doi.org/10.1016/j.ejc.2013.06.035 db/journals/ejc/ejc35.html#FinkG14

Jirí Fink Borut Luzar Riste Skrekovski Some remarks on inverse Wiener index problem. 1851-1858 2012 160 Discret. Appl. Math. 12 https://doi.org/10.1016/j.dam.2012.02.028 db/journals/dam/dam160.html#FinkLS12

Tomás Dvorák Jirí Fink Petr Gregor Václav Koubek Gray codes with bounded weights. 2599-2611 2012 312 Discret. Math. 17 https://doi.org/10.1016/j.disc.2011.09.034 db/journals/dm/dm312.html#DvorakFGK12

Jirí Fink Petr Gregor Long cycles in hypercubes with optimal number of faulty vertices. 240-265 2012 24 J. Comb. Optim. 3 https://doi.org/10.1007/s10878-011-9379-1 db/journals/jco/jco24.html#FinkG12

Tomás Dvorák Jirí Fink Petr Gregor Václav Koubek Tomasz Radzik Testing connectivity of faulty networks in sublinear time. 223-231 2012 14 J. Discrete Algorithms https://doi.org/10.1016/j.jda.2011.12.014 db/journals/jda/jda14.html#DvorakFGKR12

Jirí Fink Petr Gregor Linear extension diameter of subposets of Boolean lattice induced by two levels. 337-342 2011 38 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2011.09.055 db/journals/endm/endm38.html#FinkG11

Tomás Dvorák Jirí Fink Petr Gregor Václav Koubek Tomasz Radzik Efficient Connectivity Testing of Hypercubic Networks with Faults. 181-191 2010 IWOCA https://doi.org/10.1007/978-3-642-19222-7_19 conf/iwoca/2010 db/conf/iwoca/iwoca2010.html#DvorakFGKR10

Jirí Fink Matching graphs of hypercubes and complete bipartite graphs. 1624-1629 2009 30 Eur. J. Comb. 7 https://doi.org/10.1016/j.ejc.2009.03.007 db/journals/ejc/ejc30.html#Fink09

Tomás Dvorák Jirí Fink Petr Gregor Václav Koubek Long paths and cycles in faulty hypercubes: existence, optimality, complexity. 35-39 2009 34 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2009.07.006 db/journals/endm/endm34.html#DvorakFGK09

Jirí Fink Petr Gregor Long paths and cycles in hypercubes with faulty vertices. 3634-3644 2009 179 Inf. Sci. 20 https://doi.org/10.1016/j.ins.2009.06.011 db/journals/isci/isci179.html#FinkG09

Jirí Fink Connectivity of Matching Graph of Hypercube. 1100-1109 2009 23 SIAM J. Discret. Math. 2 https://doi.org/10.1137/070697288 db/journals/siamdm/siamdm23.html#Fink09

Jirí Fink Matching graphs of Hypercubes and Complete Bipartite Graphs. 345-351 2007 29 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2007.07.059 db/journals/endm/endm29.html#Fink07

Jirí Fink Perfect matchings extend to Hamilton cycles in hypercubes. 1074-1076 2007 97 J. Comb. Theory B 6 https://doi.org/10.1016/j.jctb.2007.02.007 https://www.wikidata.org/entity/Q56001801 db/journals/jct/jctb97.html#Fink07

Sofia Brenner Tomás Dvorák Stefan Edelkamp Petr Gregor Hung P. Hoang 0001 Vojtech Hotmar Johann L. Hurink Anders Jonsson 0001 Václav Koubek Martin Loebl Borut Luzar Arturo Merino Torsten Mütze Bernhard Nebel Tomás Novotný Petra Pelikánová Vincent Pilaud Tomasz Radzik Riste Skrekovski