In addition to the talks in the general session, the conference will host a number of special minisymposia. A minisymposium will consist of at least 9 contributed talks and at least one invited talk. Currently confirmed minisymposia are listed below.
When submitting an abstract please select an option whether you wish to submit it to the general session or to a specific minisymposium.
Organizers
Marko Orel (University of Primorska)
Polona Oblak (University of Ljubljana)
Description
Organizer
Viktor Zamaraev (University of Liverpool)
Description
Organizers
Safet Penjić (University of Primorska)
Blas Fernandez (University of Primorska)
Description
Organizers
Jan Goedgebeur (KU Leuven)
Jorik Jooken (Leiden University)
Description
Computers are often used in combinatorics to tackle problems about combinatorial objects with given structural or extremal properties, especially when these problems are too complex to solve by hand. Computational approaches can include the design and implementation of algorithms for generating combinatorial objects from a given class (typically avoiding the generation of isomorphic copies), systematic searches for examples or counterexamples and joint theoretical and computer-assisted approaches.
In this minisymposium we present some recent examples where computational methods have been successfully used to help solve problems in graph theory. The emphasis is on the design and implementation of computational methods as tools for obtaining mathematical results and insight, rather than on the complexity analysis of the algorithms themselves.
Organizer
Ismael G. Yero (Universidad de Cádiz)
Description
This minisymposium aims to explore several graph invariants defined via shortest-path distances, highlighting structural insights and computational challenges across network topology and graph theory. On the one hand, it focuses on metric dimension parameters, including classical metric dimension, fault-tolerant variants, multiset dimension, and edge dimension, among others. Discussions will cover characterizations, sharp bounds, and complexity analysis for distinguishing vertex sets using geodesic distance properties. On the other hand, the session features emerging research on visibility parameters, such as the mutual-visibility number and the general position number, along with their variations. These topics explore sets of vertices that "see" each other via unblocked geodesics, bridging concepts between computer science applications and classical combinatorial problems. By bringing together structural bounds, product graph characterizations, and algorithmic complexity contributions, this minisymposium aims to gather researchers with common interests in graph theoretical studies on these and related parameters.
Organizer
Michael A. Henning (University of Johannesburg)
Description
Domination in graphs has experienced rapid growth over the past few decades. The purpose of this minisymposium is to bring together researchers working on various aspects of domination in graphs, including topics in domination in graphs, structures of domination in graphs, domination algorithms, and domination related games. The goal of this minisymposium is to examine recent developments of domination in graphs, exploring current trends and methods used to solve graph domination problems and presenting open problems in the field.
Organizers
Michel Lavrauw (University of Primorska)
Simeon Ball (Universitat Politècnica de Catalunya)
Giusy Monzillo (University of Primorska)
George Savvaoudis (University of Primorska)
Description
Organizer
Zdeněk Dvořák (Charles University Prague)
Description
Organizers
Marston Conder (University of Auckland and University of Primorska)
Ademir Hujdurović (University of Primorska)
Description