default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrás Frank
Person information
- affiliation: Eötvös University, Department of Operations Research
- award (2015): Széchenyi Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j64]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): 114145 (2024)- [i5]Tamás Fleiner, András Frank, Tamás Király:
A new approach to bipartite stable matching optimization. CoRR abs/2409.04885 (2024) - 2023
- [j63]András Frank, Kazuo Murota:
Fair Integral Network Flows. Math. Oper. Res. 48(3): 1393-1422 (2023) - 2022
- [j62]András Frank, Kazuo Murota:
Fair integral submodular flows. Discret. Appl. Math. 320: 416-434 (2022) - [j61]András Frank, Kazuo Murota:
A Discrete Convex Min-Max Formula for Box-TDI Polyhedra. Math. Oper. Res. 47(2): 1026-1047 (2022) - [j60]András Frank, Kazuo Murota:
Decreasing minimization on M-convex sets: background and structures. Math. Program. 195(1): 977-1025 (2022) - [j59]András Frank, Kazuo Murota:
Decreasing minimization on M-convex sets: algorithms and applications. Math. Program. 195(1): 1027-1068 (2022) - 2021
- [j58]András Frank, Gergely Hajdu:
A simple algorithm and min-max formula for the inverse arborescence problem. Discret. Appl. Math. 295: 85-93 (2021)
2010 – 2019
- 2018
- [j57]Kristóf Bérczi, András Frank:
Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings. Math. Oper. Res. 43(3): 726-753 (2018) - [j56]Kristóf Bérczi, András Frank:
Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank Augmentation. Math. Oper. Res. 43(3): 754-762 (2018) - [j55]Kristóf Bérczi, András Frank:
Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs. Math. Oper. Res. 43(3): 763-780 (2018) - 2016
- [i4]Kristóf Bérczi, András Frank:
Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings. CoRR abs/1608.05722 (2016) - [i3]Kristóf Bérczi, András Frank:
Supermodularity in Unweighted Graph Opitimization III: Highly-connected Digraphs. CoRR abs/1608.05729 (2016) - [i2]Kristóf Bérczi, András Frank:
Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank Augmentation. CoRR abs/1608.05730 (2016) - 2014
- [j54]András Frank, Tamás Király, Júlia Pap, David Pritchard:
Characterizing and recognizing generalized polymatroids. Math. Program. 146(1-2): 245-273 (2014) - [j53]Dóra Erdös, András Frank, Krisztián Kun:
Sink-Stable Sets of Digraphs. SIAM J. Discret. Math. 28(4): 1651-1674 (2014) - 2013
- [j52]András Frank, Satoru Fujishige, Naoyuki Kamiyama, Naoki Katoh:
Independent arborescences in directed graphs. Discret. Math. 313(4): 453-459 (2013) - [j51]András Frank, Csaba Király:
Tree-compositions and orientations. Oper. Res. Lett. 41(4): 336-342 (2013) - 2012
- [i1]Dóra Erdös, András Frank, Krisztián Kun:
Sink-Stable Sets of Digraphs. CoRR abs/1205.6071 (2012) - 2010
- [j50]Tamás Fleiner, András Frank:
Balanced list edge-colourings of bipartite graphs. Electron. Notes Discret. Math. 36: 837-842 (2010)
2000 – 2009
- 2009
- [j49]András Frank:
Rooted k-connections in digraphs. Discret. Appl. Math. 157(6): 1242-1254 (2009) - 2008
- [j48]András Frank, László A. Végh:
An algorithm to increase the node-connectivity of a digraph by one. Discret. Optim. 5(4): 677-684 (2008) - [j47]András Frank, Lap Chi Lau, Jácint Szabó:
A note on degree-constrained subgraphs. Discret. Math. 308(12): 2647-2648 (2008) - [c16]András Frank, Tamás Király:
A Survey on Covering Supermodular Functions. Bonn Workshop of Combinatorial Optimization 2008: 87-126 - 2007
- [j46]András Frank, Zoltán Király, Balázs Kotnyek:
An algorithm for node-capacitated ring routing. Oper. Res. Lett. 35(3): 385-391 (2007) - 2005
- [j45]Mihály Bárász, Johanna Becker, András Frank:
An algorithm for source location in directed graphs. Oper. Res. Lett. 33(3): 221-230 (2005) - [c15]András Frank, Zoltán Király, Balázs Kotnyek:
An Algorithm for Node-Capacitated Ring Routing. ESA 2005: 249-258 - 2004
- [j44]Tamás Fleiner, András Frank, Satoru Iwata:
A constrained independent set problem for matroids. Oper. Res. Lett. 32(1): 23-26 (2004) - 2003
- [j43]András Frank:
Restricted t-matchings in bipartite graphs. Discret. Appl. Math. 131(2): 337-346 (2003) - [j42]András Frank, László Szegö:
Constructive characterizations for packing and covering with trees. Discret. Appl. Math. 131(2): 347-371 (2003) - [j41]András Frank, Tamás Király, Matthias Kriesell:
On decomposing a hypergraph into k connected sub-hypergraphs. Discret. Appl. Math. 131(2): 373-383 (2003) - [j40]András Frank, Tamás Király, Zoltán Király:
On the orientation of graphs and hypergraphs. Discret. Appl. Math. 131(2): 385-400 (2003) - [j39]András Frank, Tamás Király:
Combined connectivity augmentation and orientation problems. Discret. Appl. Math. 131(2): 401-419 (2003) - 2002
- [j38]András Frank, Zoltán Király:
Graph Orientations with Edge-connection and Parity Constraints. Comb. 22(1): 47-70 (2002) - [j37]András Frank, László Szegö:
Note on the path-matching formula. J. Graph Theory 41(2): 110-119 (2002) - [j36]András Frank, F. Bruce Shepherd, Vivek Tandon, Zoltán Végh:
Node-Capacitated Ring Routing. Math. Oper. Res. 27(2): 372-383 (2002) - 2001
- [j35]András Frank, Tibor Jordán, Zoltán Szigeti:
Combinatorial problems related to origin-destination matrices. Discret. Appl. Math. 115(1-3): 37-47 (2001) - [c14]András Frank, Tamás Király:
Combined Connectivity Augmentation and Orientation Problems. IPCO 2001: 130-144 - [c13]András Frank, László Szegö:
An Extension of a Theorem of Henneberg and Laman. IPCO 2001: 145-159 - 2000
- [j34]András Frank:
Edge-Connectivities of Graphs and Digraphs. Electron. Notes Discret. Math. 5: 126-129 (2000)
1990 – 1999
- 1999
- [j33]András Frank:
Finding Minimum Generators of Path Systems'. J. Comb. Theory B 75(2): 237-244 (1999) - [j32]András Frank:
Connectivity augmentation of networks: structures and algorithms. Math. Program. 84(3): 439-441 (1999) - [j31]András A. Benczúr, András Frank:
Covering symmetric supermodular functions by graphs. Math. Program. 84(3): 483-503 (1999) - [j30]András Frank, Tibor Jordán:
Directed vertex-connectivity augmentation. Math. Program. 84(3): 537-553 (1999) - [j29]András Frank:
Increasing the rooted-connectivity of a digraph by one. Math. Program. 84(3): 565-576 (1999) - [c12]András Frank, Tibor Jordán, Zoltán Szigeti:
An Orientation Theorem with Parity Conditions. IPCO 1999: 183-190 - [c11]András Frank, Zoltán Király:
Parity Constrained k-Edge-Connected Orientations. IPCO 1999: 191-201 - 1998
- [j28]Péter L. Erdös, András Frank, László A. Székely:
Minimum Multiway Cuts in Trees. Discret. Appl. Math. 87(1-3): 67-75 (1998) - [j27]András Frank, Toshihide Ibaraki, Hiroshi Nagamochi:
Two Arc-Disjoint Paths in Eulerian Digraphs. SIAM J. Discret. Math. 11(4): 557-589 (1998) - 1997
- [j26]András Frank, Alexander V. Karzanov, András Sebö:
On Integer Multiflow Maximization. SIAM J. Discret. Math. 10(1): 158-170 (1997) - [c10]András Frank:
Finding minimum weighted generators of a path system. Contemporary Trends in Discrete Mathematics 1997: 129-138 - 1995
- [j25]András Frank, Tibor Jordán:
Minimal Edge-Coverings of Pairs of Sets. J. Comb. Theory B 65(1): 73-110 (1995) - [j24]András Frank, Zoltán Szigeti:
A note on packing paths in planar graphs. Math. Program. 70: 201-209 (1995) - [j23]Jørgen Bang-Jensen, András Frank, Bill Jackson:
Preserving and Increasing Local Edge-Connectivity in Mixed Graphs. SIAM J. Discret. Math. 8(2): 155-178 (1995) - [c9]András Frank, Tibor Jordán:
How to Make a Strongly Connected Digraph Two-Connected. IPCO 1995: 414-425 - [c8]András Frank, Toshihide Ibaraki, Hiroshi Nagamochi:
Two Arc Disjoint Paths in Eulerian Diagraphs. ISAAC 1995: 92-101 - 1994
- [j22]András Frank, Zoltán Szigeti:
On Packing T-Cuts. J. Comb. Theory B 61(2): 263-271 (1994) - 1993
- [j21]András Frank:
Conservative weightings and ear-decompositions of graphs. Comb. 13(1): 65-81 (1993) - [j20]András Frank:
Submodular functions in graph theory. Discret. Math. 111(1-3): 231-243 (1993) - [j19]András Frank, Toshihide Ibaraki, Hiroshi Nagamochi:
On sparse subgraphs preserving connectivity properties. J. Graph Theory 17(3): 275-281 (1993) - 1992
- [j18]András Frank, Takao Nishizeki, Nobuji Saito, Hitoshi Suzuki, Éva Tardos:
Algorithms for Routing around a Rectangle. Discret. Appl. Math. 40(4): 363-378 (1992) - [j17]András Frank:
On a theorem of Mader. Discret. Math. 101(1-3): 49-57 (1992) - [j16]András Frank, Alexander Schrijver:
Edge-disjoint circuits in graphs on the torus. J. Comb. Theory B 55(1): 9-17 (1992) - [j15]András Frank:
Augmenting Graphs to Meet Edge-Connectivity Requirements. SIAM J. Discret. Math. 5(1): 25-53 (1992) - [c7]András Frank, Alexander V. Karzanov, András Sebö:
On Multiflow Problems. IPCO 1992: 85-101 - 1991
- [c6]András Frank, Tibor Jordán:
Tree-representation of directed circuits. Graph Structure Theory 1991: 195-202 - 1990
- [j14]András Frank:
Packing paths in planar graphs. Comb. 10(4): 325-331 (1990) - [j13]Herbert Fleischner, András Frank:
On circuit decomposition of planar Eulerian graphs. J. Comb. Theory B 50(2): 245-253 (1990) - [c5]András Frank, Alexander Schrijver:
Vertex-Disjoint Simple Paths of Given Homotopy in a Planar Graph. Polyhedral Combinatorics 1990: 139-162 - [c4]András Frank:
On Disjoint Homotopic Paths in the Plane. Polyhedral Combinatorics 1990: 163-170 - [c3]András Frank:
Augmenting Graphs to Meet Edge-Connectivity Requirements. FOCS 1990: 708-718 - [c2]András Frank:
Conservative Weightings and Ear-Decompositions of Graphs. IPCO 1990: 217-229
1980 – 1989
- 1988
- [j12]András Frank, Éva Tardos:
Generalized polymatroids and submodular flows. Math. Program. 42(1-3): 489-563 (1988) - 1987
- [j11]András Frank, Éva Tardos:
An application of simultaneous Diophantine approximation in combinatorial optimization. Comb. 7(1): 49-65 (1987) - 1985
- [j10]András Frank:
Edge-disjoint paths in planar graphs. J. Comb. Theory B 39(2): 164-178 (1985) - [j9]William H. Cunningham, András Frank:
A Primal-Dual Algorithm for Submodular Flows. Math. Oper. Res. 10(2): 251-262 (1985) - [c1]András Frank, Éva Tardos:
An Application of Simultaneous Approximation in Combinatorial Optimization. FOCS 1985: 459-463 - 1984
- [j8]András Frank:
Finding feasible vectors of Edmonds-Giles polyhedra. J. Comb. Theory B 36(3): 221-239 (1984) - 1982
- [j7]András Frank:
Disjoint paths in a rectilinear grid. Comb. 2(4): 361-371 (1982) - [j6]András Frank:
A note on k-strongly connected orientations of an undirected graph. Discret. Math. 39(1): 103-104 (1982) - 1981
- [j5]András Frank:
How to make a digraph strongly connected. Comb. 1(2): 145-153 (1981) - [j4]András Frank:
A Weighted Matroid Intersection Algorithm. J. Algorithms 2(4): 328-336 (1981) - 1980
- [j3]András Frank:
On the orientation of graphs. J. Comb. Theory B 28(3): 251-261 (1980) - [j2]András Frank:
On chain and antichain families of a partially ordered set. J. Comb. Theory B 29(2): 176-184 (1980)
1970 – 1979
- 1977
- [j1]András Frank:
On a class of balanced hypergraphs. Discret. Math. 20: 11-20 (1977)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-10 21:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
