The Computational Complexity of the Game of Set and its Theoretical Applications

The game of SET is a popular card game in which the objective is to form Sets using cards from a special deck. In this paper we study single- and multi-round variations of this game from the computational complexity point of view and establish interesting connections with other classical computational problems. Specifically, we first show that a natural generalization of the problem of finding a single Set, parameterized by the size of the sought Set is W-hard; our reduction applies also to a natural parameterization of Perfect Multi-Dimensional Matching, a result which may be of independent interest. Second, we observe that a version of the game where one seeks to find the largest possible number of disjoint Sets from a given set of cards is a special case of 3-Set Packing; we establish that this restriction remains NP-complete. Similarly, the version where one seeks to find the smallest number of disjoint Sets that overlap all possible Sets is shown to be NP-complete, through a close connection to the Independent Edge Dominating Set problem. Finally, we study a 2-player version of the game, for which we show a close connection to Arc Kayles, as well as fixed-parameter tractability when parameterized by the number of rounds played

Expanding the expressive power of Monadic Second-Order logic on restricted graph classes

We combine integer linear programming and recent advances in Monadic Second-Order model checking to obtain two new algorithmic meta-theorems for graphs of bounded vertex-cover. The first shows that cardMSO1, an extension of the well-known Monadic Second-Order logic by the addition of cardinality constraints, can be solved in FPT time parameterized by vertex cover. The second meta-theorem shows that the MSO partitioning problems introduced by Rao can also be solved in FPT time with the same parameter. The significance of our contribution stems from the fact that these formalisms can describe problems which are W[1]-hard and even NP-hard on graphs of bounded tree-width. Additionally, our algorithms have only an elementary dependence on the parameter and formula. We also show that both results are easily extended from vertex cover to neighborhood diversity.Comment: Accepted for IWOCA 201

On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT

