Hereditary classes of line graphs. - Andrei V. Gagarin; Igor E. Zverovich (Ars Comb., 1998)

Embedding Graphs Containing K5-Subdivisions. - Andrei V. Gagarin; William L. Kocay (Ars Comb., 2002)

Counting unlabelled toroidal graphs with no K33-subdivisions. - Andrei Gagarin; Gilbert Labelle; Pierre Leroux (CoRR, 2005)

Forbidden minors and subdivisions for toroidal graphs with no K3, 3's. - Andrei Gagarin; Wendy J. Myrvold; John Chambers (Electron. Notes Discret. Math., 2005)

HTS-Corrector: software for the statistical analysis and correction of experimental high-throughput screening data. - Vladimir Makarenkov; Dmytro Kevorkov; Pablo Zentilli; Andrei V. Gagarin; Nathalie Malo; Robert Nadon (Bioinform., 2006)

The structure and unlabelled enumeration of toroidal graphs with no K3, 3's. - Andrei Gagarin; Gilbert Labelle; Pierre Leroux (Electron. Notes Discret. Math., 2006)

Comparison of Two Methods for Detecting and Correcting Systematic Error in High-throughput Screening Data. - Andrei Gagarin; Dmytro Kevorkov; Vladimir Makarenkov; Pablo Zentilli (Data Science and Classification, 2006)

Counting unlabelled toroidal graphs with no K3, 3-subdivisions. - Andrei Gagarin; Gilbert Labelle; Pierre Leroux (Adv. Appl. Math., 2007)

An efficient method for the detection and elimination of systematic error in high-throughput screening. - Vladimir Makarenkov; Pablo Zentilli; Dmytro Kevorkov; Andrei V. Gagarin; Nathalie Malo; Robert Nadon (Bioinform., 2007)

Two-connected graphs with prescribed three-connected components. - Andrei Gagarin; Gilbert Labelle; Pierre Leroux; Timothy Walsh 001 (CoRR, 2007)

The structure of K3, 3-subdivision-free toroidal graphs. - Andrei Gagarin; Gilbert Labelle; Pierre Leroux (Discret. Math., 2007)

Improved upper bounds for the k-tuple domination number. - Andrei Gagarin (Australas. J Comb., 2008)

A generalised upper bound for the k-tuple domination number. - Andrei Gagarin; Vadim E. Zverovich (Discret. Math., 2008)

Distributed Search for Balanced Energy Consumption Spanning Trees in Wireless Sensor Networks. - Andrei Gagarin; Sajid Hussain; Laurence Tianruo Yang (AINA Workshops, 2009)

Structure and enumeration of two-connected graphs with prescribed three-connected components. - Andrei Gagarin; Gilbert Labelle; Pierre Leroux; Timothy Walsh 001 (Adv. Appl. Math., 2009)

The obstructions for toroidal graphs with no K3, 3's. - Andrei Gagarin; Wendy J. Myrvold; John Chambers (Discret. Math., 2009)

Upper Bounds for alpha-Domination Parameters. - Andrei Gagarin; Anush Poghosyan; Vadim E. Zverovich (Graphs Comb., 2009)

Distributed hierarchical search for balanced energy consumption routing spanning trees in wireless sensor networks. - Andrei Gagarin; Sajid Hussain; Laurence Tianruo Yang (J. Parallel Distributed Comput., 2010)

Randomized algorithms and upper bounds for multiple domination in graphs and networks. - Andrei Gagarin; Anush Poghosyan; Vadim E. Zverovich (Discret. Appl. Math., 2013)

The bondage number of graphs on topological surfaces and Teschner's conjecture. - Andrei Gagarin; Vadim E. Zverovich (Discret. Math., 2013)

Upper bounds for the bondage number of graphs on topological surfaces. - Andrei V. Gagarin; Vadim E. Zverovich (Discret. Math., 2013)

Engineering Algorithms for Workflow Satisfiability Problem with User-Independent Constraints. - David A. Cohen; Jason Crampton; Andrei Gagarin; Gregory Z. Gutin; Mark Jones 001 (FAW, 2014)

Bounds and algorithms for limited packings in graphs. - Andrei Gagarin; Vadim E. Zverovich (CoRR, 2014)

Pattern Backtracking Algorithm for the Workflow Satisfiability Problem. - Daniel Karapetyan; Andrei V. Gagarin; Gregory Z. Gutin (CoRR, 2014)

Iterative Plan Construction for the Workflow Satisfiability Problem. - David A. Cohen; Jason Crampton; Andrei Gagarin; Gregory Z. Gutin; Mark Jones 001 (J. Artif. Intell. Res., 2014)

Pattern Backtracking Algorithm for the Workflow Satisfiability Problem with User-Independent Constraints. - Daniel Karapetyan; Andrei V. Gagarin; Gregory Z. Gutin (FAW, 2015)

On the Workflow Satisfiability Problem with Class-independent Constraints. - Jason Crampton; Andrei V. Gagarin; Gregory Z. Gutin; Mark Jones 001 (IPEC, 2015)

The probabilistic approach to limited packings in graphs. - Andrei V. Gagarin; Vadim E. Zverovich (Discret. Appl. Math., 2015)

Algorithms for the workflow satisfiability problem engineered for counting constraints. - David A. Cohen; Jason Crampton; Andrei Gagarin; Gregory Z. Gutin; Mark Jones 001 (J. Comb. Optim., 2016)

On the Workflow Satisfiability Problem with Class-Independent Constraints for Hierarchical Organizations. - Jason Crampton; Andrei Gagarin; Gregory Z. Gutin; Mark Jones 001; Magnus Wahlström (ACM Trans. Priv. Secur., 2016)

Head to Head: Semantic Similarity of Multi-Word Terms. - Irena Spasic; Padraig Corcoran; Andrei Gagarin; Andreas Buerki (IEEE Access, 2018)

Multiple domination models for placement of electric vehicle charging stations in road networks. - Andrei Gagarin; Padraig Corcoran (Comput. Oper. Res., 2018)

Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints. - Daniel Karapetyan; Andrew J. Parkes; Gregory Z. Gutin; Andrei Gagarin (J. Artif. Intell. Res., 2019)

A distributed location obfuscation method for online route planning. - Padraig Corcoran; Peter Mooney; Andrei Gagarin (Comput. Secur., 2020)

Heuristics for k-domination models of facility location problems in street networks. - Padraig Corcoran; Andrei Gagarin (Comput. Oper. Res., 2021)

Heuristics for k-domination models of facility location problems in street networks. - Padraig Corcoran; Andrei Gagarin (CoRR, 2021)

Weighted domination models and randomized heuristics. - Lukas Dijkstra; Andrei Gagarin; Vadim E. Zverovich (CoRR, 2022)

Embedding K3, 3 and K5 on the Double Torus. - William L. Kocay; Andrei Gagarin (CoRR, 2022)

Methods for determining cycles of a specific length in undirected graphs with edge weights. - Rhyd Lewis; Padraig Corcoran; Andrei V. Gagarin (J. Comb. Optim., 2023)

Digraphs and k-Domination Models for Facility Location Problems in Road Networks: Greedy Heuristics. - Lukas Dijkstra; Andrei Gagarin; Padraig Corcoran; Rhyd Lewis (INOC, 2024)

Greedy and randomized heuristics for optimization of k-domination models in digraphs and road networks. - Lukas Dijkstra; Andrei Gagarin; Padraig Corcoran; Rhyd Lewis (CoRR, 2024)

Embedding K3,3 and K5 on the double torus. - Andrei Gagarin; William L. Kocay (Discret. Appl. Math., 2024)