This paper studies the problem of finding totally disjoint diametral paths in simple connected graphs and provides algorithms for certain classes of graphs.

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…

The authors map the problem of finding the maximum cut of a planar graph with arbitrary weights to a minimum T-join problem in the absolute dual graph, enabling the use of shortest paths and adapting…

This paper introduces constant-time certificate selectors for repairing faults in Dense Gaussian and Eisenstein--Jacobi networks, allowing for efficient and effective repair with a bounded number of e…

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 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})$.

This paper studies the maximum size of an independent set in the discrete simplex graph and provides new bounds using translated smaller graphs and finite rational linear systems.

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

This paper improves the known bounds on the ratio between domination number and packing number in unit disk graphs and bridgeless claw-free cubic graphs.

The paper formalizes Razborov's flag algebra method for finite simple graphs and creates a compiler to transform certificate data into algebraic proofs checked by Lean.