PARTICIPANTS & TALKS
If you see a participant's name with the symbol ** next to it, it means they are attending the conference online. Additionally, if you notice a single * by a participant's name, this signifies their participation in a poster session. Furthermore, if you see a participant's name with *** next to it, this indicates their involvement in both a poster session and a contributed talk.
- Mohammad Abudayah /German Jordanian University/
- Karl Bartolo** /University of Malta/
- Krzysztof Bartoszek /Linkoping University/
→ Characterizing phylogenetic tree indices through average coalescent times
- Urszula Bednarz /Rzeszow University of Technology/
- Bikash Bhattacharjya /Indian Institute of Technology Guwahati/
→ H-integral and Gaussian integral normal mixed Cayley graphs
- Peter Borg /University of Malta/
→ Domination, isolation and the Art Gallery Theorem
- Marta Borowiecka-Olszewska /University of Zielona Góra/
→ Consecutively colourable orientations of graphs (part II)
- Ofelia Cepeda Camargo /Universidad Nacional Autónoma de México/
→ Twins and Semitwins in Digraphs
- Sylwia Cichacz-Przeniosło /AGH University of Science and Technology/
→ Minimal k-critical bipartite graphs
- Narda Cordero-Michel** /Instituto de Matemáticas, Universidad Nacional Autónoma de México/
→ Cycle Lengths and Chromatic Number
- Joanna Cyman /Gdańsk University of Technology/
- Dariusz Dereniowski /Gdańsk University of Technology/
- Magda Dettlaff /University of Gdańsk/
- Pakanun Dokyeesun *** /University of Ljubljana/
→ Maker-Breaker domination game on Cartesian products of graphs
- Ewa Drgas-Burchardt** /University of Zielona Góra/
→ Consecutively colourable orientations of graphs (part I)
- Anna Fiedorowicz** /University of Zielona Góra/
→ Independent (k+1)-dominating sets in k-trees
- Hanna Furmańczyk /University of Gdańsk/
- Juan Carlos García-Altamirano /Universidad Autónoma Metropolitana - Cuajimalpa/
→ How to construct the symmetric cycle of length 5 using Hajós construction
- Krzysztof Giaro /Gdańsk University of Technology/
- Ricardo Gómez /Institute of Mathematics, UNAM/
→ Graphs on integer compositions and musical scales
- Ismael Gonzalez Yero /University of Cadiz/
→ On some mutual-visibility problems in graphs
- Przemysław Gordinowicz /Lodz University of Technology/
→ From binary search through games to graphs
- Izolda Gorgol /Lublin University of Technology/
→ Graphs in Action
- Hubert Grochowski /Warsaw University of Technology/
→ Partial Packing Coloring and Quasi Packing Coloring of a Triangular Grid
- Jarosław Grytczuk /Warsaw University of Technology/
→ Coloring games on graphs and words
- Felipe Hernandez-Lorenzana* /Instituto de Matematicas, UNAM/
→ Cycles of length 3 and 4 in edge-colored complete graphs with restrictions in the color transitions
- Federico Infusino** /Univeristy of Calabria/
→ Studying Graphs Through Pawlak's Techniques
- Joanna Janczewska /Gdańsk University of Technology/
- Konstanty Junosza-Szaniawski /Warsaw University of Technology/
→ Minimization of length of system of linear XOR equations
- Anna Kosiorowska /Rzeszow University of Technology/
→ On the existence of independent [j,k]-dominating sets in the generalized corona of graphs
- Adam Kostulak /University of Gdańsk/
- Marek Kubale /Gdańsk University of Technology/
- Dorota Kuziak /University of Cadiz/
→ On the total mutual-visibility number of lexicographic and Cartesian products of graphs
- Magdalena Lemańska /Gdańsk University of Technology/
- Adrian Michalski /Rzeszow University of Technology/
→ Independent (1,1)-dominating and (1,2)-dominating sets in graph products
- Mateusz Miotk* /University of Gdańsk/
→ Certified critical graphs upon vertex removal
- Anna Nenca /University of Gdańsk/
- Michał Pilipczuk /University of Warsaw/
→ A brief introduction to parameterized algorithms
- Mateusz Pirga /Rzeszow University of Technology/
- Paweł Prałat /Toronto Metropolitan University/
→ Analyzing algorithms using the differential equation method
→ The Erdos-Gyarfas function f(n,4,5) = 5n/6 + o(n) --- so Gyarfas was right
- Jakub Przybyło /AGH University of Science and Technology/
→ On degree irregularities in graphs
- Joanna Raczek /Gdańsk University of Technology/
- Stanisław Radziszowski /Rochester Institute of Technology/
→ On Some Generalized Vertex Folkman Numbers
- Monika Rosicka /University of Gdańsk/
- Dayle Scicluna** /University of Malta/
→ Isolation of graphs
- Elżbieta Sidorowicz** /University of Zielona Góra/
→ On Some Variants of Directed Proper Connections
- Maciej M. Sysło /Warsaw School of Computer Science/
- Jerzy Topp /University of Applied Sciences Elbląg/
- Krzysztof Turowski /Jagiellonian University/
→ Concentration of Degrees in the Duplication-Divergence Model
- Paweł Twardowski ** /Lodz University of Technology/
→ The polynomial method for 3-path extendability of list colourings of planar graphs
- Cerina Villarta ** /Central Mindanao University/
→ Combinatorial Approach in Counting Induced Paths in a Graph: Polynomial Representations
- Carlos Vilchis-Alfaro /Instituto de Matematicas, UNAM/
→ Trails in arc-colored digraphs with restriction in the color transitions
- Iwona Włoch /Rzeszów University of Technology/
→ On (1,2)-dominating sets and their variants in graphs
- Jan Wojtkiewicz /Gdańsk University of Technology/
- Małgorzata Wołowiec-Musiał /Rzeszow University of Technology/
- Izajasz Wrosz * /Gdańsk University of Technology/
- Bartłomiej Wróblewski /Gdańsk University of Technology/
→ Edge coloring of signed cactus graphs
- Michał Zakrzewski /University of Gdańsk/
- Radosław Ziemann * /University of Gdańsk/
→ The b-chromatic number of regular graphs
- Rita Zuazua /National Autonomus University of Mexico/
→ The color of crowns
- Andrzej Żak /AGH University of Science and Technology/
→ The integrity of grids
- Paweł Żyliński /University of Gdańsk/
|
| * - poster session |
| ** - online participation |
| *** - poster session and contributed talk |
|
