András Frank - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 78 from 78

2023

Fair Integral Network FlowsAndrás Frank, Kazuo Murota. mor, 48(3):1393-1422, August 2023. [doi]

2022

Fair integral submodular flowsAndrás Frank, Kazuo Murota. DAM, 320:416-434, 2022. [doi]

A Discrete Convex Min-Max Formula for Box-TDI PolyhedraAndrás Frank, Kazuo Murota. mor, 47(2):1026-1047, 2022. [doi]

Decreasing minimization on M-convex sets: algorithms and applicationsAndrás Frank, Kazuo Murota. mp, 195(1):1027-1068, 2022. [doi]

Decreasing minimization on M-convex sets: background and structuresAndrás Frank, Kazuo Murota. mp, 195(1):977-1025, 2022. [doi]

2021

A simple algorithm and min-max formula for the inverse arborescence problemAndrás Frank, Gergely Hajdu. DAM, 295:85-93, 2021. [doi]

2018

Supermodularity in Unweighted Graph Optimization III: Highly Connected DigraphsKristóf Bérczi, András Frank. mor, 43(3):763-780, 2018. [doi]

Supermodularity in Unweighted Graph Optimization I: Branchings and MatchingsKristóf Bérczi, András Frank. mor, 43(3):726-753, 2018. [doi]

Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank AugmentationKristóf Bérczi, András Frank. mor, 43(3):754-762, 2018. [doi]

2014

Sink-Stable Sets of DigraphsDóra Erdös, András Frank, Krisztián Kun. siamdm, 28(4):1651-1674, 2014. [doi]

Characterizing and recognizing generalized polymatroidsAndrás Frank, Tamás Király, Júlia Pap, David Pritchard. mp, 146(1-2):245-273, 2014. [doi]

2013

Tree-compositions and orientationsAndrás Frank, Csaba Király. orl, 41(4):336-342, 2013. [doi]

Independent arborescences in directed graphsAndrás Frank, Satoru Fujishige, Naoyuki Kamiyama, Naoki Katoh. DM, 313(4):453-459, 2013. [doi]

2010

Balanced list edge-colourings of bipartite graphsTamás Fleiner, András Frank. endm, 36:837-842, 2010. [doi]

2009

Rooted k-connections in digraphsAndrás Frank. DAM, 157(6):1242-1254, 2009. [doi]

2008

An algorithm to increase the node-connectivity of a digraph by oneAndrás Frank, László A. Végh. disopt, 5(4):677-684, 2008. [doi]

A note on degree-constrained subgraphsAndrás Frank, Lap Chi Lau, Jácint Szabó. DM, 308(12):2647-2648, 2008. [doi]

A Survey on Covering Supermodular FunctionsAndrás Frank, Tamás Király. bonnco 2009: 87-126 [doi]

2007

An algorithm for node-capacitated ring routingAndrás Frank, Zoltán Király, Balázs Kotnyek. orl, 35(3):385-391, 2007. [doi]

2005

An algorithm for source location in directed graphsMihály Bárász, Johanna Becker, András Frank. orl, 33(3):221-230, 2005. [doi]

An Algorithm for Node-Capacitated Ring RoutingAndrás Frank, Zoltán Király, Balázs Kotnyek. esa 2005: 249-258 [doi]

2004

A constrained independent set problem for matroidsTamás Fleiner, András Frank, Satoru Iwata. orl, 32(1):23-26, 2004. [doi]

2003

Constructive characterizations for packing and covering with treesAndrás Frank, László Szegö. DAM, 131(2):347-371, 2003. [doi]

Restricted t-matchings in bipartite graphsAndrás Frank. DAM, 131(2):337-346, 2003. [doi]

Combined connectivity augmentation and orientation problemsAndrás Frank, Tamás Király. DAM, 131(2):401-419, 2003. [doi]

On decomposing a hypergraph into k connected sub-hypergraphsAndrás Frank, Tamás Király, Matthias Kriesell. DAM, 131(2):373-383, 2003. [doi]

On the orientation of graphs and hypergraphsAndrás Frank, Tamás Király, Zoltán Király. DAM, 131(2):385-400, 2003. [doi]

2002

Node-Capacitated Ring RoutingAndrás Frank, Bruce Shepherd, Vivek Tandon, Zoltán Végh. mor, 27(2):372-383, 2002. [doi]

Note on the path-matching formulaAndrás Frank, László Szegö. jgt, 41(2):110-119, 2002. [doi]

Graph Orientations with Edge-connection and Parity ConstraintsAndrás Frank, Zoltán Király. combinatorica, 22(1):47-70, 2002. [doi]

2001

An Extension of a Theorem of Henneberg and LamanAndrás Frank, László Szegö. ipco 2001: 145-159 [doi]

Combinatorial problems related to origin-destination matricesAndrás Frank, Tibor Jordán, Zoltán Szigeti. DAM, 115(1-3):37-47, 2001.

