Call for Papers
More information will follow later.
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, and 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 modelling
- graph drawing and layouts,
- computational geometry
- computational biology
- random graphs and models of the web and scale-free networks
- support of the above concepts by suitable implementations and applications