Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Klazar, Martin"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Exact algorithms for
L(2,1)
-labeling of graphs
Frédéric Havet
,
Martin Klazar
,
Jan Kratochvíl
,
Dieter Kratsch
,
Mathieu Liedloff
Algorithmica
59
(2), 2011, pp. 169-194
On identities concerning the numbers of crossings and nestings of two edges in matchings
Martin Klazar
SIAM Journal on Discrete Mathematics
20
(4), 2006, pp. 960-976
On the least exponential growth admitting uncountably many closed permutation classes
Martin Klazar
Theoretical Computer Science
321
(2-3), 2004, pp. 271-281
Bell numbers, their relatives, and algebraic differential equations
Martin Klazar
Journal of Combinatorial Theory Series A
102
(1), 2003, pp. 63-87
On trees and noncrossing partitions
Martin Klazar
Discrete Applied Mathematics
82
(1-3), 1998, pp. 263-269
Generalized Davenport-Schinzel sequences
Martin Klazar
,
Pavel Valtr
Combinatorica
14
(2), 1994, pp. 463-476
A linear upper bound in extremal theory of sequences
Martin Klazar
Journal of Combinatorial Theory Series A
68
(2), 1994, pp. 454-464