Combined Connectivity Augmentation and Orientation ProblemsAndrás Frank, Tamás Király. ipco 2001: 130-144 [doi]

2000

Edge-Connectivities of Graphs and DigraphsAndrás Frank. endm, 5:126-129, 2000. [doi]

1999

Covering symmetric supermodular functions by graphsAndrás A. Benczúr, András Frank. mp, 84(3):483-503, 1999. [doi]

Finding Minimum Generators of Path Systems András Frank. JCT, 75(2):237-244, 1999. [doi]

Increasing the rooted-connectivity of a digraph by oneAndrás Frank. mp, 84(3):565-576, 1999. [doi]

Connectivity augmentation of networks: structures and algorithmsAndrás Frank. mp, 84(3):439-441, 1999. [doi]

Parity Constrained ::::k::::-Edge-Connected OrientationsAndrás Frank, Zoltán Király. ipco 1999: 191-201 [doi]

Directed vertex-connectivity augmentationAndrás Frank, Tibor Jordán. mp, 84(3):537-553, 1999. [doi]

An Orientation Theorem with Parity ConditionsAndrás Frank, Tibor Jordán, Zoltán Szigeti. ipco 1999: 183-190 [doi]

1998

Minimum Multiway Cuts in TreesPéter L. Erdös, András Frank, László A. Székely. DAM, 87(1-3):67-75, 1998. [doi]

Two Arc-Disjoint Paths in Eulerian DigraphsAndrás Frank, Toshihide Ibaraki, Hiroshi Nagamochi. siamdm, 11(4):557-589, 1998. [doi]

1997

Finding minimum weighted generators of a path systemAndrás Frank. dimacs 1999: 129-138

On Integer Multiflow MaximizationAndrás Frank, Alexander V. Karzanov, András Sebö. siamdm, 10(1):158-170, 1997. [doi]

1995

1994

On Packing ::::T::::-CutsAndrás Frank, Zoltán Szigeti. JCT, 61(2):263-271, 1994. [doi]

1993

Conservative weightings and ear-decompositions of graphsAndrás Frank. combinatorica, 13(1):65-81, 1993.

Submodular functions in graph theoryAndrás Frank. DM, 111(1-3):231-243, 1993. [doi]

On sparse subgraphs preserving connectivity propertiesAndrás Frank, Toshihide Ibaraki, Hiroshi Nagamochi. jgt, 17(3):275-281, 1993. [doi]

1992

On a theorem of MaderAndrás Frank. DM, 101(1-3):49-57, 1992. [doi]

Algorithms for Routing around a RectangleAndrás Frank, Takao Nishizeki, Nobuji Saito, Hitoshi Suzuki. DAM, 40(4):363-378, 1992.

Augmenting Graphs to Meet Edge-Connectivity RequirementsAndrás Frank. siamdm, 5(1):25-53, 1992.

On Multiflow ProblemsAndrás Frank, Alexander V. Karzanov, András Sebö. ipco 1992: 85-101

1991

Tree-representation of directed circuitsAndrás Frank, Tibor Jordán. gst 1993: 195-202

1990

1988

Generalized polymatroids and submodular flowsAndrás Frank, Éva Tardos. mp, 42(1-3):489-563, 1988. [doi]

1987

An application of simultaneous Diophantine approximation in combinatorial optimizationAndrás Frank, Éva Tardos. combinatorica, 7(1):49-65, 1987.

1985

A Primal-Dual Algorithm for Submodular FlowsWilliam H. Cunningham, András Frank. mor, 10(2):251-262, 1985. [doi]

An Application of Simultaneous Approximation in Combinatorial OptimizationAndrás Frank, Éva Tardos. focs 1985: 459-463

Edge-disjoint paths in planar graphsAndrás Frank. JCT, 39(2):164-178, 1985. [doi]

1984

Finding feasible vectors of Edmonds-Giles polyhedraAndrás Frank. JCT, 36(3):221-239, 1984. [doi]

1982

A note on k-strongly connected orientations of an undirected graphAndrás Frank. DM, 39(1):103-104, 1982. [doi]

Disjoint paths in a rectilinear gridAndrás Frank. combinatorica, 2(4):361-371, 1982.

1981

How to make a digraph strongly connectedAndrás Frank. combinatorica, 1(2):145-153, 1981.

A Weighted Matroid Intersection AlgorithmAndrás Frank. jal, 2(4):328-336, 1981.

1980

On the orientation of graphsAndrás Frank. JCT, 28(3):251-261, 1980. [doi]

On chain and antichain families of a partially ordered setAndrás Frank. JCT, 29(2):176-184, 1980. [doi]

1977

On a class of balanced hypergraphsAndrás Frank. DM, 20:11-20, 1977. [doi]

Sign in or sign up to see more results.

runs on WebDSL