András Frank

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	2013
j42		András Frank, Satoru Fujishige, Naoyuki Kamiyama, Naoki Katoh: Independent arborescences in directed graphs. Discrete Mathematics 313(4): 453-459 (2013)
	2012
i1		Dóra Erdös, András Frank, Krisztián Kun: Sink-Stable Sets of Digraphs. CoRR abs/1205.6071 (2012)
	2010
j41		Tamás Fleiner, András Frank: Balanced list edge-colourings of bipartite graphs. Electronic Notes in Discrete Mathematics 36: 837-842 (2010)
	2009
j40		András Frank: Rooted k-connections in digraphs. Discrete Applied Mathematics 157(6): 1242-1254 (2009)
	2008
j39		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)
j38		András Frank, Lap Chi Lau, Jácint Szabó: A note on degree-constrained subgraphs. Discrete Mathematics 308(12): 2647-2648 (2008)
c13		András Frank, Tamás Király: A Survey on Covering Supermodular Functions. Bonn Workshop of Combinatorial Optimization 2008: 87-126
	2007
j37		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
j36		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)
c12		András Frank, Zoltán Király, Balázs Kotnyek: An Algorithm for Node-Capacitated Ring Routing. ESA 2005: 249-258
	2004
j35		Tamás Fleiner, András Frank, Satoru Iwata: A constrained independent set problem for matroids. Oper. Res. Lett. 32(1): 23-26 (2004)
	2003
j34		András Frank: Restricted t-matchings in bipartite graphs. Discrete Applied Mathematics 131(2): 337-346 (2003)
j33		András Frank, László Szegö: Constructive characterizations for packing and covering with trees. Discrete Applied Mathematics 131(2): 347-371 (2003)
j32		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)
j31		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)
j30		András Frank, Tamás Király: Combined connectivity augmentation and orientation problems. Discrete Applied Mathematics 131(2): 401-419 (2003)
	2002
j29		András Frank, Zoltán Király: Graph Orientations with Edge-connection and Parity Constraints. Combinatorica 22(1): 47-70 (2002)
j28		András Frank, László Szegö: Note on the path-matching formula. Journal of Graph Theory 41(2): 110-119 (2002)
j27		András Frank, Bruce Shepherd, Vivek Tandon, Zoltán Végh: Node-Capacitated Ring Routing. Math. Oper. Res. 27(2): 372-383 (2002)
	2001
j26		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)
c11		András Frank, Tamás Király: Combined Connectivity Augmentation and Orientation Problems. IPCO 2001: 130-144
c10		András Frank, László Szegö: An Extension of a Theorem of Henneberg and Laman. IPCO 2001: 145-159
	2000
j25		András Frank: Edge-Connectivities of Graphs and Digraphs. Electronic Notes in Discrete Mathematics 5: 126-129 (2000)
	1999
j24		András Frank: Finding Minimum Generators of Path Systems'. J. Comb. Theory, Ser. B 75(2): 237-244 (1999)
c9		András Frank, Tibor Jordán, Zoltán Szigeti: An Orientation Theorem with Parity Conditions. IPCO 1999: 183-190
c8		András Frank, Zoltán Király: Parity Constrained k-Edge-Connected Orientations. IPCO 1999: 191-201
	1998
j23		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)
j22		András Frank, Toshihide Ibaraki, Hiroshi Nagamochi: Two Arc-Disjoint Paths in Eulerian Digraphs. SIAM J. Discrete Math. 11(4): 557-589 (1998)
	1997
j21		András Frank, Alexander V. Karzanov, András Sebö: On Integer Multiflow Maximization. SIAM J. Discrete Math. 10(1): 158-170 (1997)
	1995
j20		András Frank, Tibor Jordán: Minimal Edge-Coverings of Pairs of Sets. J. Comb. Theory, Ser. B 65(1): 73-110 (1995)
j19		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)
c7		András Frank, Tibor Jordán: How to Make a Strongly Connected Digraph Two-Connected. IPCO 1995: 414-425
c6		András Frank, Toshihide Ibaraki, Hiroshi Nagamochi: Two Arc Disjoint Paths in Eulerian Diagraphs. ISAAC 1995: 92-101
	1994
j18		András Frank, Zoltán Szigeti: On Packing T-Cuts. J. Comb. Theory, Ser. B 61(2): 263-271 (1994)
	1993
