Andrei Gagarin - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 25 from 25

2024

Digraphs and k-Domination Models for Facility Location Problems in Road Networks: Greedy HeuristicsLukas Dijkstra, Andrei Gagarin, Padraig Corcoran, Rhyd Lewis. inoc 2024: 22-27 [doi]

Embedding K3,3 and K5 on the double torusAndrei Gagarin, William L. Kocay. DAM, 354:29-47, 2024. [doi]

2021

k-domination models of facility location problems in street networksPadraig Corcoran, Andrei Gagarin. cor, 133:105368, 2021. [doi]

2020

A distributed location obfuscation method for online route planningPadraig Corcoran, Peter Mooney, Andrei Gagarin. compsec, 95:101850, 2020. [doi]

2019

Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent ConstraintsDaniel Karapetyan, Andrew J. Parkes, Gregory Z. Gutin, Andrei Gagarin. jair, 66:85-122, 2019. [doi]

2018

Multiple domination models for placement of electric vehicle charging stations in road networksAndrei Gagarin, Padraig Corcoran. cor, 96:69-79, 2018. [doi]

Head to Head: Semantic Similarity of Multi-Word TermsIrena Spasic, Padraig Corcoran, Andrei Gagarin, Andreas Buerki. access, 6:20545-20557, 2018. [doi]

2016

Algorithms for the workflow satisfiability problem engineered for counting constraintsDavid Cohen, Jason Crampton, Andrei Gagarin, Gregory Gutin, Mark Jones. jco, 32(1):3-24, 2016. [doi]

On the Workflow Satisfiability Problem with Class-Independent Constraints for Hierarchical OrganizationsJason Crampton, Andrei Gagarin, Gregory Gutin, Mark Jones, Magnus Wahlström. tissec, 19(3), 2016. [doi]

2014

Engineering Algorithms for Workflow Satisfiability Problem with User-Independent ConstraintsDavid Cohen, Jason Crampton, Andrei Gagarin, Gregory Gutin, Mark Jones. faw 2014: 48-59 [doi]

Iterative Plan Construction for the Workflow Satisfiability ProblemDavid Cohen, Jason Crampton, Andrei Gagarin, Gregory Gutin, Mark Jones. jair, 51:555-577, 2014. [doi]

2013

The bondage number of graphs on topological surfaces and Teschner's conjectureAndrei Gagarin, Vadim E. Zverovich. DM, 313(6):796-808, 2013. [doi]

Randomized algorithms and upper bounds for multiple domination in graphs and networksAndrei Gagarin, Anush Poghosyan, Vadim E. Zverovich. DAM, 161(4-5):604-611, 2013. [doi]

2010

Distributed hierarchical search for balanced energy consumption routing spanning trees in wireless sensor networksAndrei Gagarin, Sajid Hussain, Laurence Tianruo Yang. jpdc, 70(9):975-982, 2010. [doi]

2009

2008

A generalised upper bound for the k-tuple domination numberAndrei Gagarin, Vadim E. Zverovich. DM, 308(5-6):880-885, 2008. [doi]

Improved upper bounds for the k-tuple domination numberAndrei Gagarin. ajc, 41:257-262, 2008. [doi]

2007

Counting unlabelled toroidal graphs with no K3, 3-subdivisionsAndrei Gagarin, Gilbert Labelle, Pierre Leroux. aam, 39(1):51-75, 2007. [doi]

The structure of K::3, 3::-subdivision-free toroidal graphsAndrei Gagarin, Gilbert Labelle, Pierre Leroux. DM, 307(23):2993-3005, 2007. [doi]

2006

Comparison of Two Methods for Detecting and Correcting Systematic Error in High-throughput Screening DataAndrei Gagarin, Dmytro Kevorkov, Vladimir Makarenkov, Pablo Zentilli. In Vladimir Batagelj, Hans-Hermann Bock, Anuska Ferligoj, Ales Ziberna, editors, Data Science and Classification. Studies in Classification, Data Analysis, and Knowledge Organization, pages 241-249, Springer, 2006. [doi]

The structure and unlabelled enumeration of toroidal graphs with no K::3, 3:: sAndrei Gagarin, Gilbert Labelle, Pierre Leroux. endm, 24:69-76, 2006. [doi]

2005

Forbidden minors and subdivisions for toroidal graphs with no K::3, 3:: sAndrei Gagarin, Wendy J. Myrvold, John Chambers. endm, 22:151-156, 2005. [doi]

Sign in or sign up to see more results.

runs on WebDSL