19 citations · 20 across the 3 of their papers we have counts for
5 papers
Embedding K3,3 and K5 on the Double Torus
William L. Kocay, Andrei Gagarin
The Kuratowski graphs and characterize planarity. Counting distinct 2-cell embeddings of these two graphs on orientable surfaces was previously done by using Burnsi…
Multiple domination models for placement of electric vehicle charging stations in road networks
Padraig Corcoran, Andrei Gagarin
Electric and hybrid vehicles play an increasing role in the road transport networks. Despite their advantages, they have a relatively limited cruising range in comparison to tradit…
Algorithms for the workflow satisfiability problem engineered for counting constraints
D. Cohen, J. Crampton, A. Gagarin +2
The workflow satisfiability problem (WSP) asks whether there exists an assignment of authorized users to the steps in a workflow specification that satisfies the constraints in the…
Counting unlabelled toroidal graphs with no K33-subdivisions
Andrei Gagarin, Gilbert Labelle, Pierre Leroux
We provide a description of unlabelled enumeration techniques, with complete proofs, for graphs that can be canonically obtained by substituting 2-pole networks for the edges of co…
Characterization and enumeration of toroidal K_{3,3}-subdivision-free graphs
Andrei Gagarin, Gilbert Labelle, Pierre Leroux
We describe the structure of 2-connected non-planar toroidal graphs with no K_{3,3}-subdivisions, using an appropriate substitution of planar networks into the edges of certain gra…