Symposium on Graph-Based Representation in Computer Science

À déterminer

1 external speakers from Switzerland 1 external speaker from Europe

Graph-based data representation allow us to describe both properties and (binary) relationships among different parts of the underlying data, or arrangement of data. Moreover, graphs are not constrained to a fixed size, i.e., the number of nodes and edges is not limited a priori but can be adapted to the size and the complexity of each individual data object. Due to their power and flexibility, graphs have found widespread application in computer science. Prominent examples of data where graphs turn out to be appropriate representation formalisms are, for instance, chemical compounds, text documents, images, source code, protein structures, networks (e.g., it-, social-, or water-networks), and many others. The overarching goal of this symposium is to bring together PhD students and other interested researchers who are doing some form of research with graphs as the underlying data structure. We plan that the symposium will give participating PhD students a platform to present their current research projects, e.g. in a poster session or in the form of short oral presentations (the form depends strongly on the number of registrations). Each oral presentation might be concluded with a moderated question and discussion session. Two talks by renowned experts in the field of graph-based data analysis will frame the general exchange among peers. The symposium will generate new insights for the PhD’s own research and - in the best case - the exchange will lead to new collaborations (e.g. exchange of methods, data, or algorithms)

UNIBE

15