Skip to main content

Research Repository

Advanced Search

All Outputs (44)

Extending indoor open street mapping environments to navigable 3D citygml building models: Emergency response assessment (2018)
Journal Article
Fadli, F., Kutty, N., Wang, Z., Zlatanova, S., Mahdjoubi, L., Boguslawski, P., & Zverovich, V. (2018). Extending indoor open street mapping environments to navigable 3D citygml building models: Emergency response assessment. The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 42(4), 241-247. https://doi.org/10.5194/isprs-archives-XLII-4-161-2018

© Authors 2018. Disaster scenarios in high-rise buildings such as the Address Downtown, Dubai or Grenfell Tower, London have showed ones again the importance of data information availability for emergency management in buildings. 3D visualization of... Read More about Extending indoor open street mapping environments to navigable 3D citygml building models: Emergency response assessment.

A dynamic approach for evacuees’ distribution and optimal routing in hazardous environments (2018)
Journal Article
Boguslawski, P., Mahdjoubi, L., Zverovich, V., & Fadli, F. (2018). A dynamic approach for evacuees’ distribution and optimal routing in hazardous environments. Automation in Construction, 94, 11-21. https://doi.org/10.1016/j.autcon.2018.05.032

© 2018 Elsevier B.V. In a complex built environment, the situation changes rapidly during an emergency event. Typically, available systems rely heavily on a static scenario in the calculation of safest routes for evacuation. In addition, egress route... Read More about A dynamic approach for evacuees’ distribution and optimal routing in hazardous environments.

Analytic prioritization of indoor routes for search and rescue operations in hazardous environments (2017)
Journal Article
Zverovich, V., Mahdjoubi, L., Boguslawski, P., & Fadli, F. (2017). Analytic prioritization of indoor routes for search and rescue operations in hazardous environments. Computer-Aided Civil and Infrastructure Engineering, 32(9), 727-747. https://doi.org/10.1111/mice.12260

Applications to prioritize indoor routes for emergency situations in a complex built facility have been restricted to building simulations and network approaches. These types of applications often failed to account for the complexity and trade-offs... Read More about Analytic prioritization of indoor routes for search and rescue operations in hazardous environments.

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

© 2016 Elsevier B.V. Widespread human-induced or natural threats on buildings and their users have made preparedness and rapid response crucial issues for saving human lives. The ability to identify the paths of egress during an emergency is critical... Read More about Automated construction of variable density navigable networks in a 3D indoor environment for emergency response.

Emergency response in complex buildings: Automated selection of safest and balanced routes (2016)
Journal Article
Zverovich, V., Mahdjoubi, L., Boguslawski, P., Fadli, F., & Barki, H. (2016). Emergency response in complex buildings: Automated selection of safest and balanced routes. Computer-Aided Civil and Infrastructure Engineering, 31(8), 617-632. https://doi.org/10.1111/mice.12197

The extreme importance of emergency response in complex buildings during natural and human-induced disasters has been widely acknowledged. In particular, there is a need for efficient algorithms for finding safest evacuation routes, which would take... Read More about Emergency response in complex buildings: Automated selection of safest and balanced routes.

3D capture techniques for BIM enabled LCM (2016)
Journal Article
Fadli, F., Barki, H., Shaat, A., Mahdjoubi, L., Boguslawski, P., & Zverovich, V. (2016). 3D capture techniques for BIM enabled LCM. IFIP Advances in Information and Communication Technology, 467, 183-192. https://doi.org/10.1007/978-3-319-33111-9_17

© IFIP International Federation for Information Processing 2016. As a special kind of Product Life cyle Management (PLM), Building Life cycle Management (BLM) is a centric activity for facility owners and managers. This fact motivates the adoption of... Read More about 3D capture techniques for BIM enabled LCM.

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.

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.

Braess' paradox in a generalised traffic network (2014)
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.

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.

