On a class of balanced hypergraphs. - András Frank (Discret. Math., 1977)

On chain and antichain families of a partially ordered set. - András Frank (J. Comb. Theory B, 1980)

On the orientation of graphs. - András Frank (J. Comb. Theory B, 1980)

How to make a digraph strongly connected. - András Frank (Comb., 1981)

A Weighted Matroid Intersection Algorithm. - András Frank (J. Algorithms, 1981)

Disjoint paths in a rectilinear grid. - András Frank (Comb., 1982)

A note on k-strongly connected orientations of an undirected graph. - András Frank (Discret. Math., 1982)

Finding feasible vectors of Edmonds-Giles polyhedra. - András Frank (J. Comb. Theory B, 1984)

An Application of Simultaneous Approximation in Combinatorial Optimization - András Frank; Éva Tardos (FOCS, 1985)

Edge-disjoint paths in planar graphs. - András Frank (J. Comb. Theory B, 1985)

A Primal-Dual Algorithm for Submodular Flows. - William H. Cunningham; András Frank (Math. Oper. Res., 1985)

An application of simultaneous Diophantine approximation in combinatorial optimization. - András Frank; Éva Tardos (Comb., 1987)

Generalized polymatroids and submodular flows. - András Frank; Éva Tardos (Math. Program., 1988)

On Disjoint Homotopic Paths in the Plane. - András Frank (Polyhedral Combinatorics, 1990)

Vertex-Disjoint Simple Paths of Given Homotopy in a Planar Graph. - András Frank; Alexander Schrijver (Polyhedral Combinatorics, 1990)

Packing paths in planar graphs. - András Frank (Comb., 1990)

On circuit decomposition of planar Eulerian graphs. - Herbert Fleischner; András Frank (J. Comb. Theory B, 1990)

Tree-representation of directed circuits. - András Frank; Tibor Jordán (Graph Structure Theory, 1991)

On Multiflow Problems. - András Frank; Alexander V. Karzanov; András Sebö (IPCO, 1992)

Algorithms for Routing around a Rectangle. - András Frank; Takao Nishizeki; Nobuji Saito; Hitoshi Suzuki; Éva Tardos (Discret. Appl. Math., 1992)

On a theorem of Mader. - András Frank (Discret. Math., 1992)

Edge-disjoint circuits in graphs on the torus. - András Frank; Alexander Schrijver (J. Comb. Theory B, 1992)

Augmenting Graphs to Meet Edge-Connectivity Requirements. - András Frank (SIAM J. Discret. Math., 1992)

Conservative weightings and ear-decompositions of graphs. - András Frank (Comb., 1993)

Submodular functions in graph theory. - András Frank (Discret. Math., 1993)

On sparse subgraphs preserving connectivity properties. - András Frank; Toshihide Ibaraki; Hiroshi Nagamochi (J. Graph Theory, 1993)

On Packing T-Cuts. - András Frank; Zoltán Szigeti (J. Comb. Theory B, 1994)

How to Make a Strongly Connected Digraph Two-Connected. - András Frank; Tibor Jordán (IPCO, 1995)

Two Arc Disjoint Paths in Eulerian Diagraphs. - András Frank; Toshihide Ibaraki; Hiroshi Nagamochi (ISAAC, 1995)

Minimal Edge-Coverings of Pairs of Sets. - András Frank; Tibor Jordán (J. Comb. Theory B, 1995)

A note on packing paths in planar graphs. - András Frank; Zoltán Szigeti (Math. Program., 1995)

Preserving and Increasing Local Edge-Connectivity in Mixed Graphs. - Jørgen Bang-Jensen; András Frank; Bill Jackson (SIAM J. Discret. Math., 1995)

Finding minimum weighted generators of a path system. - András Frank (Contemporary Trends in Discrete Mathematics, 1997)

On Integer Multiflow Maximization. - András Frank; Alexander V. Karzanov; András Sebö (SIAM J. Discret. Math., 1997)

Minimum Multiway Cuts in Trees. - Péter L. Erdös; András Frank; László A. Székely (Discret. Appl. Math., 1998)

Two Arc-Disjoint Paths in Eulerian Digraphs. - András Frank; Toshihide Ibaraki; Hiroshi Nagamochi (SIAM J. Discret. Math., 1998)

An Orientation Theorem with Parity Conditions. - András Frank; Tibor Jordán; Zoltán Szigeti (IPCO, 1999)

Parity Constrained k-Edge-Connected Orientations. - András Frank; Zoltán Király (IPCO, 1999)

Finding Minimum Generators of Path Systems'. - András Frank (J. Comb. Theory B, 1999)

Covering symmetric supermodular functions by graphs. - András A. Benczúr; András Frank (Math. Program., 1999)

Connectivity augmentation of networks: structures and algorithms. - András Frank (Math. Program., 1999)

