The paper introduces and explores Truly Linear FPT (TLFPT), a complexity class defined by $O(n) + f(k)$, demonstrating that it is a strict subset of standard Linear FPT and providing new algorithms fo…

The paper removes stability requirement from the progressive exploration algorithm for Dominating Set, yielding a fixed-parameter tractable algorithm on certain graph classes.

This paper identifies a tractability island inside the contextual-fraction problem by collapsing it to a fixed-point calculation for a specific class of permutation-transport models.

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…

This paper introduces an activation hierarchy and proves a Predictor-Impossibility Theorem, showing that no effective predictor family can determine all stage languages. It also establishes a slice th…

This paper proves that the satisfiability problem of existential Presburger arithmetic extended with divisibility predicates (EPAD) is PP-hard.

This paper proves that the minimum edge-outerplanarity of a planar graph can be computed in polynomial time.

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…

The paper studies the resources required to batch verify Boolean functions and provides lower bounds on the witness-query tradeoff based on approximate degree.

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

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.

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…

The paper proves XNLP-hardness of Directed Edge Geography and Undirected Edge Geography when parameterized by pathwidth, and shows their fixed-parameter tractability when parameterized by treewidth an…

This paper constructs an epsilon-cover of the joint value set of m constant-degree polynomials over a convex set H in the linfty-norm, with size n^(O(log(mn)/ε^2)), given that the polynomials have a c…