WG 2009

Deadlines

2009-03-01

1 Mar 2009

Submission

Venue

Montpellier, France

Loading map...

{"minzoom":false,"maxzoom":false,"mappingservice":"leaflet","width":"auto","height":"350px","centre":false,"title":"","label":"","icon":"","lines":[],"polygons":[],"circles":[],"rectangles":[],"copycoords":false,"static":false,"zoom":false,"defzoom":14,"layers":["OpenStreetMap"],"image layers":[],"overlays":[],"resizable":false,"fullscreen":false,"scrollwheelzoom":true,"cluster":false,"clustermaxzoom":20,"clusterzoomonclick":true,"clustermaxradius":80,"clusterspiderfy":true,"geojson":"","clicktarget":"","imageLayers":[],"locations":[{"text":"","title":"","link":"","lat":43.6112422,"lon":3.8767337,"icon":""}],"imageoverlays":null}

Warning: Venue is missing. The map might not show the exact location.

WG 2009 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. For many years now, the proceedings have been published in the LNCS series of Springer-Verlag. We need the final version of accepted papers approximately two months after the conference.

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 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. 

Program committee

    * Hans L. Bodlaender (Universiteit Utrecht, The Netherlands)
    * Andreas Brandstädt (University of Rostock, Germany)
    * Leizhen Cai (The Chinese University of Hong Kong, China )
    * Feodor F. Dragan (Kent State University, USA)
    * Jiří Fiala (Charles University, Prague, Czech Republic)
    * Michel Habib - Co-chair (LIAFA, Université Paris-Diderot, Paris, France)
    * Pinar Heggernes (University of Bergen, Norway)
    * Michael Kaufmann (Universität Tübingen, Germany)
    * Dieter Kratsch (University of Metz, France)
    * Alberto Marchetti Spaccamela (Università di Roma La Sapienza, Italy)
    * Ernst Wilhelm Mayr (Technische Universität München, Germany)
    * Ross McConnell (Colorado State University, United States of America)
    * Haiko Müller (University of Leeds, United Kingdom)
    * Rolf Niedermeier (Friedrich-Schiller-Universität Jena, Germany)
    * Sang-Il Oum (KAIST, Republic of Korea)
    * Christophe Paul - Co-chair (CNRS - LIRMM - Université de Montpellier 2, France)
    * Dimitrios M. Thilikos (National and Kapodistrian University of Athens, Greece)
    * Ioan Todinca (LIFO - Université d'Orléans, France)
    * Bernhard Westfechtel (Universität Bayreuth, Germany) 

Organizing committee

    * Stéphane Bessy
    * Jean Daligault
    * Philippe Gambette
    * Émeric Gioan
    * Daniel Gonçalves
    * Chistophe Paul (Chair)
    * Anthony Perez
    * Alexandre Pinlou
    * Stéphan Thomassé 
	

This CfP was obtained from WikiCFP