#### Filter Results:

#### Publication Year

2000

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Duane Moise, Jaspreet Singh, Keith Dahl, Sadat Rashid, Apsara Prasad, Ghulam Siddiqui +3 others
- 2010

Extrapulmonary small cell carcinoma of the stomach is a rare and aggressive malignancy with a poor prognosis that was first described in 1976 by Matsusaka et al. In 1989 it was recognized by the World Health Organization as an independent entity affecting the stomach. Pure and composite are the two types of gastric small cell carcinoma reported in the… (More)

It is well-known that the Vertex Cover problem is in P on bipartite graphs, however; the computational complexity of the Partial Vertex Cover problem on bipartite graphs is open. In this paper, we first show that the Partial Vertex Cover problem is NP-hard on bipartite graphs. We then identify an interesting special case of bipartite graphs, for which the… (More)

In this paper, we propose an efficient method for implementing Dijkstra's algorithm for the Single Source Shortest Path Problem (SSSPP) in a graph with positively lengthed edges, and where there are few distinct lengths. The SSSPP is one of the most widely studied problems in theoretical computer science and operations research. On a graph with n vertices,… (More)

- K. Subramani
- 2008

1. Explain with an example (in C), the differences between parameter passing by value and parameter passing by reference. 2. Briefly explain the themes of imperative programming, functional programming and logic programming. 3. What are the different types of errors that can occur in a program? Give one example of each. 4. Let Σ = {0, 1} denote an alphabet… (More)

We consider the satisfiability problem for Boolean combinations of unit two variable per inequality (UTVPI) constraints. A UTVPI constraint is linear constraint containing at most two variables with non-zero coefficients, where furthermore those coefficients must be either −1 or 1. We prove that if a satisfying solution exists, then there is a solution with… (More)

In this article, we exploit the graphical structure of 2SAT formulas to show that the shortest tree-like resolution refutation of an unsatisfiable 2SAT formula can be determined in polynomial time.