Details
Title
DISOPT
Formal Name (French)
Chaire d'optimisation discrète
Formal Name (English)
Chair of Discrete Optimization
Lab Manager
Eisenbrand, Friedrich
Group ID
U11879
Affiliated authors
Annamalai, Chidambaram
Aprile, Manuel Francesco
Bach, Eleonore
Balestra, Alexandra
Bataillard, Pauline
Blanc, Jocelyne
Bock, Adrian Aloysius
Bonifas, Nicolas
Cevallos Manzano, Alfonso Bolívar
Cslovjecsek, Jana Tabea
Di Summa, Marco
Eisenbrand, Friedrich
Faenza, Yuri
Farczadi, Linda
Gallato, Martina
Haeberle, Matthieu Nicolas
Hunkenschröder, Christoph
Hähnle, Nicolai
Karaskova, Natalia
Klein, Kim-Manuel
Lassota, Alexandra Anna
Loho, Georg Peter
Malinovic, Igor
Meyland, Natacha
Moldenhauer, Carsten
Niemeier, Martin
Polak, Adam Teodor
Pritchard, David
Racine, Jonas
Rothvoss, Thomas
Sanità, Laura
Schymura, Matthias
Singer, Neta
Stauffer, Gautier
Tiwary, Hans Raj
Venzin, Moritz Andreas
Vogl, Lukas
Zemel, Yoav
Aprile, Manuel Francesco
Bach, Eleonore
Balestra, Alexandra
Bataillard, Pauline
Blanc, Jocelyne
Bock, Adrian Aloysius
Bonifas, Nicolas
Cevallos Manzano, Alfonso Bolívar
Cslovjecsek, Jana Tabea
Di Summa, Marco
Eisenbrand, Friedrich
Faenza, Yuri
Farczadi, Linda
Gallato, Martina
Haeberle, Matthieu Nicolas
Hunkenschröder, Christoph
Hähnle, Nicolai
Karaskova, Natalia
Klein, Kim-Manuel
Lassota, Alexandra Anna
Loho, Georg Peter
Malinovic, Igor
Meyland, Natacha
Moldenhauer, Carsten
Niemeier, Martin
Polak, Adam Teodor
Pritchard, David
Racine, Jonas
Rothvoss, Thomas
Sanità, Laura
Schymura, Matthias
Singer, Neta
Stauffer, Gautier
Tiwary, Hans Raj
Venzin, Moritz Andreas
Vogl, Lukas
Zemel, Yoav
Institute
MATH
Faculty
SB
Note
Members of UPEISEN-unit
Linked resource
http://disopt.epfl.ch/
Publications
An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
Combinatorial Algorithm for Restricted Max-Min Fair Allocation
Fast Computation of Small Cuts via Cycle Space Sampling
Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds
Nearly-Tight and Oblivious Algorithms for Explainable Clustering
New Algorithms for Approximate Nash Equilibria in Bimatrix Games
New Hardness Results for Diophantine Approximation
On Sub-determinants and the Diameter of Polyhedra
On the Complexity of the Asymmetric VPN Problem
k-Edge-Connectivity: Approximation and LP Relaxation
See complete list of publications (181)
Combinatorial Algorithm for Restricted Max-Min Fair Allocation
Fast Computation of Small Cuts via Cycle Space Sampling
Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds
Nearly-Tight and Oblivious Algorithms for Explainable Clustering
New Algorithms for Approximate Nash Equilibria in Bimatrix Games
New Hardness Results for Diophantine Approximation
On Sub-determinants and the Diameter of Polyhedra
On the Complexity of the Asymmetric VPN Problem
k-Edge-Connectivity: Approximation and LP Relaxation
See complete list of publications (181)
Record appears in
Authorities > Lab