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 Volume=20
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Concentration of multivariate polynomials and its applications
Jeong Han Kim
,
Van H. Vu
Combinatorica
20
(3), 2000, pp. 417-434
A min-max relation for monotone path systems in simple regions
Kathie Kameron
Combinatorica
20
(3), 2000, pp. 435-440
Edge-coloring cliques with many colors on subcliques
Dennis Eichhorn
,
Dhruv Mubayi
Combinatorica
20
(3), 2000, pp. 441-444
On minimizing symmetric set functions
Romeo Rizzi
Combinatorica
20
(3), 2000, pp. 445-450
Efficient testing of large graphs
Noga Alon
,
Eldar Fischer
,
Michael Krivelevich
,
Mario Szegedy
Combinatorica
20
(4), 2000, pp. 451-476
Biased positional games for which random strategies are nearly optimal
Maƚgorzata Bednarska
,
Tomasz Łuczak
Combinatorica
20
(4), 2000, pp. 477-488
Morse theory and evasiveness
Robin Forman
Combinatorica
20
(4), 2000, pp. 489-504
On Cayley graphs on the symmetric group generated by transpositions
Joel Friedman
Combinatorica
20
(4), 2000, pp. 505-519
On the number of edges in colour-critical graphs and hypergraphs
A.V. Kostochka
,
M. Stiebitz
Combinatorica
20
(4), 2000, pp. 521-530
Hedetniemi's conjecture and the retracts of a product of graphs
Benoit Larose
,
Claude Tardif
Combinatorica
20
(4), 2000, pp. 531-544
A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
Nathan Linial
,
Alex Samorodnitsky
,
Avi Wigderson
Combinatorica
20
(4), 2000, pp. 545-568
On a conjecture of Kemnitz
Lajos Rónyai
Combinatorica
20
(4), 2000, pp. 569-573
Total dual integrality of matching forest constraints
Alexander Schrijver
Combinatorica
20
(4), 2000, pp. 575-588
Finding convex sets in convex position
Géza Tóth
Combinatorica
20
(4), 2000, pp. 589-596
Seiten
<
1
2