Information Processing Letters

Recently, Jecker has introduced and studied the regular D-length of a monoid, as the length of its longest chain of regular D-classes. We use this parameter in order to improve the construction, originally proposed by Colcombet, of a ...

• Regular D-length improves idempotent gathering.
• Ramsey-like factorisations can be obtained compositionally.
• We apply our construction to speed-up infix query evaluation.

Given a set P = { p 1 , p 2 , … , p n } of n points in R 2 and a positive integer k ( ≤ n ), we wish to find a subset S of P of size k such that the cost of a subset S, c o s t ( S ) = min ⁡ { d ( p , q ) | p , q ∈ S }, is maximized, where d ( p ,...

• The paper studies the dispersion problem on convex polygon.
• A greedy approximation algorithm is proposed which gives 1.733 factor result.
• Furthermore, an O(n3) time algorithm is proposed where the objective is to select 4 points ...

We present a new complementation construction for nondeterministic automata on finite trees. The traditional complementation involves determinization of the corresponding bottom-up automaton (recall that top-down deterministic automata are less ...

• We present a new complementation construction for nondeterministic automata on finite trees.
• The construction works in a top-down fashion, without determinization.
• The construction generalizes the standard complementation procedure ...

In evolutionary biology, networks are becoming increasingly used to represent evolutionary histories for species that have undergone non-treelike or reticulate evolution. Such networks are essentially directed acyclic graphs with a leaf set that ...

• Proper forest-based networks model evolutionary processes such as introgression.
• We consider problem (P): Is a given m-rooted network N proper forest-based?
• We show (P) can be solved in polynomial time if N is 2-rooted, binary tree-...

We consider the differentially private (DP) facility location problem in the so called super-set output setting proposed by Gupta et al. [13]. The current best known expected approximation ratio for an ϵ-DP algorithm is O ( log ⁡ n ϵ ) due to ...

• Study facility location problem under differential privacy constraints in the super-set output model.
• Previous best algorithm gave O ( log ⁡ n / ϵ )-approximation and previous lower bound on the approximation ratio was O ( 1 / ϵ ).

In this paper, some lower and upper bounds for the subgraph centrality and communicability of a graph are proved. The expected value of the normalized total communicability of a random G ( n , p ) graph is also considered and asymptotically ...

• Devoted to subgraph centralityو communicability and total communicability.
• Lower and upper bounds for these parameters.
• Asymptotic bound for normalized total communicability.
• Computational comparison with other bounds.
• ...

This article treats AND-OR tree computation in terms of query complexity. We are interested in the cases where assignments (inputs) or algorithms are randomized. For the former case, it is known that there is a unique randomized assignment ...

• Uniqueness of optimal randomized algorithms fails for weakly-balanced AND-OR tree.
• Application of the results on randomized algorithms by Saks & Wigderson (1986).
• Using versatile linear algebraic method for two-player mixed ...

One way to define the Matching Cut problem is: Given a graph G, is there an edge-cut M of G such that M is an independent set in the line graph of G? We propose the more general Conflict-Free Cut problem: Together with the graph G, we are given a ...

• We propose Conflict-Free Cut, which is a very natural generalization of Matching Cut.
• Conflict-Free Cut remains NP-complete, even when Δ ( G ) ≤ 5 and G ˆ is 1-regular.
• Conflict-Free Cut is not solvable in 2 o ( n + m ) time ...

We initiate the study of spanners under the Hausdorff and Fréchet distances. Let S be a set of points in R d and ε a non-negative real number. A subgraph H of the Euclidean graph over S is an ε-Hausdorff-spanner (resp., an ε-Fréchet-spanner) of S,...

• We initiate the study of spanners under the Hausdorff and Fréchet distances.
• We show that any t-spanner of a planar point-set S is a f(t)-Hausdorff-spanner and a g(t)-Fréchet spanner.
• We prove that for any t > 1, there exist a set ...

The labelling-based approach of abstract argumentation frameworks (AAFs) is beneficial for various applications requiring different levels of decisiveness. For labelling-based semantics, this paper provides an operator so-called reduced meet ...

• The operator ⋂ D called reduced meet modulo an ultrafilter is introduced for labelling-based semantics.
• All fundamental labelling based semantics of AAFs are shown to be closed under the operator ⋂ D.
• Several metatheorems are ...

Consider a set of demands, each taking length-k strings as input. The k-restriction problem is to construct a small set of length-m strings, such that given any k positions and any demand, there exists a string in the set satisfying the demand at ...

• We show VC-dimension and Lovàsz Local Lemma imply size bounds independent of the number of demands.
• We prove better bounds for demands with finite VC-dimension.

In this paper, we derive parameterized Chernoff bounds and show their applications for simplifying the analysis of some well-known probabilistic algorithms and data structures. The parameterized Chernoff bounds we provide give probability bounds ...

• New, parameterized Chernoff bounds likely to be used by other researchers.
• Parameterized powers-of-twos Chernoff bounds are more appropriate for certain applications.
• A new, optimal selection algorithm, which is simpler than the ...

The seminal work by Pagh [1] proposed a matrix multiplication algorithm for real-valued squared matrices called Compressed Matrix Multiplication (CMM) having a sparse matrix output product. The algorithm is based on a popular sketching technique ...

• This work proposes an improvement to the compressed matrix multiplication (CMM) algorithm.
• Our proposal, CV-CMM, is based on the control variate (CV) method.
• Our proposal provides more accurate matrix product estimates compared to ...

The balanced hypercube B H n, a variant of the hypercube, is a novel interconnection network topology for massive parallel systems. It is showed in [Theor. Comput. Sci. 947 (2023) 113708] that for any edge subset F of B H n there exists a fault-...

• The balanced hypercube admits a Hamiltonian cycle after the removal of any matching.
• The matching can be a perfect matching.
• The largest number of faulty edges in the matching is exponential to the dimension.

Fair division is a longstanding problem in economics and has recently received substantial interest in computer science. Several applications of fair division involve agents with unequal entitlements represented by weights. We review work on ...

• Fair division has received substantial interest in economics and computer science.
• Several applications involve agents with unequal entitlements represented by weights.
• We review weighted fair division of indivisible items and ...

Using the notion of visibility representations, our paper establishes a new property of instances of the Nondeterministic Constraint Logic (NCL) problem (a PSPACE-complete problem that is very convenient to prove the PSPACE-hardness of reversible ...

• Resolves an open problem regarding the Hanano Puzzle that was posed in IPL.
• Proposes a new framework to study games with irreversible gravity.
• Previous approaches for such games relied on problem-specific tricks.
• Provides a way ...

A subset S of the vertex set of a graph G is an F -isolating set of G if G − N [ S ] does not contain a copy of a member of F as a subgraph, where F is a family of connected graphs and N [ S ] is the closed neighborhood of S. The F -isolation ...

• An appealing and natural generalization of classical domination problems.
• The decision version of { P k }-ISOLATION remains NP-complete on chordal graphs and planar graphs.
• A linear time algorithm to compute a minimum { P k }-...