Vít Jelínek

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 38

Top Topics

Subgraph Isomorphism

Pattern Matching

Tractable Cases

Top Venues

Adv. Appl. Math.

Electron. J. Comb.

Discret. Math. Theor. Comput. Sci.

Publications

Vít Jelínek, Michal Opler, Pavel Valtr
Generalized Coloring of Permutations. Algorithmica 86 (7) (2024)
Vít Jelínek, Michal Opler, Jakub Pekárek
The Hierarchy of Hereditary Sorting Operators. SODA (2024)
Petr Chmel, Vít Jelínek
String Graphs with Precise Number of Intersections. GD (1) (2023)
David Callan, Vít Jelínek, Toufik Mansour
Inversion Sequences Avoiding a Triple of Patterns of 3 Letters. Electron. J. Comb. 30 (3) (2023)
Petr Chmel, Vít Jelínek
String graphs with precise number of intersections. CoRR (2023)
Vít Jelínek, Michal Opler, Jakub Pekárek
The Hierarchy of Hereditary Sorting Operators. CoRR (2023)
Vít Jelínek, Toufik Mansour, José L. Ramírez, Mark Shattuck
Avoiding a pair of patterns in multisets and compositions. Adv. Appl. Math. 133 (2022)
Vít Jelínek, Tereza Klimosová, Tomás Masarík, Jana Novotná, Aneta Pokorná
)-Free Graphs. Algorithmica 84 (6) (2022)
Vít Jelínek, Michal Opler, Jakub Pekárek
Long paths make pattern-counting hard, and deep trees make it harder. CoRR (2021)
Vít Jelínek, Toufik Mansour, José L. Ramírez, Mark Shattuck
Avoiding a pair of patterns in multisets and compositions. CoRR (2021)
Vít Jelínek, Tereza Klimosová, Tomás Masarík, Jana Novotná, Aneta Pokorná
-Free Graphs. WG (2021)
Michael Albert, Vít Jelínek, Michal Opler
Two examples of Wilf-collapse. Discret. Math. Theor. Comput. Sci. 22 (2) (2021)
Vít Jelínek, Michal Opler, Jakub Pekárek
Griddings of permutations and hardness of pattern matching. CoRR (2021)
Vít Jelínek, Michal Opler, Jakub Pekárek
Long Paths Make Pattern-Counting Hard, and Deep Trees Make It Harder. IPEC (2021)
Vít Jelínek, Michal Opler, Jakub Pekárek
Griddings of Permutations and Hardness of Pattern Matching. MFCS (2021)
Vít Jelínek, Mark Karpilovskij
Fillings of skew shapes avoiding diagonal patterns. Discret. Math. Theor. Comput. Sci. 22 (2) (2021)
Vít Jelínek, Tereza Klimosová, Tomás Masarík, Jana Novotná, Aneta Pokorná
)-Free Graphs. CoRR (2020)
Vít Jelínek, Ida Kantor, Jan Kyncl, Martin Tancer
On the growth of the Möbius function of permutations. J. Comb. Theory, Ser. A 169 (2020)
Vít Jelínek, Michal Opler, Jakub Pekárek
A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes. CoRR (2020)
Vít Jelínek, Mark Karpilovskij
Fillings of skew shapes avoiding diagonal patterns. CoRR (2020)
Vít Jelínek, Michal Opler, Jakub Pekárek
A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes. MFCS (2020)
Vít Jelínek, Martin Töpfer
On Grounded L-Graphs and their Relatives. Electron. J. Comb. 26 (3) (2019)
Martin Balko, Vít Jelínek, Pavel Valtr
On ordered Ramsey numbers of bounded-degree graphs. J. Comb. Theory, Ser. B 134 (2019)
Vít Jelínek, Martin Töpfer
On grounded L-graphs and their relatives. CoRR (2018)
Tomas Gavenciak, Przemyslaw Gordinowicz, Vít Jelínek, Pavel Klavík, Jan Kratochvíl
Cops and Robbers on intersection graphs. Eur. J. Comb. 72 (2018)
Vít Jelínek, Stanislav Kucera
On the structure of matrices avoiding interval-minor patterns. Adv. Appl. Math. 101 (2018)
Vít Jelínek, Michal Opler, Pavel Valtr
Generalized Coloring of Permutations. ESA (2018)
Vít Jelínek, Stanislav Kucera
On the structure of matrices avoiding interval-minor patterns. CoRR (2018)
Vít Jelínek, Michal Opler
Splittability and 1-amalgamability of permutation classes. Discret. Math. Theor. Comput. Sci. 19 (2) (2017)
Vít Jelínek
Ramsey-type and amalgamation-type properties of permutations. BCC (2017)
Martin Balko, Vít Jelínek, Pavel Valtr, Bartosz Walczak
On the Beer Index of Convexity and Its Variants. Discret. Comput. Geom. 57 (1) (2017)
Vít Jelínek, Jan Kyncl
Hardness of Permutation Pattern Matching. SODA (2017)
Vít Jelínek, Jan Kyncl
Hardness of Permutation Pattern Matching. CoRR (2016)
Michael Albert, Vít Jelínek
Unsplittable Classes of Separable Permutations. Electron. J. Comb. 23 (2) (2016)
Vít Jelínek, Eva Jelínková, Jan Kratochvíl
On the hardness of switching to a small number of edges. CoRR (2016)
Martin Balko, Vít Jelínek, Pavel Valtr
On ordered Ramsey numbers of bounded-degree graphs. CoRR (2016)
Vít Jelínek, Eva Jelínková, Jan Kratochvíl
On the Hardness of Switching to a Small Number of Edges. COCOON (2016)
Tomas Gavenciak, Przemyslaw Gordinowicz, Vít Jelínek, Pavel Klavík, Jan Kratochvíl
Cops and Robbers on Intersection Graphs. CoRR (2016)
Vít Jelínek
Catalan pairs and Fishburn triples. Adv. Appl. Math. 70 (2015)
Vít Jelínek, Pavel Valtr
Splittings and Ramsey properties of permutation classes. Adv. Appl. Math. 63 (2015)
Tomas Gavenciak, Przemyslaw Gordinowicz, Vít Jelínek, Pavel Klavík, Jan Kratochvíl
Cops and Robbers on String Graphs. ISAAC (2015)
Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vít Jelínek, Jan Kratochvíl, Maurizio Patrignani, Ignaz Rutter
Testing Planarity of Partially Embedded Graphs. ACM Trans. Algorithms 11 (4) (2015)
Martin Balko, Vít Jelínek, Pavel Valtr, Bartosz Walczak
On the Beer Index of Convexity and Its Variants. SoCG (2015)
Martin Balko, Vít Jelínek, Pavel Valtr, Bartosz Walczak
On the Beer index of convexity and its variants. CoRR (2014)
Giordano Da Lozzo, Vít Jelínek, Jan Kratochvíl, Ignaz Rutter
Planar Embeddings with Small and Uniform Faces. CoRR (2014)
George E. Andrews, Vít Jelínek
On q-series identities related to interval orders. Eur. J. Comb. 39 (2014)
Giordano Da Lozzo, Vít Jelínek, Jan Kratochvíl, Ignaz Rutter
Planar Embeddings with Small and Uniform Faces. ISAAC (2014)
Vít Jelínek, Toufik Mansour, Mark Shattuck
On multiple pattern avoiding set partitions. Adv. Appl. Math. 50 (2) (2013)
Vít Jelínek, Pavel Valtr
Splittings and Ramsey Properties of Permutation Classes. CoRR (2013)
Tomas Gavenciak, Vít Jelínek, Pavel Klavík, Jan Kratochvíl
Cops and Robbers on Intersection Graphs. ISAAC (2013)
Vít Jelínek, Jan Kratochvíl, Ignaz Rutter
A Kuratowski-type theorem for planarity of partially embedded graphs. Comput. Geom. 46 (4) (2013)
Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesar, Tomás Vyskocil
The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree. Graphs Comb. 29 (4) (2013)
Anders Claesson, Vít Jelínek, Einar Steingrímsson
Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns. J. Comb. Theory, Ser. A 119 (8) (2012)
Steven Chaplick, Vít Jelínek, Jan Kratochvíl, Tomás Vyskocil
Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill. WG (2012)
Vít Jelínek, Jan Kratochvíl, Ignaz Rutter
A Kuratowski-Type Theorem for Planarity of Partially Embedded Graphs CoRR (2012)
Steven Chaplick, Vít Jelínek, Jan Kratochvíl, Tomás Vyskocil
Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill CoRR (2012)
Vít Jelínek
Counting general and self-dual interval orders. J. Comb. Theory, Ser. A 119 (3) (2012)
Vít Jelínek, Martin Klazar
Embedding dualities for set partitions and for relational structures. Eur. J. Comb. 32 (7) (2011)
Anders Claesson, Vít Jelínek, Eva Jelínková, Sergey Kitaev
Pattern Avoidance in Partial Permutations. Electron. J. Comb. 18 (1) (2011)
Vít Jelínek, Jan Kratochvíl, Ignaz Rutter
A kuratowski-type theorem for planarity of partially embedded graphs. SCG (2011)
Alexander Burstein, Vít Jelínek, Eva Jelínková, Einar Steingrímsson
The Möbius function of separable and decomposable permutations. J. Comb. Theory, Ser. A 118 (8) (2011)
Mark Dukes, Vít Jelínek, Martina Kubitzke
Composition Matrices, (2+2)-Free Posets and their Specializations. Electron. J. Comb. 18 (1) (2011)
Vít Jelínek
The rank-width of the square grid. Discret. Appl. Math. 158 (7) (2010)
Vít Jelínek, Toufik Mansour
Matchings and Partial Patterns. Electron. J. Comb. 17 (1) (2010)
Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vít Jelínek, Jan Kratochvíl, Maurizio Patrignani, Ignaz Rutter
Testing Planarity of Partially Embedded Graphs. SODA (2010)
Vít Jelínek, Jan Kyncl, Rudolf Stolar, Tomás Valla
Monochromatic triangles in two-colored plane. Comb. 29 (6) (2009)
Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesar, Tomás Vyskocil
The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree. Graph Drawing (2009)
Vít Jelínek, Toufik Mansour
Wilf-Equivalence on k-ary Words, Compositions, and Parking Functions. Electron. J. Comb. 16 (1) (2009)
Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický
Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters. Graph Drawing (2008)
Vít Jelínek, Toufik Mansour
On Pattern-Avoiding Partitions. Electron. J. Comb. 15 (1) (2008)
Vít Jelínek, Ondrej Suchý, Marek Tesar, Tomás Vyskocil
Clustered Planarity: Clusters with Few Outgoing Edges. Graph Drawing (2008)
Vít Jelínek, Martin Klazar
Generalizations of Khovanskiĭ's theorems on the growth of sumsets in Abelian semigroups. Adv. Appl. Math. 41 (1) (2008)
Vít Jelínek
The Rank-Width of the Square Grid. WG (2008)
Vít Jelínek, Martin Klazar
Generalizations of Khovanski's theorem on growth of sumsets in abelian semigroups: (extended abstract). Electron. Notes Discret. Math. 29 (2007)
Vít Jelínek
Dyck paths and pattern-avoiding matchings. Eur. J. Comb. 28 (1) (2007)
Robert Babilon, Vít Jelínek, Daniel Král, Pavel Valtr
Labelings of Graphs with Fixed and Variable Edge-Weights. SIAM J. Discret. Math. 21 (3) (2007)
Jakub Cerný, Zdenek Dvorák, Vít Jelínek, Jan Kára
Noncrossing Hamiltonian paths in geometric graphs. Discret. Appl. Math. 155 (9) (2007)
Zdenek Dvorák, Vít Jelínek, Daniel Král, Jan Kyncl, Michael E. Saks
Probabilistic strategies for the partition and plurality problems. Random Struct. Algorithms 30 (1-2) (2007)
Vít Jelínek, Nelson Y. Li, Toufik Mansour, Sherry H. F. Yan
Matchings Avoiding Partial Patterns and Lattice Paths. Electron. J. Comb. 13 (1) (2006)
Zdenek Dvorák, Vít Jelínek, Daniel Král, Jan Kyncl, Michael E. Saks
Three Optimal Algorithms for Balls of Three Colors. STACS (2005)
Zdenek Dvorák, Vít Jelínek
-Reconstruction Problem. ISAAC (2005)
Jakub Cerný, Zdenek Dvorák, Vít Jelínek, Jan Kára
Noncrossing Hamiltonian Paths in Geometric Graphs. Graph Drawing (2003)