48th International Workshop on Graph-Theoretic Concepts in Computer Science

WG conferences aim to connect theory and applications by demonstrating how graph-theoretic concepts can be applied in various areas of computer science. The goal is to present recent results and to identify and explore directions for future research. The 48th edition of the International Workshop on Graph-Theoretic Concepts in Computer Science (WG2022) was held at Tübingen from June 22 to 24, 2022 with a reception on the evening of June 21. 

The venue was held as a hybrid conference with a limited number of on-site participants. For the on-site participants, masks were obligatory within the buildings according to the university regulations. We provided complementary medical masks on a daily base and voluntary self-tests at the welcome reception.

Aims And Scope

WG is mainly concerned with efficient algorithms of various types (e.g., sequential, parallel, distributed, randomized, parameterized) for problems on graphs and networks The goal is to present recent results and to identify and explore directions for future research. Submitted papers should describe original results in any aspects of graph theory related to computer science, including but not restricted to:

• design and analysis of sequential, parallel, randomized, parameterized algorithms
• distributed graph and network algorithms
• structural graph theory with algorithmic or complexity applications
• computational complexity of graph and network problems
• graph grammars, graph rewriting systems and graph modeling
• graph drawing and layouts
• computational geometry
• computational biology
• graph mining
• random graphs and models of the web and scale-free networks
• support of the above concepts by suitable implementations and applications.

Photo taken by M. Greiner

Sponsors