WALCOM 2023
The 17th International Conference and Workshops on Algorithms and Computation
March 22-24, 2023
Hsinchu, Taiwan & Virtual Conference
Keynote Speakers
Jan Kratochvil
Charles University, Prague, Czech Republic
Bio sketch.
Jan Kratochvíl was born on 10 February 1959 in Prague, Czech Republic. He is a Czech mathematician and computer scientist whose research concerns graph theory and intersection graphs. He studied at Charles University in Prague, earning a master's degree in 1983 and a Ph.D. in 1987; his dissertation, supervised by Jaroslav Nešetřil, combined graph theory with coding theory. He remained at Charles University as a faculty member, earned his habilitation in 1995, and was promoted to full professor in 2003. From 2003 to 2011 he chaired the department of applied mathematics at Charles University, and from 2012 to 2020 he was the dean of the Faculty of Mathematics and Physics there.
Kratochvíl was the program chair and organizer of the 7th International Symposium on Graph Drawing, in 1999. From 2002 to 2010 he was president of the Czech Mathematical Society. Since March 2021, Kratochvíl is editor-in-chief of Elsevier's Computer Science Review (Impact Factor: 8.757), together with Giuseppe Liotta and Jaroslav Nešetřil.
URL: https://kam.mff.cuni.cz/~honza/cv1.htm
Speech title.
Graph Covers: Where Topology Meets Computer Science, and Simple Means Difficult
Michael Kaufmann
Universität Tübingen, Germany
Bio sketch.
Michael Kaufmann was born in August 1959 in Hasborn, Saarland, Germany. He received the Ph.D. degree from Universität des Saarlandes, Germany in 1987. He earned his habilitation from Universität des Saarlandes in 1992. Since 1993, he has been a professor in Universität Tuebingen, Germany. Before he was a professor in Universität Passau. He served as program committees in numerous conferences on theoretical computer science, including Symposium on Graph Drawing and Network Visualization (GD), European Symposium on Algorithms (ESA), and Workshop on Graphtheoretical Concepts in Computer Science (WG). He has been an editor of Journal of Graph Algorithms and Applications. His research interests include Algorithms and Complexity, Approximations, Combinatorial Optimization, Computational Geometry, Graph Drawing and Applications, Network Visualization, and Parallelism.
URL: http://www-pr.informatik.uni-tuebingen.de/?site=mitarbeiter/michaelkaufmann/index
Speech title.
The Family of Fan-planar Graphs