Dr. Linda Farczadi

Postdoctoral Researcher

 

EPFL SB MATH AA
MA C1 563
Station 8
CH-1015 Lausanne
Phone: +41 21 693 5671
Email: linda.farczadi [at] epfl [dot] ch

CV

Research Interests

  • algorithmic game theory
  • combinatorial optimization
  • approximation algorithms

Education

 
Ph.D. in Combinatorics and Optimization, 2015 
University of Waterloo, Waterloo, ON, Canada
Advisor: Jochen Koenemann
Thesis title: Matchings and games on networks
 
M.Sc. in Computer Science, 2011 
McGill University, Montreal, QC, Canada
Advisor: Luc Devroye
Thesis title: Connectivity for line-of-sight networks in higher dimensions
 
B.Sc. in Mathematics and Engineering, 2009 
Queens University, Kingston, ON, Canada
Program: Mathematics and Engineering

Publications

 
[1] The weighted stable matching problem.
MATCHUP 2017.
L. Farczadi, N. Guričanová.
 
[2] Stable marriage with general preferences.
SAGT 2014.
L. Farczadi, K. Georgiou, J. Koenemann.
 
[3] Network bargaining with general capacities.
ESA 2013.
L. Farczadi, K. Georgiou, J. Koenemann.
 
[4] On longest paths and diameter in random apollonian networks.
Random Struct. Algorithms, 2014.
E. Ehsan, L. Farczadi, P. Gao, A. Mehrabian, C.M. Sato, N. Wormald, J. Zung.
 
[5] Connectivity for line-of-sight networks in higher dimensions.
Discrete Mathematics & Theoretical Computer Science, 2013.
L. Devroye, L. Farczadi.