PhD Student
EPFL SB MATH AA
MA B1 533
Station 8
CH-1015 Lausanne
Phone: +41 21 693 2739
Fax: +41 21 693 5840
Email: adrianaloysius.lastname [at] epfl [dot] ch
Biography
2004: | Abitur from Geschwister-Scholl-Gymnasium, Lebach |
2004-2006: | Student at Saarland University |
2006-2010: | Student at Bonn University, Diplom in mathematics |
since 2010: | PhD student at EPFL |
Teaching
Fall 2013 | Lineare Algebra (main assistant), master project on Orienteering with deadlines |
Spring 2013 | Optimisation discrète (main assistant), semester project on time tabling (ctd.) |
Fall 2012 | Algèbre linéaire pour GC, MX (main assistant), semester project on time tabling |
Spring 2012: | Algorithmic (real-) algebraic geometry (at TU Berlin) |
Fall 2011: | Combinatorial Optimization (main assistant), semester project on real root finding |
Spring 2011: | Optimisation discrète (main assistant), semester project on Support Vector Machines |
Fall 2010: | Algèbre linéaire pour GC, SIE (assistant) |
Spring 2010: | Algèbre linéaire II pour mathématiciens (assistant), Discrete Optimization (assistant) |
Publications
Warning
Please note that the publication lists from Infoscience integrated into the EPFL website, lab or people pages are frozen following the launch of the new version of platform. The owners of these pages are invited to recreate their publication list from Infoscience. For any assistance, please consult the Infoscience help or contact support.
Solving the stable set problem in terms of the odd cycle packing number
2014. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, India International Centre, New Delhi, December 15–17, 2014.Approximation algorithms for regret minimization in vehicle routing problems
Lausanne, EPFL, 2014.Finding small stabilizers for unstable graphs
2014. Integer Programming and Combinatorial Optimization (IPCO), Bonn, Germany, June 2014.On the approximability of two capacitated vehicle routing problems
2013. International Network Optimization Conference (INOC), Tenerife, Spain, May 20-22, 2013. p. 519-526. DOI : 10.1016/j.endm.2013.05.133.The School Bus Problem on Trees
Algorithmica. 2013. Vol. 67, num. 1, p. 49-64. DOI : 10.1007/s00453-012-9711-x.The School Bus Problem on Trees
2011. 22nd International Symposium on Algorithms and Computation (ISAAC 2011), Yokohama, Japan, December 5-8, 2011. p. 10-19. DOI : 10.1007/978-3-642-25591-5_3.Preprints
- Capacitated Orienteering. To appear in Discrete Applied Mathematics
(together with L. Sanità)
- Approximating stable set in terms of the odd cycle packing number. submitted
(together with Y. Faenza, C. Moldenhauer and A. J. Ruiz Vargas)