A Public-Key Cryptosystem Based on the Matrix Cover NP-Complete Problem. - Ravi Janardan; K. B. Lakshmanan (CRYPTO, 1982)

Separator-Based Strategies for Efficient Message Routing (Preliminary Version) - Greg N. Frederickson; Ravi Janardan (FOCS, 1986)

Optimal Message Routing without Complete Routing Tables (preliminary version). - Greg N. Frederickson; Ravi Janardan (PODC, 1986)

Space-efficient schemes for message routing in distributed networks - Ravi Janardan (1987)

Designing Networks with Compact Routing Tables. - Greg N. Frederickson; Ravi Janardan (Algorithmica, 1988)

Space-Efficient and Fault-Tolerant Message Routing in Outerplanar Networks. - Greg N. Frederickson; Ravi Janardan (IEEE Trans. Computers, 1988)

Efficient Message Routing in Planar Networks. - Greg N. Frederickson; Ravi Janardan (SIAM J. Comput., 1989)

Efficient Dynamic Algorithms for Some Geometric Intersection Problems. - Siu-Wing Cheng; Ravi Janardan (Inf. Process. Lett., 1990)

Space-Efficient Message Routing in c-Decomposable Networks. - Greg N. Frederickson; Ravi Janardan (SIAM J. Comput., 1990)

Space-efficient Ray-shooting and Intersection Searching: Algorithms, Dynamization, and Applications. - Siu-Wing Cheng; Ravi Janardan (SODA, 1991)

On the Dynamic Maintenance of Maximal Points in the Plane. - Ravi Janardan (Inf. Process. Lett., 1991)

Efficient Maintenance of the Union of Intervals on a Line, with Applications. - Siu-Wing Cheng; Ravi Janardan (J. Algorithms, 1991)

Algorithms for Ray-Shooting and Intersection Searching. - Siu-Wing Cheng; Ravi Janardan (J. Algorithms, 1992)

Efficient Distributed Algorithms for Single-Source Shortest Paths and Related Problems on Plane Networks. - Ravi Janardan; Siu-Wing Cheng (Math. Syst. Theory, 1992)

New Results on Dynamic Planar Point Location. - Siu-Wing Cheng; Ravi Janardan (SIAM J. Comput., 1992)

A fast algorithm for VLSI net extraction. - Mario Alberto López; Ravi Janardan; Sartaj K. Sahni (ICCAD, 1993)

On maintaining the width and diameter of a planar point-set online. - Ravi Janardan (Int. J. Comput. Geom. Appl., 1993)

Generalized intersection searching problems. - Ravi Janardan; Mario Alberto López (Int. J. Comput. Geom. Appl., 1993)

Efficient Algorithms for Generalized Intersection Searching on Non-Iso-Oriented Objects. - Prosenjit Gupta; Ravi Janardan; Michiel H. M. Smid (SCG, 1994)

On Intersection Searching Problems Involving Curved Objects. - Prosenjit Gupta; Ravi Janardan; Michiel H. M. Smid (SWAT, 1994)

Widest-Corridor Problems. - Ravi Janardan; Franco P. Preparata (Nord. J. Comput., 1994)

Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization. - Prosenjit Gupta; Ravi Janardan; Michiel H. M. Smid (J. Algorithms, 1995)

Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC machining. - Prosenjit Gupta; Ravi Janardan; Jayanth Majhi; Tony C. Woo (Comput. Aided Des., 1996)

Algorithms for Generalized Halfspace Range Searching and Other Intersection Searching Problems. - Prosenjit Gupta; Ravi Janardan; Michiel H. M. Smid (Comput. Geom., 1996)

Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects. - Prosenjit Gupta; Ravi Janardan; Michiel H. M. Smid (Comput. Geom., 1996)

Efficient net extraction for restricted orientation designs [VLSI layout]. - Mario Alberto López; Ravi Janardan; Sartaj K. Sahni (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1996)

Computing planar swept polygons under translation. - Kai Tang 001; Ming-En Wang; Lin-Lin Chen; Shuo-Yan Chou; Tony C. Woo; Ravi Janardan (Comput. Aided Des., 1997)

