The aim of this workshop called Large-Scale Time Dependent Graphs (TD-LSG) is to bring together active scholars and practitioners of dynamic graphs. Graph models and algorithms are ubiquitous of a large number of application domains, ranging from transportation to social networks, semantic web, or data mining. However, many applications require graph models that are time dependent. For example, applications related to urban mobility analysis employ a graph structure of the underlying road network. Indeed, the nature of such networks are spatiotemporal. Therefore, the time a moving object takes to cross a path segment typically depends on the starting instant of time. So, we call time-dependent graphs, the graphs that have this spatiotemporal feature.

Important dates:

  • Abstract Submission Deadline: Monday, July 10, 2017 (extended)
  • Paper Submission Deadline: Monday, July 10, 2017 (extended)
  • Author Notification: Monday, July 24, 2017
  • Camera Ready Deadline: Monday, August 7, 2017

Useful links:

Accepted papers

  • Karim Alami, Radu Ciucanu and Engelbert Mephu Nguifo. Synthetic Graph Generation from Finely-Tuned Temporal Constraints
  • Rohit Kumar and Toon Calders. Finding simple temporal cycles in an interaction network
  • Ali Masri, Karine Zeitouni and Zoubida Kedad. Discovering Connections in Heterogeneous Transportation Datasets with Link++
  • Lívia Almada Cruz, Francesco Lettich, Leopoldo Soares Júnior, Regis Pires Magalhães and José Antônio Fernandes de Macedo. Finding the Nearest Service Provider on Time-Dependent Road Networks
  • Abdelfattah Idri, Mariyem Oukarfi, Azedine Boulmakoul and Karine Zeitouni. Design and implementation issues of a time-dependent shortest path algorithm for multimodal transportation network
  • Wissem Inoubli, Livia Almada, Ticiana Linhares, Gustavo Coutinho, Lucas Peres, Regis Pires Magalhães, Jose Antonio F. de Macedo, Sabeur Aridhi and Engelbert Mephu Nguifo. A Distributed Framework for Large-Scale Time-Dependent Graph Analysis

Workshop Program