


default search action
Vít Jelínek
Person information
- affiliation: Charles University, Prague, Czechia
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j39]Vít Jelínek, Michal Opler, Pavel Valtr:
Generalized Coloring of Permutations. Algorithmica 86(7): 2174-2210 (2024) - [c24]Vít Jelínek, Michal Opler, Jakub Pekárek:
The Hierarchy of Hereditary Sorting Operators. SODA 2024: 1447-1464 - 2023
- [j38]David Callan, Vít Jelínek, Toufik Mansour:
Inversion Sequences Avoiding a Triple of Patterns of 3 Letters. Electron. J. Comb. 30(3) (2023) - [c23]Petr Chmel
, Vít Jelínek
:
String Graphs with Precise Number of Intersections. GD (1) 2023: 78-92 - [i19]Petr Chmel, Vít Jelínek:
String graphs with precise number of intersections. CoRR abs/2308.15590 (2023) - [i18]Vít Jelínek, Michal Opler, Jakub Pekárek
:
The Hierarchy of Hereditary Sorting Operators. CoRR abs/2311.08727 (2023) - 2022
- [j37]Vít Jelínek
, Toufik Mansour
, José Luis Ramírez
, Mark Shattuck:
Avoiding a pair of patterns in multisets and compositions. Adv. Appl. Math. 133: 102286 (2022) - [j36]Vít Jelínek
, Tereza Klimosová
, Tomás Masarík
, Jana Novotná
, Aneta Pokorná
:
On 3-Coloring of (2P4, C5)-Free Graphs. Algorithmica 84(6): 1526-1547 (2022) - 2021
- [j35]Michael Albert, Vít Jelínek
, Michal Opler
:
Two examples of Wilf-collapse. Discret. Math. Theor. Comput. Sci. 22(2) (2021) - [j34]Vít Jelínek
, Mark Karpilovskij:
Fillings of skew shapes avoiding diagonal patterns. Discret. Math. Theor. Comput. Sci. 22(2) (2021) - [c22]Vít Jelínek
, Michal Opler
, Jakub Pekárek
:
Long Paths Make Pattern-Counting Hard, and Deep Trees Make It Harder. IPEC 2021: 22:1-22:17 - [c21]Vít Jelínek
, Michal Opler
, Jakub Pekárek
:
Griddings of Permutations and Hardness of Pattern Matching. MFCS 2021: 65:1-65:22 - [c20]Vít Jelínek
, Tereza Klimosová, Tomás Masarík, Jana Novotná
, Aneta Pokorná
:
On 3-Coloring of (2P4, C5)-Free Graphs. WG 2021: 388-401 - [i17]Vít Jelínek, Michal Opler, Jakub Pekárek:
Griddings of permutations and hardness of pattern matching. CoRR abs/2107.10897 (2021) - [i16]Vít Jelínek, Michal Opler, Jakub Pekárek:
Long paths make pattern-counting hard, and deep trees make it harder. CoRR abs/2111.03479 (2021) - [i15]Vít Jelínek, Toufik Mansour, José Luis Ramírez, Mark Shattuck:
Avoiding a pair of patterns in multisets and compositions. CoRR abs/2111.06185 (2021) - 2020
- [j33]Vít Jelínek
, Ida Kantor, Jan Kyncl
, Martin Tancer
:
On the growth of the Möbius function of permutations. J. Comb. Theory A 169 (2020) - [c19]Vít Jelínek
, Michal Opler
, Jakub Pekárek
:
A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes. MFCS 2020: 52:1-52:18 - [i14]Vít Jelínek, Mark Karpilovskij:
Fillings of skew shapes avoiding diagonal patterns. CoRR abs/2002.12308 (2020) - [i13]Vít Jelínek, Michal Opler, Jakub Pekárek:
A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes. CoRR abs/2008.04593 (2020) - [i12]Vít Jelínek, Tereza Klimosová, Tomás Masarík
, Jana Novotná
, Aneta Pokorná:
Note on 3-Coloring of (2P4, C5)-Free Graphs. CoRR abs/2011.06173 (2020)
2010 – 2019
- 2019
- [j32]Vít Jelínek
, Martin Töpfer
:
On Grounded L-Graphs and their Relatives. Electron. J. Comb. 26(3): 3 (2019) - [j31]Martin Balko
, Vít Jelínek
, Pavel Valtr:
On ordered Ramsey numbers of bounded-degree graphs. J. Comb. Theory B 134: 179-202 (2019) - 2018
- [j30]Vít Jelínek
, Stanislav Kucera:
On the structure of matrices avoiding interval-minor patterns. Adv. Appl. Math. 101: 70-99 (2018) - [j29]Tomas Gavenciak
, Przemyslaw Gordinowicz
, Vít Jelínek
, Pavel Klavík
, Jan Kratochvíl
:
Cops and Robbers on intersection graphs. Eur. J. Comb. 72: 45-69 (2018) - [c18]Vít Jelínek
, Michal Opler
, Pavel Valtr:
Generalized Coloring of Permutations. ESA 2018: 50:1-50:14 - [i11]Vít Jelínek, Stanislav Kucera:
On the structure of matrices avoiding interval-minor patterns. CoRR abs/1803.09003 (2018) - [i10]Vít Jelínek, Martin Töpfer:
On grounded L-graphs and their relatives. CoRR abs/1808.04148 (2018) - 2017
- [j28]Martin Balko
, Vít Jelínek
, Pavel Valtr, Bartosz Walczak
:
On the Beer Index of Convexity and Its Variants. Discret. Comput. Geom. 57(1): 179-214 (2017) - [j27]Vít Jelínek, Michal Opler:
Splittability and 1-amalgamability of permutation classes. Discret. Math. Theor. Comput. Sci. 19(2) (2017) - [c17]Vít Jelínek:
Ramsey-type and amalgamation-type properties of permutations. BCC 2017: 272-311 - [c16]Vít Jelínek
, Jan Kyncl
:
Hardness of Permutation Pattern Matching. SODA 2017: 378-396 - 2016
- [j26]Michael Albert, Vít Jelínek:
Unsplittable Classes of Separable Permutations. Electron. J. Comb. 23(2): 2 (2016) - [c15]Vít Jelínek
, Eva Jelínková
, Jan Kratochvíl
:
On the Hardness of Switching to a Small Number of Edges. COCOON 2016: 159-170 - [i9]Vít Jelínek, Eva Jelínková, Jan Kratochvíl:
On the hardness of switching to a small number of edges. CoRR abs/1603.00254 (2016) - [i8]Martin Balko, Vít Jelínek, Pavel Valtr:
On ordered Ramsey numbers of bounded-degree graphs. CoRR abs/1606.05628 (2016) - [i7]Tomas Gavenciak, Przemyslaw Gordinowicz, Vít Jelínek, Pavel Klavík, Jan Kratochvíl:
Cops and Robbers on Intersection Graphs. CoRR abs/1607.08058 (2016) - [i6]Vít Jelínek, Jan Kyncl:
Hardness of Permutation Pattern Matching. CoRR abs/1608.00529 (2016) - 2015
- [j25]Vít Jelínek
, Pavel Valtr:
Splittings and Ramsey properties of permutation classes. Adv. Appl. Math. 63: 41-67 (2015) - [j24]Vít Jelínek
:
Catalan pairs and Fishburn triples. Adv. Appl. Math. 70: 1-31 (2015) - [j23]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): 32:1-32:42 (2015) - [c14]Martin Balko
, Vít Jelínek
, Pavel Valtr, Bartosz Walczak:
On the Beer Index of Convexity and Its Variants. SoCG 2015: 406-420 - [c13]Tomas Gavenciak
, Przemyslaw Gordinowicz
, Vít Jelínek
, Pavel Klavík
, Jan Kratochvíl
:
Cops and Robbers on String Graphs. ISAAC 2015: 355-366 - 2014
- [j22]George E. Andrews
, Vít Jelínek
:
On q-series identities related to interval orders. Eur. J. Comb. 39: 178-187 (2014) - [c12]Giordano Da Lozzo
, Vít Jelínek
, Jan Kratochvíl
, Ignaz Rutter
:
Planar Embeddings with Small and Uniform Faces. ISAAC 2014: 633-645 - [i5]Giordano Da Lozzo, Vít Jelínek, Jan Kratochvíl, Ignaz Rutter:
Planar Embeddings with Small and Uniform Faces. CoRR abs/1409.4299 (2014) - [i4]Martin Balko, Vít Jelínek, Pavel Valtr, Bartosz Walczak:
On the Beer index of convexity and its variants. CoRR abs/1412.1769 (2014) - 2013
- [j21]Vít Jelínek
, Toufik Mansour
, Mark Shattuck:
On multiple pattern avoiding set partitions. Adv. Appl. Math. 50(2): 292-326 (2013) - [j20]Vít Jelínek
, Jan Kratochvíl
, Ignaz Rutter
:
A Kuratowski-type theorem for planarity of partially embedded graphs. Comput. Geom. 46(4): 466-492 (2013) - [j19]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): 981-1005 (2013) - [c11]Tomas Gavenciak
, Vít Jelínek
, Pavel Klavík
, Jan Kratochvíl
:
Cops and Robbers on Intersection Graphs. ISAAC 2013: 174-184 - [i3]Vít Jelínek, Pavel Valtr:
Splittings and Ramsey Properties of Permutation Classes. CoRR abs/1307.0027 (2013) - 2012
- [j18]Vít Jelínek
:
Counting general and self-dual interval orders. J. Comb. Theory A 119(3): 599-614 (2012) - [j17]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 A 119(8): 1680-1691 (2012) - [c10]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: 274-285 - [i2]Vít Jelínek, Jan Kratochvíl, Ignaz Rutter:
A Kuratowski-Type Theorem for Planarity of Partially Embedded Graphs. CoRR abs/1204.2915 (2012) - [i1]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 abs/1206.5159 (2012) - 2011
- [j16]Anders Claesson, Vít Jelínek, Eva Jelínková
, Sergey Kitaev:
Pattern Avoidance in Partial Permutations. Electron. J. Comb. 18(1) (2011) - [j15]Mark Dukes, Vít Jelínek, Martina Kubitzke:
Composition Matrices, (2+2)-Free Posets and their Specializations. Electron. J. Comb. 18(1) (2011) - [j14]Vít Jelínek
, Martin Klazar
:
Embedding dualities for set partitions and for relational structures. Eur. J. Comb. 32(7): 1084-1096 (2011) - [j13]Alexander Burstein, Vít Jelínek
, Eva Jelínková
, Einar Steingrímsson
:
The Möbius function of separable and decomposable permutations. J. Comb. Theory A 118(8): 2346-2364 (2011) - [c9]Vít Jelínek
, Jan Kratochvíl
, Ignaz Rutter
:
A kuratowski-type theorem for planarity of partially embedded graphs. SCG 2011: 107-116 - 2010
- [j12]Vít Jelínek, Toufik Mansour:
Matchings and Partial Patterns. Electron. J. Comb. 17(1) (2010) - [j11]Vít Jelínek
:
The rank-width of the square grid. Discret. Appl. Math. 158(7): 841-850 (2010) - [c8]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: 202-221
2000 – 2009
- 2009
- [j10]Vít Jelínek
, Jan Kyncl
, Rudolf Stolar, Tomás Valla
:
Monochromatic triangles in two-colored plane. Comb. 29(6): 699-718 (2009) - [j9]Vít Jelínek, Toufik Mansour
:
Wilf-Equivalence on k-ary Words, Compositions, and Parking Functions. Electron. J. Comb. 16(1) (2009) - [c7]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. GD 2009: 304-315 - 2008
- [j8]Vít Jelínek
, Martin Klazar
:
Generalizations of Khovanskiĭ's theorems on the growth of sumsets in Abelian semigroups. Adv. Appl. Math. 41(1): 115-132 (2008) - [j7]Vít Jelínek, Toufik Mansour:
On Pattern-Avoiding Partitions. Electron. J. Comb. 15(1) (2008) - [c6]Vít Jelínek, Ondrej Suchý
, Marek Tesar, Tomás Vyskocil:
Clustered Planarity: Clusters with Few Outgoing Edges. GD 2008: 102-113 - [c5]Vít Jelínek, Eva Jelínková
, Jan Kratochvíl, Bernard Lidický:
Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters. GD 2008: 121-132 - [c4]Vít Jelínek
:
The Rank-Width of the Square Grid. WG 2008: 230-239 - 2007
- [j6]Jakub Cerný, Zdenek Dvorák
, Vít Jelínek
, Jan Kára:
Noncrossing Hamiltonian paths in geometric graphs. Discret. Appl. Math. 155(9): 1096-1105 (2007) - [j5]Vít Jelínek
:
Dyck paths and pattern-avoiding matchings. Eur. J. Comb. 28(1): 202-213 (2007) - [j4]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: 273-276 (2007) - [j3]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): 63-77 (2007) - [j2]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): 688-706 (2007) - 2006
- [j1]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) - 2005
- [c3]Zdenek Dvorák
, Vít Jelínek:
On the Complexity of the G-Reconstruction Problem. ISAAC 2005: 196-205 - [c2]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: 206-217 - 2003
- [c1]Jakub Cerný, Zdenek Dvorák
, Vít Jelínek
, Jan Kára:
Noncrossing Hamiltonian Paths in Geometric Graphs. GD 2003: 86-97
Coauthor Index

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint