ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Browse by Journal / Conference

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Number of items: 15.

Das, Sudipta and Jenkins, Lawrence and Sengupta, Debasis (2013) Loss ratio of the EDF scheduling policy with early discarding technique. In: Information Processing Letters, 113 (5-6). pp. 165-170.

Das, Anita and Francis, Mathew C and Mathew, Rogers and Sadagopan, N (2010) Non-contractible non-edges in 2-connected graphs. In: Information Processing Letters, 110 (23). pp. 1044-1048.

Chandran, Sunil L and Das, Anita and Sivadasan, Naveen (2009) On the cubicity of bipartite graphs. In: Information Processing Letters, 109 (9). pp. 432-435.

Narayanaswamy, NS and Belkale, N and Chandran, LS and Sivadasan, N (2007) A note on the Hadwiger number of circular arc graphs. In: Information Processing Letters, 104 (1). pp. 10-13.

Chandran, Sunil L (2003) A lower bound for the hitting set size for combinatorial rectangles and an application. In: Information Processing Letters, 86 (2). pp. 75-78.

Arya, Sunil and Ramesh, H (1998) A 2.5-factor approximation algorithm for the k-MST problem. In: Information Processing Letters, 65 (3). pp. 117-118.

Subramanian, Ashok (1995) A polynomial bound on the number of light cycles in an undirected graph. In: Information Processing Letters, 53 (4). pp. 173-176.

Kumar, Prem G and Babu, Phanendra G (1994) Optimal network partitioning for fault-tolerant network management using evolutionary programming. In: Information Processing Letters, 50 (3). pp. 145-149.

Veeraraghavulu, NCh and Kumar, Sreenivasa P and Madhavan, Veni CE (1992) A linear-time algorithm for isomorphism of a subclass of chordal graphs. In: Information Processing Letters, 44 (1). pp. 45-49.

Gabrani, Naveen and Shankar, Priti (1992) A note on the reconstruction of a binary tree from its traversals. In: Information Processing Letters, 42 (2). 117 -119.

Haldar, Chandan and Patnaik, LM (1990) Oracle complexities for computational geometry of semi-algebraic sets and Voronoi diagrams. In: Information Processing Letters, 36 (2). pp. 95-102.

Gibbons, AN and Srikant, YN (1989) A class of problems efficiently solvable on mesh-connected computers including dynamic expression evaluation. In: Information Processing Letters, 32 (6). pp. 305-311.

Bhaskar, Dasgupta and Veni, Madhavan CE (1989) An approximate algorithm for the minimal vertex nested polygon problem. In: Information Processing Letters, 33 (1). pp. 35-44.

Haldar, S and Subramanian, DK (1988) Ring Based Termination Detection Algorithm for Distributed Computations. In: Information Processing Letters, 29 (3). pp. 149-153.

Sridhar, MK (1987) A new algorithm for parallel solution of linear equations. In: Information Processing Letters, 24 (6). pp. 407-412.

This list was generated on Wed Apr 14 06:16:43 2021 IST.