András Frank

Publication Activity (10 Years)

Years Active: 1977-2024
Publications (10 Years): 13

Top Topics

Top Venues

Math. Oper. Res.

Discret. Appl. Math.

Publications

Erika R. Bérczi-Kovács, András Frank
A network flow approach to a common generalization of Clar and Fries numbers. Discret. Math. 347 (1) (2024)
András Frank, Kazuo Murota
Fair Integral Network Flows. Math. Oper. Res. 48 (3) (2023)
András Frank, Kazuo Murota
Decreasing minimization on M-convex sets: algorithms and applications. Math. Program. 195 (1) (2022)
András Frank, Kazuo Murota
A Discrete Convex Min-Max Formula for Box-TDI Polyhedra. Math. Oper. Res. 47 (2) (2022)
András Frank, Kazuo Murota
Fair integral submodular flows. Discret. Appl. Math. 320 (2022)
András Frank, Kazuo Murota
Decreasing minimization on M-convex sets: background and structures. Math. Program. 195 (1) (2022)
András Frank, Gergely Hajdu
A simple algorithm and min-max formula for the inverse arborescence problem. Discret. Appl. Math. 295 (2021)
Kristóf Bérczi, András Frank
Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank Augmentation. Math. Oper. Res. 43 (3) (2018)
Kristóf Bérczi, András Frank
Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs. Math. Oper. Res. 43 (3) (2018)
Kristóf Bérczi, András Frank
Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings. Math. Oper. Res. 43 (3) (2018)
Kristóf Bérczi, András Frank
Supermodularity in Unweighted Graph Opitimization III: Highly-connected Digraphs. CoRR (2016)
Kristóf Bérczi, András Frank
Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings. CoRR (2016)
Kristóf Bérczi, András Frank
Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank Augmentation. CoRR (2016)
András Frank, Tamás Király, Júlia Pap, David Pritchard
Characterizing and recognizing generalized polymatroids. Math. Program. 146 (1-2) (2014)
Dóra Erdös, András Frank, Krisztián Kun
Sink-Stable Sets of Digraphs. SIAM J. Discret. Math. 28 (4) (2014)
András Frank, Satoru Fujishige, Naoyuki Kamiyama, Naoki Katoh
Independent arborescences in directed graphs. Discret. Math. 313 (4) (2013)
András Frank, Csaba Király
Tree-compositions and orientations. Oper. Res. Lett. 41 (4) (2013)
Dóra Erdös, András Frank, Krisztián Kun
Sink-Stable Sets of Digraphs CoRR (2012)
Tamás Fleiner, András Frank
Balanced list edge-colourings of bipartite graphs. Electron. Notes Discret. Math. 36 (2010)
András Frank
Rooted k-connections in digraphs. Discret. Appl. Math. 157 (6) (2009)
András Frank, László A. Végh
An algorithm to increase the node-connectivity of a digraph by one. Discret. Optim. 5 (4) (2008)
András Frank, Lap Chi Lau, Jácint Szabó
A note on degree-constrained subgraphs. Discret. Math. 308 (12) (2008)
András Frank, Tamás Király
A Survey on Covering Supermodular Functions. Bonn Workshop of Combinatorial Optimization (2008)
András Frank, Zoltán Király, Balázs Kotnyek
An algorithm for node-capacitated ring routing. Oper. Res. Lett. 35 (3) (2007)
Mihály Bárász, Johanna Becker, András Frank
An algorithm for source location in directed graphs. Oper. Res. Lett. 33 (3) (2005)
András Frank, Zoltán Király, Balázs Kotnyek
An Algorithm for Node-Capacitated Ring Routing. ESA (2005)
Tamás Fleiner, András Frank, Satoru Iwata
A constrained independent set problem for matroids. Oper. Res. Lett. 32 (1) (2004)
András Frank, László Szegö
Constructive characterizations for packing and covering with trees. Discret. Appl. Math. 131 (2) (2003)
András Frank, Tamás Király, Matthias Kriesell
On decomposing a hypergraph into k connected sub-hypergraphs. Discret. Appl. Math. 131 (2) (2003)
András Frank, Tamás Király, Zoltán Király
On the orientation of graphs and hypergraphs. Discret. Appl. Math. 131 (2) (2003)
András Frank
Restricted t-matchings in bipartite graphs. Discret. Appl. Math. 131 (2) (2003)
András Frank, Tamás Király
Combined connectivity augmentation and orientation problems. Discret. Appl. Math. 131 (2) (2003)
András Frank, László Szegö
Note on the path-matching formula. J. Graph Theory 41 (2) (2002)
András Frank, Zoltán Király
Graph Orientations with Edge-connection and Parity Constraints. Comb. 22 (1) (2002)
András Frank, F. Bruce Shepherd, Vivek Tandon, Zoltán Végh
Node-Capacitated Ring Routing. Math. Oper. Res. 27 (2) (2002)
András Frank, Tibor Jordán, Zoltán Szigeti
Combinatorial problems related to origin-destination matrices. Discret. Appl. Math. 115 (1-3) (2001)
András Frank, Tamás Király
Combined Connectivity Augmentation and Orientation Problems. IPCO (2001)
András Frank, László Szegö
An Extension of a Theorem of Henneberg and Laman. IPCO (2001)
András Frank
Edge-Connectivities of Graphs and Digraphs. Electron. Notes Discret. Math. 5 (2000)
András Frank
Increasing the rooted-connectivity of a digraph by one. Math. Program. 84 (3) (1999)
András Frank, Zoltán Király
-Edge-Connected Orientations. IPCO (1999)
András Frank
Connectivity augmentation of networks: structures and algorithms. Math. Program. 84 (3) (1999)
András Frank, Tibor Jordán, Zoltán Szigeti
An Orientation Theorem with Parity Conditions. IPCO (1999)
András Frank, Tibor Jordán
Directed vertex-connectivity augmentation. Math. Program. 84 (3) (1999)
András Frank
Finding Minimum Generators of Path Systems'. J. Comb. Theory, Ser. B 75 (2) (1999)
András A. Benczúr, András Frank
Covering symmetric supermodular functions by graphs. Math. Program. 84 (3) (1999)
Péter L. Erdös, András Frank, László A. Székely
Minimum Multiway Cuts in Trees. Discret. Appl. Math. 87 (1-3) (1998)
András Frank, Toshihide Ibaraki, Hiroshi Nagamochi
Two Arc-Disjoint Paths in Eulerian Digraphs. SIAM J. Discret. Math. 11 (4) (1998)
András Frank
Finding minimum weighted generators of a path system. Contemporary Trends in Discrete Mathematics (1997)
András Frank, Alexander V. Karzanov, András Sebö
On Integer Multiflow Maximization. SIAM J. Discret. Math. 10 (1) (1997)
András Frank, Zoltán Szigeti
A note on packing paths in planar graphs. Math. Program. 70 (1995)
Jørgen Bang-Jensen, András Frank, Bill Jackson
Preserving and Increasing Local Edge-Connectivity in Mixed Graphs. SIAM J. Discret. Math. 8 (2) (1995)
András Frank, Toshihide Ibaraki, Hiroshi Nagamochi
Two Arc Disjoint Paths in Eulerian Diagraphs. ISAAC (1995)
András Frank, Tibor Jordán
How to Make a Strongly Connected Digraph Two-Connected. IPCO (1995)
András Frank, Tibor Jordán
Minimal Edge-Coverings of Pairs of Sets. J. Comb. Theory, Ser. B 65 (1) (1995)
András Frank, Zoltán Szigeti
-Cuts. J. Comb. Theory, Ser. B 61 (2) (1994)
András Frank, Toshihide Ibaraki, Hiroshi Nagamochi
On sparse subgraphs preserving connectivity properties. J. Graph Theory 17 (3) (1993)
András Frank
Submodular functions in graph theory. Discret. Math. 111 (1-3) (1993)
András Frank
Conservative weightings and ear-decompositions of graphs. Comb. 13 (1) (1993)
András Frank, Alexander V. Karzanov, András Sebö
On Multiflow Problems. IPCO (1992)
András Frank, Takao Nishizeki, Nobuji Saito, Hitoshi Suzuki, Éva Tardos
Algorithms for Routing around a Rectangle. Discret. Appl. Math. 40 (4) (1992)
András Frank
Augmenting Graphs to Meet Edge-Connectivity Requirements. SIAM J. Discret. Math. 5 (1) (1992)
András Frank
On a theorem of Mader. Discret. Math. 101 (1-3) (1992)
András Frank, Alexander Schrijver
Edge-disjoint circuits in graphs on the torus. J. Comb. Theory, Ser. B 55 (1) (1992)
András Frank, Tibor Jordán
Tree-representation of directed circuits. Graph Structure Theory (1991)
András Frank, Alexander Schrijver
Vertex-Disjoint Simple Paths of Given Homotopy in a Planar Graph. Polyhedral Combinatorics (1990)
András Frank
Conservative Weightings and Ear-Decompositions of Graphs. IPCO (1990)
András Frank
Augmenting Graphs to Meet Edge-Connectivity Requirements FOCS (1990)
András Frank
Packing paths in planar graphs. Comb. 10 (4) (1990)
András Frank
On Disjoint Homotopic Paths in the Plane. Polyhedral Combinatorics (1990)
Herbert Fleischner, András Frank
On circuit decomposition of planar Eulerian graphs. J. Comb. Theory, Ser. B 50 (2) (1990)
András Frank, Éva Tardos
Generalized polymatroids and submodular flows. Math. Program. 42 (1-3) (1988)
András Frank, Éva Tardos
An application of simultaneous Diophantine approximation in combinatorial optimization. Comb. 7 (1) (1987)
William H. Cunningham, András Frank
A Primal-Dual Algorithm for Submodular Flows. Math. Oper. Res. 10 (2) (1985)
András Frank
Edge-disjoint paths in planar graphs. J. Comb. Theory, Ser. B 39 (2) (1985)
András Frank, Éva Tardos
An Application of Simultaneous Approximation in Combinatorial Optimization FOCS (1985)
András Frank
Finding feasible vectors of Edmonds-Giles polyhedra. J. Comb. Theory, Ser. B 36 (3) (1984)
András Frank
A note on k-strongly connected orientations of an undirected graph. Discret. Math. 39 (1) (1982)
András Frank
Disjoint paths in a rectilinear grid. Comb. 2 (4) (1982)
András Frank
How to make a digraph strongly connected. Comb. 1 (2) (1981)
András Frank
A Weighted Matroid Intersection Algorithm. J. Algorithms 2 (4) (1981)
András Frank
On the orientation of graphs. J. Comb. Theory, Ser. B 28 (3) (1980)
András Frank
On chain and antichain families of a partially ordered set. J. Comb. Theory, Ser. B 29 (2) (1980)
András Frank
On a class of balanced hypergraphs. Discret. Math. 20 (1977)