Vadim E. Zverovich

Publication Activity (10 Years)

Years Active: 1991-2022
Publications (10 Years): 6

Top Topics

Traffic Network

Randomized Algorithms

Threshold Functions

Top Venues

Discret. Appl. Math.

Comput. Aided Civ. Infrastructure Eng.

Publications

Lukas Dijkstra, Andrei Gagarin, Vadim E. Zverovich
Weighted domination models and randomized heuristics. CoRR (2022)
Vadim E. Zverovich, Lamine Mahdjoubi, Pawel Boguslawski, Fodil Fadli
Analytic Prioritization of Indoor Routes for Search and Rescue Operations in Hazardous Environments. Comput. Aided Civ. Infrastructure Eng. 32 (9) (2017)
Vadim E. Zverovich, Lamine Mahdjoubi, Pawel Boguslawski, Fodil Fadli, Hichem Barki
Emergency Response in Complex Buildings: Automated Selection of Safest and Balanced Routes. Comput. Aided Civ. Infrastructure Eng. 31 (8) (2016)
Fodil Fadli, Hichem Barki, Ahmed Shaat, Lamine Mahdjoubi, Pawel Boguslawski, Vadim E. Zverovich
3D Capture Techniques for BIM Enabled LCM. PLM (2015)
Vadim E. Zverovich
On general frameworks and threshold functions for multiple domination. Discret. Math. 338 (11) (2015)
Andrei V. Gagarin, Vadim E. Zverovich
The probabilistic approach to limited packings in graphs. Discret. Appl. Math. 184 (2015)
Andrei Gagarin, Vadim E. Zverovich
Bounds and algorithms for limited packings in graphs. CoRR (2014)
Andrei Gagarin, Vadim E. Zverovich
The probabilistic approach to limited packings in graphs. CoRR (2013)
Andrei V. Gagarin, Vadim E. Zverovich
Upper bounds for the bondage number of graphs on topological surfaces. Discret. Math. 313 (11) (2013)
Andrei Gagarin, Vadim E. Zverovich
The bondage number of graphs on topological surfaces and Teschner's conjecture. Discret. Math. 313 (6) (2013)
Andrei Gagarin, Anush Poghosyan, Vadim E. Zverovich
Randomized algorithms and upper bounds for multiple domination in graphs and networks. Discret. Appl. Math. 161 (4-5) (2013)
Andrei Gagarin, Vadim E. Zverovich
The bondage number of graphs on topological surfaces and Teschner's conjecture CoRR (2012)
Vadim E. Zverovich, Erel Avineri
Braess' Paradox in a Generalised Traffic Network CoRR (2012)
Vadim E. Zverovich, Anush Poghosyan
On Roman, Global and Restrained Domination in Graphs. Graphs Comb. 27 (5) (2011)
Keith J. Edwards, Terry S. Griggs, Jan van den Heuvel, Stephanie Perkins, Bridget S. Webb, Vadim E. Zverovich
Preface. Discret. Math. 310 (2) (2010)
Anush Poghosyan, Vadim E. Zverovich
Discrepancy and signed domination in graphs and hypergraphs. Discret. Math. 310 (15-16) (2010)
Andrei Gagarin, Vadim E. Zverovich
Upper bounds for the bondage number of graphs on topological surfaces CoRR (2010)
Andrei Gagarin, Anush Poghosyan, Vadim E. Zverovich
Upper Bounds for alpha-Domination Parameters. Graphs Comb. 25 (4) (2009)
Vadim E. Zverovich
The k-tuple domination number revisited. Appl. Math. Lett. 21 (10) (2008)
Andrei Gagarin, Vadim E. Zverovich
A generalised upper bound for the k-tuple domination number. Discret. Math. 308 (5-6) (2008)
Andrei Gagarin, Anush Poghosyan, Vadim E. Zverovich
Upper bounds for alpha-domination parameters. CoRR (2008)
Vadim E. Zverovich
The Computer System GRAPHOGRAPH. Electron. Notes Discret. Math. 27 (2006)
Vadim E. Zverovich
The Computer System GRAPHOGRAPH. ACiD (2006)
Igor E. Zverovich, Vadim E. Zverovich
The Domination Parameters of Cubic Graphs. Graphs Comb. 21 (2) (2005)
Igor E. Zverovich, Vadim E. Zverovich
Basic perfect graphs and their extensions. Discret. Math. 293 (1-3) (2005)
Vadim E. Zverovich
On the differences of the independence, domination and irredundance parameters of a graph. Australas. J Comb. 27 (2003)
Igor E. Zverovich, Vadim E. Zverovich
Locally Well-Dominated and Locally Independent Well-Dominated Graphs. Graphs Comb. 19 (2) (2003)
Lutz Volkmann, Vadim E. Zverovich
Proof of a conjecture on irredundance perfect graphs. J. Graph Theory 41 (4) (2002)
Lutz Volkmann, Vadim E. Zverovich
A disproof of Henning's conjecture on irredundance perfect graphs. Discret. Math. 254 (1-3) (2002)
Dieter Rautenbach, Vadim E. Zverovich
Perfect graphs of strong domination and independent strong domination. Discret. Math. 226 (1-3) (2001)
Igor E. Zverovich, Vadim E. Zverovich
A semi-induced subgraph characterization of upper domination perfect graphs. J. Graph Theory 31 (1) (1999)
Vadim E. Zverovich
The ratio of the irredundance number and the domination number for block-cactus graphs. J. Graph Theory 29 (3) (1998)
Gregory Z. Gutin, Vadim E. Zverovich
Upper domination and upper irredundance perfect graphs. Discret. Math. 190 (1-3) (1998)
Vadim E. Zverovich
The binding number of a random graph. Australas. J Comb. 15 (1997)
R. I. Tyshkevich, Vadim E. Zverovich
Line hypergraphs. Discret. Math. 161 (1-3) (1996)
Igor E. Zverovich, Vadim E. Zverovich
An induced subgraph characterization of domination perfect graphs. J. Graph Theory 20 (3) (1995)
Igor E. Zverovich, Vadim E. Zverovich
Disproof of a Conjecture in the Domination Theory. Graphs Comb. 10 (2-4) (1994)
Igor E. Zverovich, Vadim E. Zverovich
Contributions to the theory of graphic sequences. Discret. Math. 105 (1-3) (1992)
Igor E. Zverovich, Vadim E. Zverovich
A characterization of domination perfect graphs. J. Graph Theory 15 (2) (1991)