Andrei Gagarin

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 14

Top Topics

Pspace Complete

Satisfiability Problem

Facility Location

Top Venues

Comput. Oper. Res.

J. Artif. Intell. Res.

J. Comb. Optim.

Publications

Lukas Dijkstra, Andrei Gagarin, Padraig Corcoran, Rhyd Lewis
Digraphs and k-Domination Models for Facility Location Problems in Road Networks: Greedy Heuristics. INOC (2024)
Andrei Gagarin, William L. Kocay
Embedding K3,3 and K5 on the double torus. Discret. Appl. Math. 354 (2024)
Lukas Dijkstra, Andrei Gagarin, Vadim E. Zverovich
Weighted domination models and randomized heuristics. CoRR (2022)
William L. Kocay, Andrei Gagarin
Embedding K3, 3 and K5 on the Double Torus. CoRR (2022)
Padraig Corcoran, Andrei Gagarin
-domination models of facility location problems in street networks. Comput. Oper. Res. 133 (2021)
Padraig Corcoran, Andrei Gagarin
Heuristics for k-domination models of facility location problems in street networks. CoRR (2021)
Padraig Corcoran, Peter Mooney, Andrei Gagarin
A distributed location obfuscation method for online route planning. Comput. Secur. 95 (2020)
Daniel Karapetyan, Andrew J. Parkes, Gregory Z. Gutin, Andrei Gagarin
Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints. J. Artif. Intell. Res. 66 (2019)
Andrei Gagarin, Padraig Corcoran
Multiple domination models for placement of electric vehicle charging stations in road networks. Comput. Oper. Res. 96 (2018)
Irena Spasic, Padraig Corcoran, Andrei Gagarin, Andreas Buerki
Head to Head: Semantic Similarity of Multi-Word Terms. IEEE Access 6 (2018)
Padraig Corcoran, Andrei Gagarin
Multiple domination models for placement of electric vehicle charging stations in road networks. CoRR (2017)
Daniel Karapetyan, Andrew J. Parkes, Gregory Z. Gutin, Andrei Gagarin
Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints. CoRR (2016)
David A. Cohen, Jason Crampton, Andrei Gagarin, Gregory Z. Gutin, Mark Jones
Algorithms for the workflow satisfiability problem engineered for counting constraints. J. Comb. Optim. 32 (1) (2016)
Jason Crampton, Andrei Gagarin, Gregory Z. Gutin, Mark Jones, Magnus Wahlström
On the Workflow Satisfiability Problem with Class-Independent Constraints for Hierarchical Organizations. ACM Trans. Priv. Secur. 19 (3) (2016)
David A. Cohen, Jason Crampton, Andrei Gagarin, Gregory Z. Gutin, Mark Jones
Engineering Algorithms for Workflow Satisfiability Problem with User-Independent Constraints. FAW (2014)
David A. Cohen, Jason Crampton, Andrei Gagarin, Gregory Z. Gutin, Mark Jones
Iterative Plan Construction for the Workflow Satisfiability Problem. J. Artif. Intell. Res. 51 (2014)
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 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)
Andrei Gagarin, Sajid Hussain, Laurence Tianruo Yang
Distributed hierarchical search for balanced energy consumption routing spanning trees in wireless sensor networks. J. Parallel Distributed Comput. 70 (9) (2010)
Andrei Gagarin, Vadim E. Zverovich
Upper bounds for the bondage number of graphs on topological surfaces CoRR (2010)
Andrei Gagarin, Gilbert Labelle, Pierre Leroux, Timothy Walsh
Structure and enumeration of two-connected graphs with prescribed three-connected components. Adv. Appl. Math. 43 (1) (2009)
Andrei Gagarin, Sajid Hussain, Laurence Tianruo Yang
Distributed Search for Balanced Energy Consumption Spanning Trees in Wireless Sensor Networks. AINA Workshops (2009)
Andrei Gagarin, Anush Poghosyan, Vadim E. Zverovich
Upper Bounds for alpha-Domination Parameters. Graphs Comb. 25 (4) (2009)
Andrei Gagarin, Wendy J. Myrvold, John Chambers
's. Discret. Math. 309 (11) (2009)
Andrei Gagarin, Vadim E. Zverovich
A generalised upper bound for the k-tuple domination number. Discret. Math. 308 (5-6) (2008)
Andrei Gagarin
Improved upper bounds for the k-tuple domination number. Australas. J Comb. 41 (2008)
Andrei Gagarin, Anush Poghosyan, Vadim E. Zverovich
Upper bounds for alpha-domination parameters. CoRR (2008)
Andrei Gagarin, Gilbert Labelle, Pierre Leroux
Counting unlabelled toroidal graphs with no K3, 3-subdivisions. Adv. Appl. Math. 39 (1) (2007)
Andrei Gagarin, Gilbert Labelle, Pierre Leroux, Timothy Walsh
Two-connected graphs with prescribed three-connected components. CoRR (2007)
Andrei Gagarin, Gilbert Labelle, Pierre Leroux
-subdivision-free toroidal graphs. Discret. Math. 307 (23) (2007)
Andrei Gagarin, Gilbert Labelle, Pierre Leroux
's. Electron. Notes Discret. Math. 24 (2006)
Andrei Gagarin, Wendy J. Myrvold, John Chambers
's. Electron. Notes Discret. Math. 22 (2005)
Andrei Gagarin, Gilbert Labelle, Pierre Leroux
Counting unlabelled toroidal graphs with no K33-subdivisions. CoRR (2005)