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=Combinatorica AND YEAR=1996
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Biased random walks
Yossi Azar
,
Andrei Z. Broder
,
Anna R. Karlin
,
Nathan Linial
,
Steven Philllips
Combinatorica
16
(1), 1996, pp. 1-18
Non-repetitive words: Ages and essences
James D. Currie
Combinatorica
16
(1), 1996, pp. 19-40
Finding the
\alpha*n
-th largest element
Dorit Dor
,
Uri Zwick
Combinatorica
16
(1), 1996, pp. 41-58
Graphs of small dimensions
Nancy Eaton
,
Vojtȇch Rödl
Combinatorica
16
(1), 1996, pp. 59-85
Difference sets and inverting the difference operator
Zoltán Füredi
,
Carl G., Jr. Jockusch
,
Lee A. Rubel
Combinatorica
16
(1), 1996, pp. 87-106
Turán's extremal problem in random graphs: Forbidding odd cycles
P.E. Haxell
,
Y. Kohayakawa
,
T. Łuczak
Combinatorica
16
(1), 1996, pp. 107-122
Multiplicities of subgraphs
Chris Jagger
,
Pavel S̑t̑ovíc̑ek
,
Andrew Thomason
Combinatorica
16
(1), 1996, pp. 123-141
Complexity of the Frobenius problem
J.L. Ramírez-Alfonsín
Combinatorica
16
(1), 1996, pp. 143-147
On a theorem of Lovász on covers in
r
-partite hypergraphs
Ron Aharoni
,
Ron Holzman
,
Michael Krivelevich
Combinatorica
16
(2), 1996, pp. 149-174
All 0-1 polytopes are Traveling Salesman polytopes
Louis J. Billera
,
A. Sarangarajan
Combinatorica
16
(2), 1996, pp. 175-188
Independence and port oracles for matroids, with an application to computational learning theory
Collette R. Coullard
,
Lisa Hellerstein
Combinatorica
16
(2), 1996, pp. 189-208
Minimal imperfect graphs: A simple approach
G.S. Gasparian
Combinatorica
16
(2), 1996, pp. 209-212
On point covers of multiple intervals and axis-parallel rectangles
Gyula Károlyi
,
Gábor Tardos
Combinatorica
16
(2), 1996, pp. 213-222
Packing circuits in Eulerian digraphs
P.D. Seymour
Combinatorica
16
(2), 1996, pp. 223-231
On a matroid defined by ear-decompositions of graphs
Zoltán Szigeti
Combinatorica
16
(2), 1996, pp. 233-241
How much are increasing sets positively correlated?
Michel Talagrand
Combinatorica
16
(2), 1996, pp. 243-258
On the recognition complexity of some graph properties
Eberhard Triesch
Combinatorica
16
(2), 1996, pp. 259-268
Lines, line-point incidences and crossing families in dense sets
Pavel Valtr
Combinatorica
16
(2), 1996, pp. 269-294
A strongly regular
N
-full graph of small order
Van H. Vu
Combinatorica
16
(2), 1996, pp. 295-299
Bipartite subgraphs
Noga Alon
Combinatorica
16
(3), 1996, pp. 301-311
Highly linked graphs
Béla Bollobás
,
Andrew Thomason
Combinatorica
16
(3), 1996, pp. 313-320
A remark on sets having the Steinhaus property
Mihai Ciucu
Combinatorica
16
(3), 1996, pp. 321-324
Perfect matchings in balanced hypergraphs
Michele Conforti
,
Gérard Cornuéjols
,
Ajai Kapoor
,
Kristina Vus̆ković
Combinatorica
16
(3), 1996, pp. 325-329
Bounding the number of circuits of a graph
Guoli Ding
Combinatorica
16
(3), 1996, pp. 331-341
List edge colourings of some 1-factorable multigraphs
M.N. Ellingham
,
Luis Goddyn
Combinatorica
16
(3), 1996, pp. 343-352
Seiten 1
2
>