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=25
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
KKM - A topological approach for trees
Eli Berger
Combinatorica
25
(1), 2005, pp. 1-18
Polynomial Lym inequalities
Christian Bey
Combinatorica
25
(1), 2005, pp. 19-38
Linear versus hereditary discrepancy
Tom Bohman
,
Ron Holzman
Combinatorica
25
(1), 2005, pp. 39-47
Complete minors in
k _{s,s}
-free graphs
Daniela Kühn
,
Deryk Osthus
Combinatorica
25
(1), 2005, pp. 49-64
Hajós theorem for colorings of edge-weighted graphs
Bojan Mohar
Combinatorica
25
(1), 2005, pp. 65-76
An extension of the Ruzsa-Szemerédi theorem
Gábor N. Sárközy
,
Stanley Selkow
Combinatorica
25
(1), 2005, pp. 77-84
Classification of locally 2-connected compact metric spaces
Carsten Thomassen
Combinatorica
25
(1), 2005, pp. 85-103
Katona's intersection theorem: Four proofs
R. Ahlswede
,
L.H. Khachatrian
Combinatorica
25
(1), 2005, pp. 105-110
Dense minors in graphs of large girth
Reinhard Diestel
,
Christof Rempel
Combinatorica
25
(1), 2005, pp. 111-116
List colouring when the chromatic number is close to the order of the graph
Bruce Reed
,
Benny Sudakov
Combinatorica
25
(1), 2005, pp. 117-123
Sharp bounds for some multicolor Ramsey numbers
Noga Alon
,
Vojtȇch Rödl
Combinatorica
25
(2), 2005, pp. 125-141
Recognizing Berge graphs
Maria Chudnovsky
,
Gérard Cornuéjols
,
Xinming Liu
,
Paul Seymour
,
Kristina Vus̑ković
Combinatorica
25
(2), 2005, pp. 143-186
Matroid matching via mixed skew-symmetric matrices
James Geelen
,
Satoru Iwata
Combinatorica
25
(2), 2005, pp. 187-215
Lower bounds for concurrent zero knowledge
Joe Kilian
,
Erez Petrank
,
Charles Rackoff
Combinatorica
25
(2), 2005, pp. 217-249
Approximating directed multicuts
Joseph Cheriyan
,
Howard Karloff
,
Yuval Rabani
Combinatorica
25
(3), 2005, pp. 251-269
Local recognition of non-incident point-hyperplane graphs
Arjeh M. Cohen
,
Hans Cuypers
,
Ralf Gramlich
Combinatorica
25
(3), 2005, pp. 271-296
Random
k
-SAT: A tight threshold for moderately growing
k
Alan Frieze
,
Nicholas C. Wormald
Combinatorica
25
(3), 2005, pp. 297-305
Counting sets with small sumset, and the clique number of random Cayley graphs
Ben Green
Combinatorica
25
(3), 2005, pp. 307-326
Any 7-chromatic graphs has
K_7
or
K_{4,4}
as a minor
Ken-ichi Kawarabayashi
,
Bjarne Toft
Combinatorica
25
(3), 2005, pp. 327-353
Hypergraph extension of the Alon-Tarsi list coloring theorem
Radhika Ramamurthi
,
Douglas B. West
Combinatorica
25
(3), 2005, pp. 355-366
Maximal total length of
k
disjoint cycles in bipartite graphs
Hong Wang
Combinatorica
25
(3), 2005, pp. 367-377
Explicit bounded-degree unique-neighbor concentrators
Michael Capalbo
Combinatorica
25
(4), 2005, pp. 379-391
On connected
[g,f +1]
-factors in graphs
Guojun Li
,
Ying Xu
,
Chuanping Chen
,
Zhenhong Liu
Combinatorica
25
(4), 2005, pp. 393-405
Random lifts of graphs: Perfekt matchings
Nathan Linial
,
Eyal Rozenman
Combinatorica
25
(4), 2005, pp. 407-424
Graphs with
3n-6
edges not containing a subdivision of
K_5
Wolfgang Mader
Combinatorica
25
(4), 2005, pp. 425-438
Seiten 1
2
>