- Guillaume Bagan, Nicolas Bousquet, Nacim Oijid and Théo Pierron. Fast winning strategies for the attacker in eternal domination
-
Valentin Bartier, Nicolas Bousquet and Moritz Muehlenthaler. Independent set reconfiguration in H-free graphs
-
Benjamin Bergougnoux, Oscar Defrain and Fionn Mc Inerney. Enumerating Minimal Solution Sets for Metric Graph Problems
-
Gaétan Berthe, Marin Bougeret, Daniel Gonçalves and Jean-Florent Raymond. Feedback Vertex Set for pseudo-disk graphs in subexponential FPT time
-
Stéphane Bessy, Daniel Gonçalves and Amadeus Reinald. Oriented trees in $O(k \sqrt{k})$-chromatic digraphs, a subquadratic bound for Burr's conjecture
-
Therese Biedl and Debajyoti Mondal. Improved Outerplanarity Bounds for Planar Graphs
-
Hans Bodlaender and Krisztina Szilagyi. XNLP-hardness of Parameterized Problems on Planar Graphs
-
Aleksander Bjoern Grodt Christiansen, Linda Kleist, Irene Parada and Eva Rotenberg. Augmenting Plane Straight-Line Graphs to Meet Parity Constraints
-
Nathan Claudet and Simon Perdrix. Covering a Graph with Minimal Local Sets
-
Sarel Cohen, Lior Kamma and Aikaterini Niklanovits. A New Approach for Approximating Directed Rooted Networks
-
Ilan Doron-Arad, Guy Kortsarz, Joseph Naor, Baruch Schieber and Hadas Shachnai. Approximations and Hardness of Packing Partially Ordered Items
-
Carl Feghali, Malory Marin and Rémi Watrigant. Beyond recognizing well-covered graphs
-
Eva Fluck, Sandra Kiefer and Christoph Standke. Untangling Gaussian Mixtures
-
P. Francis, Abraham M. Illickan, Lijo M. Jose and Deepak Rajendraprasad. Face-hitting Dominating Sets in Planar Graphs
-
Robert Ganian, Mathis Rocton and Daniel Unterberger. The Parameterized Complexity Landscape of the Unsplittable Flow Problem
-
Yuval Gitlitz, Ofer Neiman and Richard Spence. Lightweight Near-Additive Spanners for Weighted Graphs
-
Irene Heinrich, Eda Kaja and Pascal Schweitzer. Classification of finite directed vertex-colored ultrahomogeneous graphs
-
Michael Hoffmann, Tillmann Miltzow, Simon Weber and Lasse Wulf. Recognition of Unit Segment and Polyline Graphs is ∃R-Complete
-
Satyabrata Jana, Sounak Modak, Saket Saurabh and Kushal Singanporia. Roman Cycle Hitting Set
-
Telikepalli Kavitha. Popular Solutions for Optimal Matchings
-
Ryan Keeney and Daniel Lokshtanov. Degreewidth on Semi-Complete Digraphs
-
Linda Kleist, Peter Kramer and Christian Rieck. On the Connectivity of the Flip Graph of Plane Spanning Paths
-
Kacper Kluk, Hoang La and Marta Piecyk. Graph Reconstruction with Connectivity Queries
-
Stefan Kratsch and Van Bang Le. On polynomial kernelization for Stable Cutset
-
R. Krithika, Kutty Malu V K and Prafullkumar Tale. Revisiting Path Contraction and Cycle Contraction
-
Benedikt Künzel and Jonathan Rollin. On the Complexity of Simultaneous Geometric Embedding for Edge-Disjoint Graphs
-
Jan Kynčl and Jan Soukup. Many views of planar point sets
-
Felicia Lucke, Ali Momeni, Daniel Paulusma and Siani Smith. Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs
-
Miriam Münch, Maximilian Pfister and Ignaz Rutter. Exact and approximate k-planarity testing for maximal graphs of small pathwidth
-
Jelle Oostveen, Daniel Paulusma and Erik Jan van Leeuwen. The Complexity of Diameter on H-free graphs
-
Dimitrios Thilikos and Sebastian Wiederrecht. Approximating branchwidth on parametric extensions of planarity
Download current event:
Calendar file
In order to enable an iCal export link, your account needs to have an API key created. This key enables other applications to access data from within Indico even when you are neither using nor logged into the Indico system yourself with the link provided. Once created, you can manage your key at any time by going to 'My Profile' and looking under the tab entitled 'HTTP API'. Further information about HTTP API keys can be found in the Indico documentation.
Additionally to having an API key associated with your account, exporting private event information requires the usage of a persistent signature. This enables API URLs which do not expire after a few minutes so while the setting is active, anyone in possession of the link provided can access the information. Due to this, it is extremely important that you keep these links private and for your use only. If you think someone else may have acquired access to a link using this key in the future, you must immediately create a new key pair on the 'My Profile' page under the 'HTTP API' and update the iCalendar links afterwards.
Permanent link for public information only:
Permanent link for all public and protected information:
Please use CTRL + C to copy this URL
Detailed timetable
