Publications
Journal papers
- V. Jelínek, N. Y. Li, T. Mansour, S. H. F. Yan: Matchings
Avoiding Partial Patterns and Lattice Paths, Electronic Journal
of Combinatorics 13 (2006), #R89. (journal)
- R. Babilon, V. Jelínek, D. Kráľ, P. Valtr: Labelings of Graphs with Fixed and Variable
Edge-Weights, SIAM J. on Discrete Mathematics 21(3) (2007),
688-706. (journal)
- J. Černý, Z. Dvořák, V. Jelínek, J. Kára: Noncrossing Hamiltonian Paths in Geometric
Graphs, Discrete Applied Mathematics 155(9) (2007), 1096-1105. (journal)
- Z. Dvořák, V. Jelínek, D. Kráľ, J. Kynčl, M. Saks: Probabilistic Strategies for the Partition
and Plurality Problems, Random Structures and Algorithms 30(1-2)
(2007), 63-77. (journal)
- V. Jelínek: Dyck Paths and
Pattern-Avoiding Matchings, European Journal of Combinatorics
28(1) (2007), 202-213. (journal)
- V. Jelínek, M. Klazar: Generalizations
of Khovanskii's Theorems on the Growth of Sumsets in Abelian Semigroups,
Advances in Applied Mathematics 41(1) (2008), 115-132. (journal)
- V. Jelínek, T. Mansour: On
Pattern-Avoiding Partitions, Electronic Journal of Combinatorics
15 (2008), #R39. (journal)
- M. Dukes, V. Jelínek, T. Mansour, A. Reifegerste: New
Equivalences for Pattern Avoiding Involutions, Proceedings of
AMS 137 (2009), 457-465. (journal)
- V. Jelínek, T. Mansour: Wilf-Equivalence
on k-ary Words, Compositions, and Parking Functions, Electronic
Journal of Combinatorics 16(1) (2009), #R58. (journal)
- V. Jelínek, J. Kynčl, R. Stolař, T. Valla: Monochromatic
Triangles in Two-Colored Plane, Combinatorica 29(6) (2009),
699-718. (journal)
- V. Jelínek: The Rank-Width of
the Square Grid, Discrete Applied Mathematics 158(7) (2010),
841-850. (journal)
- V. Jelínek, T. Mansour: Matchings
and Partial Patterns, Electronic Journal of Combinatorics, 17
(2010), #R158. (journal)
- A. Claesson, V. Jelínek, E. Jelínková, S. Kitaev: Pattern Avoidance in Partial Permutations,
Electronic Journal of Combinatorics, 18(1) (2011), #P25. (journal)
- M. Dukes, V. Jelínek, M. Kubitzke: Composition Matrices, (2+2)-Free Posets and
their Specializations, Electronic Journal of Combinatorics,
18(1) (2011), #P44. (journal)
- V. Jelínek, M. Klazar: Embedding
Dualities for Set Partitions and for Relational Structures,
European Journal of Combinatorics, 32(7) (2011), 1084-1096. (preprint, journal)
- A. Burstein, V. Jelínek, E. Jelínková, E. Steingrímsson: The Möbius Function of Separable and
Decomposable Permutations, Journal of Combinatorial Theory,
Series A, 118(8) (2011), 2346-2364. (arXiv, journal)
- V. Jelínek: Counting General
and Self-Dual Interval Orders, Journal of Combinatorial Theory,
Series A, 119(3) (2012), 599-614. (arXiv, journal)
- A. Claesson, V. Jelínek, E. Steingrímsson: Upper Bounds for the Stanley-Wilf Limit of
1324 and Other Layered Patterns, Journal of Combinatorial
Theory, Series A, 119(8) (2012), 1680-1691. (arXiv, journal)
- V. Jelínek, E. Jelínková, J. Kratochvíl, B. Lidický, M.
Tesař, T. Vyskočil: The Planar Slope
Number of Planar Partial 3-Trees of Bounded Degree, Graphs and
Combinatorics, 29(4) (2013), 981-1005. (arXiv, journal)
- V. Jelínek, J. Kratochvíl, I. Rutter: A Kuratowski-Type Theorem for Planarity of
Partially Embedded Graphs, Computational Geometry - Theory and
Applications, 46(4) (2013), 466-492. (arXiv, journal)
- V. Jelínek, T. Mansour, M. Shattuck: On Multiple Pattern Avoiding Set Partitions,
Advances in Applied Mathematics, 50(2) (2013), 292-326. (arXiv, journal)
- G. E. Andrews, V. Jelínek: On
q-Series Identities Related to Interval Orders, European Journal
of Combinatorics, 39 (2014), 178-187.
(arXiv, journal)
- V. Jelínek, P. Valtr: Splittings
and Ramsey Properties of Permutation Classes, Advances in
Applied Mathematics, 63 (2015), 41-67. (arXiv, journal)
- V. Jelínek: Catalan Pairs and
Fishburn Triples, Advances in Applied Mathematics, 70 (2015),
1-31. (arXiv, journal)
- P. Angelini, G. Di Battista, F. Frati, V. Jelínek, J. Kratochvíl,
M. Patrignani, I. Rutter: Testing
Planarity of Partially Embedded Graphs, ACM Transactions on
Algorithms, 11(4) (2015), Article No. 32, 1-42. (journal)
- M. Albert, V. Jelínek: Unsplittable
Classes of Separable Permutations, Electronic Journal of
Combinatorics 23(2) (2016), #P2.49. (arXiv, journal)
- M. Balko, V. Jelínek, P. Valtr, B. Walczak: On the Beer Index of Convexity and Its
Variants, Discrete & Computational Geometry 57(1) (2017),
179-214. (arXiv, journal)
- V. Jelínek, M. Opler: Splittability
and 1-amalgamability of permutation classes,
Discrete
Mathematics & Theoretical Computer Science 19(2) (2017). (arXiv, journal)
- T. Gavenčiak, P. Gordinowicz, V. Jelínek, P. Klavík, J.
Kratochvíl: Cops and Robbers on
Intersection Graphs, European Journal of Combinatorics, 72
(2018), 45-69. (arXiv, journal)
- V. Jelínek, S. Kučera: On the structure of matrices avoiding interval-minor patterns, Advances in Applied Mathematics, 101 (2018), 70-99. (arXiv, journal)
- M. Balko, V. Jelínek, P. Valtr: On
ordered Ramsey numbers of bounded-degree graphs, Journal of
Combinatorial Theory, Series B, 134 (2019), 179-202. (arXiv, journal)
- V. Jelínek, M. Töpfer: On grounded L-graphs and their relatives, Electronic Journal of
Combinatorics, 26(3) (2019), article P3.17. (arXiv, journal)
- R. Brignall, V. Jelínek, J. Kynčl, D. Marchant: Zeros of the Möbius function of permutations, Mathematika 65(4) (2019), 1074-1092. (arXiv, journal)
- V. Jelínek, I. Kantor, J. Kynčl, M. Tancer: On the growth of the Möbius function of permutations, Journal of Combinatorial Theory, Series A, vol. 169 (2020), 105121. (arXiv, journal)
- M. Albert, V. Jelínek, M. Opler: Two examples of Wilf-collapse, Discrete Mathematics & Theoretical Computer Science, 22(2), 5986 (2021). (arXiv, journal)
- V. Jelínek, M. Karpilovskij: Fillings of skew shapes avoiding diagonal patterns, Discrete Mathematics & Theoretical Computer Science, 22(2), 6171 (2021). (arXiv, journal)
- V. Jelínek, T. Mansour, J. L. Ramírez, M. Shattuck: Avoiding a pair of patterns in multisets and compositions, Advances in Applied Mathematics, 133 (2022), 102286. (arXiv, journal)
- V. Jelínek, T. Klimošová, T. Masařík, J. Novotná, A. Pokorná: On 3-Coloring of (2P4,C5)-Free Graphs, Algorithmica, 84(6) (2022), 1526-1547. (arXiv, journal)
- D. Callan, V. Jelínek, T. Mansour: Inversion Sequences Avoiding a Triple of Patterns of 3 Letters, Electronic Journal of Combinatorics 30(3), Article P3.19, 2023.
(journal)
- V. Jelínek, M. Opler, P. Valtr: Generalized Coloring of Permutations, Algorithmica 86 (2024), 2174-2210. (journal)
Conference proceedings papers
- J. Černý, Z. Dvořák, V. Jelínek, J. Kára: Noncrossing Hamiltonian Paths in Geometric
Graphs, Proceedings of Graph Drawing 2003, LNCS 2912 (2004),
86-97. (proceedings)
- Z. Dvořák, V. Jelínek: On the
Complexity of the G-Reconstruction Problem, Proceedings of ISAAC
2005, LNCS 3827 (2005), 196-205. (proceedings)
- Z. Dvořák, V. Jelínek, D. Kráľ, J. Kynčl, M. Saks: Three Optimal Algorithms for Balls of Three
Colors, Proceedings of STACS 2005, LNCS 3404 (2005), 206-217. (proceedings)
- V. Jelínek, M. Klazar: Generalizations
of Khovanskii's Theorem on Growth of Sumsets in Abelian
Semigroups (extended abstract), Proceedings of EUROCOMB
2007, Electronic Notes in Discrete Mathematics 29(1) (2007), 273-276. (proceedings)
- V. Jelínek: Pattern-Avoiding
Fillings of Rectangular Shapes, Proc. of 19th International
Conference on Formal Power Series and Algebraic Combinatorics (FPSAC
2007). (preprint)
- V. Jelínek: The Rank-Width of
the Square Grid, Proceedings of WG 2008, LNCS 5344 (2008),
230-239. (proceedings)
- M. Dukes, V. Jelínek, T. Mansour, A. Reifegerste: Equivalences
for
Pattern-Avoiding Involutions and Classification, Proceedings of
FPSAC 2008, DMTCS proceedings AJ (2008), 181-188. (proceedings)
- V. Jelínek, E. Jelínková, J. Kratochvíl, B. Lidický: Clustered Planarity: Embedded Clustered
Graphs with Two-Component Clusters (extended abstract),
Proceedings of Graph Drawing 2008, LNCS 5417 (2009), 121-132. (preprint, proceedings)
- V. Jelínek, O. Suchý, M. Tesař, T. Vyskočil: Clustered Planarity: Clusters with Few
Outgoing Edges, Proceedings of Graph Drawing 2008, LNCS 5417
(2009), 102-113. (proceedings)
- V. Jelínek, E. Jelínková, J. Kratochvíl, B. Lidický, M. Tesař, T.
Vyskočil: The Planar Slope Number of
Planar Partial 3-Trees of Bounded Degree, Proceedings of Graph
Drawing 2009, LNCS 5849 (2010), 304-315.
(proceedings)
- P. Angelini, G. Di Battista, F. Frati, V. Jelínek, J. Kratochvíl,
M. Patrignani, I. Rutter: Testing
Planarity of Partially Embedded Graphs, Proceedings of SODA
2010, 202-221. (proceedings)
- V. Jelínek, E. Jelínková, E. Steingrímsson: The Möbius Function of Separable
Permutations, Proceedings of FPSAC 2010, DMTCS Proceedings AN,
773-784. (proceedings)
- A. Claesson, V. Jelínek, E. Jelínková, S. Kitaev: Pattern Avoidance in Partial Permutations,
Proceedings of FPSAC 2010, DMTCS Proceedings AN, 625-636. (proceedings)
- V. Jelínek: Counting Self-Dual
Interval Orders, Proceedings of FPSAC 2011, DMTCS Proceedings
119 (2011), 539-550. (arXiv,
proceedings)
- V. Jelínek, J. Kratochvíl, I. Rutter: A Kuratowski-Type Theorem for Planarity of
Partially Embedded Graphs, Proceedings of SoCG 2011 (2011), 107-116. (arXiv, proceedings)
- S. Chaplick, V. Jelínek, J. Kratochvíl, T. Vyskočil: Bend-Bounded Path Intersection Graphs:
Sausages, Noodles and Waffles on a Grill, Proceedings of WG
2012, LNCS 7551 (2012), 274-285. (arXiv, proceedings)
- T. Gavenčiak, V. Jelínek, P. Klavík, J. Kratochvíl: Cops and
Robbers on Intersection Graphs, proceedings of ISAAC 2013, LNCS
8283 (2013), 174-184. (arXiv,
proceedings)
- G. Da Lozzo, V. Jelínek, J. Kratochvíl, I. Rutter: Planar
Embeddings with Small and Uniform Faces, proceedings of ISAAC 2014,
LNCS 8889 (2014), 633-645. (arXiv,
proceedings)
- M. Balko, V. Jelínek, P. Valtr, B. Walczak: On the Beer Index
of Convexity and its Variants, proceedings of SoCG 2015, Leibniz
International Proceedings in Informatics 34 (2015), 406-420. (arXiv, proceedings)
- T. Gavenčiak, P. Gordinowicz, V. Jelínek, P. Klavík, J.
Kratochvíl: Cops and Robbers on String Graphs, proceedings of
ISAAC 2015, LNCS 9742 (2015), 355-366. (arXiv, proceedings)
- V. Jelínek, E. Jelínková, J. Kratochvíl: On the Hardness of Switching to a Small
Number of Edges, proceedings of COCOON 2016, LNCS 9797 (2016),
159-170. (arXiv, proceedings)
- V. Jelínek, J. Kynčl: Hardness
of Permutation Pattern Matching, proceedings of SODA 2017
(2017), 387-396. (arXiv,
proceedings)
- V. Jelínek, M. Opler, P. Valtr: Generalized Coloring of Permutations, proceedings of ESA 2018, LIPIcs 112 (2018), 50:1-50:14. (proceedings)
- V. Jelínek, M. Opler, J. Pekárek: A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes, proceedings of MFCS 2020, LIPIcs 170 (2020), 52:1-52:18. (arXiv, proceedings)
- V. Jelínek, T. Klimošová, T. Masařík, J. Novotná, A. Pokorná: On 3-Coloring of (2P4,C5)-Free Graphs, proceedings of WG 2021, LNCS 12911 (2021), 388-401. (arXiv, proceedings)
- V. Jelínek, M. Opler, J. Pekárek: Griddings of permutations and hardness of pattern matching, proceedings of MFCS 2021, LIPIcs 202 (2021), 65:1-65:22. (arXiv, proceedings)
- V. Jelínek, M. Opler, J. Pekárek: Long paths make pattern-counting hard, and deep trees make it harder, proceedings of IPEC 2021, LIPIcs 214 (2021), 22:1-22:17. (arXiv, proceedings)
- B. Ghanbari, D. Hartman, V. Jelínek, A. Pokorná, R. Šámal, P. Valtr: On the structure and values of betweenness centrality in dense betweenness-uniform graphs, Proceedings of the 12th European Conference on
Combinatorics, Graph Theory and Applications (Eurocomb'23), 478-484. (proceedings)
- P. Chmel, V. Jelínek: String graphs with precise number of
intersections, Proceedings of the 31st International Symposium on Graph Drawing and Network Visualization (GD 2023). (arXiv)
- V. Jelínek, M. Opler, J. Pekárek: The Hierarchy of Hereditary Sorting Operators, to appear in proceedings of SODA 2024. (arXiv)