Skip to main content

Research Repository

See what's under the surface

Advanced Search

Automated construction of variable density navigable networks in a 3D indoor environment for emergency response (2016)
Journal Article
Boguslawski, P., Mahdjoubi, L., Zverovich, V., & Fadli, F. (2016). Automated construction of variable density navigable networks in a 3D indoor environment for emergency response. Automation in Construction, 72(2), 115-128. https://doi.org/10.1016/j.autcon.2016.08.041

Widespread human-induced or natural threats on buildings and their users have made preparedness and quick response as crucial issues for saving human lives. Available information about an emergency scene, e.g. the building structure, material and tra... Read More about Automated construction of variable density navigable networks in a 3D indoor environment for emergency response.

Two-graph building interior representation for emergency response applications (2016)
Presentation / Conference
Boguslawski, P., Mahdjoubi, L., Zverovich, V., & Fadli, F. (2016, July). Two-graph building interior representation for emergency response applications. Paper presented at XXIII ISPRS Congress 2016

Nowadays, in a rapidly developing urban environment with bigger and higher public buildings, disasters causing emergency situations and casualties are unavoidable. Preparedness and quick response are crucial issues saving human lives. Available infor... Read More about Two-graph building interior representation for emergency response applications.

CUBER: Critical Urban Buildings Emergency Response (2016)
Presentation / Conference
Mahdjoubi, L., Zverovich, V., Boguslawski, P., & Fadli, F. (2016, June). CUBER: Critical Urban Buildings Emergency Response. Poster presented at The VC’s Staff Excellence Awards

When human-induced disasters (i.e. terrorist attacks, social unrest, fires), as well as natural disasters (i.e. floods, earthquake, climate change) take place in complex buildings, a short delay in response to an incident or a major event may mean a... Read More about CUBER: Critical Urban Buildings Emergency Response.

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.

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.

Bounds and algorithms for limited packings in graphs (2014)
Presentation / Conference
Gagarin, A., & Zverovich, V. (2014, June). Bounds and algorithms for limited packings in graphs. Paper presented at The 9th International Colloquium on Graph Theory and Combinatorics

Randomized algorithms and upper bounds for multiple domination in graphs and networks (2013)
Journal Article
Gagarin, A., Poghosyan, A., & Zverovich, V. (2013). Randomized algorithms and upper bounds for multiple domination in graphs and networks. Discrete Applied Mathematics, 161(4-5), 604-611. https://doi.org/10.1016/j.dam.2011.07.004

We consider four different types of multiple domination and provide new improved upper bounds for the k- and k-tuple domination numbers. They generalize two classical bounds for the domination number and are better than a number of known upper bounds... Read More about Randomized algorithms and upper bounds for multiple domination in graphs and networks.

The bondage number of graphs on topological surfaces and Teschner's conjecture (2013)
Journal Article
Zverovich, V., & Gagarin, A. (2013). The bondage number of graphs on topological surfaces and Teschner's conjecture. Discrete Mathematics, 313(6), 796-808. https://doi.org/10.1016/j.disc.2012.12.018

The bondage number of a graph is the smallest number of its edges whose removal results in a graph having a larger domination number. We provide constant upper bounds for the bondage number of graphs on topological surfaces, and improve upper bounds... Read More about The bondage number of graphs on topological surfaces and Teschner's conjecture.

On Roman, Global and Restrained Domination in Graphs (2011)
Journal Article
Poghosyan, A., Zverovich, V., Zverovich, V., & Poghosyan, A. (2011). On Roman, Global and Restrained Domination in Graphs. Graphs and Combinatorics, 27(5), 755-768. https://doi.org/10.1007/s00373-010-0992-z

In this paper, we present new upper bounds for the global domination and Roman domination numbers and also prove that these results are asymptotically best possible. Moreover, we give upper bounds for the restrained domination and total restrained do... Read More about On Roman, Global and Restrained Domination in Graphs.

Upper bounds for the alpha-domination number (2008)
Presentation / Conference
Gagarin, A., Poghosyan, A., & Zverovich, V. (2008, May). Upper bounds for the alpha-domination number. Presented at The 4th East Cost Combinatorial Conference

The k-tuple domination number revisited (2007)
Presentation / Conference
Zverovich, V. (2007, July). The k-tuple domination number revisited. Presented at The 21st British Combinatorial Conference


;