Vadim E. Zverovich

CoRR, 2022

2017

Analytic Prioritization of Indoor Routes for Search and Rescue Operations in Hazardous Environments.

[BibT_eX]

[DOI]

Comput. Aided Civ. Infrastructure Eng., 2017

2016

Emergency Response in Complex Buildings: Automated Selection of Safest and Balanced Routes.

[BibT_eX]

[DOI]

Comput. Aided Civ. Infrastructure Eng., 2016

2015

On general frameworks and threshold functions for multiple domination.

[BibT_eX]

[DOI]

Discret. Math., 2015

The probabilistic approach to limited packings in graphs.

[BibT_eX]

[DOI]

Andrei V. Gagarin

Discret. Appl. Math., 2015

3D Capture Techniques for BIM Enabled LCM.

[BibT_eX]

[DOI]

Proceedings of the Product Lifecycle Management in the Era of Internet of Things, 2015

2014

Bounds and algorithms for limited packings in graphs.

[BibT_eX]

[DOI]

CoRR, 2014

2013

Upper bounds for the bondage number of graphs on topological surfaces.

[BibT_eX]

[DOI]

Andrei V. Gagarin

Discret. Math., 2013

The bondage number of graphs on topological surfaces and Teschner's conjecture.

[BibT_eX]

[DOI]

Discret. Math., 2013

Randomized algorithms and upper bounds for multiple domination in graphs and networks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

2012

Braess' Paradox in a Generalised Traffic Network

[BibT_eX]

[DOI]

Erel Avineri

CoRR, 2012

2011

On Roman, Global and Restrained Domination in Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2011

2010

Discrepancy and signed domination in graphs and hypergraphs.

[BibT_eX]

[DOI]

Discret. Math., 2010

Preface.

[BibT_eX]

[DOI]

Discret. Math., 2010

2009

Upper Bounds for alpha-Domination Parameters.

[BibT_eX]

[DOI]

Graphs Comb., 2009

2008

A generalised upper bound for the k-tuple domination number.

[BibT_eX]

[DOI]

Discret. Math., 2008

The k-tuple domination number revisited.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2008

2006

The Computer System GRAPHOGRAPH.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2006

2005

The Domination Parameters of Cubic Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2005

Basic perfect graphs and their extensions.

[BibT_eX]

[DOI]

Discret. Math., 2005

2003

Locally Well-Dominated and Locally Independent Well-Dominated Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2003

On the differences of the independence, domination and irredundance parameters of a graph.

[BibT_eX]

[DOI]

Australas. J Comb., 2003

2002

Proof of a conjecture on irredundance perfect graphs.

[BibT_eX]

[DOI]

Lutz Volkmann

J. Graph Theory, 2002

A disproof of Henning's conjecture on irredundance perfect graphs.

[BibT_eX]

[DOI]

Lutz Volkmann

Discret. Math., 2002

2001

Perfect graphs of strong domination and independent strong domination.

[BibT_eX]

[DOI]

Dieter Rautenbach

Discret. Math., 2001

1999

A semi-induced subgraph characterization of upper domination perfect graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1999

1998

The ratio of the irredundance number and the domination number for block-cactus graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1998

Upper domination and upper irredundance perfect graphs.

[BibT_eX]

[DOI]

Gregory Z. Gutin

Discret. Math., 1998

1997

The binding number of a random graph.

[BibT_eX]

[DOI]

Australas. J Comb., 1997

1996

Line hypergraphs.

[BibT_eX]

[DOI]

R. I. Tyshkevich

Discret. Math., 1996

1995

An induced subgraph characterization of domination perfect graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1995

1994

Disproof of a Conjecture in the Domination Theory.

[BibT_eX]

[DOI]

Graphs Comb., 1994

1992

Contributions to the theory of graphic sequences.

[BibT_eX]

[DOI]

Discret. Math., 1992

1991

A characterization of domination perfect graphs.

[BibT_eX]

[DOI]