The Rectangle Enclosure and Point-Dominance Problems Revisited. - Prosenjit Gupta; Ravi Janardan; Michiel H. M. Smid; Bhaskar DasGupta (Int. J. Comput. Geom. Appl., 1997)

A Technique for Adding Range Restrictions to Generalized Searching Problems. - Prosenjit Gupta; Ravi Janardan; Michiel H. M. Smid (Inf. Process. Lett., 1997)

Multi-Criteria Geometric Optimization Problems in Layered Manufacturing. - Jayanth Majhi; Ravi Janardan; Michiel H. M. Smid; Jörg Schwerdt (SCG, 1998)

Special Issue: Computational Geometry and Computer-Aided Design and Manufacturing. - Tony C. Woo; Ravi Janardan (Comput. Aided Des., 1998)

Protecting Facets in Layered Manufacturing. - Jörg Schwerdt; Michiel H. M. Smid; Ravi Janardan; Eric Johnson 001; Jayanth Majhi (FSTTCS, 1999)

Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design. - Jayanth Majhi; Prosenjit Gupta; Ravi Janardan (Comput. Geom., 1999)

On some geometric optimization problems in layered manufacturing. - Jayanth Majhi; Ravi Janardan; Michiel H. M. Smid; Prosenjit Gupta (Comput. Geom., 1999)

Minimizing support structures and trapped area in two-dimensional layered manufacturing. - Jayanth Majhi; Ravi Janardan; Jörg Schwerdt; Michiel H. M. Smid; Prosenjit Gupta (Comput. Geom., 1999)

On the width and roundness of a set of points in the plane. - Michiel H. M. Smid; Ravi Janardan (Int. J. Comput. Geom. Appl., 1999)

Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons. - Prosenjit Gupta; Ravi Janardan; Michiel H. M. Smid (Inf. Process. Lett., 1999)

Computing the Width of a Three-Dimensional Point Set: An Experimental Study. - Jörg Schwerdt; Michiel H. M. Smid; Jayanth Majhi; Ravi Janardan (ACM J. Exp. Algorithmics, 1999)

Protecting critical facets in layered manufacturing. - Jörg Schwerdt; Michiel H. M. Smid; Ravi Janardan; Eric Johnson 001; Jayanth Majhi (Comput. Geom., 2000)

Computing Optimal Hatching Directions in Layered Manufacturing. - Man Chung Hon; Ravi Janardan; Jörg Schwerdt; Michiel H. M. Smid (International Conference on Computational Science (1), 2001)

Terrain Polygon Decomposition, with Application to Layered Manufacturing. - Ivaylo Ilinkin; Ravi Janardan; Michiel H. M. Smid (COCOON, 2002)

A decomposition-based approach to layered manufacturing. - Ivaylo Ilinkin; Ravi Janardan; Jayanth Majhi; Jörg Schwerdt; Michiel H. M. Smid; Ram D. Sriram (Comput. Geom., 2002)

Computing an Optimal Hatching Direction in Layered Manufacturing. - Jörg Schwerdt; Michiel H. M. Smid; Man Chung Hon; Ravi Janardan (Int. J. Comput. Math., 2002)

Geometric Algorithms for Layered Manufacturing. - Ravi Janardan; Michiel H. M. Smid (Geometric and Algorithmic Aspects of Computer-Aided Design and Manufacturing, 2003)

A new optimization criterion for generalized discriminant analysis on undersampled problems. - Jieping Ye; Ravi Janardan; Cheong Hee Park; Haesun Park (ICDM, 2003)

Pairwise Protein Structure Alignment Based on an Orientation-Independent Representation of the Backbone Geometry. - Jieping Ye; Ravi Janardan; Songtao Liu (ICTAI, 2003)

Minimizing the total projection of a set of vectors, with applications to layered manufacturing. - Man Chung Hon; Ravi Janardan; Jörg Schwerdt; Michiel H. M. Smid (Comput. Aided Des., 2003)