Increasing the rooted-connectivity of a digraph by one. - András Frank (Math. Program., 1999)

Directed vertex-connectivity augmentation. - András Frank; Tibor Jordán (Math. Program., 1999)

Edge-Connectivities of Graphs and Digraphs. - András Frank (Electron. Notes Discret. Math., 2000)

An Extension of a Theorem of Henneberg and Laman. - András Frank; László Szegö (IPCO, 2001)

Combinatorial problems related to origin-destination matrices. - András Frank; Tibor Jordán; Zoltán Szigeti (Discret. Appl. Math., 2001)

Graph Orientations with Edge-connection and Parity Constraints. - András Frank; Zoltán Király (Comb., 2002)

Note on the path-matching formula. - András Frank; László Szegö (J. Graph Theory, 2002)

Node-Capacitated Ring Routing. - András Frank; F. Bruce Shepherd; Vivek Tandon; Zoltán Végh (Math. Oper. Res., 2002)

Restricted t-matchings in bipartite graphs. - András Frank (Discret. Appl. Math., 2003)

Combined connectivity augmentation and orientation problems. - András Frank; Tamás Király (Discret. Appl. Math., 2003)

On decomposing a hypergraph into k connected sub-hypergraphs. - András Frank; Tamás Király; Matthias Kriesell (Discret. Appl. Math., 2003)

On the orientation of graphs and hypergraphs. - András Frank; Tamás Király; Zoltán Király (Discret. Appl. Math., 2003)

Constructive characterizations for packing and covering with trees. - András Frank; László Szegö (Discret. Appl. Math., 2003)

A constrained independent set problem for matroids. - Tamás Fleiner; András Frank; Satoru Iwata 001 (Oper. Res. Lett., 2004)

An algorithm for source location in directed graphs. - Mihály Bárász; Johanna Becker; András Frank (Oper. Res. Lett., 2005)

An algorithm for node-capacitated ring routing. - András Frank; Zoltán Király; Balázs Kotnyek (Oper. Res. Lett., 2007)

A Survey on Covering Supermodular Functions. - András Frank; Tamás Király (Bonn Workshop of Combinatorial Optimization, 2008)

An algorithm to increase the node-connectivity of a digraph by one. - András Frank; László A. Végh (Discret. Optim., 2008)

A note on degree-constrained subgraphs. - András Frank; Lap Chi Lau; Jácint Szabó (Discret. Math., 2008)

Rooted k-connections in digraphs. - András Frank (Discret. Appl. Math., 2009)

Balanced list edge-colourings of bipartite graphs. - Tamás Fleiner; András Frank (Electron. Notes Discret. Math., 2010)

Independent arborescences in directed graphs. - András Frank; Satoru Fujishige; Naoyuki Kamiyama; Naoki Katoh (Discret. Math., 2013)

Tree-compositions and orientations. - András Frank; Csaba Király 001 (Oper. Res. Lett., 2013)

Characterizing and recognizing generalized polymatroids. - András Frank; Tamás Király; Júlia Pap; David Pritchard 001 (Math. Program., 2014)

Sink-Stable Sets of Digraphs. - Dóra Erdös; András Frank; Krisztián Kun (SIAM J. Discret. Math., 2014)

Supermodularity in Unweighted Graph Opitimization III: Highly-connected Digraphs. - Kristóf Bérczi; András Frank (CoRR, 2016)

Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings. - Kristóf Bérczi; András Frank (Math. Oper. Res., 2018)

Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank Augmentation. - Kristóf Bérczi; András Frank (Math. Oper. Res., 2018)

Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs. - Kristóf Bérczi; András Frank (Math. Oper. Res., 2018)

A simple algorithm and min-max formula for the inverse arborescence problem. - András Frank; Gergely Hajdu (Discret. Appl. Math., 2021)

Fair integral submodular flows. - András Frank; Kazuo Murota (Discret. Appl. Math., 2022)

A Discrete Convex Min-Max Formula for Box-TDI Polyhedra. - András Frank; Kazuo Murota (Math. Oper. Res., 2022)

Decreasing minimization on M-convex sets: algorithms and applications. - András Frank; Kazuo Murota (Math. Program., 2022)

Decreasing minimization on M-convex sets: background and structures. - András Frank; Kazuo Murota (Math. Program., 2022)

Fair Integral Network Flows. - András Frank; Kazuo Murota (Math. Oper. Res., 2023)

A new approach to bipartite stable matching optimization. - Tamás Fleiner; András Frank; Tamás Király (CoRR, 2024)

A network flow approach to a common generalization of Clar and Fries numbers. - Erika R. Bérczi-Kovács; András Frank (Discret. Math., 2024)

Prefix-bounded matrices. - Nóra A. Borsik; András Frank; Péter Madarasi; Tamás Takács (CoRR, 2025)