Accepted Papers

  1. Nesrine Abbas. Linear Algorithms for Red and Blue Domination in Convex Bipartite Graphs
  2. Bogdan Alecu, Aistis Atminas, Vadim Lozin and Dmitriy Malyshev. Combinatorics and algorithms for quasi-chain graphs
  3. Amotz Bar-Noy, David Peleg, Mor Perry and Dror Rawitz. Composed Degree-Distance Realizations of Graphs
  4. Sam Barr and Therese Biedl. All Subgraphs of a Wheel are 5-Coupled-Choosable
  5. Sriram Bhyravarapu, Tim A. Hartmann, Subrahmanyam Kalyanasundaram and I. Vinod Reddy. Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs
  6. Best Paper Award - Benjamin Merlin Bumpus and Kitty Meeks. Edge exploration of temporal graphs.
  7. Andrey Bychkov and Gleb Pogudin. Optimal monomial quadratization for ODE systems
  8. Ben Cameron, Joe Sawada and Aaron Williams. A Hamilton Cycle in the k-Sided Pancake Network
  9. Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri and Raji R Pillai. Algorithms and Complexity of s-Club Cluster Vertex Deletion
  10. Jongmin Choi, Dahye Jeong and Hee-Kap Ahn. Covering Convex Polygons by Two Congruent Disks
  11. Ferdinando Cicalese and Nicolò Pilati. The Tandem Duplication Distance Problem is hard over bounded alphabets
  12. Erika Morais Martins Coelho, Hebert Coelho da Silva, Luerbio Faria, Mateus de Paula Ferreira, Sylvain Gravier and Sulamita Klein. On the oriented coloring of the disjoint union of graphs
  13. Jared Coleman, Evangelos Kranakis, Danny Krizanc and Oscar Morales Ponce. The Pony Express Communication Problem
  14. Simon Coumes, Bouadi Tassadit, Nourine Lhouari and Alexandre Termier. Skyline Groups are Ideals. An efficient algorithm for enumerating skyline groups
  15. Clément Dallard, Mirza Krbezlija and Martin Milanič. Vertex Cover at Distance on H-free Graphs
  16. Peter Damaschke. On an Ordering Problem in Weighted Hypergraphs
  17. Dariusz Dereniowski, Aleksander Łukasiewicz and Przemysław Uznański. An Efficient Noisy Binary Search in Graphs via Median Approximation
  18. Niccolò Di Marco, Andrea Frosini and William Lawrence Kocay. A study on the existence of null labelling for 3-hypergraphs
  19. Adrian Dumitrescu and Josef Tkadlec. Piercing all translates of a set of axis-parallel rectangles
  20. Colin Cooper, Martin Dyer and Catherine Greenhill. A triangle process on regular graphs
  21. Mathieu Gascon, Riccardo Dondi and Nadia El-Mabrouk. Complexity and Algorithms for MUL-Tree Pruning
  22. Konstantinos Georgiou, Somnath Kundu and Pawel Pralat. Makespan Trade-offs for Visiting Triangle Edges
  23. Toru Hasunuma. Augmenting a Tree to a k-Arbor-Connected Graph with Pagenumber k
  24. Noah Brustle, Tal Elbaz, Hamed Hatami, Onur Kocer and Bingchan Ma. Approximation algorithms for hitting subgraphs
  25. Florian Ingels and Romain Azaïs. Isomorphic unordered labeled trees up to substitution ciphering
  26. Byeonguk Kang, Jongmin Choi and Hee-Kap Ahn. Intersecting Disks using Two Congruent Disks
  27. Walter Kern, Barnaby Martin, Daniel Paulusma, Siani Smith and Erik Jan van Leeuwen. Disjoint Paths and Connected Subgraphs for H-Free Graphs
  28. Martin Kučera and Ondrej Suchy. Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters
  29. Soh Kumabe and Takanori Maehara. Prophet Secretary for k-Knapsack and l-Matroid Intersection via Continuous Exchange Property
  30. Best student paper - Stefan Lendl, Gerhard J. Woeginger and Lasse Wulf. Non-preemptive tree packing
  31. Yoshifumi Manabe and Hibiki Ono. Card-based Cryptographic Protocols for Three-input Functions Using Private Operations
  32. Andrea Marino and Ana Silva. Königsberg Sightseeing: Eulerian Walks in Temporal Graphs
  33. Rahnuma Islam Nishat, Venkatesh Srinivasan and Sue Whitesides. Reconfiguring Simple s,t Hamiltonian Paths in Rectangular Grid Graphs
  34. Richard Santiago. New Approximations and Hardness Results for Submodular Partitioning Problems
  35. N R Aravind and Roopam Saxena. An FPT algorithm for Matching Cut and d-Cut
  36. Svetlana Topalova and Stela Zhelezova. Backtrack search for parallelisms of projective spaces
  37. Markus Chimani, Niklas Troost and Tilo Wiedera. Approximating Multistage Matching Problems
  38. Michael Wagner, Ludwig Kampel and Dimitris E. Simos. Heuristically enhanced IPO Algorithms for Covering Array Generation