- Fast algorithms for even/odd minimum cuts and generalizations
- E. Brger, A. Gargantini, E. Riccobene (Eds.): ASM 2003, LNCS 2589, pp. 204-217, 2003. Springer-Verlag Berlin Heidelberg 2003
- Dilworth's Theorem and its application for path systems of a cycle ---implementation and analysis
- Augmenting Undirected Edge Connectivity in ~ Andras A. Benczur \Lambda David R. Karger y
- Fast algorithms for even/odd minimum cuts and generalizations
- The Structure of NearMinimum Edge Cuts Andr'as A. Bencz'ur \Lambda
- SIAM J. SCI. STAT. COMP. c fl1989 Society for Industrial and Applied Mathematics
- A. Bencz'ur and A. Frank, Covering symmetric supermodular functions by graphs, in: Connectivity Aug mentation of Networks: Structures and Algorithms, Mathematical Programming, Ser B. (ed. A. Frank), to
- Approximating s--t Minimum Cuts in ~ Andras A. Benczur \Lambda
- Math. Program. 84: 595640 (1999) / DOI 10.1007/s10107990075b Springer-Verlag 1999 Andrs A. Benczr
- Cut structures and randomized algorithms in edgeconnectivity problems
- Augmenting Undirected Edge Connectivity in ~ Andras A. Benczur \Lambda David R. Karger y
- A representation of cuts within 6/5 times the edge connectivity with applications
- Pushdown-Reduce: An algorithm for connectivity augmentation and poset covering problems
