Jean-Claude Latombe

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Kincho H. Law

> Home > Persons > Jean-Claude Latombe

Publications

2015
[j57]
- view
  authority control:
- export record
  dblp key:
  - journals/ais/ChuPLL15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ais/ChuPLL15
Mei Ling Chu, Paolo Parigi, Jean-Claude Latombe, Kincho H. Law:
Simulating effects of signage, groups, and crowds on emergent evacuation patterns. AI Soc. 30(4): 493-507 (2015)
[j56]
- view
  authority control:
- export record
  dblp key:
  - journals/simulation/ChuPLL15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/simulation/ChuPLL15
Mei Ling Chu, Paolo Parigi, Kincho H. Law, Jean-Claude Latombe:
Simulating individual, group, and crowd behaviors in building egress. Simul. 91(9): 825-845 (2015)
2014
[j55]
- view
  authority control:
- export record
  dblp key:
  - journals/jvca/ChuPLL14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jvca/ChuPLL14
Mei Ling Chu, Paolo Parigi, Kincho H. Law, Jean-Claude Latombe:
Modeling social behaviors in an evacuation simulator. Comput. Animat. Virtual Worlds 25(3-4): 375-384 (2014)
2002
[j36]
- view
  authority control:
- export record
  dblp key:
  - journals/aei/HanLLK02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/aei/HanLLK02
Charles S. Han, Kincho H. Law, Jean-Claude Latombe, John C. Kunz:
A performance-based approach to wheelchair accessible route analysis. Adv. Eng. Informatics 16(1): 53-71 (2002)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.