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: Author="Lov{\'{a}}sz, L{\'{a}}szl{\'{o}}"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Contractors and connectors of graph algebras
László Lovász
,
Balázs Szegedy
Journal of Graph Theory
60
(1), 2009, pp. 11-30
(Almost) tight bounds and existence theorems for single-commodity confluent flows
Jiangzhuo Chen
,
Robert D. Kleinberg
,
László Lovász
,
Rajmohan Rajaraman
,
Ravi Sundaram
,
Adrian Vetta
Journal of the ACM
54
(4), 2007, pp. 16: 1-32
Graph limits and parameter testing
Christian Borgs
,
Jennifer Chayes
,
László Lovász
,
Vera T. Sós
,
Balázs Szegedy
,
Katalin Vesztergombi
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'2006 (Seattle, Washington, USA, May 21-23, 2006)
, 2006, pp. 261-270
Proving integrality gaps without knowing the linear program
Sanjeev Arora
,
Béla Bollobás
,
László Lovász
Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'2002 (Vancouver, BC, Canada, November 16-19, 2002)
, 2002, pp. 313-322
Global information from local observation
Itai Benjamini
,
László Lovász
Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'2002 (Vancouver, BC, Canada, November 16-19, 2002)
, 2002, pp. 701-710
Critical facets of the stable set polytope
László Lipták
,
László Lovász
Combinatorica
21
(1), 2001, pp. 61-88
Energy of convex sets, shortest paths, and resistance
László Lovász
Journal of Combinatorial Theory Series A
94
(2), 2001, pp. 363-382
Lifting Markov chains to speed up mixing
Fang Chen
,
László Lovász
,
Igor Pak
Proceedings of the 31st Annual ACM Symposium on Theory of Computing, STOC'99 (Atlanta, Georgia, May 1-4, 1999)
, 1999, pp. 275-281
Faster mixing via average conductance
László Lovász
,
Ravi Kannan
Proceedings of the 31st Annual ACM Symposium on Theory of Computing, STOC'99 (Atlanta, Georgia, May 1-4, 1999)
, 1999, pp. 282-287
Random walks and the regeneration time
Andrew Beveridge
,
László Lovász
Journal of Graph Theory
29
(2), 1998, pp. 57-62
Approximation of diameters: Randomization doesn't help
Andreas Brieden
,
Peter Gritzmann
,
Ravi Kannan
,
Victor Klee
,
László Lovász
,
Miklós Simonovits
Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, FOCS'98 (Palo Alto, California, November 8-11, 1998)
, 1998, pp. 244-251
The membership problem in jump systems
László Lovász
Journal of Combinatorial Theory Series B
70
(1), 1997, pp. 45-66
The rank and size of graphs
Andrew Kotlov
,
László Lovász
Journal of Graph Theory
23
(2), 1996, pp. 185-189
Efficient stopping rules for Markov chains
László Lovász
,
Peter Winkler
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, STOC'95 (Las Vegas, Nevada, USA, May 29 - June 1, 1995)
, 1995, pp. 76-82
Geometric Algorithms and Combinatorial Optimization
Martin Grötschel
,
László Lovász
,
Alexander Schrijver
Algorithms and Combinatorics
2
, 1993, pp. xii,362