- 10 May 2019 12:30pm. Jannik Matuschke.

Maintaining Perfect Matchings at Low Cost. - 2 May 2019 12:30pm. Manuel Aprile.

Extended formulations from communication protocols in output-efficient time. - 24 April 2019 12:30pm. Seungbum Jo.

Encoding Two-Dimensional Range Top-k Queries Revisited. - 28 March 2019 12:30pm. Alfio Giarlotta.

Universal Semiorders. - 27 March 2019 12:30pm. Tom Kelly.

Fractional coloring with local demands. - 1 March 2019 12:30pm. Jean-Paul Doignon.

From Italian menus to resolutions of convex geometries. - 1 February 2019 12:30pm. Vissarion Fisikopoulos.

Volume estimation by a new annealing schedule for cooling convex bodies. - 16 January 2019 12:30pm. Samuel Fiorini.

Computing a maximum independent set in a graph embedded in a fixed surface when the odd cycle packing number is bounded. - 21 November 2018 12:30pm. Keno Merckx.

Finding a Maximum-Weight Convex Set in a Chordal Graph. - 14 November 2018 12:30pm. Natalia Garcia Colin.

TBA. - 7 November 2018 12:30pm. Jean Cardinal.

Hypergraphic polytopes and flip graphs. - 24 October 2018 12:30pm. Gabriela Araujo.

The cage problem. - 17 October 2018 12:30pm. Till Miltzow.

Smoothed Analysis of the Art Gallery Problem. - 10 October 2018 12:30pm. Yelena Yuditsky.

Almost all string graphs are intersection graphs of plane convex sets. - 3 October 2018 12:30pm. Ben Karsin.

Designing efficient algorithms for modern GPU architectures. - 29 August 2018 12:30pm. Bartosz Walczak.

Sparse Kneser graphs are hamiltonian. - 24 July 2018 12:30pm. Aurélien Ooms.

Data Structures Lower Bounds. - 11 July 2018 12:30pm. John Iacono.

Dynamic Trees with Almost-Optimal Access Cost. - 4 July 2018 12:30pm. Konstantinos A. Tsakalidis.

Orthogonal Point Location and Rectangle Stabbing Queries in 3-d. - 27th June 2018 12:30pm. Nodari Sitchinava.

Sorting in the Asymmetric External Memory Model. - 30 May 2018 12:30pm. Michal Seweryn.

Dimension of posets whose cover graphs exclude some minor. - 8 May 2018 12:30pm. Laurent Beaudou.

Homomorphism bounds for K4-minor-free graphs. - 25 Apr. 2018 12:30pm. Torsten Ueckerdt.

Crossing Numbers. - 11 Apr. 2018 12:00pm. Sander Gribling.

Quantum SDP-Solvers: Better upper bounds. - 28 Mar. 2018 12:30pm. Varunkumar Jayapaul.

Sorting and selection in restricted models. - 21 Mar. 2018 12:30pm. Krystal Guo.

Inverses of Trees. - 13 Mar. 2018 12:30pm. Ahmad Abdi.

Cuboids, a class of clutters. - 7 Mar. 2018 11:00am. Tony Huynh.

Short Rainbow Cycles in Sparse Graphs. - 28 Feb. 2018 12:30pm. Mikkel Abrahamsen.

Fast Fencing. - 21 Feb. 2018 12:30pm. Grigorios Koumoutsos.

Algorithms for k-Server Problems. - 31 Jan. 2018 12:30pm. Till Miltzow.

Graph Embedding inside a polygon. - 17 Jan. 2018 1:00pm. Thatchaphol Saranurak.

Dynamic Spanning Forest: Techniques and Connections to Other Fields. - 6 Dec. 2017 12:00pm. Krystal Guo.

Discrete time quantum walks and quantum search. - 27 Nov. 2017 12:00pm. Luis Felipe Barba.

Convex hulls in the presence of obstacles. - 22 Nov. 2017 12:00pm. Wouter Cames van Batenburg.

Coloring Jordan regions and Jordan curves. - 15 Nov. 2017 12:00pm. Till Miltzow.

Is Area-Universality UETR-complete? - 8 Nov. 2017 12:00pm. Gwenaël Joret.

Lower bounds for quantum sorting. - 18 Oct. 2017 12:30pm. Jean Cardinal.

Incidence bounds and kernelization. - 4 Oct. 2017 12:30pm. Till Miltzow.

Fine-grained complexity of coloring unit disks and balls. - 19 Oct. 2016
**2:15pm**. Michele D'Adderio.

The sandpile model on K_{m,n} and the rank of its configurations. - 9 Nov. 2016 12:30pm. Udo Hoffmann.

Recognizing visibility graphs of polygons with holes is hard for the existential theory of the reals. - 16 Nov. 2016 12:00pm. Aurélien Ooms.

Comparison of real roots (without numerical approximations). - 23 Nov. 2016 12:00pm. Tony Huynh.

Transfinite Ford-Fulkerson on a Finite Network. - 30 Nov. 2016 12:00pm. Samuel Fiorini.

Characterizing Polytopes Contained in the 0/1-Cube with Bounded Chvatal-Gomory Rank. - 7 Dec. 2016 12:00pm. Michele Conforti.
- 14 Dec. 2016
**2:30pm**. Irina Kostitsyna.

Digital materials and aerospace applications. - 11 Jan. 2017 12:00pm. Ingo van Duijn.

Time-windowed graph connectivity. - 18 Jan. 2017 12:00pm. Elena Khramtcova.

Searching edges in the overlap of two plane graphs. - 1 Feb. 2017
**1:00pm**. Jean-Florent Raymond.

A randomized constant factor approximation algorithm for Planar F-Deletion. - 15 Feb. 2017 12:30pm. Pierre Aboulker.

Generalizations of the geometric de Bruijn-Erdos Theorem. - 1 Mar. 2017 12:30pm. Nathan Meynaert.

Coloring graphs with no short cycles. - 8 Mar. 2017 12:30pm. Konstantinos Stavropoulos.

Medianwidths of graphs. - 22 Mar. 2017 12:30pm. David Wood.

Monotone expanders. - 27 Mar. 2017 12:30pm. Till Miltzow.

Irrational Guards are sometimes needed. - 3 May 2017 12:30pm. Carlos Alegria Galicia.

On the Rectilinear Convex Hull of a planar point set and its generalizations. - 17 May 2017 12:30pm. Till Miltzow.

The Art Gallery Problem is $\exists \mathbb{R}$-complete. - 24 May 2017 12:30pm. Jean Cardinal.

Permutations and partitions. - 31 May 2017 12:30pm. Carole Muller.

Excluded minors for isometric embeddings of graphs in $\ell_\infty^k$-spaces. - 6 June 2017 12:30pm. Till Miltzow.

Intersection Graphs of Rays and Grounded Segments. - 13 June 2017 12:30pm. Johanna Seif.

Bounding techniques for extension complexity.