Login |

# Browse by Creator

Number of items: 85.## Article
Boguslawski, P., Mahdjoubi, L., Zverovich, V. and Fadli, F.
(2016)
Automated construction of variable density navigable networks in a 3D indoor environment for emergency response.
Zverovich, V., Mahdjoubi, L., Boguslawski, P., Fadli, F. and Barki, H.
(2016)
Emergency response in complex buildings: Automated selection of safest and balanced routes.
Zverovich, V.
(2015)
On general frameworks and threshold functions for multiple domination.
Zverovich, V. and Gagarin, A.
(2015)
The probabilistic approach to limited packings in graphs.
Zverovich, V. and Avineri, E.
(2015)
Braess' paradox in a generalised traffic network.
Gagarin, A. and Zverovich, V.
(2013)
Upper bounds for the bondage number of graphs on topological surfaces.
Gagarin, A., Poghosyan, A. and Zverovich, V.
(2013)
Randomized algorithms and upper bounds for multiple domination in graphs and networks.
Zverovich, V. and Gagarin, A.
(2013)
The bondage number of graphs on topological surfaces and Teschner's conjecture.
Zverovich, V. and Poghosyan, A.
(2011)
On Roman, global and restrained domination in graphs.
Poghosyan, A. and Zverovich, V.
(2010)
Discrepancy and signed domination in graphs and hypergraphs.
Gagarin, A., Poghosyan, A. and Zverovich, V.
(2009)
Upper bounds for alpha-domination parameters.
Gagarin, A. and Zverovich, V.
(2008)
A generalised upper bound for the k-tuple domination number.
Zverovich, V.
(2008)
The k-tuple domination number revisited.
Zverovich, V.
(2006)
The computer system GRAPHOGRAPH.
Zverovich, I. and Zverovich, V.
(2005)
Basic perfect graphs and their extensions.
Zverovich, I. and Zverovich, V.
(2005)
The domination parameters of cubic graphs.
Zverovich, I. and Zverovich, V.
(2003)
Locally well-dominated and locally independent well-dominated graphs.
Zverovich, I. and Zverovich, V.
(2003)
Bipartition of graphs into subgraphs with prescribed hereditary properties.
Zverovich, V.
(2003)
On the differences of the independence, domination and irredundance parameters of a graph.
Volkmann, L. and Zverovich, V.
(2002)
Proof of a conjecture on irredundance perfect graphs.
Volkmann, L. and Zverovich, V.
(2002)
A disproof of Henning's conjecture on irredundance perfect graphs.
Rautenbach, D. and Zverovich, V.
(2001)
Perfect graphs of strong domination and independent strong domination.
Zverovich, I. and Zverovich, V.
(1999)
A semi-induced subgraph characterization of upper domination perfect graphs.
Zverovich, V.
(1998)
The ratio of the irredundance number and the domination number for block-cactus graphs.
Gutin, G. and Zverovich, V.
(1998)
Upper domination and upper irredundance perfect graphs.
Tyshkevich, R. and Zverovich, V.
(1998)
Line hypergraphs: A survey.
Zverovich, V.
(1997)
The binding number of a random graph.
Tyshkevich, R. and Zverovich, V.
(1996)
Line hypergraphs.
Zverovich, I. and Zverovich, V.
(1995)
An induced subgraph characterization of domination perfect graphs.
Zverovich, I. and Zverovich, V.
(1994)
Disproof of a conjecture in the domination theory.
Zverovich, V., Zverovich, I. and Orlovich, Y.
(1993)
A catalogue of connected 4-regular locally connected graphs.
Zverovich, I. and Zverovich, V.
(1992)
Contributions to the theory of graphic sequences.
Zverovich, I. and Zverovich, V.
(1991)
A characterization of domination perfect graphs.
Zverovich, V. and Zverovich, I.
(1991)
A characterization of perfect dominating-clique graphs.
Zverovich, I. and Zverovich, V.
(1991)
A note on domatically critical and cocritical graphs.
Zverovich, V.
(1990)
Criticality and inequalities in domination theory of graphs.
Zverovich, V.
(1990)
Domination perfect graphs.
Zverovich, V., Zverovich, I. and Tyshkevich, R.
(1990)
Graphs with a matroid number that does not exceed 2.
Zverovich, V. and Zverovich, I.
(1990)
On the binding number of graphs.
Zverovich, V.
(1989)
The binding number of a graph.
## Book Section
Fadli, F., Barki, H., Shaat, A., Mahdjoubi, L., Boguslawski, P. and Zverovich, V.
(2016)
3D capture techniques for BIM enabled LCM.
In: Bouras, A., Eynard, B., Foufou, S. and Thoben, K.-D., eds.
(2016)
Boguslawski, P., Mahdjoubi, L., Zverovich, V., Fadli, F. and Barki, H.
(2015)
BIM-GIS modelling in support of emergency response applications.
In: Mahdjoubi, L., Brebbia, C. and Laing, R., eds.
(2015)
## Report or Working Paper
Zverovich, V.
(2015)
Zverovich, V.
(1993)
Zverovich, V.
(1993)
Zverovich, V.
(1992)
Zverovich, V. and Zverovich, I.
(1990)
Zverovich, V. and Zverovich, I.
(1989)
Zverovich, V.
(1989)
Zverovich, V. and Zverovich, I.
(1988)
Zverovich, V., Zverovich, I. and Sylla, A.
(1988)
Zverovich, V.
(1988)
## Conference or Workshop Item
Boguslawski, P., Mahdjoubi, L., Zverovich, V. and Fadli, F.
(2016)
Two-graph building interior representation for emergency response applications.
In:
Mahdjoubi, L., Zverovich, V., Boguslawski, P. and Fadli, F.
(2016)
CUBER: Critical Urban Buildings Emergency Response.
In:
Gagarin, A. and Zverovich, V.
(2014)
Bounds and algorithms for limited packings in graphs.
In:
Zverovich, V. and Avineri, E.
(2014)
Braess’ paradox in asymmetrical traffic networks.
In:
Zverovich, V. and Avineri, E.
(2013)
Braess’ paradox in generalised traffic networks.
In:
Zverovich, V. and Gagarin, A.
(2013)
The bondage number of graphs on topological surfaces and Teschner's conjecture.
In:
Zverovich, V. and Gagarin, A.
(2011)
Upper bounds for the bondage number of graphs on topological surfaces.
In:
Zverovich, V. and Gagarin, A.
(2011)
Upper bounds for the bondage number of graphs on topological surfaces.
In:
Zverovich, V. and Poghosyan, A.
(2009)
Discrepancy and signed domination in graphs and hypergraphs.
In:
Zverovich, V. and Poghosyan, A.
(2009)
Discrepancy theory and signed domination in graphs and hypergraphs.
In:
Gagarin, A., Poghosyan, A. and Zverovich, V.
(2008)
Upper bounds for the alpha-domination number.
In:
Zverovich, V.
(2007)
The k-tuple domination number revisited.
In:
Zverovich, V.
(2006)
A proof of Rautenbach-Volkmann’s conjecture on k-tuple
domination.
In:
Zverovich, V.
(2006)
The computer system GRAPHOGRAPH.
In:
Zverovich, V.
(2006)
The computer system GRAPHOGRAPH.
In:
Zverovich, V. and Gagarin, A.
(2005)
A generalised upper bound for the k-tuple domination
number.
In:
Zverovich, V.
(2004)
A characterisation of domination perfect graphs.
In:
Zverovich, V.
(2004)
Graph-theoretic problems and the computer system GraphLab.
In:
Zverovich, V. and Zverovich, I.
(2003)
Basic graphs.
In:
Zverovich, V.
(2000)
Domination parameters of cubic graphs.
In:
Zverovich, V.
(2000)
An overview of author's results in graph theory.
In:
Zverovich, V.
(1997)
Pi-tau-perfect graphs.
In:
Zverovich, I. and Zverovich, V.
(1997)
A semi-induced subgraph characterization of upper domination perfect graphs.
In:
Volkmann, L. and Zverovich, V.
(1997)
A proof of Favaron's conjecture and a disproof of Henning's conjecture on irredundance perfect graphs.
In:
Zverovich, V.
(1996)
Domination perfect and upper domination perfect graphs.
In:
Zverovich, V.
(1995)
Domination perfect graphs.
In:
Zverovich, V.
(1992)
Perfect graphs in domination theory.
In:
Zverovich, V.
(1991)
The binding number of almost every graph.
In:
Zverovich, V. and Zverovich, I.
(1990)
Domination and independence in graphs.
In:
Zverovich, V. and Zverovich, I.
(1990)
Solving industrial problems connected with analysis of chemical compounds.
In:
Zverovich, V. and Zverovich, I.
(1989)
Computational aspects of graph-optimisation problems connected with hamiltonity and k-factors.
In:
Zverovich, V. and Zverovich, I.
(1988)
Conjectures on the binding number of a graph.
In:
## Thesis
Zverovich, V.
(1992)
This list was generated on Mon Oct 24 02:37:46 2016 BST. |

- Share