MONDAY, June 5
|
Opening by Rector and Dean of Faculty
|
14:45 - 15:00
|
|
Magnus Halldórsson: Graph coloring: Connecting semi-online algorithms to new algorithmic paradigms
online
|
15:00 - 16:00
|
|
Coffee break
|
16:00 - 16:20
|
|
On the number of maximal independent sets: From Moon-Moser to Hujter-Tuza
Balazs Patkos, Alfred Renyi Institue of Mathematics, Hungary
on site
|
16:20 - 16:45 |
|
Set families with forbidden inclusion patterns
Dániel T. Nagy, Alfred Renyi Institue of Mathematics, Hungary
on site
|
16:45 - 17:10 |
|
Complexity of total dominator coloring in graphs
Kusum, Department of Mathematics, Indian Institute of Technology Ropar, Punjab, India.
online
|
17:10 - 17:35 |
|
M. Grazia Speranza: A brief history of the first semionline scheduling paper
on site
|
17:35 - 17:45 |
|
Welcome Party
Including the welcome speech of M. Grazia Speranza
|
17:45 - |
TUESDAY, June 6
|
Gábor Galambos: On couple of task scheduling
|
9:00 - 10:00
|
|
Coffee Break
|
10:00 - 10:20
|
|
Some Conjectures and Results in Tilings
Peter Horak, University of Washington, Tacoma, USA
on site
|
10:20 - 10:45
|
|
Shortest paths in grids
Bela Vizvari, Department of Industrial Engineering, Eastern Mediterranean University
on site
|
10:45 - 11:10
|
|
How to prove impossibility for packings of rectangles
Mihaly Hujter
on site
|
11:10 - 11:35
|
|
Optimal cutting arrangements in 1D
Bowen Li, Carleton College
Attila Sali, Alfred Renyi Institute of Mathematics and Department of Computer ScienceBudapest University of Technology and Economics
on site
|
11:35 - 12:00
|
|
Lunch
|
12:00 - 13:20
|
|
Approximation algorithms for the star packing problem
An Zhang, Hangzhou Dianzi University, China
online
|
13:20 - 13:45
|
|
Joint replenishment meets scheduling
Peter Györgyi
on site
|
13:45 - 14:10
|
|
On variants of a load-balancing problem
Péter Györgyi, Tamás Kis, Evelin Szögi, Institute for Computer Science and Control, Hungary on site |
14:10 - 14:35
|
|
Disjunctive cuts for modeling R³ to R piecewise linear functions
Péter Dobrovoczki, Tamás Kis, Institute for Computer Science and Control, Hungary
on site
|
14:35 - 15:00
|
|
Coffee Break
|
15:00 - 15:20
|
|
Sharp bounds on the Total Coalition Number
János Barát, Alfréd Rényi Institute of Mathematics, and University of Pannonia, Department of Mathematics, Hungary Zoltán L. Blázsik, Alfréd Rényi Institute of Mathematics, and SZTE Bolyai Institute, Hungary on site
|
15:20 - 15:45
|
|
Lower Bound for 3 Batched Bin Packing
József Békési, Institute of Informatics, University of Szeged, Hungary
on site
|
15:45 - 16:10
|
|
Why implementation matters for graph algorithms?
Máté Hegyháti, Institute of Informatics and Mathematics, University of Sopron
Zsolt Tuza
on site
|
16:10 - 16:35
|
|
Coffee Break
|
16:35 - 16:55
|
|
Betweenness Structures of Small Linear Co-Size
Peter G.N. Szabo, University of Pecs, Hungary
on site
|
16:55 - 17:20
|
|
Linear-Fractional model for reducing inconsistency of pairwise comparison matrices
Anett Rácz, University of Debrecen, Faculty of Informatics, Hungary
on site
|
17:20 - 17:45
|
|
Coffee Break
|
17:45 - 18:00
|
|
Birthday Celebration - Zsolt Tuza 70
|
18:00 - 20:00
|
WEDNESDAY, June 7
| Vitaly A. Strusevich: Models of Scheduling on Parallel Machines under Resource Constraints | 9:00 - 10:00 |
| Coffee Break | 10:00 - 10:20 |
|
Non-crossing Hamiltonian paths in geometric graphs
Jan Kratochvil, Charles University, Prague, Czech Republic
on site
|
10:20 - 10:45 |
|
Minors and Locally Spanning Subgraphs
Jochen Harant, Technical University of Ilmenau, Germany on site
|
10:45 - 11:10 |
|
Winding number and circular 4-coloring of (signed) graphs
Reza Naserasr
on site
|
11:10 - 11:35 |
|
Elena Guardo, Università di Catania - Italy
Steiner systems and configurations of points
online
|
11:35 - 12:00 |
| Lunch | 12:00 - 13:20 |
|
Sufficient conditions for the existence and uniqueness of the maximum likelihood estimation in the case of the Thurstone method
László Gyarmati, Department of Mathematics, University of Pannonia, Hungary
Csaba Mihálykó, Department of Mathematics, University of Pannonia, Hungary
Éva Orbán-Mihálykó, Department of Mathematics, University of Pannonia, Hungary
on site
|
13:20 - 13:45 |
|
Optimal subsets of pairwise comparisons - the GRAPH of graphs approach
Zsombor Szádoczki and Sándor Bozóki Institute for Computer Science and Control (SZTAKI), Eötvös Loránd Research Network (ELKH), Budapest, Hungary; Department of Operations Research and Actuarial Sciences, Corvinus University of Budapest, Budapest, Hungary on site
|
13:45 - 14:10 |
|
Application of the flexible input modeling technique for the P-Graph framework
András Éles, Department of Computer Science, University of Pannonia, Hungary
Heriberto Cabezas, Research Institute of Applied Earth Sciences, University of Miskolc, Hungary
István Heckl, Department of Computer Science, University of Pannonia, Hungary
on site
|
14:10 - 14:35 |
| Coffee Break | 14:35-14:55 |
|
Comparison of Optimization Algorithms for the Dynamic Capacitated Arc Routing Problem
Zsuzsanna Nagy, Ágnes Werner-Stark and Tibor Dulai, University of Pannonia, Hungary on site
|
14:55 - 15:20 |
|
igraph for Optimization Problems: Applications in Graph Partitioning and Clustering
Seyyed Ali Mohammadiyeh, Department of Pure Mathematics, Faculty of Mathematical Sciences,
University of Kashan, Kashan, I. R. Iran
on site
|
15:20 - 15:45 |
|
On Proper Quasi-Connection of Digraphs
Elzbieta Sidorowicz,University of Zielona Góra, Poland
online
|
15:45 - 16:10 |
| Coffee Break | 16:10 - 16:30 |
|
Domination, isolation and the Art Gallery Theorem
Peter Borg online
|
16:30 - 16:55 |
|
List coloring solution of the Futoshiki puzzle
Banu Baklan Sen, Biruni University, Turkey
Oznur Yasar Diner, Kadir Has University, Turkey
online
|
16:55 - 17:20 |
|
Optimal transport flow distributions on dynamic networks
Armen Bagdasaryan, American University of the Middle East, Kuwait
online
|
17:20 - 17:45 |
THURSDAY, June 8
| Nir Halman: Monotone Dynamic Programming: From Theory to Approximation Schemes | 9:00 - 10:00 |
| Coffee Break | 10:00 - 10:20 |
|
New Lower Bounds for Certain Online Packing Problems with Flexibility
Janos Balogh, Institute of Informatics, University of Szeged, Hungary
on site
|
10:20 - 10:45 |
|
Uniquely restricted generalized matchings
Miklos Kresz, InnoRenew Slovenia, and University of Szeged
on site
|
10:45 - 11:10 |
|
Optimization of tree bucking with quality considerations
Balazs David, InnoRenew Slovenia, and University of Primorska
on site
|
11:10 - 11:35 |
| Lunch | 11:35 - 13:00 |
| Excursion | 13:00 - 22:00 |
FRIDAY, June 9
| Jiri Sgall: Online Packet Scheduling | 9:00 - 10:00 |
| Coffee Break | 10:00 - 10:20 |
|
Various extensions on safe sets in graphs
Shinya Fujita, Yokohama City University, Japan online
|
10:20 - 10:45 |
|
Consecutive colourability of (oriented) graphs
Ewa Drgas-Burchardt, University of Zielona Góra, Poland online
|
10:45 - 11:10 |
|
Self-avoiding walks with wrong steps
László Szalay, Institute of Informatics and Mathematics, University of Sopron, Hungary
and Department of Mathematics, Jan Selye University, Slovakia
on site
|
11:10 - 11:35 |
|
Special walks on $2\times n$ grids
László Németh, Institute of Informatics and Mathematics, University of Sopron, Hungary
on site
|
11:35 - 12:00 |
| Lunch | 12:00 - 13:20 |
|
Semiconductor Manufacturing under Demand and Yield Uncertainty
Eghbal Rashidi, San Francisco State University
on site
|
13:20 - 13:45 |
|
Boundedness in the structure of the set of minimal-length slice rank decompositions of a tensor over a finite field
Thomas Karam, University of Oxford, United Kingdom online
|
13:45 - 14:10 |
|
A (1.999999)-approximation ratio for vertex cover problem on graphs with MaxCut value smaller than 0.9|E|
N. Yekezare, M. Zohrehbandian and M. Maghasedi, Karaj Branch, Islamic Azad University, Karaj, Iran. online
|
14:10 - 14:35 |
| Coffee Break | 14:35 - 14:55 |
|
Algorithm for solving a multiobjective optimization problem on a set of partial permutations
Liudmyla Koliechkina, University of Lodz, Poland
Serhii Khovben, Poltava University of Economics and Trade, Ukraine
online
|
14:55 - 15:20 |
|
On Nash-solvability of $n$-person graphical games under Markov and a-priori realizations
Vladimir Gurvich and Mariya Naumova, Rutgers Business School, Rutgers University, Piscataway, New Jersey, United States online
|
15:20 - 15:45 |