default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJirí Fink
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c2]Jirí Fink
, Torsten Mütze:
Matchings in Hypercubes Extend to Long Cycles. IWOCA 2024: 14-27- 2021
- [j19]Jirí Fink, Johann L. Hurink:
Greedy algorithm for local heating problem. Discret. Optim. 39: 100627 (2021) - [j18]Jirí Fink, Martin Loebl, Petra Pelikánová:
Arc-routing for winter road maintenance. Discret. Optim. 41: 100644 (2021) - 2020
- [j17]Jirí Fink:
Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle. Eur. J. Comb. 88: 103111 (2020) - [i4]Jirí Fink, Johann L. Hurink:
A Greedy algorithm for local heating. CoRR abs/2001.08409 (2020) - [i3]Jirí Fink, Martin Loebl:
Arc-routing for winter road maintenance. CoRR abs/2001.08416 (2020) - [i2]Jirí Fink:
Approximation algorithms for scheduling a group of heat pumps. CoRR abs/2001.08632 (2020) - [i1]Jirí Fink, Martin Loebl, Petra Pelikánová:
A New Arc-Routing Algorithm Applied to Winter Road Maintenance. CoRR abs/2001.10828 (2020)
2010 – 2019
- 2019
- [j16]Jirí Fink:
Matchings Extend into 2-Factors in Hypercubes. Comb. 39(1): 77-84 (2019) - [j15]Tomás Dvorák, Jirí Fink:
Gray codes extending quadratic matchings. J. Graph Theory 90(2): 123-136 (2019) - 2017
- [j14]Jirí Fink, Tomás Dvorák, Petr Gregor, Tomás Novotný:
Towards a problem of Ruskey and Savage on matching extendability. Electron. Notes Discret. Math. 61: 437-443 (2017) - 2015
- [j13]Jirí Fink, Johann L. Hurink:
Minimizing costs is easier than minimizing peaks when supplying the heat demand of a group of houses. Eur. J. Oper. Res. 242(2): 644-650 (2015) - 2014
- [j12]Jirí Fink, Petr Gregor:
Linear extension diameter of level induced subposets of the Boolean lattice. Eur. J. Comb. 35: 221-231 (2014) - 2012
- [j11]Jirí Fink, Borut Luzar, Riste Skrekovski:
Some remarks on inverse Wiener index problem. Discret. Appl. Math. 160(12): 1851-1858 (2012) - [j10]Tomás Dvorák, Jirí Fink, Petr Gregor, Václav Koubek:
Gray codes with bounded weights. Discret. Math. 312(17): 2599-2611 (2012) - [j9]Jirí Fink, Petr Gregor:
Long cycles in hypercubes with optimal number of faulty vertices. J. Comb. Optim. 24(3): 240-265 (2012) - [j8]Tomás Dvorák, Jirí Fink, Petr Gregor, Václav Koubek, Tomasz Radzik:
Testing connectivity of faulty networks in sublinear time. J. Discrete Algorithms 14: 223-231 (2012) - 2011
- [j7]Jirí Fink, Petr Gregor:
Linear extension diameter of subposets of Boolean lattice induced by two levels. Electron. Notes Discret. Math. 38: 337-342 (2011) - 2010
- [c1]Tomás Dvorák, Jirí Fink, Petr Gregor, Václav Koubek, Tomasz Radzik:
Efficient Connectivity Testing of Hypercubic Networks with Faults. IWOCA 2010: 181-191
2000 – 2009
- 2009
- [j6]Jirí Fink:
Matching graphs of hypercubes and complete bipartite graphs. Eur. J. Comb. 30(7): 1624-1629 (2009) - [j5]Tomás Dvorák, Jirí Fink, Petr Gregor, Václav Koubek:
Long paths and cycles in faulty hypercubes: existence, optimality, complexity. Electron. Notes Discret. Math. 34: 35-39 (2009) - [j4]Jirí Fink, Petr Gregor:
Long paths and cycles in hypercubes with faulty vertices. Inf. Sci. 179(20): 3634-3644 (2009) - [j3]Jirí Fink:
Connectivity of Matching Graph of Hypercube. SIAM J. Discret. Math. 23(2): 1100-1109 (2009) - 2007
- [j2]Jirí Fink:
Matching graphs of Hypercubes and Complete Bipartite Graphs. Electron. Notes Discret. Math. 29: 345-351 (2007) - [j1]Jirí Fink:
Perfect matchings extend to Hamilton cycles in hypercubes. J. Comb. Theory B 97(6): 1074-1076 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
