This paper studies the autarky problem of scheduling energy-consuming jobs with time windows using a battery and an energy forecast, and shows NP-hardness, polynomial-time solvability, and fixed-param…

The paper improves Banaszczyk's inequality, providing a significantly better tail estimate for the discrete Gaussian measure on a lattice, which has applications in analyzing dual attacks against the…

This paper provides bounds on the difference between the annihilation number and independence number of a finite simple graph, and proves these bounds for various types of graphs.

This paper shows #P-completeness for several graph counting problems using a new technique.

This paper analyzes the computational complexity of evaluating recurrent functions, showing that the complexity depends heavily on how the input offsets are encoded and the structure of the recurrence…

The paper studies properties of parity based bit-counting complexity classes B|0|⊕P and B|1|⊕P, proves inclusions and closures, and shows they contain PH and are contained in CH.

This paper studies the NP-completeness and provides a polynomial-time algorithm for the disjoint separators problem in planar graphs when all sizes are equal to one.

This paper studies the decidability and complexity properties of unary three-way and two-way deterministic and nondeterministic two-dimensional automata.

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

The paper proves that the proximity gaps conjecture fails for a specific family of Reed-Solomon codes near their capacity rate, specifically at radii $O(1/ ext{log } n)$ below capacity.

The paper studies the affine family of signings for a d-regular graph and shows that averaging over it converts the sign problem of the Bilu-Linial conjecture into a counting problem, proving matched…

The paper analyzes the structured CVP distance on the log-unit lattice of cyclotomic fields, significantly reducing the conjectured CDPR factor for the ML-KEM cryptosystem from exponential to sub-poly…

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

This paper proves lower bounds for the size of multiplicative graph spanners in the $f$-degree fault tolerant model, matching previous conditional lower bounds and current upper bounds.

This paper presents a simpler variation of the NC detection criterion for perfect matchings in bipartite graphs with improved parameters.

The paper presents black box algorithms for constructing standard generators and performing membership testing in Suzuki groups, with no false positives.

This paper introduces a symbolic diagnostic approach for investigating obstruction structures in the Collatz conjecture using finite exponent codes of the accelerated map.

This paper disproves a conjecture about the longest-path lengths of MaxSTN and MinSTN algorithms for producing $st$-orientations of biconnected graphs.