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

TL;DR: This article shows that both graph modification problems are Open image in new window -hard, resolving a conjecture by Natanzon, Shamir, and Sharan (2001), and gives a subexponential time parameterized algorithm solving this problem.

TL;DR: A secure searchable encryption scheme using Hash based Indexing that consists of Elliptic curve based ElGamal additive homomorphic encryption is proposed in this article , which obviates the need for generation and resource intensive processing on complex trapdoor system and binary query scheme.

TL;DR: In this paper , it was shown that orthogonal planarity can be solved in O(n 3 log n) time, where n is the number of vertices in the graph with degree at most two.

TL;DR: This paper reduces SSAT to the Nearest Codeword Problem (NCP) and Learning Halfspace Problem (LHP) and proves that both these problems are NP-hard to approximate within polynomial factors.

TL;DR: In this paper , a linear time algorithm was proposed to compute median in median graphs and to compute the Wiener index in linear time and the distance matrix in optimal quadratic time.

TL;DR: In this article , the authors presented a combinatorial two-phase heuristic for the general Steiner tree in greedy strategy that achieves an approximation ratio of 1.162 + ϵ for complete graphs with edge distances 1 and 2.

TL;DR: In this article , it was shown that the problem of deciding if an AT-free graph contains a fixed graph H as an induced topological minor admits a polynomial-time algorithm.

TL;DR: This work analyzes the algorithm of Byrka et al. and presents a combinatorial two-phase heuristic for the general Steiner tree in greedy strategy that achieves an approximation ratio of 1.4295.

TL;DR: In this paper, it was shown that the problem of deciding if an AT-free graph contains a fixed graph H as an induced topological minor admits a polynomial-time algorithm.

TL;DR: To the best of the knowledge, this is the first fully dynamic strong-connectivity algorithm achieving both sublinear update time and polylogarithmic query time for an important class of digraphs.

TL;DR: In this article, it was shown that satisfiability of word equations is in non-deterministic linear space, thus the language of satisfiable word equations was context-sensitive.

TL;DR: In this paper , the authors considered the problem of building distance sensitivity oracles (DSOs), and proposed a simple DSO with O(n 2.7233 M ) preprocessing time and O( 1 ) query time.

TL;DR: In this paper , it was shown that H-free edge editing is incompressible for graphs with at most five vertices that are not complete or empty, and that there is no other H with at least 5 vertices with a polynomial kernel.

TL;DR: In this paper, the authors considered the problem of building distance sensitivity oracles (DSOs), and proposed a simple DSO with O(n 2.7233 M ) preprocessing time and O( 1 ) query time.

TL;DR: In this paper , it was shown that satisfiability of word equations is in non-deterministic linear space, thus the language of satisfiable word equations was context-sensitive.

TL;DR: In this paper , a new perspective on the well-established study of fixed points in BNs is presented, where the authors prove that these problems are in P or complete for NP, NPNP, NP#P or NEXPTIME.

TL;DR: In this article, the OMv-conjecture was shown to not hold when t ≥ 3 and d ≥ 2, regardless of the join topology, and a dichotomy as to when feasible structures exist: they do when t = 2 or d = 1.

TL;DR: The current state-of-the-art algorithm of Brand and Pratt as discussed by the authors achieves the almost competitive bound of 2.619k⋅poly(n) for deterministically finding paths of length k, while allowing for the same running time for the k-internal out-branching problem.

TL;DR: In this paper , the authors study the approximate existential theory of the reals (ϵ-ETR) in which the constraints are only satisfied approximately, and they obtain a (quasi-)polynomial time approximation scheme ((Q)PTAS) for a fragment of constrained ϵ -ETR.

TL;DR: In this article , it was shown that threshold editing and chain editing are both NP-hard problems with complexity 2 O(k log k + nO(1) and O(nO( 1) respectively.

TL;DR: In this article , the authors consider the design of dependable SDNs through the lenses of self-stabilization and develop algorithms for an in-band and distributed control plane for SDNs, which tolerate a wide range of failures.

TL;DR: In this paper , the OMv-conjecture was shown to not hold for intersection join topologies when t ≥ 3 and d ≥ 2 , regardless of the join topology.

TL;DR: In this paper, two new versions of enumeration kernels were proposed by asking that the solutions of the original instance can be enumerated in polynomial time or with a delay from the kernel solutions.

TL;DR: In this paper , the authors gave an O(t4/3)-time algorithm for the all-targets version of the problem, where u denotes the maximum coin value.

TL;DR: In this paper , the authors obtained an approximation ratio 4 + 2 ℓ ≈ 4 + 4 lg ⁡ k + 1 2 lg + 1 + 1 ⌋ for the undirected k-connected subgraph problem.

TL;DR: In this article , a constant factor approximation of the shortest and closest lattice vector problem in any ℓ p -norm can be computed in time 2 ( 0.802 + ε ) n .

TL;DR: It is shown that a constant factor approximation of the shortest and closest lattice vector problem w.r.t. `∞ can be computed in time 2(0.802+ε)n, breaking the kissing number barrier of 3n.

TL;DR: In this paper , the authors studied the problem of counting the number of nodes in anonymous dynamic networks without any distinguished nodes. But they did not consider the problem with more than one distinguished node.

TL;DR: This work studies challenging questions that naturally follow: how to efficiently count with more than one distinguished node, or how to count without any distinguished node.

TL;DR: The existence of polynomial kernels for H-free edge editing (that is, whether it is possible to reduce the size of the instance to k^O(1) in poly(n) time) was investigated in the parameterized complexity literature as mentioned in this paper.