Last update: 04/02/2019
| 09:30 - 09:40 | Opening | ||||
| 09:40 - 10:40 | Edith Elkind Invited Talk |
||||
| 10:40 - 11:10 | Coffee Break | ||||
| 11:10 - 12:50 | Session 1 |
||||
| 11:10 - 11:35 | Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono and Yota Otachi Parameterized Complexity of Safe Set |
||||
| 11:35 - 12:00 | René Van Bevern, Oxana Yu. Tsidulko and Philipp Zschoche Fixed-parameter algorithms for maximum-profit facility location under matroid constraints |
||||
| 12:00 - 12:25 | Matthias Bentert and André Nichterlein Parameterized Complexity of Diameter |
||||
| 12:25 - 12:50 | Alexander Göke, Dániel Marx and Matthias Mnich Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set |
||||
| 12:50 - 14:00 | Lunch | ||||
| 14:00 - 15:40 | Session 2 |
||||
| 14:00 - 14:25 | Adrian Dumitrescu Finding a Mediocre Player |
||||
| 14:25 - 14:50 | Vittorio Bilò, Laurent Gourves and Jerome Monnot Project Games |
||||
| 14:50 - 15:15 | Paolo Penna and Laurent Viennot Independent lazy better-response dynamics on network games |
||||
| 15:15 - 15:40 | Bugra Caskurlu and Fatih Erdem Kizilkaya On Hedonic Games with Common Ranking Property |
||||
| 15:40 - 16:10 | Coffee Break | ||||
| 16:10 - 17:25 | Session 3 |
||||
| 16:10-16:35 | Akanksha Agrawal, Sushmita Gupta, Pallavi Jain and R. Krithika Quadratic Vertex Kernel for Split Vertex Deletion |
||||
| 16:35-17:.00 | Pratibha Choudhary, Pallavi Jain, R Krithika and Vibha Sahlot Vertex Deletion on Split Graphs: Beyond 4-Hitting Set |
||||
| 17:00-17:25 | Geevarghese Philip, Varun Rajan, Saket Saurabh and Prafullkumar Tale Subset Feedback Vertex Set in Chordal and Split Graphs |
||||
| 09:30 - 10:30 | Peter Rossmanith Invited Talk |
||||
| 10:30 - 11:00 | Coffee break | ||||
| 11:00 - 12:40 | Session 4 |
||||
| 11:00 - 11:25 | Hans L. Bodlaender, Tesshu Hanaka, Yoshio Okamoto, Yota Otachi and Tom van der Zanden Subgraph Isomorphism on Graph Classes that Exclude a Substructure |
||||
| 11:25 - 11:50 | Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jerome Monnot and Florian Sikora Extension of vertex cover and independent set in some classes of graphs and generalizations |
||||
| 11:50 - 12:15 | Fionn Mc Inerney, Nicolas Nisse and Stéphane Pérennes Eternal Domination in Grids |
||||
| 12:15 - 12:40 | Xing Shi Cai, Luc Devroye, Cecilia Holmgren and Fiona Skerman k-cuts on a path |
||||
| 12:40 - 14:00 | Lunch | ||||
| 14:00 - 15:40 | Session 5 |
||||
| 14.00-14.25 | Duc A. Hoang, Amanj Khorramian and Ryuhei Uehara Shortest Reconfiguration Sequence for Sliding Tokens on Spiders |
||||
| 14.25 -14.50 | Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda The Parameterized Position Heap of a Trie |
||||
| 14.50 -15.15 | Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz and Manuel Sorge Your Rugby Mates Don't Need to Know your Colleagues: Triadic Closure with Edge Colors |
||||
| 15.15 -15.50 | Adam Kunysz A Faster Algorithm for the Strongly Stable b-Matching Problem |
||||
| 17:15 | Social event and Social Dinner | ||||
| 9:30-10.30 | Luca TrevisanInvited Talk |
||||
| 10:30 - 11:00 | Coffee break | ||||
| 11:00 -12.40 | Session 6 |
||||
| 11:00-11.25 | Sándor Fekete and Dominik Krupke Covering Tours and Cycle Covers with Turn Costs: Hardness and Approximation |
||||
| 11:25-11:50 | Matthew P. Johnson Turing Tumble is P(SPACE)-Complete |
||||
| 11:50-12:15 | Ho Lam Pang and Leizhen Cai Complexity of Vertex Switching on Edge-Bicolored Graphs |
||||
| 12:15-12:40 | Janka Chlebikova, Clément Dallard and Niklas Paulsen Complexity of scheduling for DARP with soft ride times |
||||
| 12:40 - 14:00 | Lunch Break | ||||
| 14:00 - 15:40 | Session 7 |
||||
| 14:00 - 14:25 | Allan Barboza, Cid de Souza and Pedro de Rezende Minimum Convex Partition of Point Sets |
||||
| 14:25 - 14:50 | Eleni C. Akrida, George Mertzios and Paul Spirakis The temporal explorer who returns to the base |
||||
| 14:50 - 15:15 | Miguel Coviello Gonzalez and Marek Chrobak Towards a Theory of Mixing Graphs: A Characterization of Perfect Mixability |
||||
| 15:15 - 15:40 | Serafino Cicerone, Gabriele Di Stefano, Leszek Gasieniec, Tomasz Jurdzinski, Alfredo Navarra, Tomasz Radzik and Grzegorz Stachowiak Fair Hitting Sequence problem: scheduling activities with varied frequency requirements |
||||
| 15:40 - 16:10 | Coffee break | ||||
| 16:10 - 17:25 | Session 8 |
||||
| 16:10 -16:35 | Frank Kammer and Andrej Sajenko Linear-Time In-Place DFS and BFS on the Restore Word RAM |
||||
| 16:35 -17:00 | Emanuele Natale and Iliad Ramezani On the Necessary Memory to Compute the Plurality in Multi-Agent Systems |
||||
| 17:00 - 17:25 | Dariusz Dereniowski, Lukasz Kuszner and Robert Ostrowski Searching by heterogeneous agents |
||||
Social Event
Visit to the archeological complex of Case Romane del Celio, which extends below the Basilica of Saints John and Paul. At the end of the visit the dinner will be served in the archeological site and prepared according to 2000-year-old Roman recipes drawn from authors like Apicius, Cato, and Columella.
Click & Book your ticket >>
Meeting points: either at 16:30 in front of Grand Hotel Palatino or at 17:15 at Case del Celio.Case del Celio can be reached from the conference location by a 20 minute walk (see map).
SPONSORS:
Contact Us
For more information
LOCAL ARRANGEMENTS:
EASY CONFERENCES