| * | 2007 |
|---|
| 23 | EE | Vít Jelínek,
Martin Klazar:
Generalizations of Khovanski's theorem on growth of sumsets in abelian semigroups: (extended abstract).
Electronic Notes in Discrete Mathematics 29: 273-276 (2007) |
| 2006 |
|---|
| 22 | EE | Martin Klazar:
On Identities Concerning the Numbers of Crossings and Nestings of Two Edges in Matchings.
SIAM J. Discrete Math. 20(4): 960-976 (2006) |
| 2005 |
|---|
| 21 | EE | Martin Klazar:
Counting Set Systems by Weight.
Electr. J. Comb. 12: (2005) |
| 2004 |
|---|
| 20 | EE | Martin Klazar:
Extremal problems for ordered hypergraphs: small patterns and some enumeration.
Discrete Applied Mathematics 143(1-3): 144-154 (2004) |
| 19 | EE | Martin Klazar:
Extremal problems for ordered (hyper)graphs: applications of Davenport-Schinzel sequences.
Eur. J. Comb. 25(1): 125-140 (2004) |
| 18 | EE | Martin Klazar:
On the least exponential growth admitting uncountably many closed permutation classes.
Theor. Comput. Sci. 321(2-3): 271-281 (2004) |
| 2003 |
|---|
| 17 | EE | Jan Nemecek,
Martin Klazar:
A bijection between nonnegative words and sparse abba-free partitions.
Discrete Mathematics 265(1-3): 411-416 (2003) |
| 16 | EE | Martin Klazar:
Bell numbers, their relatives, and algebraic differential equations.
J. Comb. Theory, Ser. A 102(1): 63-87 (2003) |
| 2002 |
|---|
| 15 | EE | Tomás Kaiser,
Martin Klazar:
On Growth Rates of Closed Permutation Classes.
Electr. J. Comb. on(2): (2002) |
| 2000 |
|---|
| 14 | EE | Martin Klazar:
Counting Pattern-free Set Partitions II: Noncrossing and Other Hypergraphs.
Electr. J. Comb. 7: (2000) |
| 13 | EE | Martin Klazar:
Counting Pattern-free Set Partitions I: A Generalization of Stirling Numbers of the Second Kind.
Eur. J. Comb. 21(3): 367-378 (2000) |
| 1999 |
|---|
| 12 | EE | Martin Klazar:
Extremal problems for colored trees and Davenport-Schinzel sequences.
Discrete Mathematics 197-198: 469-482 (1999) |
| 1998 |
|---|
| 11 | EE | Martin Klazar:
On Trees and Noncrossing Partitions.
Discrete Applied Mathematics 82(1-3): 263-269 (1998) |
| 10 | EE | Martin Klazar:
On numbers of Davenport-Schinzel sequences.
Discrete Mathematics 185(1-3): 77-87 (1998) |
| 1997 |
|---|
| 9 | EE | Martin Klazar:
On well quaasiordering of finite languages.
Discrete Mathematics 163(1-3): 81-88 (1997) |
| 8 | EE | Martin Klazar:
Combinatorial aspects of Davenport-Schinzel sequences.
Discrete Mathematics 165-166: 431-445 (1997) |
| 7 | EE | Martin Klazar:
Twelve Countings with Rooted Plane Trees.
Eur. J. Comb. 18(2): 195-210 (1997) |
| 6 | EE | Martin Klazar:
Addendum Twelve Countings with Rooted Plane Trees.
Eur. J. Comb. 18(6): 739-740 (1997) |
| 1996 |
|---|
| 5 | EE | Martin Klazar:
Extremal functions for sequences.
Discrete Mathematics 150(1-3): 195-203 (1996) |
| 4 | EE | Martin Klazar:
On abab-free and abba-free Set Partitions.
Eur. J. Comb. 17(1): 53-68 (1996) |
| 1994 |
|---|
| 3 | | Martin Klazar,
Pavel Valtr:
Generalized Davenport-Schinzel Sequences.
Combinatorica 14(4): 463-476 (1994) |
| 2 | | Martin Klazar:
A Linear Upper Bound in Extremal Theory of Sequences.
J. Comb. Theory, Ser. A 68(2): 454-464 (1994) |
| 1992 |
|---|
| 1 | EE | Radek Adamec,
Martin Klazar,
Pavel Valtr:
Generalized Davenport-Schinzel sequences with linear upper bound.
Discrete Mathematics 108(1-3): 219-229 (1992) |
