Methods, challenges, and applications ... planarity always strikes back!

Description and goals | Schedule | Speakers | Organizers

speakersGiuseppe Di Battista is a Full Professor of computer science. He received the Ph.D. in computer science from the University of Rome “La Sapienza” and is currently a faculty member in the department of engineering at Roma Tre University. His current research interests include computer networks, graph drawing, and information visualization. He has published more than 200 papers in the above areas and has given several invited lectures worldwide. He is one of the authors of a book by Prentice Hall on graph drawing. He served and chaired program committees of international symposiums and is editor and guest editor of international journals. He is a founding member of the steering committee for the International Symposium on Graph Drawing.

speakers Walter Didimo is an Associate Professor of computer engineering at the University of Perugia. He received his PhD in computer engineering from the University of Rome “La Sapienza” in 2000. His research interests include graph drawing, network visualization, algorithm engineering, and computational geometry. He co-chaired the International Symposium on Graph Drawing (GD) and the European Workshop on Computational Geometry in 2012. He served in the steering committee of GD for six years, and since 2006 he co-organizes the annual “BICI Workshop on Graph Drawing”, an international event that takes place at the residential-university center of Bertinoro, in Italy.

speakersVida Dujmovińá is a Croatian-Canadian computer scientist and mathematician known for her research in graph theory and graph algorithms, and particularly for graph drawing, for the structural theory of graph width parameters including treewidth and queue number, and for the use of these parameters in the parameterized complexity of graph drawing. She is an associate professor of electrical engineering & computer science at the University of Ottawa.

speakers Ignaz Rutter is a Professor at the University of Passau. He obtained his PhD from the Karlsruhe Institute of Technology in 2011. After that we was a postdoctoral researcher at the same University and at Charles University in Prague. He further was a stand-in professor at Frankfurt University in 2016 and from 2016 to 2018 he was an Assistant Professor at TU Eindhoven. Since 2018 he holds the Chair of Theoretical Computer Science at the University of Passau. His research focus lies on algorithmic and combinatorial problems in the areas of Graph Drawing, Graph Theory, and Computational Geometry.