Hitting Set is a classic problem in combinatorial optimization. Its input consists of a set system F over a finite universe U and an integer t; the question is whether there is a set of t elements that intersects every set in F. The Hitting Set problem parameterized by the size of the solution is a well-known W[2]-complete problem in parameterized complexity theory. In this paper we investigate the complexity of Hitting Set under various structural parameterizations of the input. Our starting point is the folklore result that Hitting Set is polynomial-time solvable if there is a tree T on vertex set U such that the sets in F induce connected subtrees of T. We consider the case that there is a treelike graph with vertex set U such that the sets in F induce connected subgraphs; the parameter of the problem is a measure of how treelike the graph is. Our main positive result is an algorithm that, given a graph G with cyclomatic number k, a collection P of simple paths in G, and an integer t, determines in time 2^{5k} (|G| +|P|)^O(1) whether there is a vertex set of size t that hits all paths in P. It is based on a connection to the 2-SAT problem in multiple valued logic. For other parameterizations we derive W[1]-hardness and para-NP-completeness results.Comment: Presented at the 41st International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2015. (The statement of Lemma 4 was corrected in this update.

Cell division in apicomplexan parasites is organized by a homolog of the striated rootlet fiber of algal flagella

Apicomplexa are intracellular parasites that cause important human diseases including malaria and toxoplasmosis. During host cell infection new parasites are formed through a budding process that parcels out nuclei and organelles into multiple daughters. Budding is remarkably flexible in output and can produce two to thousands of progeny cells. How genomes and daughters are counted and coordinated is unknown. Apicomplexa evolved from single celled flagellated algae, but with the exception of the gametes, lack flagella. Here we demonstrate that a structure that in the algal ancestor served as the rootlet of the flagellar basal bodies is required for parasite cell division. Parasite striated fiber assemblins (SFA) polymerize into a dynamic fiber that emerges from the centrosomes immediately after their duplication. The fiber grows in a polarized fashion and daughter cells form at its distal tip. As the daughter cell is further elaborated it remains physically tethered at its apical end, the conoid and polar ring. Genetic experiments in Toxoplasma gondii demonstrate two essential components of the fiber, TgSFA2 and 3. In the absence of either of these proteins cytokinesis is blocked at its earliest point, the initiation of the daughter microtubule organizing center (MTOC). Mitosis remains unimpeded and mutant cells accumulate numerous nuclei but fail to form daughter cells. The SFA fiber provides a robust spatial and temporal organizer of parasite cell division, a process that appears hard-wired to the centrosome by multiple tethers. Our findings have broader evolutionary implications. We propose that Apicomplexa abandoned flagella for most stages yet retained the organizing principle of the flagellar MTOC. Instead of ensuring appropriate numbers of flagella, the system now positions the apical invasion complexes. This suggests that elements of the invasion apparatus may be derived from flagella or flagellum associated structures

Parameterized Algorithms for Modular-Width

It is known that a number of natural graph problems which are FPT parameterized by treewidth become W-hard when parameterized by clique-width. It is therefore desirable to find a different structural graph parameter which is as general as possible, covers dense graphs but does not incur such a heavy algorithmic penalty. The main contribution of this paper is to consider a parameter called modular-width, defined using the well-known notion of modular decompositions. Using a combination of ILPs and dynamic programming we manage to design FPT algorithms for Coloring and Partitioning into paths (and hence Hamiltonian path and Hamiltonian cycle), which are W-hard for both clique-width and its recently introduced restriction, shrub-depth. We thus argue that modular-width occupies a sweet spot as a graph parameter, generalizing several simpler notions on dense graphs but still evading the "price of generality" paid by clique-width.Comment: to appear in IPEC 2013. arXiv admin note: text overlap with arXiv:1304.5479 by other author

Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter

An important result in the study of polynomial-time preprocessing shows that there is an algorithm which given an instance (G,k) of Vertex Cover outputs an equivalent instance (G',k') in polynomial time with the guarantee that G' has at most 2k' vertices (and thus O((k')^2) edges) with k' <= k. Using the terminology of parameterized complexity we say that k-Vertex Cover has a kernel with 2k vertices. There is complexity-theoretic evidence that both 2k vertices and Theta(k^2) edges are optimal for the kernel size. In this paper we consider the Vertex Cover problem with a different parameter, the size fvs(G) of a minimum feedback vertex set for G. This refined parameter is structurally smaller than the parameter k associated to the vertex covering number vc(G) since fvs(G) <= vc(G) and the difference can be arbitrarily large. We give a kernel for Vertex Cover with a number of vertices that is cubic in fvs(G): an instance (G,X,k) of Vertex Cover, where X is a feedback vertex set for G, can be transformed in polynomial time into an equivalent instance (G',X',k') such that |V(G')| <= 2k and |V(G')| <= O(|X'|^3). A similar result holds when the feedback vertex set X is not given along with the input. In sharp contrast we show that the Weighted Vertex Cover problem does not have a polynomial kernel when parameterized by the cardinality of a given vertex cover of the graph unless NP is in coNP/poly and the polynomial hierarchy collapses to the third level.Comment: Published in "Theory of Computing Systems" as an Open Access publicatio

Vortex and half-vortex dynamics in a spinor quantum fluid of interacting polaritons

Spinorial or multi-component Bose-Einstein condensates may sustain fractional quanta of circulation, vorticant topological excitations with half integer windings of phase and polarization. Matter-light quantum fluids, such as microcavity polaritons, represent a unique test bed for realising strongly interacting and out-of-equilibrium condensates. The direct access to the phase of their wavefunction enables us to pursue the quest of whether half vortices ---rather than full integer vortices--- are the fundamental topological excitations of a spinor polariton fluid. Here, we are able to directly generate by resonant pulsed excitations, a polariton fluid carrying either the half or full vortex states as initial condition, and to follow their coherent evolution using ultrafast holography. Surprisingly we observe a rich phenomenology that shows a stable evolution of a phase singularity in a single component as well as in the full vortex state, spiraling, splitting and branching of the initial cores under different regimes and the proliferation of many vortex anti-vortex pairs in self generated circular ripples. This allows us to devise the interplay of nonlinearity and sample disorder in shaping the fluid and driving the phase singularities dynamicsComment: New version complete with revised modelization, discussion and added material. 8 pages, 7 figures. Supplementary videos: https://drive.google.com/folderview?id=0B0QCllnLqdyBfmc2ai0yVF9fa2g2VnZodGUwemVkLThBb3BoOVRKRDJMS2dUdjlZdkRTQk

Kernelization and Parameterized Algorithms for 3-Path Vertex Cover

A 3-path vertex cover in a graph is a vertex subset $C$ such that every path of three vertices contains at least one vertex from $C$. The parameterized 3-path vertex cover problem asks whether a graph has a 3-path vertex cover of size at most $k$. In this paper, we give a kernel of $5k$ vertices and an $O^*(1.7485^k)$-time and polynomial-space algorithm for this problem, both new results improve previous known bounds.Comment: in TAMC 2016, LNCS 9796, 201