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: Author="Bencz{\'u}r, Andr{\'a}s A."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fast algorithms for even/odd minimum cuts and generalizations
András A. Benczúr
,
Ottilia Fülöp
Lecture Notes in Computer Science
1879
, 2000, pp. 88-99
Augmenting undirected edge connectivity in
{\tilde{O}}(n^2)
time
András A. Benczúr
,
David R. Karger
Journal of Algorithms
37
(1), 2000, pp. 2-36
Approximating
s-t
minimum cuts in
{\tilde{O}}(n^2)
time
András A. Benczúr
,
David R. Karger
Proceedings of the 28th Annual ACM Symposium on Theory of Computing, STOC'96 (Philadelphia, Pennsylvania, May 22-24, 1996)
, 1996, pp. 47-55
Counterexamples for directed and node capacitated cut-trees
András A. Benczúr
SIAM Journal on Computing
24
(3), 1995, pp. 505-510
Augmenting undirected connectivity in RNC and in randomized
{\tilde O}(n^3)
time
András A. Benczúr
Proceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC'94 (Montréal, Québec, Canada, May 23-25, 1994)
, 1994, pp. 658-667