Showing papers in "Journal of Computer and System Sciences in 2020"

TL;DR: Focusing on dimensions k = 1, 2, this work investigates subgraph patterns whose counts are k - WL invariant, and whose occurrence is k -WL invariants, and achieves a complete description of all such patterns for dimension k =1 and considerably extend the previous results known for k = 2.

TL;DR: The notion of a temporal core (vertices whose incident edges change over time) is introduced and it is proved that the non-strict variant is fixed-parameter tractable when parameterized by the temporal core size, while the strict variant remains NP -complete, even for constant-size temporal cores.

TL;DR: This paper introduces and study two natural temporal extensions of the classical problem VERTEX COVER and presents a thorough investigation of the computational complexity and approximability of these two temporal covering problems.

TL;DR: It is shown that UniqueEOPL contains several important problems such as the P-matrix Linear Complementarity Problem, finding fixed points of Contraction Maps, and solving Unique Sink Orientations.

TL;DR: A solution to an open problem that is how to count and enumerate tree-child networks with fixed number of leaves and reticulations with galled trees is provided.

TL;DR: The 2-D Tucker search problem is shown to be PPA-hard under many-one reductions; therefore it is complete for PPA as mentioned in this paper. And the same holds for k-d Tucker for all k ≥ 2.

TL;DR: In this paper, the complexity of finding weighted homomorphisms from intersection graphs of curves (string graphs) with n vertices to a fixed graph H was studied. And they provided a complete dichotomy for the problem: if H has no two vertices sharing two common neighbors, then the problem can be solved in time Ω(n^{2/3} \log n)

TL;DR: In this paper, the authors consider threshold group testing, a generalization of combinatorial group testing where the output of each test is an answer to the question: is there at least one positive element inside a query set Q?

TL;DR: It is shown that structures with only one binary function symbol are universal for “online” (punctual) computable structures and that punctually categorical graphs are not universal for online computability.

TL;DR: This paper thoroughly investigates the complexity of two naturally related, but fundamentally different, temporal path problems, called Minimum Arrival and Best Policy, and studies the hierarchy of models of memory-k, in an edge-centric network evolution setting.

TL;DR: In this paper, a special decomposition of 3-partite graphs is proposed to determine whether a given hereditary graph class is well-quasi-ordered by the induced subgraph relation.

TL;DR: It is proved that RSPQ ( L ) is either -complete or -complete depending on the language L, and provides a simple characterization of the tractable fragment in terms of regular expressions.

TL;DR: This paper provides lower bounds under the ETH on the smallest function f F such that F -M-Deletion can be solved in time f F ( tw ) ⋅ n O ( 1 ) on n-vertex graphs, where tw denotes the treewidth of G.

TL;DR: This paper proposes a generic construction of SCF-PEKS with multiple keywords (SCF-MPEKS) from hidden vector encryption, tag-based encryption, and a one-time signature, and provides adaptive security, where the test queries are allowed in the security model, and does not require random oracles.

TL;DR: The online problem is resolved and a lower bound strictly larger than 2 is proved on the asymptotic competitive ratio of the online 2-dimensional vector packing problem, where no such lower bound was known even for fixed high dimensions.

TL;DR: In this article, the reconstruction problem in the congested clique model was studied and the lower bound was shown to be tight and that it is possible to achieve it with only 2 rounds.

TL;DR: The bounds of ρ k ( G ) were provided only for k ∈ { 1, 2 } and this study provides the bounds of k ≥ 2, providing the minimum cardinality over all k-extra edge-cuts of G.

TL;DR: It is shown that assuming ETH, there is no algorithm solving 2 -Club Cluster Edge Deletion in time 2 o ( k ) n O ( 1 ) and the same lower bound holds in the case of s -Club d -Cluster Edge Deletsion for any s ≥ 2 and d ≥ 2.

TL;DR: Analyzing pseudo-telepathy graph games, this work proposes a way to build contextuality scenarios exhibiting the quantum supremacy using graph states and investigates which scenarios are more multipartite and shows that there exist graphs generating scenarios with a linear multipartiteness width.

TL;DR: This work introduces the concept of control in judgment aggregation, making use of the preference types introduced by Dietrich and List and studying the class of uniform premise-based quota rules for these control problems in terms of their computational complexity.

TL;DR: A systematic treatment of complexity measures arising in Computational Geometry and Statistical Learning is given and several new upper bounds on the sizes of ϵ-nets are obtained that improve the best known general guarantees.

TL;DR: It is proved that Thiagarajan's conjecture is true for regular event structures whose domains occur as principal filters of hyperbolic CAT(0) cube complexes which are universal covers of finite nonpositively curved cube complexes.

TL;DR: The problem if a given configuration of a pushdown automaton (PDA) is bisimilar with some (unspecified) finite-state process is shown to be decidable, and the decidability is proven in the framework of first-order grammars, which are given by finite sets of labelled rules that rewrite roots offirst-order terms.

TL;DR: A dichotomy theorem for a symmetric arity 4 signature with complex weights in the planar Holant framework is obtained, which is used in the proof of the #CSP dichotomy.

TL;DR: In this article, the complexity of approximate counting constraint satisfactions problems # CSP (F ) is analyzed, where F is a set of nonnegative rational-valued functions of Boolean variables and a complete classification is known if F contains arbitrary unary functions.

TL;DR: The notion of β-pseudoconveXity is introduced, which implies Gromov's ϵ-quasiconvexity, and the abundance of pseudoconvex sets in δ-hyperbolic graphs is illustrated, showing that all sets C ≤ k ( G) = { v ∈ V : e G ( v ) ≤ r a d ( G ) + k } , k ∈ N , are ( 2 δ − 1 ) -pseud

TL;DR: The Connected Secluded Π -Subgraph problem is FPT when parameterized by just t for many important graph properties Π, and the situation changes when the authors are looking for a connected induced subgraph satisfying Π.

TL;DR: It is proved that S-TCP parameterized by r is W [ 2 ] -hard even if l is bounded by a constant and that such a version of the problem does not admit a polynomial kernel, unless NP ⊆ coNP/poly .

TL;DR: In this article, it was shown that the maximal time of simulation of any n-complete transformation of A n is at least 2n, where n is the number of registers in the transformation.

TL;DR: It is proved that Disconnected Cut is polynomial-time solvable on claw-free graphs, answering a question of Ito et al. (TCS 2011) and proving the basis for this result is a decomposition theorem for claw- free graphs of diameter 2.