The paper analyzes a fragment of Higher-Order Datalog, showing that restricting recursion to a linear form shifts its expressive power from time complexity to space complexity, specifically capturing…

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

This paper provides bounds on the neighborhood complexity of graphs with bounded treewidth and pathwidth, and constructs reaching these bounds.

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 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 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 studies the structural expressivity and parameterized complexity of counting homomorphisms from small temporal patterns to large temporal graphs, proving a temporal Lovász-style theorem, in…

This paper shows that finding the minimum geodetic set in chordal graphs is fixed parameter tractable, implying a polynomial-time algorithm for k-trees. It also proves that the problem is NP-hard on i…

This paper connects a generalized notion of tensor rank with multiplicative complexity, enabling control of arithmetic complexity in any constant degree of multilinearity and applications to fine-grai…

This paper studies the parameterized complexity of various graph problems on outer k-planar graphs.

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

This paper settles the complexity of three sketching problems in graphs and distributions.

This paper proves space lower bounds for entropy-efficient random sampling using i.i.d. uniform bits.

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 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.

This paper presents an efficient algorithm for right-to-left sequence prediction based on a new complexity measure called arithmetic repetition complexity, and demonstrates its application to predicti…

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