Vít Jelínek

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Inversion Sequences Avoiding a Triple of Patterns of 3 Letters.

[BibT_eX]

[DOI]

David Callan

Electron. J. Comb., 2023

String Graphs with Precise Number of Intersections.

[BibT_eX]

[DOI]

Petr Chmel

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

2022

On 3-Coloring of (2P4, C5)-Free Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2022

Avoiding a pair of patterns in multisets and compositions.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2022

2021

Fillings of skew shapes avoiding diagonal patterns.

[BibT_eX]

[DOI]

Mark Karpilovskij

Discret. Math. Theor. Comput. Sci., 2021

Two examples of Wilf-collapse.

[BibT_eX]

[DOI]

Michael Albert

Discret. Math. Theor. Comput. Sci., 2021

Griddings of Permutations and Hardness of Pattern Matching.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

2020

On the growth of the Möbius function of permutations.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2020

Note on 3-Coloring of (2P4, C5)-Free Graphs.

[BibT_eX]

[DOI]

CoRR, 2020

A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes.

[BibT_eX]

[DOI]

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2019

On ordered Ramsey numbers of bounded-degree graphs.

[BibT_eX]

[DOI]

Martin Balko

Pavel Valtr

J. Comb. Theory, Ser. B, 2019

On Grounded L-Graphs and their Relatives.

[BibT_eX]

[DOI]

Martin Töpfer

Electron. J. Comb., 2019

2018

Cops and Robbers on intersection graphs.

[BibT_eX]

[DOI]

Tomas Gavenciak

Przemyslaw Gordinowicz

Pavel Klavík

Eur. J. Comb., 2018

On the structure of matrices avoiding interval-minor patterns.

[BibT_eX]

[DOI]

Stanislav Kucera

Adv. Appl. Math., 2018

Generalized Coloring of Permutations.

[BibT_eX]

[DOI]

Pavel Valtr

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

Splittability and 1-amalgamability of permutation classes.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2017

On the Beer Index of Convexity and Its Variants.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2017

Hardness of Permutation Pattern Matching.

[BibT_eX]

[DOI]

Jan Kyncl

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Ramsey-type and amalgamation-type properties of permutations.

[BibT_eX]

[DOI]

Proceedings of the Surveys in Combinatorics, 2017

2016

Unsplittable Classes of Separable Permutations.

[BibT_eX]

[DOI]

Michael Albert

Electron. J. Comb., 2016

On the Hardness of Switching to a Small Number of Edges.

[BibT_eX]

[DOI]

Eva Jelínková

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015

Testing Planarity of Partially Embedded Graphs.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2015

Splittings and Ramsey properties of permutation classes.

[BibT_eX]

[DOI]

Pavel Valtr

Adv. Appl. Math., 2015

Catalan pairs and Fishburn triples.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2015

Cops and Robbers on String Graphs.

[BibT_eX]

[DOI]

Tomas Gavenciak

Przemyslaw Gordinowicz

Pavel Klavík

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014

On q-series identities related to interval orders.

[BibT_eX]

[DOI]

George E. Andrews

Eur. J. Comb., 2014

Planar Embeddings with Small and Uniform Faces.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

2013

The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree.

[BibT_eX]

[DOI]

Graphs Comb., 2013

A Kuratowski-type theorem for planarity of partially embedded graphs.

[BibT_eX]

[DOI]

Ignaz Rutter

Comput. Geom., 2013

On multiple pattern avoiding set partitions.

[BibT_eX]

[DOI]

Mark Shattuck

Adv. Appl. Math., 2013

Cops and Robbers on Intersection Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012

Counting general and self-dual interval orders.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2012

Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns.

[BibT_eX]

[DOI]

Anders Claesson

Einar Steingrímsson

J. Comb. Theory, Ser. A, 2012

Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

2011

The Möbius function of separable and decomposable permutations.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2011

Embedding dualities for set partitions and for relational structures.

[BibT_eX]

[DOI]

Martin Klazar

Eur. J. Comb., 2011

Composition Matrices, (2+2)-Free Posets and their Specializations.

[BibT_eX]

[DOI]

Mark Dukes

Martina Kubitzke

Electron. J. Comb., 2011

Pattern Avoidance in Partial Permutations.

[BibT_eX]

[DOI]

Electron. J. Comb., 2011

2010

The rank-width of the square grid.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

Matchings and Partial Patterns.

[BibT_eX]

[DOI]

Electron. J. Comb., 2010

2009

Wilf-Equivalence on k-ary Words, Compositions, and Parking Functions.

[BibT_eX]

[DOI]

Electron. J. Comb., 2009

Monochromatic triangles in two-colored plane.

[BibT_eX]

[DOI]

Comb., 2009

2008

On Pattern-Avoiding Partitions.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

Generalizations of Khovanskiĭ's theorems on the growth of sumsets in Abelian semigroups.

[BibT_eX]

[DOI]

Martin Klazar

Adv. Appl. Math., 2008

Clustered Planarity: Clusters with Few Outgoing Edges.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 16th International Symposium, 2008

Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 16th International Symposium, 2008

2007

Labelings of Graphs with Fixed and Variable Edge-Weights.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2007

Probabilistic strategies for the partition and plurality problems.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2007

Generalizations of Khovanski's theorem on growth of sumsets in abelian semigroups: (extended abstract).

[BibT_eX]

[DOI]

Martin Klazar

Electron. Notes Discret. Math., 2007

Dyck paths and pattern-avoiding matchings.

[BibT_eX]

[DOI]

Eur. J. Comb., 2007

Noncrossing Hamiltonian paths in geometric graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

2006

Matchings Avoiding Partial Patterns and Lattice Paths.

[BibT_eX]

[DOI]

Electron. J. Comb., 2006

2005

Three Optimal Algorithms for Balls of Three Colors.

[BibT_eX]

[DOI]

Proceedings of the STACS 2005, 2005

On the Complexity of the G-Reconstruction Problem.

[BibT_eX]

[DOI]

Zdenek Dvorák