GRAPHITE 2012
First Workshop on GRAPH Inspection and Traversal Engineering
March 31-April 1, 2012, Tallinn, Estonia
(affiliated with ETAPS 2012)
http://www.win.tue.nl/~awijs/graphite2012
IMPORTANT DATES
January 11, 2012, Submission deadline (EXTENDED!)
January 25, 2012, Notification of acceptance/rejection
February 5, 2012, Camera ready copy for local proceedings
June 30, 2012, Camera ready copy for (final) post-proceedings
March 31-April 1, 2012, Workshop dates
SCOPE
The main theme of the GRAPHITE workshop is graph search in all its forms in computer science. Graph search algorithms tend to have common characteristics, such as duplicate detection, independent of their application domain. Over the past few years, it has been shown that the scalability of such algorithms can be dramatically improved by using, e.g., external memory, by exploiting parallel architectures, such as clusters, multi-core CPUs, and graphics processing units, and by using heuristics to guide the search. The goal of this event is to gather scientists from different communities, such as model checking, artificial intelligence planning, game playing, and algorithm engineering, who do research on graph search algorithms, such that awareness of each others' work is increased.
The workshop will be held as a satellite event of ETAPS 2012, the 15th edition of The European Joint Conferences on Theory and Practice of Software (ETAPS). ETAPS is a primary European forum for academic and industrial researchers working on topics relating to Software Science.
WORKSHOP SPECIFIC TOPICS
We encourage submission of works which include but are not limited to the following topics (a more detailed list can be found on the workshop webpage):
* Algorithms for the verification of hardware and software based on graph exploration
* Application of graph based verification techniques to artificial intelligence problems
* Techniques for dealing with potentially infinite graphs and infinite families of graphs
* Innovative or otherwise particularly significant case studies of applications of graph based methods
* Theoretical results on the limits and possibilities of graph based methods
* Parallel algorithms for graph exploration for distributed and shared memory systems (e.g. clusters, multi-core CPUs, GPGPUs)
* Graph algorithms in artificial intelligence; planning; game playing; social network analysis; biological network analysis, and similar
* I/O Efficient algorithms for graph exploration using external memory
Preliminary papers, papers on applications, and papers bridging multiple application domains are strongly encouraged.
SOLICITED CONTRIBUTIONS
The submitted papers should contain original work which has not been submitted or accepted for publication elsewhere. Submissions should adhere to the EPTCS format and should be no longer than 15 pages. All accepted papers will be included in the workshop proceedings.
We solicit two kinds of papers:
*Technical Papers no longer than 15 pages. All accepted technical papers will be included in the proceedings.
*Tool Presentations. This kind of submission should consist of two parts. The first part is at most a 5 page description of the tool. If accepted, this part will be published in the workshop proceedings. The second part should describe an informal plan for an oral presentation of the tool. This part will not be included in the proceedings.
SUBMISSION AND PUBLICATION
Submission can be done via the Easy Chair web-based conference management
system. (Follow the link from the workshop web page.) All papers will be peer reviewed.
The proceedings will appear in the Electronic Proceedings in Theoretical Computer Science (EPTCS) as post-proceedings.
ORGANISATION
Anton Wijs (Eindhoven University of Technology, Netherlands)
Dragan Bosnacki (Eindhoven University of Technology, Netherlands)
Stefan Edelkamp (University of Bremen, Germany)
PROGRAM COMMITTEE
David A. Bader (Georgia Tech, USA)
Jiri Barnat (Masaryk University, Czech Republic)
Dragan Bosnacki (Eindhoven University of Technology, The Netherlands)
Gene Cooperman (College of Computer and Information Science, USA)
Martin Dietzfelbinger (Ilmenau University of Technology, Germany)
Alastair Donaldson (Imperial College London, UK)
Stefan Edelkamp (University of Bremen, Germany)
Malte Helmert (University of Freiburg, Germany)
Gerard Holzmann (NASA / Jet Propulsion Laboratory, USA)
Riko Jacob (Technische Universitaet Munchen, Germany)
Peter Kissmann (Technologie-Zentrum Informatik und Informationstechnik, Bremen, Germany)
Stefan Leue (University of Konstanz, Germany)
Alberto Lluch Lafuente (IMT Institute for Advanced Studies Lucca, Italy)
Radu Mateescu (INRIA Rhone-Alpes, France)
Ulrich Meyer (Goethe University Frankfurt am Main, Germany)
Wheeler Ruml (University of New Hampshire, USA)
Theo Ruys (RUwise, The Netherlands)
Peter Sanders (Karlsruhe Institute of Technology, Germany)
Stefan Schwoon (LSV, CNRS and ENS de Cachan, France)
Carsten Sinz (Karlsruhe Institute of Technology, Germany)
Nathan Sturtevant (University of Denver, USA)
Mohammad Torabi Dashti (ETH Zurich, Switzerland)
Enrico Tronci (Universita di Roma, Italy)
Jaco van de Pol (University of Twente, The Netherlands)
Anton Wijs (Eindhoven University of Technology, The Netherlands)
Philipp Woelfel (University of Calgary, Canada)
Rong Zhou (Intelligent Systems Laboratory, USA)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
