A. Lucas, A. K. Singh, Laxmi Gewali, "Simulating the Effect of Pay Table Standard Deviation on Pulls per Losing Player .. ", Gaming Research and Review Research, Vol. 11, 2007, pp. 41-52.
J. Li, X. Liang, H. Silvaraj, V. Muthukumar, and L. Gewali, "A Novel Data
Structure for Unit Disk Graph," The Journal of Combinatorial Mathematics
and Combinatorial Computing, Vol. 54(2005) pp.145-156
M. Sheerwood, L. Gewali, H. Selvaraj, and V. Muthukumar, ``A Fast and Simple
Algorithm for Computing m shortest Paths in Stage Graph, Systems Science,
Vol. 30, No. 1, (2004) pp. 91-97.
L. Gewali, S. Ntafos, and A. K. Singh, ``Geometric Approach for Finding
HPD-Credible Sets with Applications,'' Applied Mathematics and Computation,
125 (2002) pp. 195-207.
J. Bhadury, R. Chandrasekaran, and L. Gewali, ``Computational Complexity
of Integrated Models
of Network Design and Facility Location,'' Southwest Journal of Pure
and Applied Mathematics,
Issue 1, July 2000, pp. 30-40.
D. W. Pepper, D. B. Carrington, and L. Gewali, ``A Web-Based, Adaptive
Finite Element Scheme
for Heat Transfer and Fluid Flow,'' Proceedings of the Fourth ISHMT-ASME
Heat and Mass Transfer,
Jan 12-14, 2000, pp. 129-137.
L. Gewali and S. Ntafos, ``Watchman Routes in the Presence of a Pair
of Convex Polygons''
Post Script, Journal of Information Sciences
105 (1998) pp. 123-149.
L. Gewali, `` Placing Guards Inside Orthogonal Polygons'', Information Sciences, Vol. 88, 1996, pp. 1-14.
L. Gewali, ``Recognizing S-Star Polygons'', Post
Script
Pattern Recognition, Vol. 28, No. 7, 1995, pp. 1019-1032.
L. Gewali and I. Stojmenovic, ``Computing External Watchman Routes on
PRAM, BSR, and
Interconnection Models of Parallel Computation, Parallel Processing
Letters, Vol. 4, No. 1, 1994, pp. 83-93.
S. Ntafos and L. Gewali, `` External Watchman Routes '', The Visual
Computer: Special
Issue on Computational Geometry, Vol. 10, No. 8, 1994, pp. 474-483.
L. Gewali and S. Ntafos, ``Covering Grids and Orthogonal Polygons With
Periscope Guards'',
Computational Geometry: Theory and Applications, Vol.2, 1993, pp. 309-334.
L. Gewali, ``Stabbing Polygons by Monotone Chains'', The Journal of
Combinatorial
Mathematics and Combinatorial Computing, V 14, October 1993.
L. Gewali, M. Keil, and S. Ntafos, ``On Covering Orthogonal Polygons
With Star-Shaped Polygons'',
Information Sciences, Vol. 65, 1992, pp. 45-63.
L. P. Gewali, S. Ntafos, and I. Tollis, ``Path Planning in the Presence
of Vertical Obstacles'',
IEEE Transactions on Robotics and Automation, Vol. 6, No. 3, June 1990.
L. P. Gewali, A. Meng, J. S. B. Mitchell, and S. Ntafos, ``Path Planning
in 0/1/Infinity Weighted
Regions with Applications'', ORSA Journal on Computing, Vol. 2, No.
3, Summer 1990.
J. Bagga, L. Gewali, and D. Glasser, ``Illuminating Polygons by Alpha
Flood Lights'',
Post Script
L. Gewali, R. Venkatasubramanian, and D. Glasser, ``Algorithms for Computing
Grazing Area'',
Post Script
Planning Turn-Constrained Trajectories, {$167,881), US Air Force, Co-PI, 2007-2008
Computational Methods in Environmetrics, ($17,967), NSF-EPSCoR, PI 2005-2006
Curruculum Development in Information Technology, ($31,000), US Department of State
(Fulbright), 2002-2005.
Intelligent Trajectory Planning, Applied Research Initiative and
Bonn Corporation, ($50,066) PI, 2001-2003.
UNLV Dinstinguished Teaching Award, 1999.
A 3-D Adaptive Finite Element Model for Assessing Contaminant Transport
in the NTS, US Department
of Enery, 1998-99, ($60,000) Co-PI
Distinguished Teaching Award in the College of Engineering, UNLV, 1997.
An Adaptive Finite Element Model for Quickly Assessing Contaminant Transport,
US Department
of Energy, 1997-1998, ($59,866) Co-Investigator
A Rapid Adaptive Algorithm for Numerical Modeling With Unstructured
Meshes, US Department of Energy,
1996-1997, ($59,993) Co-PI
Recognition Award from the ACM for coaching the UNLV team in the ACM
programming contest.
The UNLV team was ranked second (among 22 participating teams) in the
ACM regional programming
contest, 1996.
A Rapid Adaptive Algorithm for Numerical Modeling With Unstructured
Meshes, US Department of Energy,
1995-1996, ($67,920) Co-PI
Algorithms for Decomposing Polygons, Cray Research Inc, ($21,390), Spring 1991. PI
Editorial Board: IEEE Transaction on Computers