First year PhD student and Teaching Assistant at IRIF, in Université Paris-Cité. I am fortunate to have Claire Mathieu and Vincent Cohen-Addad as my advisors.
My research interests include Game Theory, Algorithmics, and Combinatorial Optimization. I am currently working on approximation algorithms for clustering.
My resume.
Contact information:
| Email: ernest(dot)vanwijland(at)irif(dot)fr |
Research Interests
My research hovers around the design of algorithms for optimization problems motivated by real-life applications or that arise in the machine learning context. I am currently working on clustering problems such as k-Means and k-Median, and on routing problems like Vehicle Routing and Multiple-Level Aggregation. I am especially interested in leveraging the geometric properties of the Euclidean space in the context of those problems. Previously, I have also worked on Fair Division and 2-WECSS.
Publications (Google Scholar)
- An Improved Greedy Approximation for (Metric) k-Means, Charikar, Cohen-Addad, Gao, Grandoni, Lee, Van Wijland, Preprint
- Faster Approximation Scheme for Euclidean k-TSP, Van Wijland, Zhou, SOCG 2024
- Maximizing Nash Social Welfare in 2-Value Instances, Akrami, Chaudhury, Hoefer, Mehlhorn, Schmalhofer, Shahkarami, Varricchio, Vermande, Van Wijland, MOR 2023, AAAI 2022
Teaching
- Currently teaching assistant for the second semester of Bachelor course "Computer Science Concepts" at Université Paris-Cité.
- Previously teaching assistant for the "Introduction to Python" and "Programming Project" courses.