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 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 approximation algorithms for the one-way directed Reachability-Preserving Minimum Edge Cut problem in directed graphs.

This paper presents a randomized algorithm that runs in $ ilde{O}(n^2)$ time and, with high probability, guarantees a 2-approximation for all pairs at distance at least $c$ in an undirected, unweighte…

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 provides new upper bounds and algorithms for the shortest path map equivalence decomposition of a polygonal domain, leading to solutions for two-point shortest path queries, geodesic diamet…

This paper proposes a reliability-aware framework to solve the fuzzy shortest path problem in directed graphs, optimizing routes based not only on cost but also on the reliability of the associated fu…

This paper disproves a conjecture about the longest-path lengths of MaxSTN and MinSTN algorithms for producing $st$-orientations of biconnected graphs.

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 introduces the $k$-Step-Central Shortest Path problem to maximize reachability in transportation networks and provides a polynomial-time algorithm for unweighted graphs.

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 improves the time complexity of exact algorithms for converting a connected graph into a cactus by reducing it from O*(3^n) to O*(2^n) for unweighted graphs, and provides faster algorithms…