Outputs (14)

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.

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.

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.

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.

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.

Upper bounds for the bondage number of graphs on topological surfaces (2013)
Journal Article

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.

Discrepancy and signed domination in graphs and hypergraphs (2010)
Journal Article

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.