In this paper we show a deterministic parallel all-pairs shortest paths algorithm for real-
weighted directed graphs. The algorithm has Õ (nm+(n/d) 3) work and Õ (d) depth for any …

In this paper, we discuss the design and analysis of polynomial time algorithms for two
problems associated with a linearly infeasible system of Unit Two Variable Per Inequality …

In this paper, we design and analyze a fast, randomized algorithm for the problem of finding
a negative cost cycle having the smallest number of edges in a directed, weighted graph …

In this paper, we investigate refutability in Difference Constraint Systems (DCS) under the
Unit Read-Once Refutation (UROR) system. A difference constraint is a linear relationship of …

In this paper, we discuss a certifying version of the Lifting Algorithm for Horn constraint
systems. Recall that a Horn constraint system (HCS) is a specialized polyhedral system that …

This paper is concerned with a refutation system (proof system) for a class of linear
constraint systems called difference constraint systems (DCS). In particular, we study the …

In this paper, we investigate the refutability of Difference Constraint Systems (DCSs) in the
Unit Read-once Refutation (UROR) system. Recall that a difference constraint is a linear …

In this paper, we empirically profile three algorithms for the Shortest Negative Cost Cycle
(SNCC) problem. In this problem, we are given a directed, weighted graph G=< V, E, c>, and …

In this paper, we discuss an efficient divide-and-conquer algorithm for the negative cost girth
(NCG) problem in planar networks. Recall that the girth of an unweighted graph (directed or …

This dissertation is concerned with the satisfiability and refutability problems for several
constraint systems. We examine both Boolean constraint systems, in which each variable is …