András Frank

professor, member

Address:	Department of Operations Research
	Eötvös Loránd University
	1117 Budapest
	Pázmány Péter sétány, 1/C, 3-504
Tel:	(+36-1) 372-2500/8578, fax: (+36-1) 372-2500/8056
Email:	frank@cs.elte.hu
Home page:	http://www.cs.elte.hu/~frank
Publication list:	http://www.cs.elte.hu/~frank/publist.html

List of EGRES technical reports

Packing Arborescences (Kristóf Bérczi, András Frank)
Variations For Lovász' Submodular Ideas (Kristóf Bérczi, András Frank)
An algorithm to increase the node-connectivity of a digraph by one (András Frank, László Végh)
Rooted k-connections in digraphs (András Frank)
Algorithm for Node-Capacitated Ring Routing (András Frank, Zoltán Király, Balázs Kotnyek)
On Kuhn's Hungarian Method - a tribute from Hungary (András Frank)
An algorithm for source location in directed graphs (Mihály Bárász, Johanna Becker, András Frank)
A constrained independent set problem for matroids (Tamás Fleiner, András Frank, Satoru Iwata)
A magyar módszer és általánosításai (The Hungarian method and its extensions; in Hungarian) (András Frank)
Constructive characterizations for packing and covering with trees (Revised version of TR-2001-05) (András Frank, László Szegő)
Edge-connection of graphs, digraphs, and hypergraphs (András Frank)
Restricted t-matchings in bipartite graphs (András Frank)
Node-capacitated ring routing (András Frank, Bruce Shepherd, Vivek Tandon, Zoltán Végh)
Combined connectivity augmentation and orientation problems (András Frank, Tamás Király)
On the orientation of graphs and hypergraphs (András Frank, Tamás Király, Zoltán Király)
An extension of a theorem of Henneberg and Laman (A revised version is available as TR-2002-05) (András Frank, László Szegő)
A note on the path-matching formula (András Frank, László Szegő)
On decomposing a hypergraph into k connected sub-hypergraphs (András Frank, Tamás Király, Matthias Kriesell)

List of EGRES quick proofs

A quick proof for the cactus representation of mincuts (Tamás Fleiner, András Frank)
On the Edge-Connectivity Algorithm of Nagamochi and Ibaraki (András Frank)
A quick proof for the matroid intersection weight-splitting theorem (András Frank)
A quick proof for the matroidal structure of a source location problem (Johanna Becker, András Frank)
A note on degree-constrained subgraphs (András Frank, Lap Chi Lau, Jácint Szabó)

Last modification: 14.11.2009. Please email your comments to Jácint Szabó!