This paper introduces a domain-specific visual graph editor for designing modular applications in edge and cloud computing environments, enabling users to model kernels, shared memory nodes, and event…

The paper presents a novel and significantly faster algorithm for computing the second discrete homology group of a graph by identifying five basic quotient shapes of the 3-cube.

The paper introduces Grid Programs, a novel, Turing-complete model of computation where programs are two-dimensional arrangements of instructions, fundamentally departing from linear code structures.

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 presents an optimized algorithm for computing cut sets of a path set in graph theory and introduces a vectorized computational framework for property calculations.

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

This paper presents a method for compressing matrices using a RePair straight-line program (SLP), allowing matrix-vector products with time and space proportional to the compressed size, and demonstra…

This paper investigates the use of spectral filtering for continuous subgraph matching over dynamic graphs and presents three key findings.

This paper proposes a method for verifying functional correctness of message-passing concurrent programs using Constrained Horn Clause (CHC) solving.

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

This paper presents Weave, a deterministic method to convert SPICE netlists into LTspice schematics with guaranteed connectivity preservation.

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…

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…

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 presents four novel parallel algorithms for maintaining a rooted spanning forest in dynamic graphs, achieving a throughput of 2 million insertions and 1.4 million deletions per second.

This paper introduces HySpecPro, a single-level hypergraph partitioner that performs end-to-end optimization in a spectral embedding space, delivering cut quality comparable to multilevel methods with…

This paper introduces a streaming model with catalytic memory and shows dramatic space savings for data stream algorithms, providing exact computation of frequency moments using multi-pass algorithms…