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.
Non-contractible edges in a 3-connected graph
Yoshimi Egawa
,
Katsuhiro Ota
,
Akira Saito
,
Xingxing Yu
Combinatorica
15
(3), 1995, pp. 357-364
Extending partial isomorphisms on finite structures
Bernhard Herwig
Combinatorica
15
(3), 1995, pp. 365-371
Note on a conjecture of Toft
T.R. Jensen
,
F.B. Shepherd
Combinatorica
15
(3), 1995, pp. 373-377
Point sets with distinct distances
Hanno Lefmann
,
Torsten Thiele
Combinatorica
15
(3), 1995, pp. 379-408
Gröbner bases and triangulations of the second hypersimplex
Jesús A. de Loera
,
Bernd Sturmfels
,
Rekha R. Thomas
Combinatorica
15
(3), 1995, pp. 409-424
Improved bounds on the max-flow min-cut ratio for multicommodity flows
Serge Plotkin
,
éva Tardos
Combinatorica
15
(3), 1995, pp. 425-434
A primal-dual approximation algorithm for generalized Steiner network problems
David P. Williamson
,
Michel X. Goemans
,
Milena Mihail
,
Vijay V. Vazirani
Combinatorica
15
(3), 1995, pp. 435-454
Large faces in 4-critical planar graphs with minimum degree 4
H.L. Abbott
,
D.R. Hare
,
B. Zhou
Combinatorica
15
(4), 1995, pp. 455-467
Some remarks on
(k-1)
-critical subgraphs of
k
-critical graphs
H.L. Abbott
,
B. Zhou
Combinatorica
15
(4), 1995, pp. 469-474
A splitting property of maximal antichains
Rudolf Ahlswede
,
Péter L. Erdŏs
,
Niall Graham
Combinatorica
15
(4), 1995, pp. 475-480
Local structure of graphs with
\lambda=\mu=2
,
a_2=4
K. Coolsaet
Combinatorica
15
(4), 1995, pp. 481-487
Covering the edges of a random graph by cliques
Alan Frieze
,
Bruce Reed
Combinatorica
15
(4), 1995, pp. 489-497
Minimizing submodular functions over families of sets
M.X. Goemans
,
V.S. Ramakrishnan
Combinatorica
15
(4), 1995, pp. 499-513
Principal structure of submodular systems and Hitchcock-type independent flows
Satoru Iwata
Combinatorica
15
(4), 1995, pp. 515-532
Existence of vertices of local connectivity
k
in digraphs of large outdegree
W. Mader
Combinatorica
15
(4), 1995, pp. 533-539
Uniqueness and minimality of large face-width embeddings of graphs
Bojan Mohar
Combinatorica
15
(4), 1995, pp. 541-556
On rank vs. communication complexity
Noam Nisan
,
Avi Wigderson
Combinatorica
15
(4), 1995, pp. 557-565
On the ``log rank''-conjecture in communication complexity
Ran Raz
,
Boris Spieker
Combinatorica
15
(4), 1995, pp. 567-588
Ramsey families which exclude a graph
V. Rödl
,
N. Sauer
,
X. Zhu
Combinatorica
15
(4), 1995, pp. 589-596
Seiten
<
1
2