All Outputs (4)

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.

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.

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.

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.