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
[1]
Hilfe
Suche: Journal=Combinatorica AND YEAR=1985
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A strongly polynomial minimum cost circulation algorithm
éva Tardos
Combinatorica
5
, 1985, pp. 247-255
A shellable poset that is not lexicographically shellable
A. Vince
,
M. Wachs
Combinatorica
5
, 1985, pp. 257-260
Independent sets in
k
-chromatic graphs
H.-J. Voss
Combinatorica
5
, 1985, pp. 261-269
Computing the genus of the 2-amalgamations of graphs
R.W. Decker
,
H.H. Glover
,
J.P. Huneke
Combinatorica
5
, 1985, pp. 271-282
Some remarks on universal graphs
Reinhard Diestel
,
Rudolf Halin
,
Walter Vogler
Combinatorica
5
, 1985, pp. 283-293
On the existence of two non-neighboring subgraphs in a graph
M. El-Zahar
,
P. Erdŏs
Combinatorica
5
, 1985, pp. 295-300
About the ratio of the size of a maximum antichain to the size of a maximum level in finite partially ordered sets
Konrad Engel
,
Nikolaj Nikolajevic̑ Kuzjurin
Combinatorica
5
, 1985, pp. 301-309
Multipartite graph - sparse graph Ramsey numbers
P. Erdŏs
,
R.J. Faudree
,
C.C. Rousseau
,
R.H. Schelp
Combinatorica
5
, 1985, pp. 311-318
A problem of P. Seymour on nonbinary matroids
Jeff Kahn
Combinatorica
5
, 1985, pp. 319-323
Families of cuts with the MFMC-property
A.V. Karzanov
Combinatorica
5
, 1985, pp. 325-335
An inequality conjectured by Hajela and Seymour arising in combinatorial geometry
H.J. Landau
,
B.F. Logan
,
L.A. Shepp
Combinatorica
5
, 1985, pp. 337-342
Proof of a conjecture of Kahn for non-binary matroids
James G. Oxley
Combinatorica
5
, 1985, pp. 343-345
Regular subgraphs of dense graphs
L. Pyber
Combinatorica
5
, 1985, pp. 347-349
On a problem of Erdŏs and Larson
S.S. Shrikhande
,
N.M. Singhi
Combinatorica
5
, 1985, pp. 351-358
Maximal tight sets and the Edmonds-Gallai decomposition for matchings
K. Steffens
Combinatorica
5
, 1985, pp. 359-365
Sequential access in splay trees takes linear time
R.E. Tarjan
Combinatorica
5
, 1985, pp. 367-378
Seiten
<
1
2