Follow the links for the articles below to see abstracts, citations, occurences in various databases etc.
A lista cikkeinek címére kattintva elérhető a cikkekkel kapcsolatos információgyűjteményem (többnyire angol nyelven). A cikkenként összegyűjtött hivatkozásaim talán nem csak a bürokraták számára lehetnek érdekesek.
14. András A. Benczúr, Károly Csalogány, Dániel Fogaras, Eszter Friedman, Tamás Sarlós, Máté Uher and Eszter Windhager, Searching a Small National Domain -- a Preliminary Report. html
13. András A. Benczúr, Uwe Glasser and Tamás Lukovszki Formal description of a location service for mobile ad hoc networks. ASM 2003 pdf
12. András A. Benczúr Pushdown-Reduce: An algorithm for connectivity augmentation and poset covering problems. Discrete Applied Mathematics (2003?) ps.gz ps pdf
11. András A. Benczúr and David R. Karger Quadratic-time Algorithms for Edge-Connectivity Augmentation and Splitting Off. J. Alg 37(1), pp. 2-36 (2000) ps.gz ps pdf
10. András A. Benczúr, Otília Fülöp, Fast algorithms for even/odd mincuts and generalizations, Proc. European Symp. Alg., Springer Lecture Notes in Computer Science 1879, pp. 88-99 (2000) ps.gz ps pdf
9. András A. Benczúr, Jörg Förster, Zoltán Király, Dilworth's Theorem and its application for path systems of a cycle--implementation and analysis, Proc. European Symp. Alg., Springer Lecture Notes in Computer Science 1643:598-509 (1999) ps.gz ps pdf
8. András A. Benczúr, Parallel and fast sequential algorithms for undirected edge connectivity augmentation, Math. Prog. B 84(3):595-640 ps.gz ps pdf
7. András A. Benczúr, András Frank, Edge-minimum graphs that satisfy a symmetric supermodular connectivity demand, Math. Prog. B 84(3):483-504 ps.gz ps pdf
6. András A. Benczúr, David R. Karger, Augmenting undirected edge-connectivity in ~O (n^2) time. Proc. of the 9th Annual ACM-SIAM Symp. on Discrete Algorithms (1998) ps.gz ps pdf
5. András A. Benczúr, David R. Karger, Approximating s--t minimum cuts in ~O (n^2) time, Proc. 28th Annual Symp. on Theory of Comp. (1996) ps.gz ps pdf
4. András A. Benczúr, A representation of cuts witihin 6/5 times the edge connectivity with applications, Proc. 34th Annual Symp. on Found. of Comp. Sci. (1995) ps.gz ps pdf
3. András A. Benczúr, Counterexamples for directed and node capacitated cut-trees, Siam Journal on Computing (1995) ps.gz ps pdf
2. András A. Benczúr, Augmenting edge connectivity in ~O (n^3) time, Proc. 26th Annual Symp. on Theory of Comp. (1994) ps.gz, no figures ps, no figures pdf
1. András A. Benczúr, On the structure of near-minimum edge cuts, Tech. report MIT/LCS/TR-639 (1994) ps.gz ps pdf