WG 2011 - 37th Workshop on Graph-Theoretic Concepts in Computer Science

Aims and Scope

WG 2011 aims at uniting theory and practice by demonstrating how Graph-Theoretic concepts can be applied to various areas in Computer Science, or by extracting new problems from applications. The goal is to present recent research results and to identify and explore directions of future research. The conference is well-balanced with respect to established researchers and young scientists. The proceedings will be published in the LNCS series of Springer-Verlag. We need the final version of accepted papers approximately two months after the conference.

Submitted papers should describe original results in any aspects and areas of Graph Theory in Computer Science, including but not restricted to e.g. structural graph theory, sequential, parallel, randomized, parameterized, and distributed graph and network algorithms and their complexity, graph grammars and graph rewriting systems, graph-based modeling, graph-drawing and layout, random graphs, diagram methods, and support of these concepts by suitable implementations. The scope of WG includes all applications of graph-theoretic concepts in Computer Science, including data structures, data bases, programming languages, computational geometry, tools for software construction, communications, computing on the web, models of the web and scale-free networks, mobile computing, concurrency, computer architectures, VLSI, artificial intelligence, graphics, CAD, operations research, and pattern recognition.

At least one author of every accepted submission is supposed to register and present the paper at the conference.

The conference will take place in the premises of a Premonstrate Monastery in Teplá in West Bohemia, June 21. ? 23. 2011.

Best Student Paper Award

A prize will be awarded to the author(s) of the best student-authored paper (or split between more than one paper if there is a tie). A paper is eligible if all of its authors are full-time students at the time of submission.