Vadim E. Zverovich

39 papers Journal 37Unranked 2

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