Martin Klazar

33 papers Journal 32Unranked 1
YearRankTypeTitle / Venue / Authors
2023 J jnl
A jump to the Narayana number for hereditary properties of ordered 3-uniform hypergraphs.
Eur. J. Comb.
Jaroslav Hancl, Martin Klazar
2022 J jnl
Are the Catalan Numbers a Linear Recurrence Sequence?
Am. Math. Mon.
Martin Klazar, Richard Horský
2011 J jnl
Embedding dualities for set partitions and for relational structures.
Eur. J. Comb.
Vít Jelínek, Martin Klazar
2011 J jnl
Exact Algorithms for
Algorithmica
Frédéric Havet, Martin Klazar, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff
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 Growth Rates of Permutations, Set Partitions, Ordered Graphs and Other Objects.
Electron. J. Comb.
Martin Klazar
2007 J jnl
Extensions of the linear bound in the Füredi-Hajnal conjecture.
Adv. Appl. Math.
Martin Klazar, Adam Marcus
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
2006 J jnl
On Identities Concerning the Numbers of Crossings and Nestings of Two Edges in Matchings.
SIAM J. Discret. Math.
Martin Klazar
2005 J jnl
Counting Set Systems by Weight.
Electron. J. Comb.
Martin Klazar
2004 J jnl
Extremal problems for ordered (hyper)graphs: applications of Davenport-Schinzel sequences.
Eur. J. Comb.
Martin Klazar
2004 J jnl
Extremal problems for ordered hypergraphs: small patterns and some enumeration.
Discret. Appl. Math.
Martin Klazar
2004 J jnl
On the least exponential growth admitting uncountably many closed permutation classes.
Theor. Comput. Sci.
Martin Klazar
2003 J jnl
A bijection between nonnegative words and sparse abba-free partitions.
Discret. Math.
Jan Nemecek, Martin Klazar
2003 J jnl
Bell numbers, their relatives, and algebraic differential equations.
J. Comb. Theory A
Martin Klazar
2003 J jnl
Counting Even and Odd Partitions.
Am. Math. Mon.
Martin Klazar
2003 J jnl
Non-P-recursiveness of numbers of matchings or linear chord diagrams with many crossings.
Adv. Appl. Math.
Martin Klazar
2002 J jnl
On Growth Rates of Closed Permutation Classes.
Electron. J. Comb.
Tomás Kaiser, Martin Klazar
2000 J jnl
Counting Pattern-free Set Partitions I: A Generalization of Stirling Numbers of the Second Kind.
Eur. J. Comb.
Martin Klazar
2000 J jnl
Counting Pattern-free Set Partitions II: Noncrossing and Other Hypergraphs.
Electron. J. Comb.
Martin Klazar
1999 J jnl
Extremal problems for colored trees and Davenport-Schinzel sequences.
Discret. Math.
Martin Klazar
1998 J jnl
On Trees and Noncrossing Partitions.
Discret. Appl. Math.
Martin Klazar
1998 J jnl
On numbers of Davenport-Schinzel sequences.
Discret. Math.
Martin Klazar
1997 J jnl
Addendum Twelve Countings with Rooted Plane Trees.
Eur. J. Comb.
Martin Klazar
1997 J jnl
Combinatorial aspects of Davenport-Schinzel sequences.
Discret. Math.
Martin Klazar
1997 — conf
On the maximum lengths of Davenport-Schinzel sequences.
Contemporary Trends in Discrete Mathematics
Martin Klazar
1997 J jnl
On well quaasiordering of finite languages.
Discret. Math.
Martin Klazar
1997 J jnl
Twelve Countings with Rooted Plane Trees.
Eur. J. Comb.
Martin Klazar
1996 J jnl
Extremal functions for sequences.
Discret. Math.
Martin Klazar
1996 J jnl
On abab-free and abba-free Set Partitions.
Eur. J. Comb.
Martin Klazar
1994 J jnl
A Linear Upper Bound in Extremal Theory of Sequences.
J. Comb. Theory A
Martin Klazar
1994 J jnl
Generalized Davenport-Schinzel Sequences.
Comb.
Martin Klazar, Pavel Valtr
1992 J jnl
Generalized Davenport-Schinzel sequences with linear upper bound.
Discret. Math.
Radek Adamec, Martin Klazar, Pavel Valtr