The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ravi Janardan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Siu-Wing Cheng, Ravi Janardan
    Efficient Dynamic Algorithms for Some Geometric Intersection Problems. [Citation Graph (1, 0)][DBLP]
    Inf. Process. Lett., 1990, v:36, n:5, pp:251-258 [Journal]
  2. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
    Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:8-13 [Conf]
  3. Ivaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid, Eric Johnson, Paul Castillo, Jörg Schwerdt
    Approximating contact-area of supports in layered manufacturing. [Citation Graph (0, 0)][DBLP]
    CCCG, 2004, pp:91-94 [Conf]
  4. Ravi Janardan, Franco P. Preparata
    Widest-corridor Problems. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:426-431 [Conf]
  5. Jieping Ye, Tao Xiong, Qi Li, Ravi Janardan, Jinbo Bi, Vladimir Cherkassky, Chandra Kambhamettu
    Efficient model selection for regularized linear discriminant analysis. [Citation Graph (0, 0)][DBLP]
    CIKM, 2006, pp:532-539 [Conf]
  6. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
    Efficient Non-intersection Queries on Aggregated Geometric Data. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:544-553 [Conf]
  7. Ivaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid
    Terrain Polygon Decomposition, with Application to Layered Manufacturing. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:381-390 [Conf]
  8. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
    Efficient Algorithms for Generalized Intersection Searching on Non-Iso-Oriented Objects. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:369-378 [Conf]
  9. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid, Bhaskar DasGupta
    The Rectangle Enclosure and Point-Dominance Problems Revisited. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:162-171 [Conf]
  10. Jayanth Majhi, Ravi Janardan, Michiel H. M. Smid, Jörg Schwerdt
    Multi-Criteria Geometric Optimization Problems in Layered Manufacturing. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:19-28 [Conf]
  11. Ravi Janardan, K. B. Lakshmanan
    A Public-Key Cryptosystem Based on the Matrix Cover NP-Complete Problem. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1982, pp:21-37 [Conf]
  12. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
    Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:278-289 [Conf]
  13. Siu-Wing Cheng, Ravi Janardan
    New Results on Dynamic Planar Point Location [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:96-105 [Conf]
  14. Greg N. Frederickson, Ravi Janardan
    Separator-Based Strategies for Efficient Message Routing (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:428-437 [Conf]
  15. Jörg Schwerdt, Michiel H. M. Smid, Ravi Janardan, Eric Johnson, Jayanth Majhi
    Protecting Facets in Layered Manufacturing. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:291-303 [Conf]
  16. Man Chung Hon, Ravi Janardan, Jörg Schwerdt, Michiel H. M. Smid
    Computing Optimal Hatching Directions in Layered Manufacturing. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (1), 2001, pp:683-692 [Conf]
  17. Mario A. Lopez, Ravi Janardan, Sartaj K. Sahni
    A fast algorithm for VLSI net extraction. [Citation Graph (0, 0)][DBLP]
    ICCAD, 1993, pp:770-774 [Conf]
  18. Jieping Ye, Ravi Janardan, Cheong Hee Park, Haesun Park
    A new optimization criterion for generalized discriminant analysis on undersampled problems. [Citation Graph (0, 0)][DBLP]
    ICDM, 2003, pp:419-426 [Conf]
  19. Jieping Ye, Ravi Janardan, Qi Li, Haesun Park
    Feature extraction via generalized uncorrelated linear discriminant analysis. [Citation Graph (0, 0)][DBLP]
    ICML, 2004, pp:- [Conf]
  20. Jieping Ye, Ravi Janardan, Songtao Liu
    Pairwise Protein Structure Alignment Based on an Orientation-Independent Representation of the Backbone Geometry. [Citation Graph (0, 0)][DBLP]
    ICTAI, 2003, pp:2-8 [Conf]
  21. Ravi Janardan
    On Maintaining the Width and Diameter of a Planar Point-Set Online. [Citation Graph (0, 0)][DBLP]
    ISA, 1991, pp:137-149 [Conf]
  22. Jieping Ye, Ravi Janardan, Qi Li
    GPCA: an efficient dimension reduction scheme for image compression and retrieval. [Citation Graph (0, 0)][DBLP]
    KDD, 2004, pp:354-363 [Conf]
  23. Jieping Ye, Qi Li, Hui Xiong, Haesun Park, Ravi Janardan, Vipin Kumar
    IDR/QR: an incremental dimension reduction algorithm via QR decomposition. [Citation Graph (0, 0)][DBLP]
    KDD, 2004, pp:364-373 [Conf]
  24. Tao Xiong, Jieping Ye, Qi Li, Ravi Janardan, Vladimir Cherkassky
    Efficient Kernel Discriminant Analysis via QR Decomposition. [Citation Graph (0, 0)][DBLP]
    NIPS, 2004, pp:- [Conf]
  25. Jieping Ye, Ravi Janardan, Qi Li
    Two-Dimensional Linear Discriminant Analysis. [Citation Graph (0, 0)][DBLP]
    NIPS, 2004, pp:- [Conf]
  26. Greg N. Frederickson, Ravi Janardan
    Optimal Message Routing without Complete Routing Tables (preliminary version). [Citation Graph (0, 0)][DBLP]
    PODC, 1986, pp:88-97 [Conf]
  27. Jieping Ye, Tao Xiong, Ravi Janardan
    CPM: A Covariance-preserving Projection Method. [Citation Graph (0, 0)][DBLP]
    SDM, 2006, pp:- [Conf]
  28. Siu-Wing Cheng, Ravi Janardan
    Efficient Maintenance of the Union Intervals on a Line, with Applications. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:74-83 [Conf]
  29. Siu-Wing Cheng, Ravi Janardan
    Space-efficient Ray-shooting and Intersection Searching: Algorithms, Dynamization, and Applications. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:7-16 [Conf]
  30. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
    On Intersection Searching Problems Involving Curved Objects. [Citation Graph (0, 0)][DBLP]
    SWAT, 1994, pp:183-194 [Conf]
  31. Jieping Ye, Ivaylo Ilinkin, Ravi Janardan, Adam Isom
    Multiple Structure Alignment and Consensus Identification for Proteins. [Citation Graph (0, 0)][DBLP]
    WABI, 2006, pp:115-125 [Conf]
  32. Jayanth Majhi, Prosenjit Gupta, Ravi Janardan
    Computing a Flattest, Undercut-Free Parting Line for a Convex Polyhedron, with Application to Mold Design. [Citation Graph (0, 0)][DBLP]
    WACG, 1996, pp:109-120 [Conf]
  33. Prosenjit Gupta, Ravi Janardan, Jayanth Majhi, Tony C. Woo
    Efficient Geometric Algorithms for Workpiece Orientation in 4- and 5-Axis NC-Machining. [Citation Graph (0, 0)][DBLP]
    WADS, 1995, pp:171-182 [Conf]
  34. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
    Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization. [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:361-372 [Conf]
  35. Ivaylo Ilinkin, Ravi Janardan, Jayanth Majhi, Jörg Schwerdt, Michiel H. M. Smid, Ram D. Sriram
    A Decomposition-Based Approach to Layered Manufacturing. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:389-400 [Conf]
  36. Jayanth Majhi, Ravi Janardan, Michiel H. M. Smid, Prosenjit Gupta
    On Some Geometric Optimization Problems in Layered Manufacturing. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:136-149 [Conf]
  37. Jörg Schwerdt, Michiel H. M. Smid, Jayanth Majhi, Ravi Janardan
    Computing the Width of a Three-Dimensional Point Set: An Experimental Study. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1998, pp:62-73 [Conf]
  38. Ravi Janardan, Siu-Wing Cheng
    Efficient Distributed Algorithms for Single-Source Shortest Paths and Related Problems on Plane Networks. [Citation Graph (0, 0)][DBLP]
    WDAG, 1990, pp:133-150 [Conf]
  39. Greg N. Frederickson, Ravi Janardan
    Designing Networks with Compact Routing Tables. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1988, v:3, n:, pp:171-190 [Journal]
  40. Prosenjit Gupta, Ravi Janardan, Jayanth Majhi, Tony C. Woo
    Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC machining. [Citation Graph (0, 0)][DBLP]
    Computer-Aided Design, 1996, v:28, n:8, pp:577-587 [Journal]
  41. Man Chung Hon, Ravi Janardan, Jörg Schwerdt, Michiel H. M. Smid
    Minimizing the total projection of a set of vectors, with applications to layered manufacturing. [Citation Graph (0, 0)][DBLP]
    Computer-Aided Design, 2003, v:35, n:1, pp:57-68 [Journal]
  42. Kai Tang, Ming-En Wang, Lin-Lin Chen, Shuo-Yan Chou, Tony C. Woo, Ravi Janardan
    Computing planar swept polygons under translation. [Citation Graph (0, 0)][DBLP]
    Computer-Aided Design, 1997, v:29, n:12, pp:825-836 [Journal]
  43. Jörg Schwerdt, Michiel H. M. Smid, Ravi Janardan, Eric Johnson
    Protecting critical facets in layered manufacturing: implementation and experimental results. [Citation Graph (0, 0)][DBLP]
    Computer-Aided Design, 2003, v:35, n:7, pp:647-657 [Journal]
  44. Tony C. Woo, Ravi Janardan
    Special Issue: Computational Geometry and Computer-Aided Design and Manufacturing. [Citation Graph (0, 0)][DBLP]
    Computer-Aided Design, 1998, v:30, n:4, pp:229- [Journal]
  45. Ivaylo Ilinkin, Ravi Janardan, Jayanth Majhi, Jörg Schwerdt, Michiel H. M. Smid, Ram D. Sriram
    A decomposition-based approach to layered manufacturing. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:23, n:2, pp:117-151 [Journal]
  46. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
    Algorithms for Generalized Halfspace Range Searching and Other Intersection Searching Problems. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1995, v:5, n:, pp:321-340 [Journal]
  47. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
    Algorithms for Generalized Halfspace Range Searching and Other Intersection Searching Problems. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1996, v:6, n:, pp:1-19 [Journal]
  48. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
    Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1996, v:6, n:, pp:371-391 [Journal]
  49. Jayanth Majhi, Prosenjit Gupta, Ravi Janardan
    Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1999, v:13, n:4, pp:229-252 [Journal]
  50. Jayanth Majhi, Ravi Janardan, Michiel H. M. Smid, Prosenjit Gupta
    On some geometric optimization problems in layered manufacturing. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1999, v:12, n:3-4, pp:219-239 [Journal]
  51. Jayanth Majhi, Ravi Janardan, Jörg Schwerdt, Michiel H. M. Smid, Prosenjit Gupta
    Minimizing support structures and trapped area in two-dimensional layered manufacturing. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1999, v:12, n:3-4, pp:241-267 [Journal]
  52. Jörg Schwerdt, Michiel H. M. Smid, Ravi Janardan, Eric Johnson, Jayanth Majhi
    Protecting critical facets in layered manufacturing. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:16, n:3, pp:187-210 [Journal]
  53. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid, Bhaskar DasGupta
    The Rectangle Enclosure and Point-Dominance Problems Revisited. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1997, v:7, n:5, pp:437-455 [Journal]
  54. Ravi Janardan
    On maintaining the width and diameter of a planar point-set online. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1993, v:3, n:3, pp:331-344 [Journal]
  55. Ravi Janardan, Mario A. Lopez
    Generalized intersection searching problems. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1993, v:3, n:1, pp:39-69 [Journal]
  56. Michiel H. M. Smid, Ravi Janardan
    On the width and roundness of a set of points in the plane. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1999, v:9, n:1, pp:97-108 [Journal]
  57. Jörg Schwerdt, Michiel H. M. Smid, Man Chung Hon, Ravi Janardan
    Computing an Optimal Hatching Direction in Layered Manufacturing. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Math., 2002, v:79, n:10, pp:1067-1081 [Journal]
  58. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
    A Technique for Adding Range Restrictions to Generalized Searching Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:64, n:5, pp:263-269 [Journal]
  59. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
    Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:69, n:1, pp:7-13 [Journal]
  60. Ravi Janardan
    On the Dynamic Maintenance of Maximal Points in the Plane. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:40, n:2, pp:59-64 [Journal]
  61. Siu-Wing Cheng, Ravi Janardan
    Efficient Maintenance of the Union of Intervals on a Line, with Applications. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1991, v:12, n:1, pp:57-74 [Journal]
  62. Siu-Wing Cheng, Ravi Janardan
    Algorithms for Ray-Shooting and Intersection Searching. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1992, v:13, n:4, pp:670-692 [Journal]
  63. Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
    Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:19, n:2, pp:282-317 [Journal]
  64. Jieping Ye, Ravi Janardan, Songtao Liu
    Pairwise Protein Structure Alignment Based on an Orientation-independent Backbone Representation. [Citation Graph (0, 0)][DBLP]
    J. Bioinformatics and Computational Biology, 2004, v:2, n:4, pp:699-718 [Journal]
  65. Jieping Ye, Ravi Janardan
    Approximate Multiple Protein Structure Alignment Using the Sum-of-Pairs Distance. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2004, v:11, n:5, pp:986-1000 [Journal]
  66. Ivaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid, Eric Johnson, Paul Castillo, Jörg Schwerdt
    Heuristics for estimating contact area of supports in layered manufacturing. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2006, v:11, n:, pp:- [Journal]
  67. Jörg Schwerdt, Michiel H. M. Smid, Jayanth Majhi, Ravi Janardan
    Computing the Width of a Three-Dimensional Point Set: An Experimental Study. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 1999, v:4, n:, pp:8- [Journal]
  68. Ravi Janardan, Siu-Wing Cheng
    Efficient Distributed Algorithms for Single-Source Shortest Paths and Related Problems on Plane Networks. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1992, v:25, n:2, pp:93-122 [Journal]
  69. Ravi Janardan, Franco P. Preparata
    Widest-Corridor Problems. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1994, v:1, n:2, pp:231-245 [Journal]
  70. Jieping Ye, Ravi Janardan, Cheong Hee Park, Haesun Park
    An Optimization Criterion for Generalized Discriminant Analysis on Undersampled Problems. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 2004, v:26, n:8, pp:982-994 [Journal]
  71. Siu-Wing Cheng, Ravi Janardan
    New Results on Dynamic Planar Point Location. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:5, pp:972-999 [Journal]
  72. Greg N. Frederickson, Ravi Janardan
    Efficient Message Routing in Planar Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:4, pp:843-857 [Journal]
  73. Greg N. Frederickson, Ravi Janardan
    Space-Efficient Message Routing in c-Decomposable Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:1, pp:164-181 [Journal]
  74. Greg N. Frederickson, Ravi Janardan
    Space-Efficient and Fault-Tolerant Message Routing in Outerplanar Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1988, v:37, n:12, pp:1529-1540 [Journal]
  75. Mario A. Lopez, Ravi Janardan, Sartaj K. Sahni
    Efficient net extraction for restricted orientation designs [VLSI layout]. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1996, v:15, n:9, pp:1151-1159 [Journal]
  76. Jieping Ye, Tao Li, Tao Xiong, Ravi Janardan
    Using Uncorrelated Discriminant Analysis for Tissue Classification with Gene Expression Data. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Comput. Biology Bioinform., 2004, v:1, n:4, pp:181-190 [Journal]
  77. Jieping Ye, Ravi Janardan, Qi Li, Haesun Park
    Feature Reduction via Generalized Uncorrelated Linear Discriminant Analysis. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Knowl. Data Eng., 2006, v:18, n:10, pp:1312-1322 [Journal]
  78. Jieping Ye, Qi Li, Hui Xiong, Haesun Park, Ravi Janardan, Vipin Kumar
    IDR/QR: An Incremental Dimension Reduction Algorithm via QR Decomposition. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Knowl. Data Eng., 2005, v:17, n:9, pp:1208-1222 [Journal]

  79. Building a Communication Bridge with Mobile Hubs. [Citation Graph (, )][DBLP]


  80. Data Structures for Range-Aggregate Extent Queries. [Citation Graph (, )][DBLP]


  81. Efficient algorithms for reverse proximity query problems. [Citation Graph (, )][DBLP]


  82. Heterogeneous data fusion for alzheimer's disease study. [Citation Graph (, )][DBLP]


  83. Multiple structure alignment and consensus identification for proteins. [Citation Graph (, )][DBLP]


Search in 0.300secs, Finished in 0.304secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002