PlanarBench introduces a novel benchmark to test LLM spatial reasoning by requiring them to draw planar graphs as ASCII art from an edge list, finding that edge count is a stronger difficulty predicto…

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…

The paper systematically studies the trade-offs between the number of slopes, bends per edge, and required area for planar drawings of bounded-degree graphs, providing new constructions for high-degre…

The paper shows that for non-planar orthogonal drawings of a graph, two drawings are sufficient instead of the planar case's three.

DiagramRAG is a lightweight retrieval-augmented framework that uses reference diagrams to guide the completion of scientific diagrams from incomplete user sketches, achieving high performance on stand…

The paper introduces MUSE, a comprehensive benchmark that evaluates Text-to-CAD generation by assessing complex assemblies based on functionality, manufacturability, and assemblability, moving beyond…

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

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

This paper presents an algorithmic framework for exhaustively generating and tabulating knot and link diagrams on the thickened torus.

This paper studies the NP-completeness and provides a polynomial-time algorithm for the disjoint separators problem in planar graphs when all sizes are equal to one.

The paper introduces 3DCodeBench, a systematic benchmark and platform for evaluating Vision-Language Model (VLM) agents' ability to generate procedural 3D models from text and images using code.

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

The paper introduces a hybrid WGAN-GA framework that uses a Genetic Algorithm (GA) to refine graphs generated by a GAN, significantly reducing structural deviations and improving realism.

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

This paper introduces ZipLine, a system for integrative analysis of multivariate graphs through a unified predicate language and learning algorithm.

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…