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 Volume=15
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The complexity of computing the tutte polynomial on transversal matroids
Charles J. Colbourn
,
J. Scott Provan
,
Dirk Vertigan
Combinatorica
15
(1), 1995, pp. 1-10
Riffle shuffles, cycles, and descents
Persi Diaconis
,
Michael Mc Grath
,
Jim Pitman
Combinatorica
15
(1), 1995, pp. 11-29
Some graphs with small second eigenvalue
Joel Friedman
Combinatorica
15
(1), 1995, pp. 31-42
An analysis of a Monte Carlo algorithm for estimating the permanent
Alan Frieze
,
Mark Jerrum
Combinatorica
15
(1), 1995, pp. 67-83
On Erd\Hos-Rado numbers
Hanno Lefmann
,
Vojtĕch Rödl
Combinatorica
15
(1), 1995, pp. 85-104
On the number of lines in planar spaces
Klaus Metsch
Combinatorica
15
(1), 1995, pp. 105-110
Natural bounded concentrators
Moshe Morgenstern
Combinatorica
15
(1), 1995, pp. 111-122
Transversals of 2-intervals, a topological approach
Gábor Tardos
Combinatorica
15
(1), 1995, pp. 123-134
A linear-time algorithm for edge-disjoint paths in planar graphs
Dorothea Wagner
,
Karsten Weihe
Combinatorica
15
(1), 1995, pp. 135-150
Penny-packings with minimal second moments
Timothy Y. Chow
Combinatorica
15
(2), 1995, pp. 151-158
Bounding the number of bases of a matroid
Guoli Ding
Combinatorica
15
(2), 1995, pp. 159-165
Circle grids and bipartite graphs of distances
G. Elekes
Combinatorica
15
(2), 1995, pp. 167-174
The minimum independence number for designs
David A. Grable
,
Kevin T. Phelps
,
Vojtĕch Rödl
Combinatorica
15
(2), 1995, pp. 175-185
An approximate max-flow min-cut relation for undirected multicommodity flow, with applications
Philip Klein
,
Satish Rao
,
Ajit Agrawal
,
R. Ravi
Combinatorica
15
(2), 1995, pp. 187-202
A one-round, two-prover, zero-knowledge protocol for
NP
Dror Lapidot
,
Adi Shamir
Combinatorica
15
(2), 1995, pp. 203-214
The geometry of graphs and some of its algorithmic applications
Nathan Linial
,
Eran London
,
Yuri Rabinovich
Combinatorica
15
(2), 1995, pp. 215-245
Hamiltonian cycles in bipartite graphs
Xiaoyun Lu
Combinatorica
15
(2), 1995, pp. 247-254
The local nature of
\Delta
-coloring and its algorithmic applications
Alessandro Panconesi
,
Aravind Srinivasan
Combinatorica
15
(2), 1995, pp. 255-280
Packing directed circuits fractionally
P.D. Seymour
Combinatorica
15
(2), 1995, pp. 281-288
Minimal orientations of colour critical graphs
D.A. Youngs
Combinatorica
15
(2), 1995, pp. 289-295
Sensitivity vs. block sensitivity of Boolean functions
David Rubinstein
Combinatorica
15
(2), 1995, pp. 297-299
A lattice point problem and additive number theory
Noga Alon
,
Moshe Dubiner
Combinatorica
15
(3), 1995, pp. 301-309
A nonexistence result for Abelian Menon difference sets using perfect binary arrays
K.T. Arasu
,
James A. Davis
,
J. Jedwab
Combinatorica
15
(3), 1995, pp. 311-317
Fast perfect-information leader-election protocols with linear immunity
Jason Cooper
,
Nathan Linial
Combinatorica
15
(3), 1995, pp. 319-332
Infinite partition regular matrices
Walter A. Deuber
,
Neil Hindman
,
Imre Leader
,
Hanno Lefmann
Combinatorica
15
(3), 1995, pp. 333-355
Seiten 1
2
>