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: Journal=J. Comb.~Theory Series A AND Volume=118
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On
p
-covalenced association schemes
Mitsugu Hirasaka
,
Kyoung-tark Kim
Journal of Combinatorial Theory Series A
118
(1), 2011, pp. 1-8
A curious
q
-analogue of Hermite polynomials
Johann Cigler
,
Jiang Zeng
Journal of Combinatorial Theory Series A
118
(1), 2011, pp. 9-26
Non-Abelian skew Hadamard difference sets fixed by a prescribed automorphism
Tao Feng
Journal of Combinatorial Theory Series A
118
(1), 2011, pp. 27-36
Bases for diagonally alternating harmonic polynomials of low degree
Nantel Bergeron
,
Zhi Chen
Journal of Combinatorial Theory Series A
118
(1), 2011, pp. 37-57
Combinatorial formulas for
?
-coordinates in a totally nonnegative Grassmannian
Kelli Talaska
Journal of Combinatorial Theory Series A
118
(1), 2011, pp. 58-66
Partitions and indivisibility properties of countable dimensional vector spaces
C. Laflamme
,
L. Nguyen Van Thé
,
M. Pouzet
,
N. Sauer
Journal of Combinatorial Theory Series A
118
(1), 2011, pp. 67-77
On a generalisation of the Dipper-James-Murphy conjecture
Jun Hu
Journal of Combinatorial Theory Series A
118
(1), 2011, pp. 78-93
Generalized Stirling permutations, families of increasing trees and urn models
Svante Janson
,
Markus Kuba
,
Alois Panholzer
Journal of Combinatorial Theory Series A
118
(1), 2011, pp. 94-114
A bijective enumeration of labeled trees with given indegree sequence
Heesung Shin
,
Jiang Zeng
Journal of Combinatorial Theory Series A
118
(1), 2011, pp. 115-128
Enumeration of non-crossing pairings on bit strings
Todd Kemp
,
Karl Mahlburg
,
Amarpreet Rattan
,
Clifford Smyth
Journal of Combinatorial Theory Series A
118
(1), 2011, pp. 129-151
New inequalities for subspace arrangements
Ryan Kinser
Journal of Combinatorial Theory Series A
118
(1), 2011, pp. 152-161
The number of extreme points of tropical polyhedra
Xavier Allamigeon
,
Stéphane Gaubert
,
Ricardo D. Katz
Journal of Combinatorial Theory Series A
118
(1), 2011, pp. 162-189
An upper bound on the minimum weight of type II
\mathbb {Z}_{2k}
-codes
Masaaki Harada
,
Tsuyoshi Miezaki
Journal of Combinatorial Theory Series A
118
(1), 2011, pp. 190-196
Transversals to the convex hulls of all
k
-sets of discrete subsets of
\mathbb R^n
J.L. Arocha
,
J. Bracho
,
L. Montejano
,
J.L. Ramírez Alfonsín
Journal of Combinatorial Theory Series A
118
(1), 2011, pp. 197-207
Stability for
t
-intersecting families of permutations
David Ellis
Journal of Combinatorial Theory Series A
118
(1), 2011, pp. 208-227
Kakeya sets in finite affine spaces
Antonio Maschietti
Journal of Combinatorial Theory Series A
118
(1), 2011, pp. 228-230
Affine geometry designs, polarities, and Hamada's conjecture
David Clark
,
Dieter Jungnickel
,
Vladimir D. Tonchev
Journal of Combinatorial Theory Series A
118
(1), 2011, pp. 231-239
Bailey's well-poised
_6\psi_6
-series implies the Askey-Wilson integral
Wenchang Chu
,
Xinrong Ma
Journal of Combinatorial Theory Series A
118
(1), 2011, pp. 240-247
The complexity of node blocking for dags
Dariusz Dereniowski
Journal of Combinatorial Theory Series A
118
(1), 2011, pp. 248-256
A noncrossing basis for noncommutative invariants of
SL(2, \mathbb C)
Franz Lehner
Journal of Combinatorial Theory Series A
118
(1), 2011, pp. 257-269
On the existence of orthogonal arrays OA
(3,5,4n+2)
Jianxing Yin
,
Jianmin Wang
,
Lijun Ji
,
Yang Li
Journal of Combinatorial Theory Series A
118
(1), 2011, pp. 270-276
A Pieri rule for skew shapes
Sami H. Assaf
,
Peter R.W. McNamara
Journal of Combinatorial Theory Series A
118
(1), 2011, pp. 277-290
A universal sequence of integers generating balanced Steinhaus figures modulo an odd number
Jonathan Chappelon
Journal of Combinatorial Theory Series A
118
(1), 2011, pp. 291-315
Substitution-closed pattern classes
M.D. Atkinson
,
N. Rus̑kuc
,
Rebecca Smith
Journal of Combinatorial Theory Series A
118
(2), 2011, pp. 317-340
Computational complexity of reconstruction and isomorphism testing for designs and line graphs
Michael Huber
Journal of Combinatorial Theory Series A
118
(2), 2011, pp. 341-349
Seiten 1
2
3
4
5
6
7
>