default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrei V. Gagarin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j28]Andrei Gagarin, William L. Kocay:
Embedding K3,3 and K5 on the double torus. Discret. Appl. Math. 354: 29-47 (2024)- 2023
- [j27]Rhyd Lewis
, Padraig Corcoran, Andrei V. Gagarin:
Methods for determining cycles of a specific length in undirected graphs with edge weights. J. Comb. Optim. 46(5): 29 (2023) - 2021
- [j26]Padraig Corcoran, Andrei Gagarin:
Heuristics for k-domination models of facility location problems in street networks. Comput. Oper. Res. 133: 105368 (2021) - 2020
- [j25]Padraig Corcoran, Peter Mooney, Andrei Gagarin:
A distributed location obfuscation method for online route planning. Comput. Secur. 95: 101850 (2020) - 2019
- [j24]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: 85-122 (2019) - 2018
- [j23]Irena Spasic, Padraig Corcoran, Andrei Gagarin, Andreas Buerki:
Head to Head: Semantic Similarity of Multi-Word Terms. IEEE Access 6: 20545-20557 (2018) - [j22]Andrei Gagarin, Padraig Corcoran:
Multiple domination models for placement of electric vehicle charging stations in road networks. Comput. Oper. Res. 96: 69-79 (2018) - 2016
- [j21]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): 3-24 (2016) - [j20]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): 8:1-8:29 (2016) - 2015
- [j19]Andrei V. Gagarin, Vadim E. Zverovich:
The probabilistic approach to limited packings in graphs. Discret. Appl. Math. 184: 146-153 (2015) - 2014
- [j18]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: 555-577 (2014) - 2013
- [j17]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): 604-611 (2013) - [j16]Andrei Gagarin, Vadim E. Zverovich:
The bondage number of graphs on topological surfaces and Teschner's conjecture. Discret. Math. 313(6): 796-808 (2013) - [j15]Andrei V. Gagarin, Vadim E. Zverovich:
Upper bounds for the bondage number of graphs on topological surfaces. Discret. Math. 313(11): 1132-1137 (2013) - 2010
- [j14]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): 975-982 (2010) - 2009
- [j13]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): 46-74 (2009) - [j12]Andrei Gagarin, Wendy J. Myrvold, John Chambers:
The obstructions for toroidal graphs with no K3, 3's. Discret. Math. 309(11): 3625-3631 (2009) - [j11]Andrei Gagarin, Anush Poghosyan, Vadim E. Zverovich:
Upper Bounds for alpha-Domination Parameters. Graphs Comb. 25(4): 513-520 (2009) - 2008
- [j10]Andrei Gagarin:
Improved upper bounds for the k-tuple domination number. Australas. J Comb. 41: 257-262 (2008) - [j9]Andrei Gagarin, Vadim E. Zverovich:
A generalised upper bound for the k-tuple domination number. Discret. Math. 308(5-6): 880-885 (2008) - 2007
- [j8]Andrei Gagarin, Gilbert Labelle, Pierre Leroux:
Counting unlabelled toroidal graphs with no K3, 3-subdivisions. Adv. Appl. Math. 39(1): 51-75 (2007) - [j7]Vladimir Makarenkov, Pablo Zentilli, Dmytro Kevorkov, Andrei V. Gagarin, Nathalie Malo, Robert Nadon:
An efficient method for the detection and elimination of systematic error in high-throughput screening. Bioinform. 23(13): 1648-1657 (2007) - [j6]Andrei Gagarin, Gilbert Labelle, Pierre Leroux:
The structure of K3, 3-subdivision-free toroidal graphs. Discret. Math. 307(23): 2993-3005 (2007) - 2006
- [j5]Vladimir Makarenkov, Dmytro Kevorkov, Pablo Zentilli, Andrei V. Gagarin, Nathalie Malo, Robert Nadon:
HTS-Corrector: software for the statistical analysis and correction of experimental high-throughput screening data. Bioinform. 22(11): 1408-1409 (2006) - [j4]Andrei Gagarin, Gilbert Labelle, Pierre Leroux:
The structure and unlabelled enumeration of toroidal graphs with no K3, 3's. Electron. Notes Discret. Math. 24: 69-76 (2006) - 2005
- [j3]Andrei Gagarin, Wendy J. Myrvold, John Chambers:
Forbidden minors and subdivisions for toroidal graphs with no K3, 3's. Electron. Notes Discret. Math. 22: 151-156 (2005) - 2002
- [j2]Andrei V. Gagarin, William L. Kocay:
Embedding Graphs Containing K5-Subdivisions. Ars Comb. 64: 33- (2002) - 1998
- [j1]Andrei V. Gagarin, Igor E. Zverovich:
Hereditary classes of line graphs. Ars Comb. 48 (1998)
Conference and Workshop Papers
- 2024
- [c5]Lukas Dijkstra, Andrei Gagarin, Padraig Corcoran, Rhyd Lewis:
Digraphs and k-Domination Models for Facility Location Problems in Road Networks: Greedy Heuristics. INOC 2024: 22-27 - 2015
- [c4]Daniel Karapetyan, Andrei V. Gagarin, Gregory Z. Gutin:
Pattern Backtracking Algorithm for the Workflow Satisfiability Problem with User-Independent Constraints. FAW 2015: 138-149 - [c3]Jason Crampton, Andrei V. Gagarin, Gregory Z. Gutin, Mark Jones:
On the Workflow Satisfiability Problem with Class-independent Constraints. IPEC 2015: 66-77 - 2014
- [c2]David A. Cohen, Jason Crampton, Andrei Gagarin, Gregory Z. Gutin, Mark Jones:
Engineering Algorithms for Workflow Satisfiability Problem with User-Independent Constraints. FAW 2014: 48-59 - 2009
- [c1]Andrei Gagarin, Sajid Hussain, Laurence Tianruo Yang:
Distributed Search for Balanced Energy Consumption Spanning Trees in Wireless Sensor Networks. AINA Workshops 2009: 1037-1042
Parts in Books or Collections
- 2006
- [p1]Andrei Gagarin, Dmytro Kevorkov, Vladimir Makarenkov, Pablo Zentilli:
Comparison of Two Methods for Detecting and Correcting Systematic Error in High-throughput Screening Data. Data Science and Classification 2006: 241-249
Informal and Other Publications
- 2024
- [i16]Lukas Dijkstra, Andrei Gagarin, Padraig Corcoran, Rhyd Lewis:
Greedy and randomized heuristics for optimization of k-domination models in digraphs and road networks. CoRR abs/2409.04226 (2024) - 2022
- [i15]Lukas Dijkstra, Andrei Gagarin, Vadim E. Zverovich:
Weighted domination models and randomized heuristics. CoRR abs/2203.00799 (2022) - [i14]William L. Kocay, Andrei Gagarin:
Embedding K3, 3 and K5 on the Double Torus. CoRR abs/2203.01150 (2022) - 2021
- [i13]Padraig Corcoran, Andrei Gagarin:
Heuristics for k-domination models of facility location problems in street networks. CoRR abs/2111.07885 (2021) - 2017
- [i12]Padraig Corcoran, Andrei Gagarin:
Multiple domination models for placement of electric vehicle charging stations in road networks. CoRR abs/1710.01294 (2017) - 2016
- [i11]Daniel Karapetyan, Andrew J. Parkes, Gregory Z. Gutin, Andrei Gagarin:
Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints. CoRR abs/1604.05636 (2016) - 2015
- [i10]David A. Cohen, Jason Crampton, Andrei V. Gagarin, Gregory Z. Gutin, Mark Jones:
Algorithms for the workflow satisfiability problem engineered for counting constraints. CoRR abs/1504.02420 (2015) - [i9]Jason Crampton, Andrei V. Gagarin, Gregory Z. Gutin, Mark Jones:
On the Workflow Satisfiability Problem with Class-Independent Constraints. CoRR abs/1504.03561 (2015) - 2014
- [i8]Andrei Gagarin, Vadim E. Zverovich:
Bounds and algorithms for limited packings in graphs. CoRR abs/1407.1637 (2014) - [i7]Daniel Karapetyan, Andrei V. Gagarin, Gregory Z. Gutin:
Pattern Backtracking Algorithm for the Workflow Satisfiability Problem. CoRR abs/1412.7834 (2014) - 2013
- [i6]Andrei Gagarin, Vadim E. Zverovich:
The probabilistic approach to limited packings in graphs. CoRR abs/1311.1707 (2013) - 2012
- [i5]Andrei Gagarin, Vadim E. Zverovich:
The bondage number of graphs on topological surfaces and Teschner's conjecture. CoRR abs/1209.1362 (2012) - 2010
- [i4]Andrei Gagarin, Vadim E. Zverovich:
Upper bounds for the bondage number of graphs on topological surfaces. CoRR abs/1012.4117 (2010) - 2008
- [i3]Andrei Gagarin, Anush Poghosyan, Vadim E. Zverovich:
Upper bounds for alpha-domination parameters. CoRR abs/0805.0612 (2008) - 2007
- [i2]Andrei Gagarin, Gilbert Labelle, Pierre Leroux, Timothy Walsh:
Two-connected graphs with prescribed three-connected components. CoRR abs/0712.1869 (2007) - 2005
- [i1]Andrei Gagarin, Gilbert Labelle, Pierre Leroux:
Counting unlabelled toroidal graphs with no K33-subdivisions. CoRR abs/math/0509004 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-10 22:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
