#### Filter Results:

- Full text PDF available (28)

#### Publication Year

1991

2017

- This year (2)
- Last 5 years (10)
- Last 10 years (17)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- D. Chithra Prasad, Sudebkumar Prasant Pal, Tamal K. Dey
- Comput. Geom.
- 1998

We develop protocols for preparing a GHZ state and, in general, a pure multi-partite maximally entangled state in a distributed network with apriori quantum entanglement between agents using classical communication and local operations. We investigate and characterize the minimal combinatorics of the sharing of EPR pairs required amongst agents in a network… (More)

- Rajat K. Pal, A. K. Datta, Sudebkumar Prasant Pal, M. M. Das, Ajit Pal
- VLSI Design
- 1995

In this p a p e r we propose a general framework for viewing a class of heuristics f o r track assignment in channel routing f rom a purely graph theoretic angle. Within this framework we propose algorithms for computing roufing solutions using optimal or near optimal number of tracks for several well-known benchmark channels i n the two-layer VH,… (More)

- Rajat K. Pal, Sudebkumar Prasant Pal, Ajit Pal, Alak K. Dutta
- VLSI Design
- 1993

- Saswata Shannigrahi, Sudebkumar Prasant Pal
- Algorithmica
- 2006

We consider labelled r-uniform hypertrees, 2≤r≤n, where n is the number of vertices in the hypertree. Any two hyperedges in a hypertree share at most one vertex and each hyperedge in an r-uniform hypertree contains exactly r vertices. We show that r-uniform hypertrees can be encoded in linear time using as little as n−2 integers in the range [1,n]. The… (More)

- Tushar Kalra, Rogers Mathew, Sudebkumar Prasant Pal, Vijay Pandey
- CALDAM
- 2017

Given a graph G, a non-negative integer k, and a weight function that maps each vertex in G to a positive real number, the Maximum Weighted Budgeted Independent Set (MWBIS) problem is about finding a maximum weighted independent set in G of cardinality at most k. A special case of MWBIS, when the weight assigned to each vertex is equal to its degree in G,… (More)

- Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad
- Discrete & Computational Geometry
- 1998

We show that the region lit by a point light source inside a simple n-gon after at most k reeections oo the boundary has combinatorial complexity O(n 2k), for any k 1. A lower bound of ((n=k ? (1)) 2k) is also established which matches the upper bound for any xed k. A simple near-optimal algorithm for computing the illuminated region is presented, which… (More)

- Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad
- Symposium on Computational Geometry
- 1995

We extend the concept of the polygon visible from a source point S in a simple polygon by considering visibility with two types of reflection, specular and dzffuse. In specular reflection a light ray reflects from an edge of the polygon according to Snell’s law: the angle of incidence equals the angle of reflection. In diffuse reflection a light ray… (More)

- Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan
- Comput. Geom.
- 1993

A polygon is said to be a weak visibility polygon if every point of the polygon is visible from some point of an internal segment. In this paper we derive properties of shortest paths in weak visibility polygons and present a characterization of weak visibility polygons in terms of shortest paths between vertices. These properties lead to the following… (More)