Skip to main content

Research Repository

See what's under the surface

Advanced Search

BIM-GIS modelling in support of emergency response applications (2015)
Book Chapter
Boguslawski, P., Mahdjoubi, L., Zverovich, V., Fadli, F., & Barki, H. (2015). BIM-GIS modelling in support of emergency response applications. In R. Laing, L. Mahdjoubi, & C. Brebbia (Eds.), Building Information Modelling (BIM) in Design, Construction and Operations, 381-392. WIT Press. https://doi.org/10.2495/BIM150321

Building Information Modelling (BIM) provides a detailed 3D geometrical model with rich semantics which go beyond the standard Computer-Aided Design approach. In contrast, Geography Information Science (GIS) offers powerful spatial analytical tools.... Read More about BIM-GIS modelling in support of emergency response applications.

On general frameworks and threshold functions for multiple domination (2015)
Journal Article
Zverovich, V. (2015). On general frameworks and threshold functions for multiple domination. Discrete Mathematics, 338(11), 2095-2104. https://doi.org/10.1016/j.disc.2015.05.003

© 2015 Elsevier B.V. All rights reserved. We consider two general frameworks for multiple domination, which are called (r,s)-domination and parametric domination. They generalise and unify {k}-domination, k-domination, total k-domination and k-tuple... Read More about On general frameworks and threshold functions for multiple domination.

Braess' paradox in a generalised traffic network (2015)
Journal Article
Zverovich, V., & Avineri, E. (2015). Braess' paradox in a generalised traffic network. Journal of Advanced Transportation, 49(1), 114-138. https://doi.org/10.1002/atr.1269

Copyright © 2014 John Wiley & Sons, Ltd. Braess' paradox illustrates situations when adding a new link to a transport network might lead to an equilibrium state in which travel times of users will increase. The classical network configuration intro... Read More about Braess' paradox in a generalised traffic network.

The probabilistic approach to limited packings in graphs (2015)
Journal Article
Zverovich, V., & Gagarin, A. (2015). The probabilistic approach to limited packings in graphs. Discrete Applied Mathematics, 184, 146-153. https://doi.org/10.1016/j.dam.2014.11.017

© 2014 Elsevier B.V. All rights reserved. We consider (closed neighbourhood) packings and their generalization in graphs. A vertex set X in a graph G is a k-limited packing if for every vertex vεV(G), |N[v]∩X|≤k, where N[v] is the closed neighbourhoo... Read More about The probabilistic approach to limited packings in graphs.


;