Date : 2026-06-05
Lieu : Bengaluru, India
===========================================================
GRADES-NDA 2026
9th Joint Workshop on
Graph Data Management Experiences & Systems (GRADES)
and
Network Data Analytics (NDA)
Collocated with SIGMOD/PODS 2026
Bengaluru, India
Workshop Date: 5 June 2026
===========================================================
Paper Abstract Submission: March 8, 2026
Full Paper Submission: March 15, 2026
https://gradesnda.github.io/
===========================================================
GRADES-NDA 2026 Call for Papers
===========================================================
The GRADES-NDA workshop explores the challenges, application areas, and usage scenarios of managing large-scale graph-shaped data. It provides a forum for exchanging ideas on mining, querying, and learning from real-world network data, fostering interdisciplinary collaboration, and sharing datasets and benchmarks.
GRADES-NDA brings together researchers from academia, industry, and government to discuss advances in large-scale graph data management and analytics. Its scope covers domain-specific challenges, noise handling in real-world graphs, and innovations in databases, data mining, machine learning, data streaming, network science, and graph algorithms. Case studies across diverse areas are welcome, including Social Networks, Business Analytics, Healthcare, and Cybersecurity.
==> Submission Guidelines
– All papers must be original and not simultaneously submitted to another journal or conference.
– Submissions must follow the latest 2-column ACM Primary Article Template (Overleaf template: https://www.overleaf.com/latex/templates/association-for-computing-machinery-acm-sig-proceedings-template/bmvfhcdnxfty).
– Submissions have to be *anonymous*.
– The following paper categories are welcome:
* Archival: Accepted papers under this category will be published by the ACM, indexed by DBLP, and will be available in the ACM DL.
** Full papers should be a maximum of 8 pages in length, excluding references and appendix.
** Case studies should be a maximum of 4 pages in length, excluding references and appendix.
** Short papers and demonstration papers should be a maximum of 4 pages in length, excluding references and appendix.
* Non-archival: Accepted papers under this category will not be published in the workshop proceedings, but will only be listed on the workshop website.
** Papers that are suitable for this category are Work-in-progress papers presenting early results. These papers should be a maximum of 4 pages in length, excluding references and appendix.
* [NEW!] This year we are also excited to introduce a Best Paper Award to recognize outstanding contributions to the field!
==> List of Topics
The topics of interest include but are not limited to the following:
– Graph modeling and processing – advances in representing, visualizing, storing, indexing, querying, and managing graph data.
– Graph query languages, visualization, and querying interfaces – design, usability, practical implementations, and use cases.
– Knowledge Graphs – construction, augmentation, reasoning, and neuro-symbolic approaches.
– GenAI techniques – integration of Knowledge Graphs and LLMs for information retrieval, question answering, knowledge inference, and natural language understanding.
– Graph processing platforms – including Titan, Giraph, GraphChi, SPARK/GraphX, GraphLab/PowerGraph, and others.
– Human-centric graph processing – interactive approaches for graph data exploration, querying, and analytics.
– Reliable graph data processing – validation and verification techniques for ensuring the trustworthiness of algorithms, query languages, applications, and systems.
– Graph metrics – methods for measuring graph characteristics, e.g., diameter, eigenvalues, triangle counting.
– Spatial and temporal graph analytics – updates, dynamic graphs, streaming analytics, evolution tracking, point-of-interest recommendation, community structure detection, etc.
– Graph mining and machine learning – including heterogeneous networks and knowledge graphs.
– Graph summarization and sampling – efficient methods for large-scale data.
– Noisy and uncertain graphs – analytics on incomplete, inconsistent, or unreliable data.
– Network dynamics – game theory, social contagion, and information propagation.
– Domain-specific graph analytics – applications in social networks, biology, business, finance, healthcare, transportation, etc.
– Vision and systems papers – potential or real applications of graph management, especially in the era of large language models.
==> Important Dates
– Abstract Submission: March 8, 2026
– Paper Submission: March 15, 2026
– Notifications: April 13, 2026
– Camera Ready Submission: April 26, 2026
– Workshop Date: June 5, 2026
All deadlines are 23:59 AoE.
==> Student Travel Awards
Thanks to the generous support from our sponsors, we will provide scholarship awards to selected students attending the SIGMOD/PODS conference. The scholarships will include financial support to partially cover the expense for traveling and conference registrations. Awardees are expected to register for the event and will have to make their own arrangements for travel and accommodation. Students whose advisors cannot provide financial support to attend the conference will be given priority. Additionally, students corresponding to underrepresented groups in the SIGMOD community will be given priority to increase diversity.
==> Committees
– Workshop Organizers
* Akhil Arora (akhil.arora@cs.au.dk), Aarhus University & Copenhagen Center for Social Data Science, Denmark
* Stefania Dumbrava (stefania.dumbrava@ensiie.fr), ENSIIE & INRIA Paris & Télécom SudParis, France
– Steering Committee
* Olaf Hartig, Amazon Web Services & Linköping University, Sweden
* Semih Salihoglu, University of Waterloo, Canada
* Vasiliki Kalavri, Boston University, US
* George Fletcher, TU Eindhoven, The Netherlands
– Program Committee
* Renzo Angles, Universidad de Talca, Chile
* Amitabha Bagchi, Indian Institute of Technology Delhi, India
* Kaustubh Beedkar, Indian Institute of Technology Delhi, India
* James Clarkson, Neo4j, USA
* Juan A. Colmenares, Microsoft Fabric Graph, USA
* Sourav Dutta, Huawei Research Center, UK
* Russ Harmer, Ecole Normale Supérieure de Lyon, France
* Adriana Iamnitchi, Maastricht University, The Netherlands
* Vasiliki Kalavri, Boston University, USA
* Panos Kalnis, King Abdullah University of Science and Technology, Saudi Arabia
* Meike Klettke, Universität Regensburg, Germany
* Silviu Maniu, Université Grenoble Alpes, LIG, CNRS, France
* Ioana Manolescu, INRIA, Institut Polytechnique de Paris, France
* Victor Marsault, Université Gustave Eiffel, CNRS, LIGM, France
* Andrea Mauri, Université Lyon 1, LIRIS, CNRS, France
* Amine Mhedhbi, Polytechnique Montréal, Canada
* Makoto Onizuka, University of Osaka, Japan
* Marcus Paradies, Ludwig-Maximilians-Universität München, Germany
* Matei Ripeanu, University of British Columbia, Canada
* Alexandra Rogova, Uniwersytet Warszawski, Poland
* Semih Salihoglu, University of Waterloo, Kùzu, Canada
* Hiroaki Shiokawa, University of Tsukuba, Japan
* Petra Selmer, Bloomberg, UK
* Genoveva Vargas-Solar, Université Lyon 1, LIRIS, CNRS, France
* Hannes Voigt, Neo4j, Germany
* Yinghui Wu, Case Western Reserve University, USA
* Nikolay Yakovets, Eindhoven University of Technology, The Netherlands
* Chao Zhang, University of Waterloo, Canada
All questions about submissions should be emailed to grades-nda@googlegroups.com
==> Venue
The workshop will be co-located with SIGMOD/PODS at the Sheraton Grand Bengaluru Whitefield Hotel & Convention Center.
==> Further Information
More information, including our fantastic program committee, exciting keynote speakers, and submission guidelines, can be found on the workshop website: https://gradesnda.github.io/
Notre site web : www.madics.fr
Suivez-nous sur Tweeter : @GDR_MADICS
Pour vous désabonner de la liste, suivre ce lien.