相关论文: On the NP-Completeness of Satisfying Certain Path …

The (Perfect) Matching Cut problem is to decide if a connected graph has a (perfect) matching that is also an edge cut. The Disconnected Perfect Matching problem is to decide if a connected graph has a perfect matching that contains a…

Metric Temporal Logic, $\mtlfull$ is amongst the most studied real-time logics. It exhibits considerable diversity in expressiveness and decidability properties based on the permitted set of modalities and the nature of time interval…

We show the existence of regular combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, t-designs, and t-wise…

We present an efficient Neural Neighborhood Search (N2S) approach for pickup and delivery problems (PDPs). In specific, we design a powerful Synthesis Attention that allows the vanilla self-attention to synthesize various types of features…

Let $P$ and $Q$ be finite point sets of the same cardinality in $\mathbb{R}^2$, each labelled from $1$ to $n$. Two noncrossing geometric graphs $G_P$ and $G_Q$ spanning $P$ and $Q$, respectively, are called compatible if for every face $f$…

We prove a complete dichotomy theorem for the parameterized sparse $t$-uniform hypergraphic degree sequence problem, $\mathrm{sparse}\text{-}t\text{-}\mathrm{uni}\text{-}\mathrm{HDS}_{\alpha',\alpha}$. For any fixed $t \ge 3$, given…

Nondango is a pencil puzzle consisting of a rectangular grid partitioned into regions, with some cells containing a white circle. The player has to color some circles black such that every region contains exactly one black circle, and there…

We discuss the existence of vertex disjoint path coverings with prescribed ends for the $n$-dimensional hypercube with or without deleted vertices. Depending on the type of the set of deleted vertices and desired properties of the path…

In this paper we present a Hashed-Path Traveling Salesperson Problem (HPTSP), a new type of problem which has the interesting property of having no polynomial time solutions. Next we show that HPTSP is in the class NP by demonstrating that…

Motivated by a relaxed notion of the celebrated Hamiltonian cycle, this paper investigates its variant, parity Hamiltonian cycle (PHC): A PHC of a graph is a closed walk which visits every vertex an odd number of times, where we remark that…

We apply Kovacic's algorithm from differential Galois theory to show that all complex non-oscillatory solutions (finite exponential of convergence of zeros) of certain Hill equations considered by Bank and Laine using Nevanlinna theory must…

Szepietowski [A. Szepietowski, Hamiltonian cycles in hypercubes with $2n-4$ faulty edges, Information Sciences, 215 (2012) 75--82] observed that the hypercube $Q_n$ is not Hamiltonian if it contains a trap disconnected halfway. A proper…

A dichotomy theorem for counting problems due to Creignou and Hermann states that or any nite set S of logical relations, the counting problem #SAT(S) is either in FP, or #P-complete. In the present paper we show a dichotomy theorem for…

Conjecturing and theorem proving are activities at the center of mathematical practice and are difficult to separate. In this paper, we propose a framework for completing incomplete conjectures and incomplete proofs. The framework can turn…

We consider the following problem: Given a finite set of straight line segments in the plane, determine the positions of a minimal number of points on the segments, from which guards can see all segments. This problem can be interpreted as…

Wu in 1999 conjectured that if $H$ is a subgraph of the complete graph $K_{2n+1}$ with $n$ edges, then there is a Hamiltonian cycle decomposition of $K_{2n+1}$ such that each edge of $H$ is in a separate Hamiltonian cycle. The conjecture…

We consider the distributed message-passing {LOCAL} model. In this model a communication network is represented by a graph where vertices host processors, and communication is performed over the edges. Computation proceeds in synchronous…

A Hamilton cycle in a directed graph $G$ is a cycle that passes through every vertex of $G$. A Hamiltonian decomposition of $G$ is a partition of its edge set into disjoint Hamilton cycles. In the late $60$s Kelly conjectured that every…

Many evolutionary and constructive heuristic approaches have been introduced in order to solve the Traveling Thief Problem (TTP). However, the accuracy of such approaches is unknown due to their inability to find global optima. In this…

We show that the problem of covering a set of points in the plane with a minimum number of guillotine cuts is NP-complete. To that end, first we present a new NP-completeness proof for the problem of covering points with disjoint line…