Andrei Gagarin

38 papers C 1Misc 1Journal 34Unranked 1

Year	Rank	Type	Title / Venue / Authors
2024	C	`conf`	Digraphs and k-Domination Models for Facility Location Problems in Road Networks: Greedy Heuristics. INOC Lukas Dijkstra, Andrei Gagarin, Padraig Corcoran, Rhyd Lewis
2024	J	`jnl`	Embedding K3,3 and K5 on the double torus. Discret. Appl. Math. Andrei Gagarin, William L. Kocay
2024	J	`jnl`	Greedy and randomized heuristics for optimization of k-domination models in digraphs and road networks. CoRR Lukas Dijkstra, Andrei Gagarin, Padraig Corcoran, Rhyd Lewis
2022	J	`jnl`	Embedding K3, 3 and K5 on the Double Torus. CoRR William L. Kocay, Andrei Gagarin
2022	J	`jnl`	Weighted domination models and randomized heuristics. CoRR Lukas Dijkstra, Andrei Gagarin, Vadim E. Zverovich
2021	J	`jnl`	Heuristics for Comput. Oper. Res. Padraig Corcoran, Andrei Gagarin
2021	J	`jnl`	Heuristics for k-domination models of facility location problems in street networks. CoRR Padraig Corcoran, Andrei Gagarin
2020	J	`jnl`	A distributed location obfuscation method for online route planning. Comput. Secur. Padraig Corcoran, Peter Mooney, Andrei Gagarin
2019	J	`jnl`	Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints. J. Artif. Intell. Res. Daniel Karapetyan, Andrew J. Parkes, Gregory Z. Gutin, Andrei Gagarin
2018	J	`jnl`	Head to Head: Semantic Similarity of Multi-Word Terms. IEEE Access Irena Spasic, Padraig Corcoran, Andrei Gagarin, Andreas Buerki
2018	J	`jnl`	Multiple domination models for placement of electric vehicle charging stations in road networks. Comput. Oper. Res. Andrei Gagarin, Padraig Corcoran
2017	J	`jnl`	Multiple domination models for placement of electric vehicle charging stations in road networks. CoRR Padraig Corcoran, Andrei Gagarin
2016	J	`jnl`	Algorithms for the workflow satisfiability problem engineered for counting constraints. J. Comb. Optim. David A. Cohen, Jason Crampton, Andrei Gagarin, Gregory Z. Gutin, Mark Jones
2016	J	`jnl`	On the Workflow Satisfiability Problem with Class-Independent Constraints for Hierarchical Organizations. ACM Trans. Priv. Secur. Jason Crampton, Andrei Gagarin, Gregory Z. Gutin, Mark Jones, Magnus Wahlström
2016	J	`jnl`	Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints. CoRR Daniel Karapetyan, Andrew J. Parkes, Gregory Z. Gutin, Andrei Gagarin
2014	J	`jnl`	Bounds and algorithms for limited packings in graphs. CoRR Andrei Gagarin, Vadim E. Zverovich
2014	Misc	`conf`	Engineering Algorithms for Workflow Satisfiability Problem with User-Independent Constraints. FAW David A. Cohen, Jason Crampton, Andrei Gagarin, Gregory Z. Gutin, Mark Jones
2014	J	`jnl`	Iterative Plan Construction for the Workflow Satisfiability Problem. J. Artif. Intell. Res. David A. Cohen, Jason Crampton, Andrei Gagarin, Gregory Z. Gutin, Mark Jones
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
2012	J	`jnl`	The bondage number of graphs on topological surfaces and Teschner's conjecture CoRR Andrei Gagarin, Vadim E. Zverovich
2010	J	`jnl`	Distributed hierarchical search for balanced energy consumption routing spanning trees in wireless sensor networks. J. Parallel Distributed Comput. Andrei Gagarin, Sajid Hussain, Laurence Tianruo Yang
2010	J	`jnl`	Upper bounds for the bondage number of graphs on topological surfaces CoRR Andrei Gagarin, Vadim E. Zverovich
2009	—	`conf`	Distributed Search for Balanced Energy Consumption Spanning Trees in Wireless Sensor Networks. AINA Workshops Andrei Gagarin, Sajid Hussain, Laurence Tianruo Yang
2009	J	`jnl`	Structure and enumeration of two-connected graphs with prescribed three-connected components. Adv. Appl. Math. Andrei Gagarin, Gilbert Labelle, Pierre Leroux, Timothy Walsh
2009	J	`jnl`	The obstructions for toroidal graphs with no K Discret. Math. Andrei Gagarin, Wendy J. Myrvold, John Chambers
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`	Improved upper bounds for the k-tuple domination number. Australas. J Comb. Andrei Gagarin
2008	J	`jnl`	Upper bounds for alpha-domination parameters. CoRR Andrei Gagarin, Anush Poghosyan, Vadim E. Zverovich
2007	J	`jnl`	Counting unlabelled toroidal graphs with no K3, 3-subdivisions. Adv. Appl. Math. Andrei Gagarin, Gilbert Labelle, Pierre Leroux
2007	J	`jnl`	The structure of K Discret. Math. Andrei Gagarin, Gilbert Labelle, Pierre Leroux
2007	J	`jnl`	Two-connected graphs with prescribed three-connected components. CoRR Andrei Gagarin, Gilbert Labelle, Pierre Leroux, Timothy Walsh
2006	—	`ch.`	Comparison of Two Methods for Detecting and Correcting Systematic Error in High-throughput Screening Data. Data Science and Classification Andrei Gagarin, Dmytro Kevorkov, Vladimir Makarenkov, Pablo Zentilli
2006	J	`jnl`	The structure and unlabelled enumeration of toroidal graphs with no K Electron. Notes Discret. Math. Andrei Gagarin, Gilbert Labelle, Pierre Leroux
2005	J	`jnl`	Counting unlabelled toroidal graphs with no K33-subdivisions. CoRR Andrei Gagarin, Gilbert Labelle, Pierre Leroux
2005	J	`jnl`	Forbidden minors and subdivisions for toroidal graphs with no K Electron. Notes Discret. Math. Andrei Gagarin, Wendy J. Myrvold, John Chambers