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 proves a coarse tree decomposition of graphs with bounded adhesion sets and separators.

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

The paper presents an algorithm for updating a Directed Minimum Spanning Tree using the weighted matroid intersection algorithm and a dynamic auxiliary graph.

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 shows that for non-planar orthogonal drawings of a graph, two drawings are sufficient instead of the planar case's three.

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 presents three new algorithms for maximizing revenue in the Stackelberg Vertex Cover problem on certain kinds of trees.

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 disproves a conjecture about the longest-path lengths of MaxSTN and MinSTN algorithms for producing $st$-orientations of biconnected graphs.

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.

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

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

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

This paper presents an algorithm to generate snake-like polyominoes within a given rectangle and provides exact formulas for the maximal area of such polyominoes for certain dimensions.