Andrei Gagarin
Andrei Gagarin

homepage
andrei.gagarinatrhul.ac.uk

  Affiliation history
Bibliometrics: publication history
Average citations per article2.44
Citation Count39
Publication count16
Publication years2003-2016
Available for download1
Average downloads per article91.00
Downloads (cumulative)91
Downloads (12 Months)69
Downloads (6 Weeks)3
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


16 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 16 of 16
Sort by:

1 published by ACM
October 2016 ACM Transactions on Privacy and Security (TOPS): Volume 19 Issue 3, December 2016
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 3,   Downloads (12 Months): 69,   Downloads (Overall): 91

Full text available: PDFPDF
A workflow specification defines a set of steps, a set of users, and an access control policy. The policy determines which steps a user is authorized to perform and imposes constraints on which sets of users can perform which sets of steps. The workflow satisfiability problem (WSP) is the problem ...
Keywords: class-independent constraints, Workflow satisfiability problem, user-independent constraints, fixed-parameter tractability

2
July 2016 Journal of Combinatorial Optimization: Volume 32 Issue 1, July 2016
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 1

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 specification. The problem is NP-hard in general, but several subclasses of the problem are known to be fixed-parameter tractable (FPT) when parameterized by ...
Keywords: User-independent constraints, Algorithm engineering, Workflow satisfiability problem (WSP), Fixed-parameter tractability (FPT), Reduction to the pseudo-Boolean SAT problem

3
March 2015 Discrete Applied Mathematics: Volume 184 Issue C, March 2015
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 0

We consider (closed neighbourhood) packings and their generalization in graphs. A vertex set X in a graph G is a k -limited packing if for every vertex v � V ( G ) , | N v � X | � k , where N v is the closed neighbourhood ...
Keywords: Randomized algorithm, The probabilistic method, k -limited packings, Lower and upper bounds

4
September 2014 Journal of Artificial Intelligence Research: Volume 51 Issue 1, September 2014
Publisher: AI Access Foundation
Bibliometrics:
Citation Count: 8

The Workflow Satisfiability Problem (WSP) is a problem of practical interest that arises whenever tasks need to be performed by authorized users, subject to constraints defined by business rules. We are required to decide whether there exists a plan - an assignment of tasks to authorized users - such that ...

5
March 2013 Discrete Applied Mathematics: Volume 161 Issue 4-5, March, 2013
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 5

We consider four different types of multiple domination and provide new improved upper bounds for the k- and k-tuple domination numbers. They generalize two classical bounds for the domination number and are better than a number of known upper bounds for these two multiple domination parameters. Also, we explicitly present ...
Keywords: k-domination, k-tuple domination, α-domination, α-rate domination, Randomized algorithm

6
September 2010 Journal of Parallel and Distributed Computing: Volume 70 Issue 9, September, 2010
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 5

We provide a new heuristic method approach to search for degree-balanced and small weight routing spanning trees in a network. The method is a modification of Kruskal's minimum spanning tree search algorithm and is based on a distributed search by hierarchical clusters. It provides spanning trees with a lower maximum ...
Keywords: Energy-balanced topology control, Hierarchical clustering, Routing spanning tree, Wireless sensor network, Distributed algorithm

7
November 2009 Graphs and Combinatorics: Volume 25 Issue 4, November 2009
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 5

We provide a new upper bound for the α-domination number in terms of a parameter α, 0 < α ≤ 1, and graph vertex degrees. This result generalises the well-known Caro-Roditty bound for the domination number of a graph. The same probabilistic construction is used to generalise another well-known upper bound for ...
Keywords: 68W20, 68R10, 90B15

8
July 2009 Advances in Applied Mathematics: Volume 43 Issue 1, July, 2009
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 1

We adapt the classical 3-decomposition of any 2-connected graph to the case of simple graphs (no loops or multiple edges). By analogy with the block-cutpoint tree of a connected graph, we deduce from this decomposition a bicolored tree tc(g) associated with any 2-connected graph g, whose white vertices are the ...
Keywords: 05C05, Dissymmetry theorem, 05A15, 05C40, 3-Connected decomposition, 05C30, 05C75, 2-Trees, Enumeration, Combinatorial species

9
June 2009 Discrete Mathematics: Volume 309 Issue 11, June, 2009
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 2

Forbidden minors and subdivisions for toroidal graphs are numerous. We consider the toroidal graphs with no K"3","3-subdivisions that coincide with the toroidal graphs with no K"3","3-minors. These graphs admit a unique decomposition into planar components and have short lists of obstructions. We provide the complete lists of four forbidden minors ...
Keywords: Embedding in a surface, Forbidden minor, Forbidden subdivision, Toroidal graph

10
May 2009 WAINA '09: Proceedings of the 2009 International Conference on Advanced Information Networking and Applications Workshops
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 0

Sensor networks are commonly used for security and surveillance applications. As sensor nodes have limited battery paower, computing, and storage resources, the energy efficient security techniques are needed. We provide a new heuristic approach to search for balanced and small weight routing spanning trees in a network. The approach is ...
Keywords: wireless sensor networks, graph algorithms, clustering, energy efficient routing

11
March 2008 Discrete Mathematics: Volume 308 Issue 5-6, March, 2008
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 1

In this paper, we provide an upper bound for the k-tuple domination number that generalises known upper bounds for the double and triple domination numbers. We prove that for any graph G,@c"x"k(G)=
Keywords: Domination, Graph

12
November 2007 Discrete Mathematics: Volume 307 Issue 23, November, 2007
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 1

We consider the class T of 2-connected non-planar K"3","3-subdivision-free graphs that are embeddable in the torus. We show that any graph in T admits a unique decomposition as a basic toroidal graph (the toroidal core) where the edges are replaced by two-pole networks constructed from 2-connected planar graphs. The structure ...
Keywords: 2-Pole networks, Planar networks, Edge substitution, Labelled enumeration, Structure theorem, Toroidal core, K3,3-subdivisions, Toroidal graphs

13
July 2007 Bioinformatics: Volume 23 Issue 13, July 2007
Publisher: Oxford University Press
Bibliometrics:
Citation Count: 0

Motivation: High-throughput screening (HTS) is an early-stage process in drug discovery which allows thousands of chemical compounds to be tested in a single study. We report a method for correcting HTS data prior to the hit selection process (i.e. selection of active compounds). The proposed correction minimizes the impact of ...

14
July 2007 Advances in Applied Mathematics: Volume 39 Issue 1, July, 2007
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 2

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 core graphs. Using structure theorems for toroidal and projective-planar graphs containing no K"3","3-subdivisions, we apply these techniques to obtain their unlabelled enumeration.
Keywords: Edge substitution, Homogeneous Tchebytchev polynomials, 2-pole networks, Matching polynomials, Toroidal graphs, Unlabelled enumeration, primary, K3,3-subdivision free graphs, secondary

15
June 2006 Bioinformatics: Volume 22 Issue 11, June 2006
Publisher: Oxford University Press
Bibliometrics:
Citation Count: 0

Motivation: High-throughput screening (HTS) plays a central role in modern drug discovery, allowing for testing of >100 000 compounds per screen. The aim of our work was to develop and implement methods for minimizing the impact of systematic error in the analysis of HTS data. To the best of our ...

16
January 2003
Bibliometrics:
Citation Count: 0

A topological surface S can be obtained from the sphere by adding a number of handles and/or cross-caps. Any topological surface can be represented as a polygon whose sides are identified in pairs. The projective plane can be represented as a circular disk with opposite pairs of points on its ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us