Friday
Saturday
The workshop 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 workshop is well-balanced w.r.t. established researchers and young scientists. For many years now, the proceedings have been published in the LNCS series of Springer-Verlag. Accepted papers in final form will be due approximately one month after the workshop.
Papers are solicited describing original results on all aspects of graph-theoretic concepts in Computer Science, e.g. structural graph theory, sequential, parallel, and distributed graph and network algorithms and their complexity, graph grammars and graph rewriting systems, graph-based modeling, graph-drawing and layout, diagram methods, and support of these concepts by suitable implementations. The scope of the workshop includes all applications of graph-theoretic concepts in Computer Science, including data structures, data bases, programming languages, 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.