All Outputs (91)

Methods of Graph Decompositions (2024)
Book

In general terms, a graph decomposition is a partition of a graph into parts satisfying some special conditions. Methods of Graph Decompositions discusses some state-of-the-art decomposition methods of graph theory, which are highly instrumental when... Read More about Methods of Graph Decompositions.

Modern Applications of Graph Theory (2021)
Book

This book discusses many cutting-edge applications of graph theory, such as traffic networks, navigable networks and optimal routing for emergency response, placement of electric vehicle charging stations, and graph-theoretic methods in molecular epi... Read More about Modern Applications of Graph Theory.

Research Topics in Graph Theory and Its Applications (2019)
Book

This book includes a number of research topics in graph theory and its applications. We discuss various research ideas devoted to alpha-discrepancy, strongly perfect graphs, the reconstruction conjectures, graph invariants, hereditary classes of grap... Read More about Research Topics in Graph Theory and Its Applications.

The likelihood of Braess' paradox in traffic networks (2018)
Book Chapter

The well-known Braess' paradox illustrates situations when adding a new link to a traffic network might increase congestion in the network. In this article, we announce a number of new results devoted to the probability of Braess' paradox to occur in... Read More about The likelihood of Braess' paradox in traffic networks.

Extending indoor open street mapping environments to navigable 3D citygml building models: Emergency response assessment (2018)
Presentation / Conference Contribution

© 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

© 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

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

© 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.

CUBER: Critical Urban Buildings Emergency Response (2016)
Presentation / Conference Contribution

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.

Emergency response in complex buildings: Automated selection of safest and balanced routes (2016)
Journal Article

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)
Presentation / Conference Contribution

© 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.

BIM-GIS modelling in support of emergency response applications (2015)
Book Chapter

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

© 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.

Threat assessment algorithm for prioritisation of moving objects in a secure compound (2015)
Report

In this report, a threat assessment algorithm for prioritisation of moving objects in a secure compound is presented.

The probabilistic approach to limited packings in graphs (2015)
Journal Article

© 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 Contribution

Braess' paradox in a generalised traffic network (2014)
Journal Article

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.

Braess’ paradox in asymmetrical traffic networks (2014)
Presentation / Conference Contribution

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. Braess’ paradox has been studied mainly in the context of the classical problem intr... Read More about Braess’ paradox in asymmetrical traffic networks.

Braess’ paradox in generalised traffic networks (2013)
Presentation / Conference Contribution

The bondage number of graphs on topological surfaces and Teschner's conjecture (2013)
Presentation / Conference Contribution