Abstracts of contributed talks (pdf)
List of contributed talks (in random order):
Arman Boyaci, Tinaz Ekim, Mordechai Shalom and Shmuel Zaks. Graphs of Edge-Intersecting and Non-Splitting Paths
slides
David Tankus and Vadim Levit. Well-dominated graphs without cycles of lengths 4 and 5
slides
Ismael González Yero, Alejandro Estrada-Moreno and Juan Alberto Rodriguez Velazquez. On the complexity of computing the $k$-metric dimension of graphs
slides
Fedor Fomin, Petr Golovach, Nikolay Karpov and Alexander Kulikov. Parameterized Complexity of Secluded Connectivity Problems
slides
Didem Gözüpek and Mordechai Shalom. Edge Coloring with Minimum Reload/Changeover Costs
slides
Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt and Mingxian Zhong. Obstructions for three-coloring graphs without long induced paths
slides
Archontia C. Giannopoulou and George Mertzios. New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs
slides
Primož Potočnik and Steve Wilson. The Separated Box Product
slides
Cemil Dibek, Tinaz Ekim, Didem Gozupek and Mordechai Shalom. Equimatchable Graphs are $C_{2k+1}$-free for $kgeq 4$
slides
Ingo Schiermeyer. 4-colorability of P6-free graphs
slides
Martin Milanič, Irena Penev and Nicolas Trotignon. Stable sets in {ISK4,wheel}-free graphs
slides
Vadim Levit and Eugen Mandrescu. All Square Roots of a König-Egerváry Graph
slides
Endre Boros and Peter Muršič. Recognizability of bipartite graphs and hypergraphs given degree sequence
Eun Jung Kim. Tree-Cut width: computation and algorithmic applications
slides
Andreas M. Hinz. The Dudeney Algorithm
slides
Joachim Schauer. Asymptotic Aspects of the Quadratic Knapsack Problem
slides
Spyridon Maniatis, Marcin Kamiński, Dimitrios Thilikos and Petr Golovach. The parameterized complexity of graph cyclability
slides
Rayan Chikhi, Paul Medvedev, Martin Milanič and Sofya Raskhodnikova. On the readability of overlap digraphs
Andreas Brandstädt, Konrad Kazimierz Dabrowski, Shenwei Huang and Daniel Paulusma. Clique-width of Restricted Graph Classes
slides
Spencer Backman and Tony Huynh. Transfinite Ford-Fulkerson on a Finite Network
Iztok Peterin. Another approach to the linear algorithm for the prime factor decomposition of Cartesian product
Kenta Ozeki. The $4$-ordered Hamiltonicity and the spanning $K_4^-$-linkedness in planar graphs
slides
Irena Hrastnik Ladinek and Janez Žerovnik. Perfect codes in direct graph bundles
slides
S. Aparna Lakshmanan, Csilla Bujtás and Zsolt Tuza. Line graphs, triangle graphs, and further generalizations
slides
Eranda Çela, Rostislav Staněk and Joachim Schauer. A special case of the data arrangement problem on binary trees
slides
Martin Pečar. Choosing best shortcuts for a path
slides
Aleksander Vesel and Yoomi Rho. Linear recognition algorithm of generalized Fibonacci cubes $Q_h(111)$
Andrej Brodnik and Marko Grgurovič. Practical performance comparison of all-pairs shortest path algorithms
slides
Gabriela Araujo-Pardo and Christian Rubio-Montiel. Pseudoachromatic and connected-pseudoachromatic indices of the complete graph
Kathie Cameron, Steven Chaplick and Chinh Hoang. On (pan, even hole)-free graphs
slides
Edward Dobson, Ademir Hujdurović, Martin Milanič and Gabriel Verret. Vertex-transitive CIS graphs
slides
Eranda Cela, Vladimir Deineko and Gerhard J. Woeginger. The linearizable QAP and some applications in optimization problems in graphs
slides
Csilla Bujtás and Zsolt Tuza. K3-WORM colorings of graphs: Feasible sets and complexity
Marcin Anholcer. Group edge irregularity strength of graphs
slides
Dimitris Chatzidimitriou, Archontia Giannopoulou, Spyridon Maniatis, Clément Requilé, Dimitrios Thilikos and Dimitris Zoros. Fixed Parameter Algorithms for Completion Problems on Planar Graphs
slides
Archontia Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov and Saket Saurabh. Uniform Kernelization Complexity of Hitting Forbidden Minors
slides
Andreas Hinz and Sara Sabrina Zemljič. Distances in Sierpinski triangle graphs
slides
Luciano N. Grippo, Martí??n Matamala, Martí??n D. Safe and Maya Stein. Convex p-partitions of bipartite graphs
slides
Martin Bachratý, Michal Hagara and Robert Jajcay. Computational Aspects of Finding Skew-Morphisms for Cyclic Groups
Dušanka Janežič and Janez Konc. Maximum clique algorithm for binding site comparison in drug discovery
Ilia Ponomarenko and A.Vasil'ev. The recognizing of the Cartan association schemes
slides
Martin Knor, Riste Škrekovski and Aleksandra Tepeh. An inequality between the edge-Wiener index and the Wiener index of a graph
slides
