| 2008 |
|---|
| 49 | EE | András Frank,
Lap Chi Lau,
Jácint Szabó:
A note on degree-constrained subgraphs.
Discrete Mathematics 308(12): 2647-2648 (2008) |
| 48 | EE | András Frank,
László A. Végh:
An algorithm to increase the node-connectivity of a digraph by one.
Discrete Optimization 5(4): 677-684 (2008) |
| 2007 |
|---|
| 47 | EE | 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 |
|---|
| 46 | EE | András Frank,
Zoltán Király,
Balázs Kotnyek:
An Algorithm for Node-Capacitated Ring Routing.
ESA 2005: 249-258 |
| 45 | EE | 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) |
| 2004 |
|---|
| 44 | EE | Tamás Fleiner,
András Frank,
Satoru Iwata:
A constrained independent set problem for matroids.
Oper. Res. Lett. 32(1): 23-26 (2004) |
| 2003 |
|---|
| 43 | EE | András Frank:
Restricted t-matchings in bipartite graphs.
Discrete Applied Mathematics 131(2): 337-346 (2003) |
| 42 | EE | András Frank,
László Szegö:
Constructive characterizations for packing and covering with trees.
Discrete Applied Mathematics 131(2): 347-371 (2003) |
| 41 | EE | András Frank,
Tamás Király,
Matthias Kriesell:
On decomposing a hypergraph into k connected sub-hypergraphs.
Discrete Applied Mathematics 131(2): 373-383 (2003) |
| 40 | EE | András Frank,
Tamás Király,
Zoltán Király:
On the orientation of graphs and hypergraphs.
Discrete Applied Mathematics 131(2): 385-400 (2003) |
| 39 | EE | András Frank,
Tamás Király:
Combined connectivity augmentation and orientation problems.
Discrete Applied Mathematics 131(2): 401-419 (2003) |
| 2002 |
|---|
| 38 | EE | András Frank,
Zoltán Király:
Graph Orientations with Edge-connection and Parity Constraints.
Combinatorica 22(1): 47-70 (2002) |
| 37 | EE | András Frank,
Bruce Shepherd,
Vivek Tandon,
Zoltán Végh:
Node-Capacitated Ring Routing.
Math. Oper. Res. 27(2): 372-383 (2002) |
| 2001 |
|---|
| 36 | EE | András Frank,
Tamás Király:
Combined Connectivity Augmentation and Orientation Problems.
IPCO 2001: 130-144 |
| 35 | EE | András Frank,
László Szegö:
An Extension of a Theorem of Henneberg and Laman.
IPCO 2001: 145-159 |
| 34 | | András Frank,
Tibor Jordán,
Zoltán Szigeti:
Combinatorial problems related to origin-destination matrices.
Discrete Applied Mathematics 115(1-3): 37-47 (2001) |
| 2000 |
|---|
| 33 | EE | András Frank:
Edge-Connectivities of Graphs and Digraphs.
Electronic Notes in Discrete Mathematics 5: 126-129 (2000) |
| 1999 |
|---|
| 32 | EE | András Frank,
Tibor Jordán,
Zoltán Szigeti:
An Orientation Theorem with Parity Conditions.
IPCO 1999: 183-190 |
| 31 | EE | András Frank,
Zoltán Király:
Parity Constrained k-Edge-Connected Orientations.
IPCO 1999: 191-201 |
| 30 | EE | András Frank:
Finding Minimum Generators of Path Systems'.
J. Comb. Theory, Ser. B 75(2): 237-244 (1999) |
| 1998 |
|---|
| 29 | EE | Péter L. Erdös,
András Frank,
László A. Székely:
Minimum Multiway Cuts in Trees.
Discrete Applied Mathematics 87(1-3): 67-75 (1998) |
| 28 | EE | András Frank,
Toshihide Ibaraki,
Hiroshi Nagamochi:
Two Arc-Disjoint Paths in Eulerian Digraphs.
SIAM J. Discrete Math. 11(4): 557-589 (1998) |
| 1997 |
|---|
| 27 | EE | András Frank,
Alexander V. Karzanov,
András Sebö:
On Integer Multiflow Maximization.
SIAM J. Discrete Math. 10(1): 158-170 (1997) |
| 1995 |
|---|
| 26 | | András Frank,
Tibor Jordán:
How to Make a Strongly Connected Digraph Two-Connected.
IPCO 1995: 414-425 |
| 25 | | András Frank,
Toshihide Ibaraki,
Hiroshi Nagamochi:
Two Arc Disjoint Paths in Eulerian Diagraphs.
ISAAC 1995: 92-101 |
| 24 | EE | András Frank,
Tibor Jordán:
Minimal Edge-Coverings of Pairs of Sets.
J. Comb. Theory, Ser. B 65(1): 73-110 (1995) |
| 23 | EE | Jørgen Bang-Jensen,
András Frank,
Bill Jackson:
Preserving and Increasing Local Edge-Connectivity in Mixed Graphs.
SIAM J. Discrete Math. 8(2): 155-178 (1995) |
| 1994 |
|---|
| 22 | EE | András Frank,
Zoltán Szigeti:
On Packing T-Cuts.
J. Comb. Theory, Ser. B 61(2): 263-271 (1994) |
| 1993 |
|---|
| 21 | | András Frank:
Conservative weightings and ear-decompositions of graphs.
Combinatorica 13(1): 65-81 (1993) |
| 20 | EE | András Frank:
Submodular functions in graph theory.
Discrete Mathematics 111(1-3): 231-243 (1993) |
| 1992 |
|---|
| 19 | | András Frank,
Alexander V. Karzanov,
András Sebö:
On Multiflow Problems.
IPCO 1992: 85-101 |
| 18 | | András Frank,
Takao Nishizeki,
Nobuji Saito,
Hitoshi Suzuki:
Algorithms for Routing around a Rectangle.
Discrete Applied Mathematics 40(4): 363-378 (1992) |
| 17 | EE | András Frank:
On a theorem of Mader.
Discrete Mathematics 101(1-3): 49-57 (1992) |
| 16 | | András Frank:
Augmenting Graphs to Meet Edge-Connectivity Requirements.
SIAM J. Discrete Math. 5(1): 25-53 (1992) |
| 1991 |
|---|
| 15 | | András Frank,
Tibor Jordán:
Tree-representation of directed circuits.
Graph Structure Theory 1991: 195-202 |
| 1990 |
|---|
| 14 | | András Frank:
Augmenting Graphs to Meet Edge-Connectivity Requirements
FOCS 1990: 708-718 |
| 13 | | András Frank:
Conservative Weightings and Ear-Decompositions of Graphs.
IPCO 1990: 217-229 |
| 12 | | András Frank:
Packing paths in planar graphs.
Combinatorica 10(4): 325-331 (1990) |
| 11 | EE | Herbert Fleischner,
András Frank:
On circuit decomposition of planar Eulerian graphs.
J. Comb. Theory, Ser. B 50(2): 245-253 (1990) |
| 1987 |
|---|
| 10 | | András Frank,
Éva Tardos:
An application of simultaneous Diophantine approximation in combinatorial optimization.
Combinatorica 7(1): 49-65 (1987) |
| 1985 |
|---|
| 9 | | András Frank,
Éva Tardos:
An Application of Simultaneous Approximation in Combinatorial Optimization
FOCS 1985: 459-463 |
| 8 | EE | András Frank:
Edge-disjoint paths in planar graphs.
J. Comb. Theory, Ser. B 39(2): 164-178 (1985) |
| 1984 |
|---|
| 7 | EE | András Frank:
Finding feasible vectors of Edmonds-Giles polyhedra.
J. Comb. Theory, Ser. B 36(3): 221-239 (1984) |
| 1982 |
|---|
| 6 | | András Frank:
Disjoint paths in a rectilinear grid.
Combinatorica 2(4): 361-371 (1982) |
| 5 | EE | András Frank:
A note on k-strongly connected orientations of an undirected graph.
Discrete Mathematics 39(1): 103-104 (1982) |
| 1981 |
|---|
| 4 | | András Frank:
How to make a digraph strongly connected.
Combinatorica 1(2): 145-153 (1981) |
| 3 | | András Frank:
A Weighted Matroid Intersection Algorithm.
J. Algorithms 2(4): 328-336 (1981) |
| 1980 |
|---|
| 2 | EE | András Frank:
On the orientation of graphs.
J. Comb. Theory, Ser. B 28(3): 251-261 (1980) |
| 1 | EE | András Frank:
On chain and antichain families of a partially ordered set.
J. Comb. Theory, Ser. B 29(2): 176-184 (1980) |
