According to our database
1,
András Frank
authored at least 78 papers
between 1977 and 2024.
Collaborative distances:
2024
A network flow approach to a common generalization of Clar and Fries numbers.
Discret. Math., January, 2024
A new approach to bipartite stable matching optimization.
CoRR, 2024
2023
Fair Integral Network Flows.
Math. Oper. Res., August, 2023
2022
Decreasing minimization on M-convex sets: background and structures.
Math. Program., 2022
Decreasing minimization on M-convex sets: algorithms and applications.
Math. Program., 2022
A Discrete Convex Min-Max Formula for Box-TDI Polyhedra.
Math. Oper. Res., 2022
Fair integral submodular flows.
Discret. Appl. Math., 2022
2021
A simple algorithm and min-max formula for the inverse arborescence problem.
Discret. Appl. Math., 2021
2018
Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs.
Math. Oper. Res., 2018
Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank Augmentation.
Math. Oper. Res., 2018
Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings.
Math. Oper. Res., 2018
2016
Supermodularity in Unweighted Graph Opitimization III: Highly-connected Digraphs.
CoRR, 2016
2014
Sink-Stable Sets of Digraphs.
SIAM J. Discret. Math., 2014
Characterizing and recognizing generalized polymatroids.
Math. Program., 2014
2013
Tree-compositions and orientations.
Oper. Res. Lett., 2013
Independent arborescences in directed graphs.
Discret. Math., 2013
2010
Balanced list edge-colourings of bipartite graphs.
Electron. Notes Discret. Math., 2010
2009
Rooted k-connections in digraphs.
Discret. Appl. Math., 2009
2008
A note on degree-constrained subgraphs.
Discret. Math., 2008
An algorithm to increase the node-connectivity of a digraph by one.
Discret. Optim., 2008
A Survey on Covering Supermodular Functions.
Proceedings of the Research Trends in Combinatorial Optimization, 2008
2007
An algorithm for node-capacitated ring routing.
Oper. Res. Lett., 2007
2005
An algorithm for source location in directed graphs.
Oper. Res. Lett., 2005
2004
A constrained independent set problem for matroids.
Oper. Res. Lett., 2004
2003
Constructive characterizations for packing and covering with trees.
Discret. Appl. Math., 2003
On the orientation of graphs and hypergraphs.
Discret. Appl. Math., 2003
On decomposing a hypergraph into k connected sub-hypergraphs.
Discret. Appl. Math., 2003
Combined connectivity augmentation and orientation problems.
Discret. Appl. Math., 2003
Restricted t-matchings in bipartite graphs.
Discret. Appl. Math., 2003
2002
Node-Capacitated Ring Routing.
Math. Oper. Res., 2002
Note on the path-matching formula.
J. Graph Theory, 2002
Graph Orientations with Edge-connection and Parity Constraints.
Comb., 2002
2001
Combinatorial problems related to origin-destination matrices.
Discret. Appl. Math., 2001
An Extension of a Theorem of Henneberg and Laman.
Proceedings of the Integer Programming and Combinatorial Optimization, 2001
2000
Edge-Connectivities of Graphs and Digraphs.
Electron. Notes Discret. Math., 2000
1999
Directed vertex-connectivity augmentation.
Math. Program., 1999
Increasing the rooted-connectivity of a digraph by one.
Math. Program., 1999
Connectivity augmentation of networks: structures and algorithms.
Math. Program., 1999
Covering symmetric supermodular functions by graphs.
Math. Program., 1999
Finding Minimum Generators of Path Systems'.
J. Comb. Theory B, 1999
Parity Constrained <i>k</i>-Edge-Connected Orientations.
Proceedings of the Integer Programming and Combinatorial Optimization, 1999
An Orientation Theorem with Parity Conditions.
Proceedings of the Integer Programming and Combinatorial Optimization, 1999
1998
Two Arc-Disjoint Paths in Eulerian Digraphs.
SIAM J. Discret. Math., 1998
Minimum Multiway Cuts in Trees.
Discret. Appl. Math., 1998
1997
On Integer Multiflow Maximization.
SIAM J. Discret. Math., 1997
Finding minimum weighted generators of a path system.
Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997
1995
Preserving and Increasing Local Edge-Connectivity in Mixed Graphs.
SIAM J. Discret. Math., 1995
A note on packing paths in planar graphs.
Math. Program., 1995
Minimal Edge-Coverings of Pairs of Sets.
J. Comb. Theory B, 1995
Two Arc Disjoint Paths in Eulerian Diagraphs.
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995
How to Make a Strongly Connected Digraph Two-Connected.
Proceedings of the Integer Programming and Combinatorial Optimization, 1995
1994
On Packing <i>T</i>-Cuts.
J. Comb. Theory B, 1994
1993
On sparse subgraphs preserving connectivity properties.
J. Graph Theory, 1993
Submodular functions in graph theory.
Discret. Math., 1993
Conservative weightings and ear-decompositions of graphs.
Comb., 1993
1992
Augmenting Graphs to Meet Edge-Connectivity Requirements.
SIAM J. Discret. Math., 1992
Edge-disjoint circuits in graphs on the torus.
J. Comb. Theory B, 1992
Algorithms for Routing around a Rectangle.
Discret. Appl. Math., 1992
Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992
1991
Tree-representation of directed circuits.
Proceedings of the Graph Structure Theory, 1991
1990
On circuit decomposition of planar Eulerian graphs.
J. Comb. Theory B, 1990
Packing paths in planar graphs.
Comb., 1990
Vertex-Disjoint Simple Paths of Given Homotopy in a Planar Graph.
Proceedings of the Polyhedral Combinatorics, 1990
On Disjoint Homotopic Paths in the Plane.
Proceedings of the Polyhedral Combinatorics, 1990
1988
Generalized polymatroids and submodular flows.
Math. Program., 1988
1987
An application of simultaneous Diophantine approximation in combinatorial optimization.
Comb., 1987
1985
A Primal-Dual Algorithm for Submodular Flows.
Math. Oper. Res., 1985
Edge-disjoint paths in planar graphs.
J. Comb. Theory B, 1985
An Application of Simultaneous Approximation in Combinatorial Optimization
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985
1984
Finding feasible vectors of Edmonds-Giles polyhedra.
J. Comb. Theory B, 1984
1982
A note on k-strongly connected orientations of an undirected graph.
Discret. Math., 1982
Disjoint paths in a rectilinear grid.
Comb., 1982
1981
A Weighted Matroid Intersection Algorithm.
J. Algorithms, 1981
How to make a digraph strongly connected.
Comb., 1981
1980
On the orientation of graphs.
J. Comb. Theory B, 1980
On chain and antichain families of a partially ordered set.
J. Comb. Theory B, 1980
1977
On a class of balanced hypergraphs.
Discret. Math., 1977
