| 2012 | ||
|---|---|---|
| c26 | John T. Minor, Laxmi Gewali: Useful Compiler Directives for Teaching Programming. ITNG 2012: 608-611 | |
| 2011 | ||
| c25 | Bartosz Kajak, Laxmi Gewali, Henry Selvaraj: Ear-Slicing and Quality Triangulation. ICSEng 2011: 194-199 | |
| c24 | Ahmed Khago, Ashok K. Singh, Laxmi Gewali: Bayesian Estimation of the Normal Mean from Censored Samples. ITNG 2011: 214-220 | |
| c23 | ||
| 2010 | ||
| c22 | John T. Minor, Laxmi Gewali: Improved, Reliable Control Statements for Teaching Programming. FECS 2010: 67-73 | |
| c21 | Dawid Zydek, Henry Selvaraj, Laxmi Gewali: Synthesis of Processor Allocator for Torus-Based Chip MultiProcessors. ITNG 2010: 13-18 | |
| c20 | ||
| 2009 | ||
| j9 | Laxmi Gewali, Dan Mazzella, Henry Selvaraj: Constrained Disjoint Paths in Geometric Networks. International Journal of Computational Intelligence and Applications 8(2): 141-154 (2009) | |
| 2008 | ||
| c19 | ||
| c18 | Hongyan Wang, Mei Yang, Yingtao Jiang, Shupeng Wang, Laxmi Gewali: Overlapped Layers for Prolonging Network Lifetime in Multi-Hop Wireless Sensor Networks. ITNG 2008: 755-760 | |
| p1 | Sang-Hee Lee, Ashok K. Singh, Laxmi Gewali: Dimension reduction for performing discriminant analysis for microarrays. Computational Intelligence in Medical Informatics 2008: 117-131 | |
| 2007 | ||
| c17 | Ashwini Raina, Venkatesan Muthukumar, Laxmi Gewali: Cell-based Distributed Addressing Technique Using Clustered Backbone Approach. ITNG 2007: 116-121 | |
| c16 | Min Tun, Laxmi Gewali, Henry Selvaraj: Interference Aware Routing in Sensor Network. ITNG 2007: 140-146 | |
| 2006 | ||
| c15 | ||
| c14 | Laxmi Gewali, Khursheed Mohamad, Min Tun: Interference Aware Dominating Set for Sensor Network. ITNG 2006: 268-273 | |
| 2005 | ||
| c13 | S. Veeravalli, Laxmi Gewali, Muthukumar Venkatesan: Construction of Power-Aware Diameter-Reduced Broadcast Trees. ITCC (2) 2005: 668-674 | |
| 2004 | ||
| c12 | Jianhong Li, Laxmi Gewali, Henry Selvaraj, Muthukumar Venkatesan: Hybrid Greedy/Face Routing for Ad-Hoc Sensor Network. DSD 2004: 574-578 | |
| c11 | Jianhong Li, Xiaojun Liang, Laxmi Gewali: Extended DCEL Data Structure for Mobile Computing. ITCC (2) 2004: 416-420 | |
| c10 | ||
| 2003 | ||
| c9 | Laxmi Gewali, Prashu Kodela, Joy Bhadury: Approximation Algorithm for Multi-Facility Location. Applied Informatics 2003: 411-416 | |
| c8 | Laxmi Gewali, Joy Bhadury, Ramaswamy Chandrasekaran: Network Design Subject to Facility Location. CCCG 2003: 128-131 | |
| 2001 | ||
| c7 | ||
| 1998 | ||
| j8 | Laxmi Gewali, Simeon C. Ntafos: Watchman Routes in the Presence of a Pair of Convex Polygons. Inf. Sci. 105(1-4): 123-149 (1998) | |
| c6 | Joy Bhadury, Ramaswamy Chandrasekaran, Laxmi Gewali: Constructing median constrained minimum spanning tree. CCCG 1998 | |
| 1997 | ||
| c5 | ||
| 1996 | ||
| j7 | ||
| c4 | Jay Bagga, Laxmi Gewali, David Glasser: The Complexity of Illuminating Polygons by alpha-flood-lights. CCCG 1996: 337-342 | |
| 1995 | ||
| j6 | ||
| 1994 | ||
| j5 | Laxmi Gewali, Ivan Stojmenovic: Computing External Watchman Routes on Pram, BSR, and Interconnection Network Models of Parallel Computation. Parallel Processing Letters 4: 83-93 (1994) | |
| j4 | ||
| c3 | ||
| 1993 | ||
| c2 | ||
| 1992 | ||
| j3 | Laxmi Gewali, Simeon C. Ntafos: Covering Grids and Orthogonal Polygons with Periscope Guards. Comput. Geom. 2: 309-334 (1992) | |
| j2 | Laxmi Gewali, Mark Keil, Simeon C. Ntafos: On covering orthogonal polygons with star-shaped polygons. Inf. Sci. 65(1-2): 45-63 (1992) | |
| 1990 | ||
| j1 | Laxmi Gewali, Alex C. Meng, Joseph S. B. Mitchell, Simeon C. Ntafos: Path Planning in 0/1/ Weighted Regions with Applications. INFORMS Journal on Computing 2(3): 253-272 (1990) | |
| 1988 | ||
| c1 | Laxmi Gewali, Alex C. Meng, Joseph S. B. Mitchell, Simeon C. Ntafos: Path Planning in 0/1/infinity Weighted Regions with Applications. Symposium on Computational Geometry 1988: 266-278 | |
Colors in the list of coauthors
Last update Mon May 20 08:37:56 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page