Zobrazeno 1 - 10
of 82
pro vyhledávání: '"Jiří Fiala"'
Publikováno v:
Acta Universitatis Agriculturae et Silviculturae Mendelianae Brunensis, Vol 55, Iss 1, Pp 111-116 (2007)
The experimental rearing of tench (Tinca tinca) juveniles of two size classes with initial individual weight of 0.8 and 1.2 g was performed into flow-through aquaria connected to recirculation system during a period of 63 days. Three feeds (KARPICO S
Externí odkaz:
https://doaj.org/article/4cf0db2ac0234643b1a2fe4a085f0cb9
Autor:
Jiří Fiala
Publikováno v:
Slavica litteraria. :145-154
Inspirace lidovou písní v básnické sbírce Jana Nerudy Písně kosmické vzbuzuje otázku, do jaké míry se "kosmické motivy“ reflektují v písňovém fokloru. Materiálovou základnu jsme omezili z prostorových důvodů na texty moravskýc
Autor:
Jiří Fiala
Publikováno v:
Slavica litteraria. :161-165
Publikováno v:
International Journal of Computational Geometry & Applications. 31:141-162
The edge-length ratio of a planar straight-line drawing of a graph is the maximum ratio between the lengths of any two of its edges. When the edges to be considered in the ratio are required to be adjacent, the ratio is called local edge-length ratio
Publikováno v:
Graph-Theoretic Concepts in Computer Science ISBN: 9783031159138
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4ad100e25544759787a05cfd05d94367
https://doi.org/10.1007/978-3-031-15914-5_17
https://doi.org/10.1007/978-3-031-15914-5_17
Publikováno v:
European Journal of Combinatorics. 73:170-210
A graph $G$ covers a graph $H$ if there exists a locally bijective homomorphism from $G$ to $H$. We deal with regular coverings in which this homomorphism is prescribed by an action of a semiregular subgroup $\Gamma$ of $\textrm{Aut}(G)$; so $H \cong
Publikováno v:
Discrete Applied Mathematics. 248:46-55
We rephrase the Distance labeling problem as a specific uniform variant of the Channel Assignment problem and show that the latter one is fixed parameter tractable when parameterized by the neighborhood diversity together with the largest weight. Con
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030687656
Graph Drawing
Graph Drawing
We study planar straight-line drawings of graphs that minimize the ratio between the length of the longest and the shortest edge. We answer a question of Lazard et al. [Theor. Comput. Sci. 770 (2019), 88–94] and, for any given constant r, we provid
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::52ccfac05c2c07c705eea8070f92e059
http://hdl.handle.net/11391/1488380
http://hdl.handle.net/11391/1488380
Autor:
Jiří Fiala
Publikováno v:
Bohemica Olomucensia. 10:144-159
Autor:
Jiří Fiala
Publikováno v:
Acta Musei Nationalis Pragae – Historia litterarum. 62:65-71
On the Christmas Eve of 1844, the master shoemaker Carl Ertel in Přibor murdered his wife and his three children by slitting their throats, after which he attempted suicide in the same way and died of his injuries on 31 December of the same year. Th