Details
Title
THL2
Formal Name (French)
Laboratoire de théorie du calcul 2
Formal Name (English)
Theory of Computation Laboratory 2
Lab Manager
Svensson, Ola Nils Anders
Group ID
U12629
Affiliated authors
An, Hyung Chan
Bamas, Etienne
Bazzi, Abbas
Chen, Yu
Chiplunkar, Ashish Hari
Drygala, Marina
Feldman, Moran
Gamlath, Buddhima
Garg, Paritosh
Jia, Xinrui
Kalaitzis, Christos
Kale, Sagar Sudhir
Maggiori, Andreas
Mazzali, Davide
Nagarajan, Sai Ganesh
Newman, Alantha Landess
Nguyen, Viet Hang
Norouzi Fard, Ashkan
Risse, Kilian
Rohwedder, Lars
Schneeberger, Chantal
Stouras, Miltiadis
Svensson, Ola Nils Anders
Tarnawski, Jakub
Thiery, Théophile François
Vintan, Radu
Vogl, Lukas
Ward, Justin Dean
Yuan, Weiqiang
Bamas, Etienne
Bazzi, Abbas
Chen, Yu
Chiplunkar, Ashish Hari
Drygala, Marina
Feldman, Moran
Gamlath, Buddhima
Garg, Paritosh
Jia, Xinrui
Kalaitzis, Christos
Kale, Sagar Sudhir
Maggiori, Andreas
Mazzali, Davide
Nagarajan, Sai Ganesh
Newman, Alantha Landess
Nguyen, Viet Hang
Norouzi Fard, Ashkan
Risse, Kilian
Rohwedder, Lars
Schneeberger, Chantal
Stouras, Miltiadis
Svensson, Ola Nils Anders
Tarnawski, Jakub
Thiery, Théophile François
Vintan, Radu
Vogl, Lukas
Ward, Justin Dean
Yuan, Weiqiang
Institute
IINFCOM
Faculty
IC
Note
Members of THL2-unit
Linked resource
http://theory.epfl.ch/
Publications
Centrality of trees for capacitated -center
Combinatorial Algorithm for Restricted Max-Min Fair Allocation
Combinatorial Algorithm for Restricted Max-Min Fair Allocation
Fair Colorful k-Center Clustering
Fair colorful k-center clustering
Local Approximation of the Maximum Cut in Regular Graphs
On the configuration LP for maximum budgeted allocation
Online Matching with General Arrivals
Optimal Software Patching Plan for PMUs
Strong LP formulations for scheduling splittable jobs on unrelated machines
See complete list of publications (134)
Combinatorial Algorithm for Restricted Max-Min Fair Allocation
Combinatorial Algorithm for Restricted Max-Min Fair Allocation
Fair Colorful k-Center Clustering
Fair colorful k-center clustering
Local Approximation of the Maximum Cut in Regular Graphs
On the configuration LP for maximum budgeted allocation
Online Matching with General Arrivals
Optimal Software Patching Plan for PMUs
Strong LP formulations for scheduling splittable jobs on unrelated machines
See complete list of publications (134)
Record appears in
Authorities > Lab