Guests
-
David Steurer, Cornell University (Ithaca, NY, USA) and Institute of Advanced Study (Princeton, NJ, USA), Jan 11 – Jan 14. Host: E. Welzl.
Efficient algorithms for tensor decomposition and their applications (Mittagsseminar, Jan 12).
-
Ioannis Emiris, University of Athens (Athens, Greece), Feb 6 – Feb 12. Host: B. Gärtner.
Dimensionality reduction for search in general dimension (Mittagsseminar, Feb 10).
-
Penny Haxell, University of Waterloo (ON, Canada), Feb 20 – Feb 26. Host: E. Welzl.
Stability for matchings in regular hypergraphs (Mittagsseminar, Feb 23).
-
Anastasia Moskovaya, EPFL (Lausanne, Switzerland).
Different Tree Packing Conjectures
(Mini-Symposium on Combinatorial Algorithms, Feb 24).
-
Kilian Risse, ETH Zürich.
Finding the Sink of a USO with a Hamming Ball
(Mini-Symposium on Combinatorial Algorithms, Feb 24).
-
Guido Brückner, Karlsruhe Institute of Technology (Karlsruhe, Germany).
Partial and Constrained Level Planarity
(Mini-Symposium on Combinatorial Algorithms, Feb 24).
-
Gábor Damásdi, ELTE (Budapest, Hungary).
Algorithmic Proof for the Existence of Six-way Equipartitions
(Mini-Symposium on Combinatorial Algorithms, Feb 24).
-
Torsten Mütze, TU Berlin (Germany), Mar 20 – Mar 24. Host: E. Welzl.
Trimming and gluing Gray codes (Mittagsseminar, Mar 21).
-
Kenneth Clarkson, IBM Almaden Research Center (San Jose, CA, USA), May 1 – May 3. Host: B. Gärtner.
Low-rank PSD Approximation in Input-Sparsity Time (Mittagsseminar, May 2).
-
Radoslav Fulek,
IST Austria (Klosterneuburg, Austria), Jun 12 – Jun 16. Host: E. Welzl.
A Picture-Hanging Puzzle (Combinatorial Algorithms day, Jun 12).
-
Tillmann Miltzow,
UL Bruxelles (Belgium), Jun 12 – Jun 16. Host: E. Welzl.
The Art Gallery Problem is ∃R-complete (Combinatorial Algorithms day, Jun 12).
-
Yoshio Okamoto, UEC Tokyo (Japan), Jun 12 – Jun 16. Host: E. Welzl.
Tight Approximability of the Server Allocation Problem for Real-Time Applications (Combinatorial Algorithms day, Jun 12).
-
Bettina Speckmann, TU Eindhoven (Netherlands), Jun 12 – Jun 16. Host: E. Welzl.
Computing Representative Networks for Braided Rivers (Combinatorial Algorithms day, Jun 12).
-
Csaba Dávid Tóth, CSU Northridge (CA, USA), Jun 12 – Jun 16. Host: E. Welzl.
Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs (Combinatorial Algorithms day, Jun 12).
-
Miloš Stojaković, University of Novi Sad (Serbia), Jun 12 – Jun 16. Host: E. Welzl.
Making Hamiltonian cycles on small graphs (Combinatorial Algorithms day, Jun 12).
-
Jean Cardinal, UL Bruxelles (Belgium), Jun 12 – Jun 16. Host: E. Welzl.
-
Dániel Korándi, EPFL (Lausanne, Switzerland), Jun 12 – Jun 16. Host: E. Welzl.
-
Andrey Kupavskii, EPFL (Lausanne, Switzerland), Jun 12 – Jun 16. Host: E. Welzl.
-
Dominik Scheder, Shanghai Jiaotong University (Shanghai, China), Jun 12 – Jun 16. Host: E. Welzl.
