András Frank is a Hungarian mathematician

Mathematician

A mathematician is a person whose primary area of study is the field of mathematics. Mathematicians are concerned with quantity, structure, space, and change....

, working in combinatorics

Combinatorics

Combinatorics is a branch of mathematics concerning the study of finite or countable discrete structures. Aspects of combinatorics include counting the structures of a given kind and size , deciding when certain criteria can be met, and constructing and analyzing objects meeting the criteria ,...

, especially in graph theory

Graph theory

In mathematics and computer science, graph theory is the study of graphs, mathematical structures used to model pairwise relations between objects from a certain collection. A "graph" in this context refers to a collection of vertices or 'nodes' and a collection of edges that connect pairs of...

, and combinatorial optimisation. He is director of the Institute of Mathematics of the Eötvös Loránd University, Budapest

Budapest

Budapest is the capital of Hungary. As the largest city of Hungary, it is the country's principal political, cultural, commercial, industrial, and transportation centre. In 2011, Budapest had 1,733,685 inhabitants, down from its 1989 peak of 2,113,645 due to suburbanization. The Budapest Commuter...

.

Mathematical work

Using the LLL-algorithm

Lenstra–Lenstra–Lovász lattice basis reduction algorithm

The LLL-reduction algorithm is a polynomial time lattice reduction algorithm invented by Arjen Lenstra, Hendrik Lenstra and László Lovász in 1982, see...

, Frank, and his student, Éva Tardos

Éva Tardos

Éva Tardos is a Hungarian mathematician, winner of the Fulkerson Prize , and professor of Computer Science at Cornell University.Research Interests:...

 developed a general method, which could transform some polynomial time algorithms into strongly polynomial. He solved the problem of finding the minimum number of edges to be added to a given undirected graph so that in the resulting graph the edge-connectivity between any two vertices u and v is at least a predetermined number f(u,v).

Degrees, awards

He received the Candidate of Mathematical Science degree in 1980, advisor: László Lovász

László Lovász

László Lovász is a Hungarian mathematician, best known for his work in combinatorics, for which he was awarded the Wolf Prize and the Knuth Prize in 1999, and the Kyoto Prize in 2010....

, and the Doctor of Mathematical Science degree (1990) from the Hungarian Academy of Sciences

Hungarian Academy of Sciences

The Hungarian Academy of Sciences is the most important and prestigious learned society of Hungary. Its seat is at the bank of the Danube in Budapest.-History:...

. He was awarded the Tibor Szele

Tibor Szele

Tibor Szele Hungarian mathematician, working in combinatorics and abstract algebra. After graduating at the Debrecen University, he became a researcher at the Szeged University in 1946, then he went back at the Debrecen University in 1948 where he became full professor in 1952...

 Prize of the János Bolyai Mathematical Society

János Bolyai Mathematical Society

The János Bolyai Mathematical Society is the Hungarian mathematical society, named after János Bolyai, a 19th century Hungarian mathematician, a co-discoverer of non-Euclidean geometry. It is the professional society of the Hungarian mathematicians, applied mathematicians, and mathematics teachers...

 in 2002 and the Albert Szent-Györgyi

Albert Szent-Györgyi

Albert Szent-Györgyi de Nagyrápolt was a Hungarian physiologist who won the Nobel Prize in Physiology or Medicine in 1937. He is credited with discovering vitamin C and the components and reactions of the citric acid cycle...

 Prize in 2009. In June 2009 the ELTE Mathematical Institute sponsored a workshop in honor of his 60th birthday.

External links