Vít Jelínek

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