j17		András Frank: Conservative weightings and ear-decompositions of graphs. Combinatorica 13(1): 65-81 (1993)
j16		András Frank: Submodular functions in graph theory. Discrete Mathematics 111(1-3): 231-243 (1993)
j15		András Frank, Toshihide Ibaraki, Hiroshi Nagamochi: On sparse subgraphs preserving connectivity properties. Journal of Graph Theory 17(3): 275-281 (1993)
	1992
j14		András Frank, Takao Nishizeki, Nobuji Saito, Hitoshi Suzuki: Algorithms for Routing around a Rectangle. Discrete Applied Mathematics 40(4): 363-378 (1992)
j13		András Frank: On a theorem of Mader. Discrete Mathematics 101(1-3): 49-57 (1992)
j12		András Frank: Augmenting Graphs to Meet Edge-Connectivity Requirements. SIAM J. Discrete Math. 5(1): 25-53 (1992)
c5		András Frank, Alexander V. Karzanov, András Sebö: On Multiflow Problems. IPCO 1992: 85-101
	1991
c4		András Frank, Tibor Jordán: Tree-representation of directed circuits. Graph Structure Theory 1991: 195-202
	1990
j11		András Frank: Packing paths in planar graphs. Combinatorica 10(4): 325-331 (1990)
j10		Herbert Fleischner, András Frank: On circuit decomposition of planar Eulerian graphs. J. Comb. Theory, Ser. B 50(2): 245-253 (1990)
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
	1987
j9		András Frank, Éva Tardos: An application of simultaneous Diophantine approximation in combinatorial optimization. Combinatorica 7(1): 49-65 (1987)
	1985
j8		András Frank: Edge-disjoint paths in planar graphs. J. Comb. Theory, Ser. B 39(2): 164-178 (1985)
c1		András Frank, Éva Tardos: An Application of Simultaneous Approximation in Combinatorial Optimization. FOCS 1985: 459-463
	1984
j7		András Frank: Finding feasible vectors of Edmonds-Giles polyhedra. J. Comb. Theory, Ser. B 36(3): 221-239 (1984)
	1982
j6		András Frank: Disjoint paths in a rectilinear grid. Combinatorica 2(4): 361-371 (1982)
j5		András Frank: A note on k-strongly connected orientations of an undirected graph. Discrete Mathematics 39(1): 103-104 (1982)
	1981
j4		András Frank: How to make a digraph strongly connected. Combinatorica 1(2): 145-153 (1981)
j3		András Frank: A Weighted Matroid Intersection Algorithm. J. Algorithms 2(4): 328-336 (1981)
	1980
j2		András Frank: On the orientation of graphs. J. Comb. Theory, Ser. B 28(3): 251-261 (1980)
j1		András Frank: On chain and antichain families of a partially ordered set. J. Comb. Theory, Ser. B 29(2): 176-184 (1980)

Coauthor Index

1	Jørgen Bang-Jensen	[j19]
2	Johanna Becker	[j36]
3	Mihály Bárász	[j36]
4	Dóra Erdös	[i1]
5	Péter L. Erdös	[j23]
6	Tamás Fleiner	[j41] [j35]
7	Herbert Fleischner	[j10]
8	Satoru Fujishige	[j42]
9	Toshihide Ibaraki	[j22] [c6] [j15]
10	Satoru Iwata	[j35]
11	Bill Jackson	[j19]
12	Tibor Jordán	[j26] [c9] [j20] [c7] [c4]
13	Naoyuki Kamiyama	[j42]
14	Alexander V. Karzanov	[j21] [c5]
15	Naoki Katoh	[j42]
16	Tamás Király	[c13] [j32] [j31] [j30] [c11]
17	Zoltán Király	[j37] [c12] [j31] [j29] [c8]
18	Balázs Kotnyek	[j37] [c12]
19	Matthias Kriesell	[j32]
20	Krisztián Kun	[i1]
21	Lap Chi Lau	[j38]
22	Hiroshi Nagamochi	[j22] [c6] [j15]
23	Takao Nishizeki	[j14]
24	Nobuji Saito	[j14]
25	András Sebö	[j21] [c5]
26	Bruce Shepherd	[j27]
27	Hitoshi Suzuki	[j14]
28	Jácint Szabó	[j38]
29	László Szegö	[j33] [j28] [c10]
30	Zoltán Szigeti	[j26] [c9] [j18]
31	László A. Székely	[j23]
32	Vivek Tandon	[j27]
33	Éva Tardos	[j9] [c1]
34	László A. Végh	[j39]
35	Zoltán Végh	[j27]

Colors in the list of coauthors

Last update Sat May 25 16:25:28 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page