Protecting critical facets in layered manufacturing: implementation and experimental results. - Jörg Schwerdt; Michiel H. M. Smid; Ravi Janardan; Eric Johnson 001 (Comput. Aided Des., 2003)

Approximating contact-area of supports in layered manufacturing. - Ivaylo Ilinkin; Ravi Janardan; Michiel H. M. Smid; Eric Johnson 001; Paul Castillo 001; Jörg Schwerdt (CCCG, 2004)

Feature extraction via generalized uncorrelated linear discriminant analysis. - Jieping Ye; Ravi Janardan; Qi Li 001; Haesun Park (ICML, 2004)

GPCA: an efficient dimension reduction scheme for image compression and retrieval. - Jieping Ye; Ravi Janardan; Qi Li 001 (KDD, 2004)

Efficient Kernel Discriminant Analysis via QR Decomposition. - Tao Xiong; Jieping Ye; Qi Li 001; Ravi Janardan; Vladimir Cherkassky (NIPS, 2004)

Two-Dimensional Linear Discriminant Analysis. - Jieping Ye; Ravi Janardan; Qi Li 001 (NIPS, 2004)

Pairwise Protein Structure Alignment Based on an Orientation-independent Backbone Representation. - Jieping Ye; Ravi Janardan; Songtao Liu (J. Bioinform. Comput. Biol., 2004)

Approximate Multiple Protein Structure Alignment Using the Sum-of-Pairs Distance. - Jieping Ye; Ravi Janardan (J. Comput. Biol., 2004)

An Optimization Criterion for Generalized Discriminant Analysis on Undersampled Problems. - Jieping Ye; Ravi Janardan; Cheong Hee Park; Haesun Park (IEEE Trans. Pattern Anal. Mach. Intell., 2004)

Using Uncorrelated Discriminant Analysis for Tissue Classification with Gene Expression Data. - Jieping Ye; Tao Li; Tao Xiong; Ravi Janardan (IEEE ACM Trans. Comput. Biol. Bioinform., 2004)

Manufacturing processes. - Ravi Janardan; Tony C. Woo (Handbook of Discrete and Computational Geometry, 2nd Ed., 2004)

Computational Geometry. - Prosenjit Gupta; Ravi Janardan; Michiel H. M. Smid (Handbook of Data Structures and Applications, 2004)

A collision prediction system for traffic intersections. - Stefan Atev; Osama Masoud; Ravi Janardan; Nikolaos Papanikolopoulos (IROS, 2005)

A vision-based approach to collision prediction at traffic intersections. - Stefan Atev; Hemanth Arumugam; Osama Masoud; Ravi Janardan; Nikolaos P. Papanikolopoulos (IEEE Trans. Intell. Transp. Syst., 2005)

IDR/QR: An Incremental Dimension Reduction Algorithm via QR Decomposition. - Jieping Ye; Qi Li 001; Hui Xiong 001; Haesun Park; Ravi Janardan; Vipin Kumar 001 (IEEE Trans. Knowl. Data Eng., 2005)

Efficient model selection for regularized linear discriminant analysis. - Jieping Ye; Tao Xiong; Qi Li 001; Ravi Janardan; Jinbo Bi; Vladimir Cherkassky; Chandra Kambhamettu (CIKM, 2006)

CPM: A Covariance-preserving Projection Method. - Jieping Ye; Tao Xiong; Ravi Janardan (SDM, 2006)

Multiple Structure Alignment and Consensus Identification for Proteins. - Jieping Ye; Ivaylo Ilinkin; Ravi Janardan; Adam Isom (WABI, 2006)

Heuristics for estimating contact area of supports in layered manufacturing. - Ivaylo Ilinkin; Ravi Janardan; Michiel H. M. Smid; Eric Johnson 001; Paul Castillo 001; Jörg Schwerdt (ACM J. Exp. Algorithmics, 2006)

Feature Reduction via Generalized Uncorrelated Linear Discriminant Analysis. - Jieping Ye; Ravi Janardan; Qi Li 001; Haesun Park (IEEE Trans. Knowl. Data Eng., 2006)

Efficient algorithms for reverse proximity query problems. - Yokesh Kumar; Ravi Janardan; Prosenjit Gupta (GIS, 2008)