Upper bounds for the bondage number of graphs on topological surfaces (2013)
Journal Article
Gagarin, A., & Zverovich, V. (2013). Upper bounds for the bondage number of graphs on topological surfaces. Discrete Mathematics, 313(11), 1132-1137. https://doi.org/10.1016/j.disc.2011.10.018

The bondage number b(G) of a graph G is the smallest number of edges of G whose removal results in a graph having the domination number larger than that of G. We show that, for a graph G having the maximum vertex degree Δ(G) and embeddable on an orie... Read More about Upper bounds for the bondage number of graphs on topological surfaces.

On Roman, Global and Restrained Domination in Graphs (2011)
Journal Article
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.

Discrepancy and signed domination in graphs and hypergraphs (2010)
Journal Article
Poghosyan, A., & Zverovich, V. (2010). Discrepancy and signed domination in graphs and hypergraphs. Discrete Mathematics, 310(15-16), 2091-2099. https://doi.org/10.1016/j.disc.2010.03.030

For a graph G, a signed domination function of G is a two-colouring of the vertices of G with colours +1 and -1 such that the closed neighbourhood of every vertex contains more +1's than -1's. This concept is closely related to combinatorial discrepa... Read More about Discrepancy and signed domination in graphs and hypergraphs.

Upper bounds for α-domination parameters (2009)
Journal Article
Gagarin, A., Poghosyan, A., & Zverovich, V. (2009). Upper bounds for α-domination parameters. Graphs and Combinatorics, 25(4), 513-520. https://doi.org/10.1007/s00373-009-0864-6

We provide a new upper bound for the α-domination number in terms of a parameter α, 0 < α ≤ 1, and graph vertex degrees. This result generalises the well-known Caro-Roditty bound for the domination number of a graph. The same probabilistic constructi... Read More about Upper bounds for α-domination parameters.

The k-tuple domination number revisited (2008)
Journal Article
Zverovich, V. (2008). The k-tuple domination number revisited. Applied Mathematics Letters, 21(10), 1005-1011. https://doi.org/10.1016/j.aml.2007.10.016

The following fundamental result for the domination number γ (G) of a graph G was proved by Alon and Spencer, Arnautov, Lovász and Payan: γ (G) ≤ frac(ln (δ + 1) + 1, δ + 1) n, where n is the order and δ is the minimum degree of vertices of G. A simi... Read More about The k-tuple domination number revisited.

A generalised upper bound for the k-tuple domination number (2008)
Journal Article
Gagarin, A., & Zverovich, V. (2008). A generalised upper bound for the k-tuple domination number. Discrete Mathematics, 308(5-6), 880-885. https://doi.org/10.1016/j.disc.2007.07.033

In this paper, we provide an upper bound for the k-tuple domination number that generalises known upper bounds for the double and triple domination numbers. We prove that for any graph G,γ× k (G) ≤ frac(ln (δ - k + 2) + ln (∑m = 1k - 1 (k - m) over(d... Read More about A generalised upper bound for the k-tuple domination number.

The domination parameters of cubic graphs (2005)
Journal Article
Zverovich, I. E., & Zverovich, V. (2005). The domination parameters of cubic graphs. Graphs and Combinatorics, 21(2), 277-288. https://doi.org/10.1007/s00373-005-0608-1

Let ir(G), γ(G), i(G), β0(G), Γ(G) and IR(G) be the irredundance number, the domination number, the independent domination number, the independence number, the upper domination number and the upper irredundance number of a graph G, respectively. In t... Read More about The domination parameters of cubic graphs.

Basic perfect graphs and their extensions (2005)
Journal Article
Zverovich, I. E., & Zverovich, V. (2005). Basic perfect graphs and their extensions. Discrete Mathematics, 293(1-3), 291-311. https://doi.org/10.1016/j.disc.2004.08.033

In this article, we present a characterization of basic graphs in terms of forbidden induced subgraphs. This class of graphs was introduced by Conforti et al. (Square-free perfect graphs, J. Combin. Theory Ser. B, 90 (2) (2004) 257-307), and it plays... Read More about Basic perfect graphs and their extensions.