- CSB - MetaPress - Google - Bing - Yahoo
 | 2011 | |
|---|---|---|
| j27 |      | Frédéric Havet, Martin Klazar, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff: Exact Algorithms for L(2, 1)-Labeling of Graphs. Algorithmica 59(2): 169-194 (2011) |
| j26 | | Vít Jelínek, Martin Klazar: Embedding dualities for set partitions and for relational structures. Eur. J. Comb. 32(7): 1084-1096 (2011) |
| 2008 | ||
| j25 | | Martin Klazar: On Growth Rates of Permutations, Set Partitions, Ordered Graphs and Other Objects. Electr. J. Comb. 15(1) (2008) |
| 2007 | ||
| j24 | | 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 | ||
| j23 | | 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 | ||
| j22 | | |
| 2004 | ||
| j21 | | Martin Klazar: Extremal problems for ordered hypergraphs: small patterns and some enumeration. Discrete Applied Mathematics 143(1-3): 144-154 (2004) |
| j20 | | Martin Klazar: Extremal problems for ordered (hyper)graphs: applications of Davenport-Schinzel sequences. Eur. J. Comb. 25(1): 125-140 (2004) |
| j19 | | Martin Klazar: On the least exponential growth admitting uncountably many closed permutation classes. Theor. Comput. Sci. 321(2-3): 271-281 (2004) |
| 2003 | ||
| j18 | | Jan Nemecek, Martin Klazar: A bijection between nonnegative words and sparse abba-free partitions. Discrete Mathematics 265(1-3): 411-416 (2003) |
| j17 | | Martin Klazar: Bell numbers, their relatives, and algebraic differential equations. J. Comb. Theory, Ser. A 102(1): 63-87 (2003) |
| j16 | | Martin Klazar: Counting Even and Odd Partitions. The American Mathematical Monthly 110(6): 527-532 (2003) |
| 2002 | ||
| j15 | | Tomás Kaiser, Martin Klazar: On Growth Rates of Closed Permutation Classes. Electr. J. Comb. on(2) (2002) |
| 2000 | ||
| j14 | | Martin Klazar: Counting Pattern-free Set Partitions II: Noncrossing and Other Hypergraphs. Electr. J. Comb. 7 (2000) |
| j13 | | 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 | ||
| j12 | | Martin Klazar: Extremal problems for colored trees and Davenport-Schinzel sequences. Discrete Mathematics 197-198: 469-482 (1999) |
| 1998 | ||
| j11 | | Martin Klazar: On Trees and Noncrossing Partitions. Discrete Applied Mathematics 82(1-3): 263-269 (1998) |
| j10 | | Martin Klazar: On numbers of Davenport-Schinzel sequences. Discrete Mathematics 185(1-3): 77-87 (1998) |
| 1997 | ||
| j9 | | Martin Klazar: On well quaasiordering of finite languages. Discrete Mathematics 163(1-3): 81-88 (1997) |
| j8 | | Martin Klazar: Combinatorial aspects of Davenport-Schinzel sequences. Discrete Mathematics 165-166: 431-445 (1997) |
| j7 | | |
| j6 | | Martin Klazar: Addendum Twelve Countings with Rooted Plane Trees. Eur. J. Comb. 18(6): 739-740 (1997) |
| 1996 | ||
| j5 | | |
| j4 | | |
| 1994 | ||
| j3 | | Martin Klazar, Pavel Valtr: Generalized Davenport-Schinzel Sequences. Combinatorica 14(4): 463-476 (1994) |
| j2 |  | Martin Klazar: A Linear Upper Bound in Extremal Theory of Sequences. J. Comb. Theory, Ser. A 68(2): 454-464 (1994) |
| 1992 | ||
| j1 | | Radek Adamec, Martin Klazar, Pavel Valtr: Generalized Davenport-Schinzel sequences with linear upper bound. Discrete Mathematics 108(1-3): 219-229 (1992) |
| 1 | Radek Adamec | |
| 2 | Frédéric Havet | |
| 3 | Vít Jelínek (Vítek Jelínek) | |
| 4 | Tomás Kaiser | |
| 5 | Jan Kratochvíl | |
| 6 | Dieter Kratsch | |
| 7 | Mathieu Liedloff | |
| 8 | Jan Nemecek | |
| 9 | Pavel Valtr |
Data released under the ODC-BY 1.0 license — See also our legal information page