Counting Hamilton decompositions of oriented graphs by Ferber, A, Long, E, Sudakov, B

Approximately Counting Locally-Optimal Structures by Goldberg, L, Gysel, R, Lapinskas, J

“…However, we highlight an interesting phenomenon that arises in approximate counting, where approximately counting locally-optimal structures is apparently more difficult than approximately counting globally-optimal structures. …”

Sexual violence: unacceptable on all counts by Ahmad, L

Counting electrons in transmission electron microscopes by Moldovan, G, Li, X, Wilshaw, P, Kirkland, A

Photon counting with a loop detector. by Banaszek, K, Walmsley, I

“…We propose a design for a photon-counting detector that is capable of resolving multiphoton events. …”

Immunoplatelet counting: Platelet transfusions - Response by Norris, S, Pantelidou, D, Smith, D, Murphy, M

Counting rational points on algebraic varieties by Heath-Brown, D, Browning, T, Salberger, P

Parameterized counting and Cayley graph expanders by Peyerimhoff, N, Roth, M, Schmitt, J, Stix, J, Vdovina, A, Wellnitz, P

“…Specifically, we study the parameterized complexity of # EdgeSub (Φ) with respect to both approximate and exact counting, as well as its decision version EdgeSub (Φ). …”

Epidemiology: Count the dead, measure the living. by Whitlock, G, Huxley, R

Parameterized counting of partially injective homomorphisms by Roth, M

“…We study the parameterized complexity of the problem of counting graph homomorphisms with given partial injectivity constraints, i.e., inequalities between pairs of vertices, which subsumes counting of graph homomorphisms, subgraph counting and, more generally, counting of answers to equi-join queries with inequalities. …”

Counting subgraphs in somewhere dense graphs by Bressan, M, Goldberg, LA, Meeks, K, Roth, M

“…<p>We study the problems of counting copies and induced copies of a small pattern graph H in a large host graph G. …”

Counting solutions to random CNF formulas by Galanis, A, Goldberg, LA, Guo, H, Yang, K

“…We give the first efficient algorithm to approximately count the number of solutions in the random $k$-SAT model when the density of the formula scales exponentially with $k$. …”

The complexity of counting surjective homomorphisms and compactions by Focke, J, Goldberg, L, Zivny, S

“…In this paper, we give a complete characterisation of the complexity of counting surjective homomorphisms from an input graph G to a fixed graph H and we also give a complete characterisation of the complexity of counting compactions from an input graph G to a fixed graph H.…”

Counting list matrix partitions of graphs by Göbel, A, Goldberg, L, McQuillan, C, Richerby, D, Yamakami, T

“…We give an algorithm that counts list <em>M</em> partitions in polynomial time for every (fixed) matrix <em>M</em> in this set. …”

Automated counting of mammalian cell colonies. by Barber, P, Vojnovic, B, Kelly, J, Mayes, C, Boulton, P, Woodcock, M, Joiner, M

“…From the variation in the counts, it is shown that the automated counts are generally more consistent than the manual counts.…”

HALL ALGEBRAS AND CURVE-COUNTING INVARIANTS by Bridgeland, T

Vortex Counting and Lagrangian 3-manifolds by Dimofte, T, Gukov, S, Hollands, L

“…Degenerate limits of vertex operators in CFT receive a simple interpretation via geometric transitions in BPS counting.…”

Nominals‚ Inverses‚ Counting‚ and Conjunctive Queries by Rudolph, S, Glimm, B

The complexity of counting surjective homomorphisms and compactions by Focke, J, Goldberg, L, Zivny, S

“…In this paper, we give a complete characterization of the complexity of counting surjective homomorphisms from an input graph $G$ to a fixed graph $H$, and we also give a complete characterization of the complexity of counting compactions from an input graph $G$ to a fixed graph $H$. …”

Counting sets with small sumset and applications by Green, B, Morris, R