World's Best Scientists 2026 revealed!

D-Index & Metrics

Mathematics

D-Index
35
Citations
5064
World Ranking
2781
National Ranking
17

Overview

András Frank is affiliated with Eötvös Loránd University in Hungary and works primarily in the field of Computer Science. Their research focuses on Computational Theory and Mathematics, with substantial contributions to related subfields including Computer Graphics and Computer-Aided Design, Computer Networks and Communications, Discrete Mathematics and Combinatorics, and Numerical Analysis.

The scientist's main topics of work reflect a strong emphasis on graph theory and combinatorial mathematics, including:

  • Advanced Graph Theory Research
  • Complexity and Algorithms in Graphs
  • Computational Geometry and Mesh Generation
  • Optimization and Search Problems
  • Advanced Combinatorial Mathematics
  • Advanced Optimization Algorithms Research
  • Graph theory and applications

Frequent publication venues where the scientist has contributed include:

  • arXiv (Cornell University)
  • Mathematical Programming
  • Mathematics of Operations Research
  • Discrete Applied Mathematics
  • Japan Journal of Industrial and Applied Mathematics

Notable recent papers by András Frank published mainly in 2021 and 2022 are:

  • Decreasing minimization on M-convex sets: background and structures, 2021, Mathematical Programming
  • A Discrete Convex Min-Max Formula for Box-TDI Polyhedra, 2021, Mathematics of Operations Research
  • Decreasing minimization on M-convex sets: algorithms and applications, 2021, Mathematical Programming
  • Fair integral submodular flows, 2022, Discrete Applied Mathematics
  • A simple algorithm and min-max formula for the inverse arborescence problem, 2021, Discrete Applied Mathematics

The scientist collaborates with several frequent co-authors, including:

  • Kazuo Murota
  • Erika R. Bérczi-Kovács
  • Gergely Hajdu
  • Tamás Fleiner
  • Tamás Király

Best Publications

  • Augmenting graphs to meet edge-connectivity requirements

    András Frank

  • An application of simultaneous Diophantine approximation in combinatorial optimization

    A. Frank;Éva Tardos

  • Connections in Combinatorial Optimization

    András Frank

  • Generalized polymatroids and submodular flows

    A. Frank;É. Tardoes

  • An Algorithm for Submodular Functions on Graphs

    András Frank

  • A weighted matroid intersection algorithm

    András Frank

  • On Kuhn's Hungarian Method—A tribute from Hungary

    András Frank

  • SOME POLYNOMIAL ALGORITHMS FOR CERTAIN GRAPHS AND HYPERGRAPHS.

    A Frank

  • An application of submodular flows

    András Frank;Éva Tardos

  • On decomposing a hypergraph into k connected sub-hypergraphs

    András Frank;Tamás Király;Matthias Kriesell

  • On chain and antichain families of a partially ordered set

    András Frank

  • Disjoint paths in a rectilinear grid

    András Frank

  • Edge-disjoint paths in planar graphs

    András Frank

  • On the orientation of graphs

    András Frank

  • Minimal Edge-Coverings of Pairs of Sets

    A. Frank;T. Jordan

  • Connectivity and network flows

    András Frank

  • Preserving and Increasing Local Edge-Connectivity in Mixed Graphs

    Jorgen Bang-Jensen;Andras Frank;Bill Jackson

  • On the orientation of graphs and hypergraphs

    András Frank;Tamás Király;Zoltán Király

  • Algorithms for routing around a rectangle

    András Frank;Takao Nishizeki;Nobuji Saito;Hitoshi Suzuki

  • A Primal-Dual Algorithm for Submodular Flows

    William H. Cunningham;András Frank

Frequent Co-Authors

Éva Tardos
Éva Tardos Cornell University
Kazuo Murota
Kazuo Murota Tokyo Metropolitan University
Toshihide Ibaraki
Toshihide Ibaraki Kyoto College of Graduate Studies for Informatics
Hiroshi Nagamochi
Hiroshi Nagamochi Kyoto University
Naoki Katoh
Naoki Katoh University of Hyogo
Satoru Fujishige
Satoru Fujishige Kyoto University
Takao Nishizeki
Takao Nishizeki Tohoku University
David F. Manlove
David F. Manlove University of Glasgow
Günter Rote
Günter Rote Freie Universität Berlin
Monique Laurent
Monique Laurent Centrum Wiskunde & Informatica

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students studying Mathematics in the USA, exploring online degrees related to math can open diverse career opportunities. A masters in digital marketing is a great option for those interested in applying analytical and quantitative skills to market trends and consumer data.

Many professionals also consider an one year MBA program to quickly gain leadership and business expertise. This accelerated path is ideal for mathematicians aiming to move into management roles without a lengthy study commitment.

Additionally, if you have prior credits, exploring the MBA transfer credits options can make pursuing a business degree more flexible and cost-effective.

Lastly, a data analytics masters degree aligns closely with mathematics, opening doors to high-demand jobs in data science, statistics, and decision-making roles across various industries.

Best Scientists Citing András Frank

Trending Scientists

Recently Published Articles