Spatio-temporal Networks: Modeling, Storing, and Querying Temporally-Detailed Roadmaps - Space-Time Integration in Geography and GIScience - page 102

Chabini, I., & Lan, S. (2002). Adaptations of the A* algorithm for the computation of fastest
paths in deterministic discrete-time dynamic networks. IEEE Transactions on Intelligent
Transportation Systems, 3 (1), 60-74.
Christakos, G., Bogaert, P., & Serre, M. (2001). Temporal GIS: Advanced functions for field-based
applications . New York: Springer.
Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2001). Introduction to algorithms .
Cambridge, MA: MIT Press.
Dehne, F., Omran, M. T., & Sack, J.-R. (2009). Shortest paths in time-dependent FIFO networks
using edge load forecasts. In Proceedings of the second international workshop on computa-
tional transportation science, IWCTS'09 (pp. 1-6). New York, NY: ACM.
Delling, D. (2008). Time-dependent SHARC-routing. In Proceedings of the 16th annual European
symposium on algorithms, ESA'08 (pp. 332-343). Berlin/Heidelberg: Springer.
Delling, D., & Wagner, D. (2007). Landmark-based routing in dynamic graphs. In Experimental
algorithms (pp. 52-65). Berlin/Heidelberg: Springer.
Demiryurek, U., Banaei-Kashani, F., & Shahabi, C. (2010). A case for time-dependent shortest path
computation in spatial networks. In Proc. of the ACM SIGSPATIAL Intl. Conf. on Advances in
GIS, GIS'10 (pp. 474-477).
Demiryurek, U., Banaei-Kashani, F., Shahabi, C., & Ranganathan, A. (2011). Online computation
of fastest path in time-dependent spatial networks. In Advances in spatial and temporal
databases . LNCS 6849 (pp. 92-111). Berlin/Heidelberg: Springer.
Deutsch, C. (2007). UPS embraces high-tech delivery methods . www.nytimes.com/2007/07/12/
business/12ups.html
DiBiase, D., MacEachren, A., Krygier, J., & Reeves, C. (1992). Animation and the role of map
design in scientific visualization. Cartography and Geographic Information Science, 19 (4),
201-214.
Dijkstra, E. (1959). A note on two problems in connexion with graphs. Numerische Mathematik,
1 (1), 269-271.
Ding, B., Yu, J., & Qin, L. (2008). Finding time-dependent shortest paths over large graphs. In
Proceedings of the 11th international conference on Extending database technology: Advances
in database technology (pp. 205-216). New York: ACM.
Dreyfus, S. (1969). An appraisal of some shortest path algorithms. Operations Research, 17 ,
395-412.
Egenhofer, M., & Golledge, R. (1998). Spatial and temporal reasoning in geographic information
systems . New York: Oxford University Press.
Ford, L., & Fulkerson, D. (1958). Constructing maximal dynamic flows from static flows.
Operations Research, 6 (3), 419-433.
Ford, L., & Fulkerson, D. (1962). Flows in networks . Princeton: Princeton University Press.
Francis, R. L., & Chalmet, L. G. (1984). A negative exponential solution to an evacuation
problem (Technical Report Research Report No. 84-86) Washington, DC: National Bureau
Of Standards, Center for Fire Research.
Frank, A. (2003). 2: Ontology for spatio-temporal databases. Lecture Notes in Computer Science,
2520 ,9.
Frank, A., Grumbach, S., Güting, R., Jensen, C., Koubarakis, M., Lorentzos, N., Manolopoulos,
Y., Nardelli, E., Pernici, B., Schek, H., et al. (1999). Chorochronos: A research network for
spatiotemporal database systems. ACM SIGMOD Record, 28 (3), 12-21.
Galton, A., & Worboys, M. (2005). Processes and events in dynamic geo-networks. Lecture Notes
in Computer Science, 3799 , 45.
George, B. & Shekhar, S. (2006). Time-aggregated graphs for modeling spatio-temporal networks.
In Advances in conceptual modeling - Theory and practice (pp. 85-99). Berlin/Heidelberg:
Springer.
George, B., & Shekhar, S. (2007a, November). Modeling spatio-temporal network computations -
A summary of results. In Proceedings of second international conference on GeoSpatial
Semantics (GeoS 2007), Mexico City, Mexico.