default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Klazar
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j32]Jaroslav Hancl
, Martin Klazar:
A jump to the Narayana number for hereditary properties of ordered 3-uniform hypergraphs. Eur. J. Comb. 113: 103744 (2023)- 2022
- [j31]Martin Klazar, Richard Horský:
Are the Catalan Numbers a Linear Recurrence Sequence? Am. Math. Mon. 129(2): 166-171 (2022)
2010 – 2019
- 2011
- [j30]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) - [j29]Vít Jelínek, Martin Klazar:
Embedding dualities for set partitions and for relational structures. Eur. J. Comb. 32(7): 1084-1096 (2011)
2000 – 2009
- 2008
- [j28]Vít Jelínek, Martin Klazar:
Generalizations of Khovanskiĭ's theorems on the growth of sumsets in Abelian semigroups. Adv. Appl. Math. 41(1): 115-132 (2008) - [j27]Martin Klazar:
On Growth Rates of Permutations, Set Partitions, Ordered Graphs and Other Objects. Electron. J. Comb. 15(1) (2008) - 2007
- [j26]Martin Klazar, Adam Marcus:
Extensions of the linear bound in the Füredi-Hajnal conjecture. Adv. Appl. Math. 38(2): 258-266 (2007) - [j25]Vít Jelínek, Martin Klazar:
Generalizations of Khovanski's theorem on growth of sumsets in abelian semigroups: (extended abstract). Electron. Notes Discret. Math. 29: 273-276 (2007) - 2006
- [j24]Martin Klazar:
On Identities Concerning the Numbers of Crossings and Nestings of Two Edges in Matchings. SIAM J. Discret. Math. 20(4): 960-976 (2006) - 2005
- [j23]Martin Klazar:
Counting Set Systems by Weight. Electron. J. Comb. 12 (2005) - 2004
- [j22]Martin Klazar:
Extremal problems for ordered hypergraphs: small patterns and some enumeration. Discret. Appl. Math. 143(1-3): 144-154 (2004) - [j21]Martin Klazar:
Extremal problems for ordered (hyper)graphs: applications of Davenport-Schinzel sequences. Eur. J. Comb. 25(1): 125-140 (2004) - [j20]Martin Klazar:
On the least exponential growth admitting uncountably many closed permutation classes. Theor. Comput. Sci. 321(2-3): 271-281 (2004) - 2003
- [j19]Martin Klazar:
Non-P-recursiveness of numbers of matchings or linear chord diagrams with many crossings. Adv. Appl. Math. 30(1-2): 126-136 (2003) - [j18]Jan Nemecek, Martin Klazar:
A bijection between nonnegative words and sparse abba-free partitions. Discret. Math. 265(1-3): 411-416 (2003) - [j17]Martin Klazar:
Bell numbers, their relatives, and algebraic differential equations. J. Comb. Theory A 102(1): 63-87 (2003) - [j16]Martin Klazar:
Counting Even and Odd Partitions. Am. Math. Mon. 110(6): 527-532 (2003) - 2002
- [j15]Tomás Kaiser, Martin Klazar:
On Growth Rates of Closed Permutation Classes. Electron. J. Comb. 9(2) (2002) - 2000
- [j14]Martin Klazar:
Counting Pattern-free Set Partitions II: Noncrossing and Other Hypergraphs. Electron. 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)
1990 – 1999
- 1999
- [j12]Martin Klazar:
Extremal problems for colored trees and Davenport-Schinzel sequences. Discret. Math. 197-198: 469-482 (1999) - 1998
- [j11]Martin Klazar:
On Trees and Noncrossing Partitions. Discret. Appl. Math. 82(1-3): 263-269 (1998) - [j10]Martin Klazar:
On numbers of Davenport-Schinzel sequences. Discret. Math. 185(1-3): 77-87 (1998) - 1997
- [j9]Martin Klazar:
On well quaasiordering of finite languages. Discret. Math. 163(1-3): 81-88 (1997) - [j8]Martin Klazar:
Combinatorial aspects of Davenport-Schinzel sequences. Discret. Math. 165-166: 431-445 (1997) - [j7]Martin Klazar:
Twelve Countings with Rooted Plane Trees. Eur. J. Comb. 18(2): 195-210 (1997) - [j6]Martin Klazar:
Addendum Twelve Countings with Rooted Plane Trees. Eur. J. Comb. 18(6): 739-740 (1997) - [c1]Martin Klazar:
On the maximum lengths of Davenport-Schinzel sequences. Contemporary Trends in Discrete Mathematics 1997: 169-178 - 1996
- [j5]Martin Klazar:
Extremal functions for sequences. Discret. Math. 150(1-3): 195-203 (1996) - [j4]Martin Klazar:
On abab-free and abba-free Set Partitions. Eur. J. Comb. 17(1): 53-68 (1996) - 1994
- [j3]Martin Klazar, Pavel Valtr:
Generalized Davenport-Schinzel Sequences. Comb. 14(4): 463-476 (1994) - [j2]Martin Klazar:
A Linear Upper Bound in Extremal Theory of Sequences. J. Comb. Theory A 68(2): 454-464 (1994) - 1992
- [j1]Radek Adamec, Martin Klazar, Pavel Valtr:
Generalized Davenport-Schinzel sequences with linear upper bound. Discret. Math. 108(1-3): 219-229 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
