The following pages link to András Frank (Q226797):
Displayed 50 items.
- Submodular functions in graph theory (Q686469) (← links)
- Finding feasible vectors of Edmonds-Giles polyhedra (Q796541) (← links)
- Packing paths in planar graphs (Q809091) (← links)
- An algorithm to increase the node-connectivity of a digraph by one (Q955325) (← links)
- Rooted \(k\)-connections in digraphs (Q1025990) (← links)
- Disjoint paths in a rectilinear grid (Q1051655) (← links)
- Edge-disjoint paths in planar graphs (Q1069956) (← links)
- An application of simultaneous diophantine approximation in combinatorial optimization (Q1101013) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- An application of submodular flows (Q1119596) (← links)
- Applications of relaxed submodularity (Q1126827) (← links)
- On the orientation of graphs (Q1144041) (← links)
- On chain and antichain families of a partially ordered set (Q1144050) (← links)
- (Q1161750) (redirect page) (← links)
- A note on k-strongly connected orientations of an undirected graph (Q1161751) (← links)
- How to make a digraph strongly connected (Q1165251) (← links)
- On a theorem of Mader (Q1197013) (← links)
- Algorithms for routing around a rectangle (Q1208452) (← links)
- On a class of balanced hypergraphs (Q1252358) (← links)
- Minimum multiway cuts in trees (Q1270773) (← links)
- Connectivity augmentation of networks: Structures and algorithms. Papers from the workshop held at Eötvös University, Budapest, Hungary, November 1994 (Q1300050) (← links)
- Covering symmetric supermodular functions by graphs (Q1300054) (← links)
- Directed vertex-connectivity augmentation (Q1300059) (← links)
- Increasing the rooted connectivity of a digraph by one (Q1300061) (← links)
- Finding minimum generators of path systems (Q1305531) (← links)
- On packing \(T\)-cuts (Q1333344) (← links)
- Restricted \(t\)-matchings in bipartite graphs (Q1410687) (← links)
- Constructive characterizations for packing and covering with trees (Q1410688) (← links)
- On decomposing a hypergraph into \(k\) connected sub-hypergraphs (Q1410689) (← links)
- On the orientation of graphs and hypergraphs (Q1410690) (← links)
- Combined connectivity augmentation and orientation problems (Q1410691) (← links)
- A constrained independent set problem for matroids (Q1433653) (← links)
- Graph orientations with edge-connection and parity constraints (Q1603262) (← links)
- An algorithm for source location in directed graphs (Q1779694) (← links)
- On circuit decomposition of planar Eulerian graphs (Q1814589) (← links)
- Minimal edge-coverings of pairs of sets (Q1898731) (← links)
- A note on packing paths in planar graphs (Q1906072) (← links)
- Simple push-relabel algorithms for matroids and submodular flows (Q1926643) (← links)
- Independent arborescences in directed graphs (Q1937557) (← links)
- Decreasing minimization on M-convex sets: background and structures (Q2089794) (← links)
- Decreasing minimization on M-convex sets: algorithms and applications (Q2089795) (← links)
- Decreasing minimization on base-polyhedra: relation between discrete and continuous cases (Q2111551) (← links)
- Fair integral submodular flows (Q2166258) (← links)
- Conservative weightings and ear-decompositions of graphs (Q2367443) (← links)
- A note on degree-constrained subgraphs (Q2427532) (← links)
- Tree-compositions and orientations (Q2450662) (← links)
- An algorithm for node-capacitated ring routing (Q2467482) (← links)
- A simple algorithm and min-max formula for the inverse arborescence problem (Q2661220) (← links)
- (Q2816087) (← links)
- (Q2861497) (← links)