Vít Jelínek

Orcid: 0000-0003-4831-4079

Affiliations:
  • Charles University, Prague, Czechia


According to our database1, Vít Jelínek authored at least 56 papers between 2005 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Generalized Coloring of Permutations.
Algorithmica, July, 2024

The Hierarchy of Hereditary Sorting Operators.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Inversion Sequences Avoiding a Triple of Patterns of 3 Letters.
Electron. J. Comb., 2023

String Graphs with Precise Number of Intersections.
Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

2022
On 3-Coloring of (2P<sub>4, C<sub>5</sub></sub>)-Free Graphs.
Algorithmica, 2022

Avoiding a pair of patterns in multisets and compositions.
Adv. Appl. Math., 2022

2021
Fillings of skew shapes avoiding diagonal patterns.
Discret. Math. Theor. Comput. Sci., 2021

Two examples of Wilf-collapse.
Discret. Math. Theor. Comput. Sci., 2021

Griddings of Permutations and Hardness of Pattern Matching.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Long Paths Make Pattern-Counting Hard, and Deep Trees Make It Harder.
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

2020
On the growth of the Möbius function of permutations.
J. Comb. Theory A, 2020

Note on 3-Coloring of (2P<sub>4</sub>, C<sub>5</sub>)-Free Graphs.
CoRR, 2020

A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2019
On ordered Ramsey numbers of bounded-degree graphs.
J. Comb. Theory B, 2019

On Grounded L-Graphs and their Relatives.
Electron. J. Comb., 2019

2018
Cops and Robbers on intersection graphs.
Eur. J. Comb., 2018

On the structure of matrices avoiding interval-minor patterns.
Adv. Appl. Math., 2018

2017
Splittability and 1-amalgamability of permutation classes.
Discret. Math. Theor. Comput. Sci., 2017

On the Beer Index of Convexity and Its Variants.
Discret. Comput. Geom., 2017

Hardness of Permutation Pattern Matching.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Ramsey-type and amalgamation-type properties of permutations.
Proceedings of the Surveys in Combinatorics, 2017

2016
Unsplittable Classes of Separable Permutations.
Electron. J. Comb., 2016

On the Hardness of Switching to a Small Number of Edges.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015
Testing Planarity of Partially Embedded Graphs.
ACM Trans. Algorithms, 2015

Splittings and Ramsey properties of permutation classes.
Adv. Appl. Math., 2015

Catalan pairs and Fishburn triples.
Adv. Appl. Math., 2015

Cops and Robbers on String Graphs.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014
On q-series identities related to interval orders.
Eur. J. Comb., 2014

Planar Embeddings with Small and Uniform Faces.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

2013
The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree.
Graphs Comb., 2013

A Kuratowski-type theorem for planarity of partially embedded graphs.
Comput. Geom., 2013

On multiple pattern avoiding set partitions.
Adv. Appl. Math., 2013

Cops and Robbers on Intersection Graphs.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012
Counting general and self-dual interval orders.
J. Comb. Theory A, 2012

Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns.
J. Comb. Theory A, 2012

Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

2011
The Möbius function of separable and decomposable permutations.
J. Comb. Theory A, 2011

Embedding dualities for set partitions and for relational structures.
Eur. J. Comb., 2011

Composition Matrices, (2+2)-Free Posets and their Specializations.
Electron. J. Comb., 2011

Pattern Avoidance in Partial Permutations.
Electron. J. Comb., 2011

2010
The rank-width of the square grid.
Discret. Appl. Math., 2010

Matchings and Partial Patterns.
Electron. J. Comb., 2010

2009
Wilf-Equivalence on k-ary Words, Compositions, and Parking Functions.
Electron. J. Comb., 2009

Monochromatic triangles in two-colored plane.
Comb., 2009

2008
On Pattern-Avoiding Partitions.
Electron. J. Comb., 2008

Generalizations of Khovanskiĭ's theorems on the growth of sumsets in Abelian semigroups.
Adv. Appl. Math., 2008

Clustered Planarity: Clusters with Few Outgoing Edges.
Proceedings of the Graph Drawing, 16th International Symposium, 2008

Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters.
Proceedings of the Graph Drawing, 16th International Symposium, 2008

2007
Labelings of Graphs with Fixed and Variable Edge-Weights.
SIAM J. Discret. Math., 2007

Probabilistic strategies for the partition and plurality problems.
Random Struct. Algorithms, 2007

Generalizations of Khovanski's theorem on growth of sumsets in abelian semigroups: (extended abstract).
Electron. Notes Discret. Math., 2007

Dyck paths and pattern-avoiding matchings.
Eur. J. Comb., 2007

Noncrossing Hamiltonian paths in geometric graphs.
Discret. Appl. Math., 2007

2006
Matchings Avoiding Partial Patterns and Lattice Paths.
Electron. J. Comb., 2006

2005
Three Optimal Algorithms for Balls of Three Colors.
Proceedings of the STACS 2005, 2005

On the Complexity of the <i>G</i>-Reconstruction Problem.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005


  Loading...