#### Filter Results:

- Full text PDF available (3)

#### Publication Year

2015

2016

- This year (0)
- Last 5 years (4)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Abhiruk Lahiri, Joydeep Mukherjee, C. R. Subramanian
- COCOA
- 2015

- Mathew C. Francis, Abhiruk Lahiri
- Discrete Applied Mathematics
- 2016

A piecewise linear simple curve in the plane made up of k+1 line segments, each of which is either horizontal or vertical, with consecutive segments being of different orientation is called a k-bend path. Given a graph G, a collection of k-bend paths in which each path corresponds to a vertex in G and two paths have a common point if and only if the… (More)

- Minati De, Abhiruk Lahiri
- ArXiv
- 2016

In this paper, we study two classic optimization problems: minimum geometric dominating set and set cover. In the dominating set problem, for a given set of objects as input, the objective is to choose minimum number of input objects such that every input object is dominated by the chosen set of objects. Here, one object is dominated by the other if both of… (More)

- Arpitha P. Bharathi, Minati De, Abhiruk Lahiri
- ArXiv
- 2016

A pair of non-adjacent edges is said to be separated in a circular ordering of vertices, if the endpoints of the two edges do not alternate in the ordering. The circular separation dimension of a graph G, denoted by π◦(G), is the minimum number of circular orderings of the vertices ofG such that every pair of non-adjacent edges is separated in at least one… (More)

- ‹
- 1
- ›