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 a new variant of the Traveling Salesman Problem where the goal is to find two paths connecting a set of sites while minimizing the Fréchet distance between the two paths.

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

This paper presents approximation algorithms for the one-way directed Reachability-Preserving Minimum Edge Cut problem in directed graphs.

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 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…

The paper develops a new framework for proving lower bounds for the maximum matching problem in the semi-streaming model, improving upon the previous best known bounds.

This paper proves that no single-pass semi-streaming algorithm can achieve a better-than-half approximation to the maximum matching problem, implying the optimality of the naive greedy algorithm.

This paper presents a deterministic algorithm achieving an expected competitive ratio of O(1) for Euclidean online TSP in high dimensions and O(log n) for d = 1, improving upon previous O(sqrt(n)) and…

The paper simplifies and speeds up an algorithm for computing a Hamilton path on the skeleton of a 0/1-polytope by removing the log n factor, leading to improved algorithms for various problems.

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