discrete/combinatorial optimization - graph theory - submodular functions - matroid theory - polynomial algorithms
research field in which current research is conducted
mathematics and computing
Publications
2022
from data base, 2023. V. 25.
Frank Andras, Murota Kazuo: Decreasing minimization on M-convex sets: algorithms and applications, MATHEMATICAL PROGRAMMING 195: (1-2) pp. 1027-1068. type of document: Journal paper/Article number of independent citations: 1 language: English URL
2022
from data base, 2023. V. 25.
Frank András, Murota Kazuo: Decreasing minimization on M-convex sets: background and structures, MATHEMATICAL PROGRAMMING 195: pp. 977-1025. type of document: Journal paper/Article number of independent citations: 2 language: English URL
2022
from data base, 2023. V. 25.
Frank Andras, Murota Kazuo: Fair integral submodular flows, DISCRETE APPLIED MATHEMATICS 320: pp. 416-434. type of document: Journal paper/Article language: English URL
2022
from data base, 2023. V. 25.
András Frank, Kazuo Murota: A Discrete Convex Min-Max Formula for Box-TDI Polyhedra, MATHEMATICS OF OPERATIONS RESEARCH 47: (2) pp. 1026-1047. type of document: Journal paper/Article number of independent citations: 1 language: English URL
2021
from data base, 2023. V. 25.
Frank Andras, Hajdu Gergely: A simple algorithm and min-max formula for the inverse arborescence problem, DISCRETE APPLIED MATHEMATICS 295: pp. 85-93. type of document: Journal paper/Article number of independent citations: 1 language: English URL
2021
from data base, 2023. V. 25.
Frank András, Kazuo Murota: Decreasing Minimization on M-convex Sets:Background and Structures, type of document: language: English
2018
from data base, 2023. V. 25.
Bérczi Kristóf, Frank András: Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings, MATHEMATICS OF OPERATIONS RESEARCH 43: (3) pp. 726-753. type of document: Journal paper/Article number of independent citations: 4 language: English URL
2003
from data base, 2023. V. 25.
Frank András, Király Tamás, Kriesell M: On decomposing a hypergraph into k connected sub-hypergraphs, DISCRETE APPLIED MATHEMATICS 131: (2) pp. 373-383. type of document: Journal paper/Article number of independent citations: 92 language: English URL
2003
from data base, 2023. V. 25.
Frank A: Restricted t-matchings in bipartite graphs, DISCRETE APPLIED MATHEMATICS 131: (2) pp. 337-346. type of document: Journal paper/Article number of independent citations: 23 language: English URL
1995
from data base, 2023. V. 25.
Frank A, Jordán T: Minimal edge-coverings of pairs of sets, JOURNAL OF COMBINATORIAL THEORY SERIES B 65: (1) pp. 73-110. type of document: Journal paper/Article number of independent citations: 107 language: English URL
Number of independent citations to these publications:
number of independent citations to scientific publications and creative works:
The number of citations displayed after clicking on the link may differ from the displayed number because the former displays the current state of MTMT2 and the latter was the case when importing science metrics.