This paper proves DP-completeness of Exact-3-DNP and Exact-4-DNP by reducing 3SAT to these problems.

The paper settles the computational complexity of Quoridor and related games by reducing them to Reisch's planar graph-Hex.

The authors prove that the solution-search problem for Ice Walk puzzle is ASP-complete by reducing Hamiltonian cycles in a maximum-degree-3 spanning subgraph of a rectangular grid graph to Ice Walk so…

This paper simplifies the proof of the bound on the target dimension for reducing the dimension of high-dimensional polygonal curves using random projections, extending it to various distance measures…

This paper systematically analyzes combining dimensionality reduction and quantization to compress text embeddings, showing that this combined approach achieves substantial compression (e.g., 0.1% siz…

This paper introduces structured cut sets, a novel preprocessing technique for Maximum k-Cut, and extends existing techniques from Maximum Cut. The rules are optimality-preserving and yield significan…

This paper presents approximation algorithms for the one-way directed Reachability-Preserving Minimum Edge Cut problem in directed graphs.

This paper proves a coarse tree decomposition of graphs with bounded adhesion sets and separators.

This paper provides new upper bounds and algorithms for the shortest path map equivalence decomposition of a polygonal domain, leading to solutions for two-point shortest path queries, geodesic diamet…

This paper introduces a structural theorem for the sparsifiability of real-valued codes, which generalizes both combinatorial and continuous notions of sparsification.

The paper shows that an oddomorphism between graphs does not imply graph minor containment and introduces a new structural relation called split-off minor.

This paper proves that testing the equivalence of finite closure systems specified by implicational and intersection methods is coNP-complete.

The paper shows that every problem asking if a given graph has an edge-coloring without an edge-colored clique from a fixed family is poly-time equivalent to a Constraint Satisfaction Problem, resulti…

This paper studies the complexity of the graph homomorphism problem in terms of the degeneracy of the target graph and shows that under ETH, there is no efficient algorithm for this problem.

KoAT is a tool that automatically infers complexity bounds and proves termination of integer programs using an alternating modular analysis approach and a portfolio of techniques.

The paper introduces a method to efficiently detect 'essential' constraints in Boolean MinCSPs, significantly reducing the search space for solving these problems and providing a dichotomy theorem for…

The paper provides a constructive, intuitionistically valid proof of Rice's Theorem and the Halting Problem undecidability by reducing the problem to the undecidability of Hilbert's Tenth Problem (MRD…

This paper improves the time complexity of exact algorithms for converting a connected graph into a cactus by reducing it from O*(3^n) to O*(2^n) for unweighted graphs, and provides faster algorithms…