43rd International Workshop on Graph-Theoretic Concepts in Computer Science.
Aims and Scope
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. 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 modeling,
- graph drawing and layouts,
- computational geometry,
- computational biology,
- random graphs and models of the web and scale-free networks, and
- support of these concepts by suitable implementations and applications.
Best Paper Award and Best Student Paper Award
Thanks to a generous donation by Springer Verlag, WG 2017 is able to offer awards of 500 euro for the best paper and the best student paper. The awards will be decided by the program committee. The committee can decide to split the award(s) over multiple papers. Papers eligible for the best student paper can have non-student co-authors, but the main work in a paper that is a candidate for the best student paper award must be done by co-authors that were students at the time of submission, and the award can be received only by such co-authors. It must be indicated at the time of submission whether a paper is candidate for this award.
For more information visit the WG 2017 website.