András Frank
professor, member
List of EGRES technical reports
- A network flow approach to a common generalization of Clar and Fries numbers (Erika Renáta Bérczi-Kovács, András Frank)
- Decreasing Minimization on Base-Polyhedra: Relation Between Discrete and Continuous Cases (András Frank, Kazuo Murota)
- Fair integral submodular flows (András Frank, Kazuo Murota)
- Fair Integral Network Flows (András Frank, Kazuo Murota)
- Simple algorithm and min-max formula for the inverse arborescence problem (András Frank, Gergely Hajdu)
- Decreasing Minimization on M-convex Sets: Algorithms and Applications (András Frank, Kazuo Murota)
- Decreasing Minimization on M-convex Sets (András Frank, Kazuo Murota)
- A Discrete Convex Min-Max Formula for Box-TDI Polyhedra (András Frank, Kazuo Murota)
- Discrete Decreasing Minimization, Part III: Network Flows (András Frank, Kazuo Murota)
- Discrete Decreasing Minimization, Part II: Views from Discrete Convex Analysis (András Frank, Kazuo Murota)
- Discrete Decreasing Minimization, Part I: Base-polyhedra with Applications in Network Optimization (András Frank, Kazuo Murota)
- Discrete Decreasing Minimization, Part II: Views from Discrete Convex Analysis (A revised version is available as TR-2019-08) (András Frank, Kazuo Murota)
- Discrete Decreasing Minimization, Part I, Base-polyhedra with Applications in Network Optimization (A revised version is available as TR-2019-07) (András Frank, Kazuo Murota)
- Supermodularity in unweighted graph optimization III: Highly connected digraphs (Kristóf Bérczi, András Frank)
- Supermodularity in unweighted graph optimization II: Matroidal term rank augmentation (Kristóf Bérczi, András Frank)
- Supermodularity in unweighted graph optimization I: Branchings and matchings (Kristóf Bérczi, András Frank)
- Non-TDI graph-optimization with supermodular functions (extended abstract) (Kristóf Bérczi, András Frank)
- Characterizing and recognizing generalized polymatroids (András Frank, Tamás Király, Júlia Pap, David Pritchard)
- Sink-stable sets of digraphs (Dóra Erdős, András Frank, Krisztián Kun)
- Tree-compositions and submodular flows (András Frank, Csaba Király)
- Simple push-relabel algorithms for matroids and submodular flows (András Frank, Zoltán Miklós)
- Balanced list edge-colourings of bipartite graphs (Tamás Fleiner, András Frank)
- 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
Last modification: 21.3.2024. Please email your comments to Tamás Király!
|