Search results
- 1.0551784 - ÚI 2022 RIV CH eng C - Conference Paper (international conference)
Blažej, V. - Opler, M. - Šileikis, Matas - Valtr, P.
Non-homotopic Loops with a Bounded Number of Pairwise Intersections.
Graph Drawing and Network Visualization. 29th International Symposium GD 2021, Revised Selected Papers. Cham: Springer, 2021 - (Purchase, H.; Rutter, I.), s. 210-222. Lecture Notes in Computer Science, 12868. ISBN 978-3-030-92930-5. ISSN 0302-9743.
[GD 2021: International Symposium on Graph Drawing and Network Visualization /29./. Tübingen (DE), 14.09.2021-17.09.2021]
R&D Projects: GA ČR(CZ) GJ20-27757Y
Institutional support: RVO:67985807
Keywords : Graph drawing * Non-homotopic loops * Curve intersections * Plane
OECD category: Pure mathematics
Permanent Link: http://hdl.handle.net/11104/0327001 - 2.0539705 - ÚI 2022 RIV CH eng C - Conference Paper (international conference)
Blažej, V. - Opler, M. - Šileikis, Matas - Valtr, P.
On the Intersections of Non-homotopic Loops.
Algorithms and Discrete Applied Mathematics. Cham: Springer, 2021 - (Mudgal, A.; Subramanian, C.), s. 196-205. Lecture Notes on Computer Science, 12601. ISBN 978-3-030-67898-2. ISSN 0302-9743.
[CALDAM 2021: The International Conference on Algorithms and Discrete Applied Mathematics /7./. Rupnagar (IN), 11.02.2021-13.02.2021]
R&D Projects: GA ČR(CZ) GJ20-27757Y
Institutional support: RVO:67985807
Keywords : Graph drawing * Non-homotopic loops * Curve intersections * Plane
OECD category: Pure mathematics
https://link.springer.com/chapter/10.1007%2F978-3-030-67899-9_15
Permanent Link: http://hdl.handle.net/11104/0317418 - 3.0505191 - ÚI 2020 PL eng C - Conference Paper (international conference)
Holmgren, C. - Janson, S. - Šileikis, Matas
Using Pólya urns to show normal limit lawsfor fringe subtrees inm-ary search trees.
Proceedings of the 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2016). Kraków: Jagiellonian University, 2016 - (Neininger, R.; Zaionc, M.), č. článku 18.
[AofA 2016: International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms /27./. Kraków (PL), 04.07.2016-08.07.2016]
http://www.aofa.tcs.uj.edu.pl/proceedings/aofa2016.pdf
Permanent Link: http://hdl.handle.net/11104/0296684 - 4.0491225 - ÚI 2019 RIV DE eng C - Conference Paper (international conference)
Ralaivaosaona, D. - Šileikis, Matas - Wagner, S.
Asymptotic Normality of Almost Local Functionals in Conditioned Galton-Watson Trees.
29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018). Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, 2018 - (Ward, M.; Fill, J.), č. článku 33. Leibniz International Proceedings in Informatics, 110. ISBN 978-395977078-1. ISSN 1868-8969.
[AofA 2018: International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms /29./. Uppsala (SE), 25.06.2018-29.06.2018]
R&D Projects: GA ČR GJ16-07822Y
Institutional support: RVO:67985807
Keywords : Galton-Watson trees * central limit theorem * additive functional
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=8926
Permanent Link: http://hdl.handle.net/11104/0285264File Download Size Commentary Version Access a0491225.pdf 7 425.4 KB Publisher’s postprint open-access