Program

Program last updated on 28 Sept. 2015


Monday, Oct 5, 2015

  • 8:30 – 9:00   Registration
  • 8:55 – 9:00   Opening
  • 9:00 – 10:00   Invited talk: Béla Bollobás: Monotone Cellular Automata (abstract)
  • 10:05 – 10:55   Session 1
    • Daniel Freund, Matthias Poloczek and Daniel Reichman. Contagious Sets in Dense Graphs
    • 
Denys Shcherbak, Gerold Jäger and Lars-Daniel Öhman. The Zero Forcing Number of Bijection Graphs
  • 10:55 – 11:20   Coffee break
  • 11:20 – 13:00   Session 2
    • Alessio Conte, Roberto Grossi, Andrea Marino and Romeo Rizzi. Enumerating Cyclic Orientations of a Graph
    • Petr Golovach, Pinar Heggernes and Dieter Kratsch. Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs
    • Carla Binucci, Emilio Di Giacomo, Md. Iqbal Hossain and Giuseppe Liotta. 1-page and 2-page Drawings with Bounded Number of Crossings per Edge
    • Joan Boyar and Christian Kudahl. Adding isolated vertices makes some online algorithms optimal
  • 13:00 – 14:45   Lunch (on your own)
  • 14:45 – 16:00   Session 3
    • Myoungji Han, Munseong Kang, Sukhyeun Cho, Geonmo Gu, Jeong Seop Sim and Kunsoo Park. Fast Multiple Order-Preserving Matching Algorithms
    • Felipe A. Louza and Guilherme P. Telles. Computing the BWT and the LCP Array in Constant Space
    • Mikhail Rubinchik and Arseny Shur. Eertree: An Efficient Data Structure for Processing Palindromes in Strings
  • 16:00 – 16:25   Coffee break
  • 16:25 – 18:05   Session 4
    • Robert Ganian, Eduard Eiben and Juho Lauri. On the Complexity of Rainbow Coloring Problems
    • Dušan Knop and Tomáš Masařík. Computational complexity of distance edge labeling
    • Konrad Dabrowski, Francois Dross, Matthew Johnson and Daniel Paulusma. Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs
    • Vít Jelínek, Eva Jelinkova and Jan Kratochvil. On the hardness of switching to a small number of edges
  • 18:05 – 18:30   Business meeting


Tuesday, Oct 6, 2015

  • 9:00 – 10:00   Invited talk: Esko Ukkonen: Identifiability of a string from its substrings (abstract)
  • 10:05 – 10:55   Session 5
    • Francine Blanchet-Sadri, Rachel Harred and Justin Lazarow. Longest Common Extensions in Partial Words
    • Philippe Gambette, Andreas Gunawan, Anthony Labarre, Stéphane Vialette and Louxin Zhang. Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time
  • 10:55 – 11:20   Coffee break
  • 11:20 – 13:00   Session 6
    • Meirav Zehavi. The k-Leaf Spanning Tree Problem Admits a Klam Value of 39
    • Hasna Mohsen Alqahtani and Thomas Erlebach. Minimum Activation Cost Edge-Disjoint Paths in Graphs with Bounded Tree-Width
  • 12:10 – 13:00   Open Problem Session
  • 13:00 – 14:45   Lunch (on your own)
  • 14:45 – 16:00   Session 7
    • Martin Derka, Alejandro Lopez-Ortiz and Daniela Maftuleac. List Colouring and Partial List Colouring of Graphs On-Line
    • Gilad Kutiel, Reuven Bar-Yehuda and Dror Rawitz. 1.5-Approximation Algorithm for the 2-Convex Recoloring Problem
    • Guillaume Fertin, Irena Rusu and Stéphane Vialette. Algorithmic aspects of the S-Labeling problem
  • 17:00 – 20:00   Walking Tour of Verona
  • 20:00   Conference Banquet at Antico Caffé Dante


Wednesday, Oct 7, 2015

  • 9:00 – 10:00   Invited talk: Frank Ruskey: Recent results about Venn diagrams (abstract)
  • 10:05 – 10:55   Session 8
    • Jou-Ming Chang, Ton Kloks and Hung-Lung Wang. Gray codes for AT-free orders via antimatroids
    • Luca Ferrari. Schröder partitions and Schröder tableaux
  • 10:55 – 11:20   Coffee break
  • 11:20 – 13:00   Session 9
    • Irving Dai. Combinatorial Properties of Full-Flag Johnson Graphs
    • Gabriele Di Stefano, Pietro Montanari and Alfredo Navarra. About Ungatherability of Oblivious and Asynchronous Robots on Anonymous Rings
    • Klaus Jansen and Stefan Kraft. A Faster FPTAS for the Unbounded Knapsack Problem
    • Stepan Artamonov and Maxim Babenko. A Fast Scaling Algorithm for the Weighted Triangle-Free 2-Matching Problem
  • 13:00 – 14:45   Lunch (on your own)
  • 14:45 – 16:25   Session 10
    • Frederic Giroire, Stephane Perennes and Issam Tahiri. How to design graphs with low forwarding index and limited number of edges
    • Toru Hasunuma. Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees
    • Mohammed Abdullah, Colin Cooper and Moez Draief. Speeding Up Cover Time of Sparse Graphs Using Local Knowledge
    • Gabriele Farina and Luigi Laura. Dynamic subtrees queries revisited: the Depth First Tour Tree
  • 16:25   Closing