Dear colleagues and friends, Apologies for multiple copies received. Please distribute it to interested colleagues, students, and mailing lists. Lots of thanks for your great help! Sincerely, Hamamache Kheddouci ------------------------------------------------------------- C A L L F O R P A P E R S ------------------------------- The 2011 IEEE/WIC/ACM International Workshop on Graphs and Complex Object Matching (G-COM 2011) http://gcom2011.univ-lyon1.fr/ Conjointly with WI-IAT 2011 22 - 27 August 2011 Lyon France http://wi-iat-2011.org/ Objectives Applications such as digital libraries, mediation systems or architectures based on Web services produce huge amounts of data that lead to the generation of a large number of models that are to be stored and accessible by users (customers) by means of suitable query interfaces. These models which describe complex objects such as documents, business processes or ontologies related to specific areas of knowledge are usually represented by graphs. Most applications that handle such models use graph techniques such as the matching process to access data by exploring structural and semantic properties of these graphs. Furthermore, the graph matching is one of the known hard problems in graph theory and optimization. Several algorithms and heuristics have been developed for exact and inexact matchings, embedding and packing of graphs on general graphs and/or graph classes. The purpose of this workshop is to bring together different communities of academic and industrial researchers working on problems of matching of graph models. Discussions will be held on theoretical and applied aspects of these problems. Topics of interest include (but are not limited to): . Graph matching and Web service . Graph matching and ontologies . Graph matching and document matching (XML,.) . Graph matching and semantic Web . Graph matching and business process . Graph indexing . Graph mining . Graph embedding/packing . Graph isomorphism/homomorphism . Graph decomposition . Graph similarity measures . Tools for matching . Query languages for complex object discovery . Resource discovery and matching . Techniques and algorithms for information filtering and indexing . User profile matching for personalization . Matchings in bioinformatics, social networks,. . . Important dates: . Paper submission: March 21, 2011 . Notification of acceptance/rejection: June 1, 2011 . Camera-ready copy due: June 22, 2011 . Workshop: August 22, 2011 Submission: Papers reporting original and unpublished research results and experience are solicited. Papers will be selected based on their originality, timeliness, significance, relevance, and clarity of presentation. Accepted and presented papers will be published in the workshop proceedings. Submissions should include abstract, key words, the e-mail address of the corresponding author, and must not exceed 4 pages of two columns, including tables and figures. Submissions imply the willingness of at least one author to register, attend the workshop, and present the paper. Submissions to G-COM'2011 are conducted only electronically. Authors should upload their manuscripts in the PDF or DOC formats through the Submission page at http://wi-iat-2011.org/. Committees: Chair: Hamamache Kheddouci, Claude Bernard University, Lyon, France Program Committee: . Ahmed Awad, University of Potsdam, Germany . Terry Caelli, National ICT Australia (NICTA), Australia . Alfredo Cuzzocrea, University of Calabria, Italy . Remco Dijkman, Eindhoven University of Technology, Netherlands . Michel Habib, University of Paris Diderot - Paris7, France . Su-Cheng Haw, Multimedia University, Malaysia . Marcello Pelillo, Ca' Foscari University of Venice, Italy . Sherif Sakr, National ICT Australia (NICTA), Australia . Ansaf Salleb-Aouissi, Columbia University, USA . Eric Sopena, Bordeaux University, France . Xifeng Yan, University of California, USA . Michele Zito, University of Liverpool, UK