Martin Klazar - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 33 from 33

2023

A jump to the Narayana number for hereditary properties of ordered 3-uniform hypergraphsJaroslav Hancl, Martin Klazar. ejc, 113:103744, October 2023. [doi]

2022

Are the Catalan Numbers a Linear Recurrence Sequence?Martin Klazar, Richard Horský. tamm, 129(2):166-171, 2022. [doi]

2011

Exact Algorithms for ::::L::::(2, 1)-Labeling of GraphsFrédéric Havet, Martin Klazar, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff. algorithmica, 59(2):169-194, 2011. [doi]

Embedding dualities for set partitions and for relational structuresVít Jelínek, Martin Klazar. ejc, 32(7):1084-1096, 2011. [doi]

2008

Generalizations of Khovanskiĭ's theorems on the growth of sumsets in Abelian semigroupsVít Jelínek, Martin Klazar. aam, 41(1):115-132, 2008. [doi]

On Growth Rates of Permutations, Set Partitions, Ordered Graphs and Other ObjectsMartin Klazar. combinatorics, 15(1), 2008. [doi]

2007

Generalizations of Khovanski s theorem on growth of sumsets in abelian semigroups: (extended abstract)Vít Jelínek, Martin Klazar. endm, 29:273-276, 2007. [doi]

Extensions of the linear bound in the Füredi-Hajnal conjectureMartin Klazar, Adam Marcus 0001. aam, 38(2):258-266, 2007. [doi]

2006

On Identities Concerning the Numbers of Crossings and Nestings of Two Edges in MatchingsMartin Klazar. siamdm, 20(4):960-976, 2006. [doi]

2005

Counting Set Systems by WeightMartin Klazar. combinatorics, 12, 2005. [doi]

2004

Extremal problems for ordered hypergraphs: small patterns and some enumerationMartin Klazar. DAM, 143(1-3):144-154, 2004. [doi]

Extremal problems for ordered (hyper)graphs: applications of Davenport-Schinzel sequencesMartin Klazar. ejc, 25(1):125-140, 2004. [doi]

On the least exponential growth admitting uncountably many closed permutation classesMartin Klazar. TCS, 321(2-3):271-281, 2004. [doi]

2003

Bell numbers, their relatives, and algebraic differential equationsMartin Klazar. JCT, 102(1):63-87, 2003. [doi]

Counting Even and Odd PartitionsMartin Klazar. tamm, 110(6):527-532, 2003. [doi]

Non-P-recursiveness of numbers of matchings or linear chord diagrams with many crossingsMartin Klazar. aam, 30(1-2):126-136, 2003. [doi]

A bijection between nonnegative words and sparse abba-free partitionsJan Nemecek, Martin Klazar. DM, 265(1-3):411-416, 2003. [doi]

2002

On Growth Rates of Closed Permutation ClassesTomás Kaiser, Martin Klazar. combinatorics, on(2), 2002. [doi]

2000

Counting Pattern-free Set Partitions I: A Generalization of Stirling Numbers of the Second KindMartin Klazar. ejc, 21(3):367-378, 2000. [doi]

Counting Pattern-free Set Partitions II: Noncrossing and Other HypergraphsMartin Klazar. combinatorics, 7, 2000. [doi]

1999

Extremal problems for colored trees and Davenport-Schinzel sequencesMartin Klazar. DM, 197-198:469-482, 1999. [doi]

1998

On Trees and Noncrossing PartitionsMartin Klazar. DAM, 82(1-3):263-269, 1998. [doi]

On numbers of Davenport-Schinzel sequencesMartin Klazar. DM, 185(1-3):77-87, 1998. [doi]

1997

Twelve Countings with Rooted Plane TreesMartin Klazar. ejc, 18(2):195-210, 1997. [doi]

Combinatorial aspects of Davenport-Schinzel sequencesMartin Klazar. DM, 165-166:431-445, 1997. [doi]

Addendum Twelve Countings with Rooted Plane TreesMartin Klazar. ejc, 18(6):739-740, 1997. [doi]

On well quaasiordering of finite languagesMartin Klazar. DM, 163(1-3):81-88, 1997. [doi]

On the maximum lengths of Davenport-Schinzel sequencesMartin Klazar. dimacs 1999: 169-178

1996

Extremal functions for sequencesMartin Klazar. DM, 150(1-3):195-203, 1996. [doi]

On abab-free and abba-free Set PartitionsMartin Klazar. ejc, 17(1):53-68, 1996. [doi]

1994

A Linear Upper Bound in Extremal Theory of SequencesMartin Klazar. JCT, 68(2):454-464, 1994.

Generalized Davenport-Schinzel SequencesMartin Klazar, Pavel Valtr. combinatorica, 14(4):463-476, 1994.

1992

Generalized Davenport-Schinzel sequences with linear upper boundRadek Adamec, Martin Klazar, Pavel Valtr. DM, 108(1-3):219-229, 1992. [doi]

Sign in or sign up to see more results.

runs on WebDSL