book Author Title 58 Bijo S Anand Atoms and clique separators in graph products 59 Asir T Domination in total graph of a commutative ring 60 Sharada B On the Neighbourhood Subdivi...
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
Weprovethatthegenusoftheboundaryofadigitalimageispreciselyhalfofthe sum of the cycle ranks of three particular graphs: the “foreground graph” and “background graph,” which ...
The topological Tverberg theorem states that for any prime power q and continuous map from a (d + 1)(q − 1)-simplex to Rd , there are q disjoint faces Fi of the simplex whose im...
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...