The paper investigates the relationship between graph classes, edit cost functions, and computational complexity of the graph edit distance, providing polynomial-time reductions and correspondences.

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…

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

This paper proves a new lower bound of $ ildeΩ(n^2)$ for read-once parity branching programs on boolean functions, improving upon the previous bound of $ ildeΩ(n^{1.5})$.

The paper develops an explicit multi-linear polynomial form for binary polynomial optimization problems after eliminating a subset of variables, allowing for characterization of new special classes wi…

A new polynomial-time algorithm is presented for optimally coloring perfect graphs using graph-theoretic operations and iterative walk counting.

The polynomial-time low-degree conjecture, which predicts that low-degree indistinguishability, a uniform null distribution, permutation invariance, and independent resampling imply polynomial-time ha…

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 shows #P-completeness for several graph counting problems using a new technique.

The paper introduces a novel public key encryption scheme with high security by leveraging the conjectured intractability of two types of highly corrupted constraint satisfaction problems (CSPs).

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 investigates the complexity of recognizing domatically critical graphs, which are graphs with maximum dominating sets that cannot be increased by deleting any edge.

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