J u m p t o c o n t e n t
M a i n m e n u
M a i n m e n u
N a v i g a t i o n
● M a i n p a g e ● C o n t e n t s ● C u r r e n t e v e n t s ● R a n d o m a r t i c l e ● A b o u t W i k i p e d i a ● C o n t a c t u s ● D o n a t e
C o n t r i b u t e
● H e l p ● L e a r n t o e d i t ● C o m m u n i t y p o r t a l ● R e c e n t c h a n g e s ● U p l o a d f i l e
S e a r c h
Search
A p p e a r a n c e
● C r e a t e a c c o u n t ● L o g i n
P e r s o n a l t o o l s
● C r e a t e a c c o u n t ● L o g i n
P a g e s f o r l o g g e d o u t e d i t o r s l e a r n m o r e ● C o n t r i b u t i o n s ● T a l k
( T o p )
1 M a t h e m a t i c a l w o r k
2 D e g r e e s , a w a r d s
3 R e f e r e n c e s
4 E x t e r n a l l i n k s
T o g g l e t h e t a b l e o f c o n t e n t s
A n d r á s F r a n k
6 l a n g u a g e s
● ا ل ع ر ب ي ة ● D e u t s c h ● E s p e r a n t o ● M a g y a r ● م ص ر ى ● P o r t u g u ê s
E d i t l i n k s
● A r t i c l e ● T a l k
E n g l i s h
● R e a d ● E d i t ● V i e w h i s t o r y
T o o l s
T o o l s
A c t i o n s
● R e a d ● E d i t ● V i e w h i s t o r y
G e n e r a l
● W h a t l i n k s h e r e ● R e l a t e d c h a n g e s ● U p l o a d f i l e ● S p e c i a l p a g e s ● P e r m a n e n t l i n k ● P a g e i n f o r m a t i o n ● C i t e t h i s p a g e ● G e t s h o r t e n e d U R L ● D o w n l o a d Q R c o d e ● W i k i d a t a i t e m
P r i n t / e x p o r t
● D o w n l o a d a s P D F ● P r i n t a b l e v e r s i o n
A p p e a r a n c e
F r o m W i k i p e d i a , t h e f r e e e n c y c l o p e d i a
András Frank (born 3 June 1949) is a Hungarian mathematician , working in combinatorics , especially in graph theory , and combinatorial optimisation . He is director of the Institute of Mathematics of the Faculty of Sciences of the Eötvös Loránd University , Budapest .
Mathematical work [ edit ]
Using the LLL-algorithm , Frank, and his student, Éva Tardos developed a general method, which could transform some polynomial-time algorithms into strong polynomial.[1] u v f u v [2]
Degrees, awards [ edit ]
He received the Candidate of Mathematical Science degree in 1980, advisor: László Lovász ,[3] Hungarian Academy of Sciences . In 1998 he was an Invited Speaker of the International Congress of Mathematicians in Berlin.[4] Tibor Szele Prize of the János Bolyai Mathematical Society in 2002[5] Albert Szent-Györgyi Prize in 2009.[6] [6] [7]
References [ edit ]
^ Frank, András; Tardos, Éva (1987), "An application of simultaneous diophantine approximation in combinatorial optimization", Combinatorica , 7 1 ): 49–65, doi :10.1007/BF02579200 , S2CID 45585308
^ Frank, András (1992), "Augmenting graphs to meet edge-connectivity requirements" (PDF) , SIAM Journal on Discrete Mathematics 5 1 ): 25–53, doi :10.1137/0405003
^ András Frank at the Mathematics Genealogy Project .
^ Frank, András (1998). "Applications of relaxed submodularity" . Doc. Math. (Bielefeld) Extra Vol. ICM Berlin, 1998, vol. III . pp. 343–354.
^ Szele Tibor Emlékérem (in Hungarian). János Bolyai Mathematical Society , retrieved 2010-01-21.
^ a b News about mathematics , Eötvös Loránd University, Faculty of Science, Institute of Mathematics, retrieved 2010-01-21.
^ Frank András 60. születésnapja alkalmából Archived 2011-07-21 at the Wayback Machine (in Hungarian), retrieved 2010-01-21.
External links [ edit ]
International
National
Academics
Other
t
e
t
e
R e t r i e v e d f r o m " https://en.wikipedia.org/w/index.php?title=András_Frank&oldid=1225127060 " C a t e g o r i e s : ● 1 9 4 9 b i r t h s ● L i v i n g p e o p l e ● M a t h e m a t i c i a n s f r o m B u d a p e s t ● U n i v e r s i t y o f S z e g e d a l u m n i ● C o m b i n a t o r i a l i s t s ● A c a d e m i c s t a f f o f E ö t v ö s L o r á n d U n i v e r s i t y ● H u n g a r i a n s c i e n t i s t s t u b s ● E u r o p e a n m a t h e m a t i c i a n s t u b s H i d d e n c a t e g o r i e s : ● W e b a r c h i v e t e m p l a t e w a y b a c k l i n k s ● A r t i c l e s w i t h s h o r t d e s c r i p t i o n ● S h o r t d e s c r i p t i o n m a t c h e s W i k i d a t a ● A r t i c l e s w i t h h C a r d s ● A r t i c l e s w i t h I S N I i d e n t i f i e r s ● A r t i c l e s w i t h V I A F i d e n t i f i e r s ● A r t i c l e s w i t h W o r l d C a t E n t i t i e s i d e n t i f i e r s ● A r t i c l e s w i t h B I B S Y S i d e n t i f i e r s ● A r t i c l e s w i t h G N D i d e n t i f i e r s ● A r t i c l e s w i t h J 9 U i d e n t i f i e r s ● A r t i c l e s w i t h L C C N i d e n t i f i e r s ● A r t i c l e s w i t h N K C i d e n t i f i e r s ● A r t i c l e s w i t h D B L P i d e n t i f i e r s ● A r t i c l e s w i t h M A T H S N i d e n t i f i e r s ● A r t i c l e s w i t h M G P i d e n t i f i e r s ● A r t i c l e s w i t h O R C I D i d e n t i f i e r s ● A r t i c l e s w i t h P u b l o n s i d e n t i f i e r s ● A r t i c l e s w i t h R I D i d e n t i f i e r s ● A r t i c l e s w i t h Z B M A T H i d e n t i f i e r s ● A r t i c l e s w i t h S U D O C i d e n t i f i e r s ● A l l s t u b a r t i c l e s
● T h i s p a g e w a s l a s t e d i t e d o n 2 2 M a y 2 0 2 4 , a t 1 4 : 5 0 ( U T C ) . ● T e x t i s a v a i l a b l e u n d e r t h e C r e a t i v e C o m m o n s A t t r i b u t i o n - S h a r e A l i k e L i c e n s e 4 . 0 ;
a d d i t i o n a l t e r m s m a y a p p l y . B y u s i n g t h i s s i t e , y o u a g r e e t o t h e T e r m s o f U s e a n d P r i v a c y P o l i c y . W i k i p e d i a ® i s a r e g i s t e r e d t r a d e m a r k o f t h e W i k i m e d i a F o u n d a t i o n , I n c . , a n o n - p r o f i t o r g a n i z a t i o n . ● P r i v a c y p o l i c y ● A b o u t W i k i p e d i a ● D i s c l a i m e r s ● C o n t a c t W i k i p e d i a ● C o d e o f C o n d u c t ● D e v e l o p e r s ● S t a t i s t i c s ● C o o k i e s t a t e m e n t ● M o b i l e v i e w
Hungary
