References
- Agarwal, P. K., Avraham, R. B., Kaplan, H., and Sharir, M. (2014), “Computing the Discrete Fréchet Distance in Subquadratic Time,” SIAM Journal on Computing, 43, 156–167.
- Apaydin, M. S., Brutlag, D. L., Guestrin, C., Hsu, D., Latombe, J.-C., and Varma, C. (2003), “Stochastic Roadmap Simulation: An Efficient Representation and Algorithm for Analyzing Molecular Motion,” Journal of Computational Biology, 10, 257–281.
- Butler, K., Farley, T., Mcdaniel, P., and Rexford, J. (2010), “A Survey of bgp Security Issues and Solutions,” Proceedings of the IEEE, 98, 100–122.
- Cáceres, J., Márquez, A., Oellermann, O. R., and Puertas, M. L. (2005), “Rebuilding Convex Sets in Graphs,” Discrete Mathematics, 297, 26–37.
- Carrillo, H., and Lipman, D. (1988), “The Multiple Sequence Alignment Problem in Biology,” SIAM Journal on Applied Mathematics, 48, 1073–1082.
- Eiter, T., and Mannila, H. (1994), “Computing Discrete Fréchet Distance,” Technical Report CD-TR 94/64, Information Systems Department, Technical University of Vienna.
- Evans, M. R., Oliver, D., Shekhar, S., and Harvey, F. (2012), “Summarizing Trajectories Into k-primary Corridors: A Summary of Results,” in Proceedings of the 20th International Conference on Advances in Geographic Information Systems, pp. 454–457.
- ——— (2013), “Fast and Exact Network Trajectory Similarity Computation: A Case-study on Bicycle Corridor Planning,” in Proceedings of the 2nd ACM SIGKDD International Workshop on Urban Computing, ACM, pp. 9.
- Freeman, L. C. (1977), “A Set of Measures of Centrality Based on Betweenness,” Sociometry, 40, 35–41.
- Fruchterman, T. M. J., and Reingold, E. M. (1991), “Graph Drawing by Force-directed Placement,” Software: Practice and Experience, 21, 1129–1164.
- Genton, M. G., Johnson, C., Potter, K., Stenchikov, G., and Sun, Y. (2014), “Surface Boxplots,” Stat Journal, 3, 1–11.
- Gibson, H., Faith, J., and Vickers, P. (2013), “A Survey of Two-Dimensional Graph Layout Techniques for Information Visualisation,” Information Visualization, 12, 324–357.
- Haklay, M., and Weber, P. (2008), “Openstreetmap: User-Generated Street Maps,” IEEE Pervasive Computing, 7, 12–18.
- He, R. R., Liu, H. X., and Kornhauser, A. L. (2002), “Temporal and Spatial Variability of Travel Time,” Paper UCI-ITS-TS-02, 14, Center for Traffic Simulation Studies.
- Hua, M., and Pei, J. (2010), “Probabilistic Path Queries in Road Networks: Traffic Uncertainty Aware Path Selection,” in Proceedings of the 13th International Conference on Extending Database Technology, pp. 347–358.
- Just, W. (2001), “Computational Complexity of Multiple Sequence Alignment with Sp-score,” Journal of Computational Biology, 8, 615–623.
- Kharrat, A., Popa, I. S., Zeitouni, K., and Faiz, S. (2008), “Clustering Algorithm for Network Constraint Trajectories,” in Headway in Spatial Data Handling, New York: Springer, pp. 631–647.
- Liu, R. Y. (1990), “On a Notion of Data Depth Based on Random Simplices,” The Annals of Statistics, 18, 405–414.
- López-Pintado, S., and Romo, J. (2009), “On the Concept of Depth for Functional Data,” Journal of the American Statistical Association, 104, 718–734.
- López-Pintado, S., Sun, Y., Lin, J., and Genton, M. (2014), “Simplicial Band Depth for Multivariate Functional Data,” Advances in Data Analysis and Classification, 8, 1–18.
- Mirzargar, M., Whitaker, R., and Kirby, R. (2014), “Curve Boxplot: Generalization of Boxplot for Ensembles of Curves,” IEEE Transactions on Visualization and Computer Graphics, 20, 2654–2663.
- Molnár, M., and Marie, R. (2011), “Stability Oriented Routing in Mobile ad hoc Networks Based on Simple Automatons,” in Mobile Ad-Hoc Networks: Protocol Design, ed. X Wang, Rijeka, Croatia: Intech, pp. 363–390.
- Needleman, S. B., and Wunsch, C. D. (1970), “A General Method Applicable to the Search for Similarities in the Amino Acid Sequence of Two Proteins,” Journal of Molecular Biology, 48, 443–453.
- Pelayo, I. M. (2014), Geodesic Convexity in Graphs (Springer Briefs in Mathematics), New York: Springer.
- Sun, Y., and Genton, M. G. (2012), “Adjusted Functional Boxplots for Spatio-Temporal Data Visualization and Outlier Detection,” Environmetrics, 23, 54–64.
- Tukey, J. W. (1977), Exploratory Data Analysis. Behavioral Science: Quantitative Methods, Boston: Addison-Wesley.
- Von Landesberger, T., Kuijper, A., Schreck, T., Kohlhammer, J., Van Wijk, J., Fekete, J.-D., and Fellner, Dieter, W. (2011), “Visual Analysis of Large Graphs: State-of-the-Art and Future Research Challenges,” Computer Graphics Forum, 30, 1719–1749.
- Whitaker, R. T., Mirzargar, M., and Kirby, R. M. (2013), “Contour Boxplots: A Method for Characterizing Uncertainty in Feature Sets from Simulation Ensembles,” IEEE Transactions on Visualization and Computer Graphics, 19, 2713–2722.
- Wright, S. (1934), “The Method of Path Coefficients,” The Annals of Mathematical Statistics, 5, 161–215.
- Zuo, Y., and Serfling, R. (2000), “General Notions of Statistical Depth Function,” Annals of Statistics, 28, 461–482.