Second Workshop on GRAPH Inspection and Traversal Engineering
March 24, 2013, Rome, Italy
(affiliated with ETAPS 2013)
Final Call for Papers - Extended Deadline
The topic of the GRAPHITE workshop is graph analysis in all its forms in computer science.
Graphs are used to represent data in many application areas, and they are subjected to
various computational algorithms in order to acquire the desired information. These graph
algorithms tend to have common characteristics, such as duplicate detection to guarantee
their termination, 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. Novel
techniques to further scale graph search algorithms, and new applications of graph search
are within the scope of this workshop. Another topic of interest of the event is more
related to the structural properties of graphs: which kind of graph characteristics are
relevant for a particular application area, and how can these be measured? Finally, any
novel way of using graphs for a particular application area is on topic. 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 2013, the
16-th 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:
* Algorithms for the verification of hardware and software based on graph exploration
(e.g. the computation of an explicit state space based on an implicit description)
* Application of graph based techniques originating in one application domain, applied on
a problem in another domain (e.g. verification algorithms on artificial intelligence problems)
* Techniques to deal with potentially infinite graphs and infinite families of graphs
* Innovative or otherwise particularly significant case studies of applications of graph based
* 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
* Graph minimisation and abstraction techniques as a preprocessing step for analysis (e.g.
bisimulation reduction, transitive reduction)
* Computation on graphs through graph transformation techniques
* I/O Efficient graph algorithms using external memory
Papers on applications and papers bridging multiple application domains are strongly encouraged.
The submitted papers should contain original work which has not been
submitted or accepted for publication elsewhere. Submissions should
adhere to the EPTCS format. 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
The proceedings will likely appear in
the Electronic Proceedings in Theoretical Computer Science (EPTCS)
January 13, 2013, New submission deadline
January 24, 2013, Notification of acceptance/rejection
February 13, 2013, Camera ready copy for local proceedings
March 24, 2013, Workshop
Anton Wijs (Eindhoven University of Technology, Netherlands)
Dragan Bosnacki (Eindhoven University of Technology, Netherlands)
Stefan Edelkamp (University of Bremen, Germany)
Henri Bal (VU University Amsterdam, The Netherlands)
Dragan Bosnacki (Eindhoven University of Technology, The Netherlands) (co-chair)
Alastair Donaldson (Imperial College London, England)
Stefan Edelkamp (University of Bremen, Germany) (co-chair)
Ansgar Fehnker (The University of the South Pacific, Fiji)
Wan Fokkink (VU University Amsterdam, The Netherlands)
Keijo Heljanko (Aalto University, Finland)
Gerard Holzmann (NASA / Jet Propulsion Laboratory, USA)
Gunnar Klau (Centrum Wiskunde & Informatica, The Netherlands)
Juan de Lara (Universidad Autónoma de Madrid, Spain)
Stefan Leue (University of Konstanz, Germany)
Ulrich Meyer (Goethe University Frankfurt am Main, Germany)
Jun Pang (Université du Luxembourg, Luxembourg)
David Parker (University of Birmingham, England)
Arend Rensink (University of Twente, The Netherlands)
Anton Wijs (Eindhoven University of Technology, The Netherlands) (co-chair)
* Contributions to be spread via DMANET are submitted to
* 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)