András Frank - RankMe

87 papers A* 2A 1B 8Journal 71Unranked 5

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	How to see the forest for the trees. CoRR Erika Renata Kovács, András Frank
2025	J	`jnl`	Prefix-bounded matrices. CoRR Nóra A. Borsik, András Frank, Péter Madarasi, Tamás Takács
2024	J	`jnl`	A network flow approach to a common generalization of Clar and Fries numbers. Discret. Math. Erika R. Bérczi-Kovács, András Frank
2024	J	`jnl`	A new approach to bipartite stable matching optimization. CoRR Tamás Fleiner, András Frank, Tamás Király
2023	J	`jnl`	Fair Integral Network Flows. Math. Oper. Res. András Frank, Kazuo Murota
2022	J	`jnl`	A Discrete Convex Min-Max Formula for Box-TDI Polyhedra. Math. Oper. Res. András Frank, Kazuo Murota
2022	J	`jnl`	Decreasing minimization on M-convex sets: algorithms and applications. Math. Program. András Frank, Kazuo Murota
2022	J	`jnl`	Decreasing minimization on M-convex sets: background and structures. Math. Program. András Frank, Kazuo Murota
2022	J	`jnl`	Fair integral submodular flows. Discret. Appl. Math. András Frank, Kazuo Murota
2021	J	`jnl`	A simple algorithm and min-max formula for the inverse arborescence problem. Discret. Appl. Math. András Frank, Gergely Hajdu
2018	J	`jnl`	Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings. Math. Oper. Res. Kristóf Bérczi, András Frank
2018	J	`jnl`	Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank Augmentation. Math. Oper. Res. Kristóf Bérczi, András Frank
2018	J	`jnl`	Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs. Math. Oper. Res. Kristóf Bérczi, András Frank
2016	J	`jnl`	Supermodularity in Unweighted Graph Opitimization III: Highly-connected Digraphs. CoRR Kristóf Bérczi, András Frank
2016	J	`jnl`	Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings. CoRR Kristóf Bérczi, András Frank
2016	J	`jnl`	Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank Augmentation. CoRR Kristóf Bérczi, András Frank
2014	J	`jnl`	Characterizing and recognizing generalized polymatroids. Math. Program. András Frank, Tamás Király, Júlia Pap, David Pritchard
2014	J	`jnl`	Sink-Stable Sets of Digraphs. SIAM J. Discret. Math. Dóra Erdös, András Frank, Krisztián Kun
2013	J	`jnl`	Independent arborescences in directed graphs. Discret. Math. András Frank, Satoru Fujishige, Naoyuki Kamiyama, Naoki Katoh
2013	J	`jnl`	Tree-compositions and orientations. Oper. Res. Lett. András Frank, Csaba Király
2012	J	`jnl`	Sink-Stable Sets of Digraphs CoRR Dóra Erdös, András Frank, Krisztián Kun
2010	J	`jnl`	Balanced list edge-colourings of bipartite graphs. Electron. Notes Discret. Math. Tamás Fleiner, András Frank
2009	J	`jnl`	Rooted k-connections in digraphs. Discret. Appl. Math. András Frank
2008	—	`conf`	A Survey on Covering Supermodular Functions. Bonn Workshop of Combinatorial Optimization András Frank, Tamás Király
2008	J	`jnl`	A note on degree-constrained subgraphs. Discret. Math. András Frank, Lap Chi Lau, Jácint Szabó
2008	J	`jnl`	An algorithm to increase the node-connectivity of a digraph by one. Discret. Optim. András Frank, László A. Végh
2007	J	`jnl`	An algorithm for node-capacitated ring routing. Oper. Res. Lett. András Frank, Zoltán Király, Balázs Kotnyek
2005	A	`conf`	An Algorithm for Node-Capacitated Ring Routing. ESA András Frank, Zoltán Király, Balázs Kotnyek
2005	J	`jnl`	An algorithm for source location in directed graphs. Oper. Res. Lett. Mihály Bárász, Johanna Becker, András Frank
2004	J	`jnl`	A constrained independent set problem for matroids. Oper. Res. Lett. Tamás Fleiner, András Frank, Satoru Iwata
2003	J	`jnl`	Combined connectivity augmentation and orientation problems. Discret. Appl. Math. András Frank, Tamás Király
2003	J	`jnl`	Constructive characterizations for packing and covering with trees. Discret. Appl. Math. András Frank, László Szegö
2003	J	`jnl`	On decomposing a hypergraph into k connected sub-hypergraphs. Discret. Appl. Math. András Frank, Tamás Király, Matthias Kriesell
2003	J	`jnl`	On the orientation of graphs and hypergraphs. Discret. Appl. Math. András Frank, Tamás Király, Zoltán Király
2003	J	`jnl`	Restricted t-matchings in bipartite graphs. Discret. Appl. Math. András Frank
2002	J	`jnl`	Graph Orientations with Edge-connection and Parity Constraints. Comb. András Frank, Zoltán Király
2002	J	`jnl`	Node-Capacitated Ring Routing. Math. Oper. Res. András Frank, F. Bruce Shepherd, Vivek Tandon, Zoltán Végh
2002	J	`jnl`	Note on the path-matching formula. J. Graph Theory András Frank, László Szegö
2001	B	`conf`	An Extension of a Theorem of Henneberg and Laman. IPCO András Frank, László Szegö
2001	J	`jnl`	Combinatorial problems related to origin-destination matrices. Discret. Appl. Math. András Frank, Tibor Jordán, Zoltán Szigeti
2001	B	`conf`	Combined Connectivity Augmentation and Orientation Problems. IPCO András Frank, Tamás Király
2000	J	`jnl`	Edge-Connectivities of Graphs and Digraphs. Electron. Notes Discret. Math. András Frank
1999	B	`conf`	An Orientation Theorem with Parity Conditions. IPCO András Frank, Tibor Jordán, Zoltán Szigeti
1999	J	`jnl`	Connectivity augmentation of networks: structures and algorithms. Math. Program. András Frank
1999	J	`jnl`	Covering symmetric supermodular functions by graphs. Math. Program. András A. Benczúr, András Frank
1999	J	`jnl`	Directed vertex-connectivity augmentation. Math. Program. András Frank, Tibor Jordán
1999	J	`jnl`	Finding Minimum Generators of Path Systems'. J. Comb. Theory B András Frank
1999	J	`jnl`	Increasing the rooted-connectivity of a digraph by one. Math. Program. András Frank
1999	B	`conf`	Parity Constrained IPCO András Frank, Zoltán Király
1998	J	`jnl`	Minimum Multiway Cuts in Trees. Discret. Appl. Math. Péter L. Erdös, András Frank, László A. Székely
1998	J	`jnl`	Two Arc-Disjoint Paths in Eulerian Digraphs. SIAM J. Discret. Math. András Frank, Toshihide Ibaraki, Hiroshi Nagamochi
1997	—	`conf`	Finding minimum weighted generators of a path system. Contemporary Trends in Discrete Mathematics András Frank
1997	J	`jnl`	On Integer Multiflow Maximization. SIAM J. Discret. Math. András Frank, Alexander V. Karzanov, András Sebö
1995	J	`jnl`	A note on packing paths in planar graphs. Math. Program. András Frank, Zoltán Szigeti
1995	B	`conf`	How to Make a Strongly Connected Digraph Two-Connected. IPCO András Frank, Tibor Jordán
1995	J	`jnl`	Minimal Edge-Coverings of Pairs of Sets. J. Comb. Theory B András Frank, Tibor Jordán
1995	J	`jnl`	Preserving and Increasing Local Edge-Connectivity in Mixed Graphs. SIAM J. Discret. Math. Jørgen Bang-Jensen, András Frank, Bill Jackson
1995	B	`conf`	Two Arc Disjoint Paths in Eulerian Diagraphs. ISAAC András Frank, Toshihide Ibaraki, Hiroshi Nagamochi
1994	J	`jnl`	On Packing J. Comb. Theory B András Frank, Zoltán Szigeti
1993	J	`jnl`	Conservative weightings and ear-decompositions of graphs. Comb. András Frank
1993	J	`jnl`	On sparse subgraphs preserving connectivity properties. J. Graph Theory András Frank, Toshihide Ibaraki, Hiroshi Nagamochi
1993	J	`jnl`	Submodular functions in graph theory. Discret. Math. András Frank
1992	J	`jnl`	Algorithms for Routing around a Rectangle. Discret. Appl. Math. András Frank, Takao Nishizeki, Nobuji Saito, Hitoshi Suzuki, Éva Tardos
1992	J	`jnl`	Augmenting Graphs to Meet Edge-Connectivity Requirements. SIAM J. Discret. Math. András Frank
1992	J	`jnl`	Edge-disjoint circuits in graphs on the torus. J. Comb. Theory B András Frank, Alexander Schrijver
1992	B	`conf`	On Multiflow Problems. IPCO András Frank, Alexander V. Karzanov, András Sebö
1992	J	`jnl`	On a theorem of Mader. Discret. Math. András Frank
1991	—	`conf`	Tree-representation of directed circuits. Graph Structure Theory András Frank, Tibor Jordán
1990	A*	`conf`	Augmenting Graphs to Meet Edge-Connectivity Requirements FOCS András Frank
1990	B	`conf`	Conservative Weightings and Ear-Decompositions of Graphs. IPCO András Frank
1990	—	`conf`	On Disjoint Homotopic Paths in the Plane. Polyhedral Combinatorics András Frank
1990	J	`jnl`	On circuit decomposition of planar Eulerian graphs. J. Comb. Theory B Herbert Fleischner, András Frank
1990	J	`jnl`	Packing paths in planar graphs. Comb. András Frank
1990	—	`conf`	Vertex-Disjoint Simple Paths of Given Homotopy in a Planar Graph. Polyhedral Combinatorics András Frank, Alexander Schrijver
1988	J	`jnl`	Generalized polymatroids and submodular flows. Math. Program. András Frank, Éva Tardos
1987	J	`jnl`	An application of simultaneous Diophantine approximation in combinatorial optimization. Comb. András Frank, Éva Tardos
1985	J	`jnl`	A Primal-Dual Algorithm for Submodular Flows. Math. Oper. Res. William H. Cunningham, András Frank
1985	A*	`conf`	An Application of Simultaneous Approximation in Combinatorial Optimization FOCS András Frank, Éva Tardos
1985	J	`jnl`	Edge-disjoint paths in planar graphs. J. Comb. Theory B András Frank
1984	J	`jnl`	Finding feasible vectors of Edmonds-Giles polyhedra. J. Comb. Theory B András Frank
1982	J	`jnl`	A note on k-strongly connected orientations of an undirected graph. Discret. Math. András Frank
1982	J	`jnl`	Disjoint paths in a rectilinear grid. Comb. András Frank
1981	J	`jnl`	A Weighted Matroid Intersection Algorithm. J. Algorithms András Frank
1981	J	`jnl`	How to make a digraph strongly connected. Comb. András Frank
1980	J	`jnl`	On chain and antichain families of a partially ordered set. J. Comb. Theory B András Frank
1980	J	`jnl`	On the orientation of graphs. J. Comb. Theory B András Frank
1977	J	`jnl`	On a class of balanced hypergraphs. Discret. Math. András Frank