Heterogeneous data fusion for alzheimer's disease study. - Jieping Ye; Kewei Chen 001; Teresa Wu; Jing Li 016; Zheng Zhao 002; Rinkal Patel; Min Bae; Ravi Janardan; Huan Liu 001; Gene E. Alexander; Eric Reiman (KDD, 2008)

Developmental stage annotation of Drosophila gene expression pattern images via an entire solution path for LDA. - Jieping Ye; Jianhui Chen; Ravi Janardan; Sudhir Kumar 001 (ACM Trans. Knowl. Discov. Data, 2008)

Efficient Non-Intersection Queries on Aggregated Geometric Data. - Prosenjit Gupta; Ravi Janardan; Michiel H. M. Smid (Int. J. Comput. Geom. Appl., 2009)

Biological Image Analysis via Matrix Approximation. - Jieping Ye; Ravi Janardan; Sudhir Kumar 001 (Encyclopedia of Data Warehousing and Mining, 2009)

Multiple structure alignment and consensus identification for proteins. - Ivaylo Ilinkin; Jieping Ye; Ravi Janardan (BMC Bioinform., 2010)

Efficient Top-k Queries for Orthogonal Ranges. - Saladi Rahul; Prosenjit Gupta; Ravi Janardan; Krishnan Sundara Rajan (WALCOM, 2011)

Algorithms for range-skyline queries. - Saladi Rahul; Ravi Janardan (SIGSPATIAL/GIS, 2012)

Building a Communication Bridge With Mobile Hubs. - Onur Tekdas; Yokesh Kumar; Volkan Isler; Ravi Janardan (IEEE Trans Autom. Sci. Eng., 2012)

CG_Hadoop: computational geometry in MapReduce. - Ahmed Eldawy; Yuan Li 013; Mohamed F. Mokbel; Ravi Janardan (SIGSPATIAL/GIS, 2013)

Data structures for range-aggregate extent queries. - Prosenjit Gupta; Ravi Janardan; Yokesh Kumar; Michiel H. M. Smid (Comput. Geom., 2014)

A General Technique for Top-$k$ Geometric Intersection Query Problems. - Saladi Rahul; Ravi Janardan (IEEE Trans. Knowl. Data Eng., 2014)

Range search on tuples of points. - Akash Agrawal; Saladi Rahul; Yuan Li 013; Ravi Janardan (J. Discrete Algorithms, 2015)

On the arrangement of stochastic lines in ℤ2. - Yuan Li 013; Jie Xue 003; Akash Agrawal; Ravi Janardan (J. Discrete Algorithms, 2017)

Approximate Range Closest-Pair Search. - Jie Xue 003; Yuan Li 013; Ravi Janardan (CCCG, 2018)

On the separability of stochastic geometric objects, with applications. - Jie Xue 003; Yuan Li 013; Ravi Janardan (Comput. Geom., 2018)

On the expected diameter, width, and complexity of a stochastic convex hull. - Jie Xue 003; Yuan Li 013; Ravi Janardan (Comput. Geom., 2019)

Scalable computational geometry in MapReduce. - Yuan Li 013; Ahmed Eldawy; Jie Xue 003; Nadezda Knorozova; Mohamed F. Mokbel; Ravi Janardan (VLDB J., 2019)

The most-likely skyline problem for stochastic points. - Akash Agrawal; Yuan Li 013; Jie Xue 003; Ravi Janardan (Comput. Geom., 2020)

Approximate range closest-pair queries. - Jie Xue 003; Yuan Li 013; Ravi Janardan (Comput. Geom., 2020)

Searching for the closest-pair in a query translate. - Jie Xue 003; Yuan Li 013; Saladi Rahul; Ravi Janardan (J. Comput. Geom., 2020)

New Bounds for Range Closest-Pair Problems. - Jie Xue 003; Yuan Li 013; Saladi Rahul; Ravi Janardan (Discret. Comput. Geom., 2022)

Top-k colored orthogonal range search. - Guangya Cai; Ravi Janardan (CCCG, 2024)