#### Filter Results:

#### Publication Year

1996

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Jacob Illum Rasmussen, Kim G. Larsen, K. Subramani
- TACAS
- 2004

- Bugra Caskurlu, K. Subramani
- ArXiv
- 2013

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)

- Kumar Subramani, Alexander Velkov, Irene Ntoutsi, Peer Kroger, Hans-Peter Kriegel
- 2011 IEEE 5th International Conference on…
- 2011

This paper deals with community detection in social networks using density-based clustering. We compare two well-known concepts for community detection that are implemented as distance functions in the algorithms SCAN [1] and DEN-GRAPH [2], the structural similarity of nodes and the number of interactions between nodes, respectively, in order to evaluate… (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)

- James B. Orlin, Kamesh Madduri, K. Subramani, Matthew D. Williamson
- J. Discrete Algorithms
- 2010

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)

- Jacob Illum Rasmussen, Kim G. Larsen, K. Subramani
- Formal Methods in System Design
- 2006

- K. Subramani
- ACM Trans. Comput. Log.
- 2004

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.

- Sanjit A. Seshia, K. Subramani, Randal E. Bryant
- JSAT
- 2007

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)

- Hans Kleine Büning, K. Subramani, Xishun Zhao
- SAT
- 2003

> denote two sequences on a fixed alphabet Σ (You may assume that Σ = {0, 1}, if it helps). Devise an efficient algorithm to determine the length of the Longest Common Subsequence between X and Y. Note that a subsequence of a sequence need not be contiguous. (b) LC(X, Y) denotes the LCS between X and Y.