Programme

22. November, Wednesday

19:00 -
Welcome Reception, University of Szeged, Juhász Gyula Faculty of Education (map)

23. November, Thursday

8:30 - 9:00
Registration
9:00 - 9:10
Opening
9:10 - 10:50
Session 1 (Graph theory I) - Chair: Ervin Győri
9:10 - 9:30
Adrian Dumitrescu
Finding Triangles or Independent Sets
9:30 - 9:50
Ahmad Anaqreh, Boglarka G.-Toth, Tamas Vinko
Exact Methods for the Longest Induced Cycle Problem
9:50 - 10:10
Bence Csonka, Gábor Simonyi
Shanon capacity, Lovász theta number and the Micielsky construction
10:10 - 10:30
Anna Gujgiczer, Gábor Simonyi
Critical subgraphs of Schrijver graphs for the fractional chromatic number
10:30 - 10:50
Gábor Simonyi
Shannon capacity and Hedetniemi-type equalities
10:50 - 11:20
Coffee break
11:20 - 13:00
Session 2 (Optimization I) - Chair: Gábor Galambos
11:20 - 11:40
Péter Györgyi, David Fischer
Coupled task scheduling – minimizing the total completion time
11:40 - 12:00
János Balogh, György Dósa, Leah Epstein, Lukasz Jez
New Lower Bounds for Certain Relaxed Online Packing Problems
12:00 - 12:20
Marie-Louise Lackner, Christoph Mrkvicka, Nysret Musliu, Daniel Walkiewitz, Felix Winter
Exact and Heuristic Methods for the Oven Scheduling Problem
12:20 - 12:40
Máté Hegyháti
Cyclic scheduling with Timed Automata
12:40 - 13:00
Tamás Kis, Péter Dobrovoczky
Disjunctive cuts and application to optimization with piecewise-linear functions
13:00 - 14:00
Lunch
14:00 - 14:50
Keynote talk
Patric R. J. Östergård
Counting Steiner triple systems
14:50 - 15:10
Coffee break
15:10 - 16:50
Session 3 (Miscellaneous I) - Chair: Zsolt Tuza
15:10 - 15:30
Béla Vízvári
Analysis of quantities related to COVID-19 pandemic
15:30 - 15:50
Benedek Nagy
Digital Convexity based on Path Counting
15:50 - 16:10
Gyula Ábrahám, György Dósa, Lars Magnus Hvattum, Tomas Attila Olaj, Zsolt Tuza
Board Packing
16:10 - 16:30
Edith Alice Kovács
Generalized product-type probability approximations and bounds of higher order
16:30 - 16:50
Tibor Illés, Sorin-Mihai Grad, Petra R. Rigó
New algorithms for generating Pareto-optimal points of multi-objective optimization problems
16:50 - 17:20
Coffee break
17:20 - 19:00
Session 4 (Cliques) - Chair: Bo Chen
17:20 - 17:40
Sándor Szabó, Bogdán Zaválnij
Additional pruning and backtracking rules in the Carradhan-Pardalos algorithm applied to packing by cubical clusters
17:40 - 18:00
Dániel Pfeifer
Cliqueful graphs as a means of calculating the maximum number of maximum cliques of simple graphs
18:00 - 18:20
Dusanka Janezic, Janez Konc
An exact algorithm to find a maximum weight clique in a weighted undirected graph
18:20 - 18:40
Pablo San Segundo
CliSAT, a new exact algorithm for the maximum clique problem
18:40 - 19:00
Martin Milanic, Yushi Uno
Upper clique transversals in graphs: Complexity and algorithms
20:00 -
Conference dinner

24. November, Friday

8:45 - 10:25
Session 5 (Graph theory II) - Chair: Miklós Simonovits
8:45 - 9:05
András Hubai, Tamás Róbert Mezei, Ferenc Béres, András Benczúr, István Miklós
Sensitive χ2 testing via sampling tripartite 3-uniform hypergraphs
9:05 - 9:25
Janez Zerovnik
From Szeged number to closeness of networks
9:25 - 9:45
Uros Cibej, Aaron Li, István Miklós, Sohaib Nasir, Varun Srikanth
Constructing bounded degree graphs with prescribed degree and neighbor degree sequences
9:45 - 10:05
Murat Elhüseyni, Balázs Dávid, László Hajdú, Burak Kocuk, Miklós Krész
Weighted P-Median-Spanning Tree Problem
10:05 - 10:25
Gábor Bacsó, Csilla Bujtás, Balázs Patkós, Zsolt Tuza, Máté Vizer
Robust coloring and related invariants of graphs
10:25 - 10:55
Coffee break
10:55 - 11:45
Keynote talk
Bo Chen
Auctions and Bidding
11:45 - 12:45
Session 6 (Machine Learning) - Chair: Miklós Krész
11:45 - 12:05
Branko Kavsek
Transfer Learning: Boosting Machine Learning Efficiency and Efficacy
12:05 - 12:25
Deepak Ajwani, Paula Carroll, James Fitzpatrick, Saurabh Ray, Dena Tayebi
Machine Learning Techniques for Solving Combinatorial Optimisation Problems
12:25 - 12:45
Karlo Bala, Dejan Brcanov, Nebojsa Gvozdenovic, Andrea Roznjik
Deep Learning-Based Approximation of Optimal Traveling Salesman Tour Length
12:45 - 14:00
Lunch
14:00 - 15:50
Session 7 (Miscellaneous II) - Chair: Tibor Illés
14:00 - 14:20
Wallace Peaslee, Attila Sali, Jun Yan
An intermediate case of exponential multivalued forbidden matrix configuration
14:20 - 14:40
Gabriel Istrate, Mihai Prunescu
Conway’s Army Percolation
14:40 - 15:00
Domen Vake, Niki Hrovatin, Aleksandar Tosic, Jernej Vicic
Privacy preserving fall detection using homomorphic encryption
15:00 - 15:20
Ata Atay, Marina Nunez, Tamás Solymosi
On the core of many-to-one assignment games
15:20 - 15:35
Yannick Kuhar, Uroš Cibej
Compressing directed graphs with local symmetries
15:35 - 15:50
Gábor Kusper, Benedek Nagy, Imre Baják, Attila Adamkó
On strongly connected resolvable networks
15:50 - 16:20
Coffee break
16:20 - 18:00
Session 8 (Optimization II) - Chair: Gerhard Reinelt
16:20 - 16:40
Eszter Csókás, Tamás Vinkó
On the starting point of the constraint generation algorithm for submodular function maximization
16:40 - 17:00
Bowen Li, Attila Sali
Optimal Cutting Arrangements in 1D
17:00 - 17:20
Daniil Baldouski, Balázs Dávid, György Dósa, Tibor Dulai, Ágnes Werner-Stark, Miklós Krész
Improving container handling in port operations
17:20 - 17:40
Péter Naszvadi, Mátyás Koniorczyk
MILP models of mixed Hamming packings: improved upper bounds
17:40 - 18:00
Nikola Obrenovic, Maksim Lalic, Sanja Brdar, Oskar Marko, Vladimir Crnojevic
Optimization Algorithms in Precision Agriculture - Selected Use Cases
18:00 - 18:15
Closing
19:00 -
Survivors' dinner