Graph Conference on Graph Theory

Tınaz Ekim (PhD in OR, EPFL 2006) is a full professor at the Department of Industrial Engineering, Boğaziçi University, Istanbul, Turkey.

Her research areas include Algorithmic and Structural Graph Theory and Combinatorial Optimization, with a focus on coloring, matching and domination problems, as well as extremal graph theory and Integer Programming techniques applied for graph theoretical problems.

Izolda Gorgol is an associate professor in the Department of Applied Mathematics, Faculty of Mathematics and Information Technology at Lublin University of Technology in Poland.

She graduated her master degree from Maria Sklodowska-Curie University in Lublin, and get her PhD in mathematics from Adam Mickiewicz University in Poznań. The whole her personal life is connected with Lublin University of Technology.

Her research areas include graph theory, in particular Ramsey, anti-Ramsey and Turan numbers.

Michael Henning is a research professor in the Department of Mathematics and Applied Mathematics at the University of Johannesburg in South Africa. His research interests are in the field of graph theory and hypergraph theory, and his favourite topics are in the area of domination theory in graphs and transversals in hypergraphs.

Stanislaw Radziszowski is a Professor in the Department of Computer Science since 1995. He earned Ph.D. from the Institute of Informatics at the University of Warsaw. During the years 1980-1984 he worked in IIMAS at the National Autonomous University of Mexico in Mexico City, and since 1984 at the RIT. In the 1990's he held three times 6-week visiting positions at the Australian National University in Canberra, and maintained collaborations with universities in Poland.

His main research interest is in combinatorial computing - solving classical problems in combinatorics, graph theory and design theory, usually with the help of massive computations. Bounds on Ramsey numbers are his favorite. His survey titled 'Small Ramsey Numbers', which is a regularly updated living article at the Electronic Journal of Combinatorics, became a standard reference in this area. He teaches mostly theory oriented courses, including very popular courses on cryptography, both at undergraduate and graduate levels. His recent work on applied cryptography led to joint projects with Computer Engineering Department.

Kieka Mynhardt is a full professor at the University of Victoria on Vancouver Island,
Canada. She was born in Cape Town, South Africa. She graduated from the University
of Johannesburg and first taught at the University of Pretoria and the University of South
Africa before moving to Victoria in 2002. Her research focuses on domination theory. Recent research areas include reconfiguration problems, graph protection (eternal domination
and eternal eviction), and broadcasts.

Sandi Klavžar is a professor at the Faculty of Mathematics and Physics, University of Ljubljana. His research interests include discrete mathematics and its applications in other fields. He has published over 380 scientific papers and 7 scientific monographs. He is editor or member of the editorial boards of a number of journals, including an associate editor of Discrete Applied Mathematics and editorial board member of the European Journal of Combinatorics. He has supervised over 20 PhD students.

Łukasz Kowalik is a full professor at the Institute of Informatics of the University of Warsaw. He received a PhD from University of Warsaw in 2005 and then worked as a postdoc at MPI Saarbrucken, Germany. His research focuses on graph algorithms, including parameterized and approximation algorithms. He is a co-author of over 60 publications, including a popular textbook "Parameterized Algorithms".

Paweł Rzążewski completed his PhD at University of Warsaw in 2015. Currently he is a researcher at Warsaw University of Technology and University of Warsaw. His professional interests include many aspects of structural and algorithmic graph theory, especially algorithms for various graph colorings problems.