Since 1975, WG conferences aim to connect theory and applications by demonstrating how graph-theoretic concepts can be applied in various areas of computer science. As such 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. Work presented at WG describes 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.