The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
S. S. Ravi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Parvathi Chundi, Daniel J. Rosenkrantz, S. S. Ravi
    Deferred Updates and Data Placement in Distributed Databases. [Citation Graph (8, 13)][DBLP]
    ICDE, 1996, pp:469-476 [Conf]
  2. Ian Davidson, S. S. Ravi
    Identifying and Generating Easy Sets of Constraints for Clustering. [Citation Graph (0, 0)][DBLP]
    AAAI, 2006, pp:- [Conf]
  3. Errol L. Lloyd, Rui Liu, S. S. Ravi
    Approximating the Minimum Number of Maximum Power Users in Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    ADHOC-NOW, 2004, pp:1-13 [Conf]
  4. Sven Oliver Krumke, Rui Liu, Errol L. Lloyd, Madhav V. Marathe, Ram Ramanathan, S. S. Ravi
    Topology Control Problems under Symmetric and Asymmetric Power Thresholds. [Citation Graph (0, 0)][DBLP]
    ADHOC-NOW, 2003, pp:187-198 [Conf]
  5. Sven Oliver Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe
    Compact Location Problems with Budget and Communication Constraints. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:510-519 [Conf]
  6. Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Predrag T. Tosic
    Gardens of Eden and Fixed Points in Sequential Dynamical Systems. [Citation Graph (0, 0)][DBLP]
    DM-CCG, 2001, pp:95-110 [Conf]
  7. Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
    Predecessor and Permutation Existence Problems for Sequential Dynamical Systems. [Citation Graph (0, 0)][DBLP]
    DMCS, 2003, pp:69-80 [Conf]
  8. Daniel J. Rosenkrantz, Sanjay Goel, S. S. Ravi, Jagdish Gangolly
    Structure-Based Resilience Metrics for Service-Oriented Networks. [Citation Graph (0, 0)][DBLP]
    EDCC, 2005, pp:345-362 [Conf]
  9. Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
    A Unified Approach to Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:424-435 [Conf]
  10. Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
    Approximation Schemes Using L-Reductions. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1994, pp:342-353 [Conf]
  11. Venkatesh Radhakrishnan, Sven Oliver Krumke, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi
    Compact Location Problems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:238-247 [Conf]
  12. Dechang Gu, Daniel J. Rosenkrantz, S. S. Ravi
    Construction and Analysis of Fault-Secure Multiprocessor Schedules. [Citation Graph (0, 0)][DBLP]
    FTCS, 1991, pp:120-127 [Conf]
  13. Ragini Shamsunder, Daniel J. Rosenkrantz, S. S. Ravi
    Exploiting Data Flow Information in Algorithm-Based Fault Tolerance. [Citation Graph (0, 0)][DBLP]
    FTCS, 1993, pp:280-289 [Conf]
  14. Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth
    Improving Spanning Trees by Upgrading Nodes. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:281-291 [Conf]
  15. Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi
    The Complexity of Approximating PSPACE-Complete Problems for Hierarchical Specifications (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:76-87 [Conf]
  16. Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III
    Bicriteria Network Design Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:487-498 [Conf]
  17. Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi
    Efficient Approximation Algorithms for Domatic Partition and On-Line Coloring of Circular Arc Graphs. [Citation Graph (0, 0)][DBLP]
    ICCI, 1993, pp:26-30 [Conf]
  18. Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Mayur Thakur
    Computational Aspects of Analyzing Social Network Dynamics. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:2268-2273 [Conf]
  19. Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
    Analysis Problems for Sequential Dynamical Systems and Communicating State Machines. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:159-172 [Conf]
  20. S. S. Ravi, Dechang Gu
    On approximation algorithms for microcode bit minimization. [Citation Graph (0, 0)][DBLP]
    MICRO, 1988, pp:67-69 [Conf]
  21. Errol L. Lloyd, Rui Liu, Madhav V. Marathe, Ram Ramanathan, S. S. Ravi
    Algorithmic aspects of topology control problems for ad hoc networks. [Citation Graph (0, 0)][DBLP]
    MobiHoc, 2002, pp:123-134 [Conf]
  22. Ian Davidson, S. S. Ravi
    Agglomerative Hierarchical Clustering with Constraints: Theoretical and Empirical Results. [Citation Graph (0, 0)][DBLP]
    PKDD, 2005, pp:59-70 [Conf]
  23. Parvathi Chundi, Ragini Narasimhan, Daniel J. Rosenkrantz, S. S. Ravi
    Active Client Primary-Backup Protocols (Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1995, pp:264- [Conf]
  24. Sandeep K. Shukla, Harry B. Hunt III, Daniel J. Rosenkrantz, S. S. Ravi, Richard Edwin Stearns
    I/O Automata Based Verification of Finite State Distributed Systems: Complexity Issues (Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1996, pp:122- [Conf]
  25. Christopher L. Barrett, Madhav V. Marathe, James P. Smith, S. S. Ravi
    A mobility and traffic generation framework for modeling and simulating ad hoc communication networks. [Citation Graph (0, 0)][DBLP]
    SAC, 2002, pp:122-126 [Conf]
  26. Parvathi Chundi, Daniel J. Rosenkrantz, S. S. Ravi
    Multi-site distributed database transactions utilizing deferred update. [Citation Graph (0, 0)][DBLP]
    SAC, 1997, pp:118-122 [Conf]
  27. Ian Davidson, S. S. Ravi
    Clustering with Constraints: Feasibility Issues and the k-Means Algorithm. [Citation Graph (0, 0)][DBLP]
    SDM, 2005, pp:- [Conf]
  28. Gabriel Istrate, Madhav V. Marathe, S. S. Ravi
    Adversarial models in evolutionary game dynamics. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:719-720 [Conf]
  29. R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi
    Spanning Trees Short or Small. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:546-555 [Conf]
  30. R. Ravi, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III
    Many birds with one stone: multi-objective approximation algorithms. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:438-447 [Conf]
  31. Srinivas Doddi, Madhav V. Marathe, S. S. Ravi, David Scot Taylor, Peter Widmayer
    Approximation Algorithms for Clustering to Minimize the Sum of Diameters. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:237-250 [Conf]
  32. S. S. Ravi, Daniel J. Rosenkrantz, Giri Kumar Tayi
    Facility Dispersion Problems: Heuristics and Special Cases (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:355-366 [Conf]
  33. Evangelos Kranakis, Danny Krizanc, S. S. Ravi
    On Multi-Label Linear Interval Routing Schemes (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1993, pp:338-349 [Conf]
  34. Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth
    Upgrading Bottleneck Constrained Forests. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:215-226 [Conf]
  35. Sven Oliver Krumke, Madhav V. Marathe, Diana Poensgen, S. S. Ravi, Hans-Christoph Wirth
    Budgeted Maximum Graph Coverage. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:321-332 [Conf]
  36. Sven Oliver Krumke, Hartmut Noltemeier, Madhav V. Marathe, S. S. Ravi, Kay U. Drangmeister
    Modifying Networks to Obtain Low Cost Trees. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:293-307 [Conf]
  37. Sven Oliver Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe
    Complexity and Approximability of Certain Bicriteria Location Problems. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:73-87 [Conf]
  38. Madhav V. Marathe, Venkatesh Radhakrishnan, Harry B. Hunt III, S. S. Ravi
    Hierarchical Specified Unit Disk Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1993, pp:21-32 [Conf]
  39. R. Ravi, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III
    Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:31, n:1, pp:58-78 [Journal]
  40. Daniel J. Rosenkrantz, Lin Yu, S. S. Ravi
    Efficient Construction of Minimum Makespan Schedules for Tasks with a Fixed Number of Distinct Execution Times. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:30, n:1, pp:83-100 [Journal]
  41. Young C. Wee, Seth Chaiken, S. S. Ravi
    Rectilinear Steiner Tree Heuristics and Minimum Spanning Tree Algorithms Using Geographic Nearest Neighbors. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:12, n:6, pp:421-435 [Journal]
  42. Evangelos Kranakis, Danny Krizanc, S. S. Ravi
    On Multi-Label Linear Interval Routing Schemes. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1996, v:39, n:2, pp:133-139 [Journal]
  43. Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III
    Bicriteria Network Design Problems [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  44. Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth
    Upgrading bottleneck constrained forests. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:108, n:1-2, pp:129-142 [Journal]
  45. Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi
    Efficient Approximation Algorithms for Domatic Partition and on-line Coloring of Circular Arc Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:64, n:2, pp:135-149 [Journal]
  46. Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
    Parallel Approximation Schemes for a Class of Planar and Near Planar Combinatorial Optimization Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:173, n:1, pp:40-63 [Journal]
  47. Ragini Narasimhan, Daniel J. Rosenkrantz, S. S. Ravi
    Using Data Flow Information to Obtain Efficient Check Sets for Algorithm-Based Fault Tolerance. [Citation Graph (0, 0)][DBLP]
    International Journal of Parallel Programming, 1999, v:27, n:4, pp:289-323 [Journal]
  48. Daniel J. Rosenkrantz, Giri Kumar Tayi, S. S. Ravi
    Algorithms for Path-Based Placement of Inspection Stations on Networks. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2000, v:12, n:2, pp:136-149 [Journal]
  49. Peter A. Bloniarz, S. S. Ravi
    An O(n log n) Lower Bound for Decomposing a Set of Points into Chains. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:31, n:6, pp:319-322 [Journal]
  50. Madhav V. Marathe, S. S. Ravi
    On Approximation Algorithms for the Minimum Satisfiability Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:58, n:1, pp:23-29 [Journal]
  51. S. S. Ravi, Harry B. Hunt III
    An Application of the Planar Separator Theorem to Counting Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:25, n:5, pp:317-322 [Journal]
  52. Giri Kumar Tayi, Ram Ramanathan, S. S. Ravi, Sanjay Goel
    Guest Editors' Introduction. [Citation Graph (0, 0)][DBLP]
    Information Systems Frontiers, 2005, v:7, n:2, pp:111-112 [Journal]
  53. Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
    NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:26, n:2, pp:238-274 [Journal]
  54. Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth
    Improving Minimum Cost Spanning Trees by Upgrading Nodes. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:33, n:1, pp:92-111 [Journal]
  55. Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III
    Bicriteria Network Design Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:28, n:1, pp:142-171 [Journal]
  56. Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi
    Approximation Algorithms for Certain Network Improvement Problems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1998, v:2, n:3, pp:257-288 [Journal]
  57. Daniel J. Rosenkrantz, Giri Kumar Tayi, S. S. Ravi
    Facility Dispersion Problems Under Capacity and Cost Constraints. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2000, v:4, n:1, pp:7-33 [Journal]
  58. Errol L. Lloyd, S. S. Ravi
    One-Layer Routing without Component Constraints. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1984, v:28, n:3, pp:420-438 [Journal]
  59. S. S. Ravi, Errol L. Lloyd
    Graph Theoretic Analysis of PLA Folding Heuristics. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1993, v:46, n:3, pp:326-348 [Journal]
  60. Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
    Complexity of reachability problems for finite discrete dynamical systems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:8, pp:1317-1345 [Journal]
  61. Dechang Gu, Daniel J. Rosenkrantz, S. S. Ravi
    Determining Performance Measures of Algorithm-Based Fault Tolerant Systems. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1993, v:18, n:1, pp:56-70 [Journal]
  62. Errol L. Lloyd, Rui Liu, Madhav V. Marathe, Ram Ramanathan, S. S. Ravi
    Algorithmic Aspects of Topology Control Problems for Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    MONET, 2005, v:10, n:1-2, pp:19-34 [Journal]
  63. Errol L. Lloyd, Rui Liu, S. S. Ravi
    Approximating the Minimum Number of Maximum Power Users in Ad hoc Networks. [Citation Graph (0, 0)][DBLP]
    MONET, 2006, v:11, n:2, pp:129-142 [Journal]
  64. Giri Kumar Tayi, Daniel J. Rosenkrantz, S. S. Ravi
    Path problems in networks with vector-valued edge weights. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:34, n:1, pp:19-35 [Journal]
  65. Daniel J. Rosenkrantz, Giri Kumar Tayi, S. S. Ravi
    Obtaining online approximation algorithms for facility dispersion from offline algorithms. [Citation Graph (0, 0)][DBLP]
    Networks, 2006, v:47, n:4, pp:206-217 [Journal]
  66. Srinivas Doddi, Madhav V. Marathe, S. S. Ravi, David Scot Taylor, Peter Widmayer
    Approximation Algorithms for Clustering to Minimize the Sum of Diameters. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2000, v:7, n:3, pp:185-203 [Journal]
  67. Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi
    The Complexity of Approximation PSPACE-Complete Problems for Hierarchical Specifications. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1994, v:1, n:3, pp:275-316 [Journal]
  68. S. S. Ravi, Errol L. Lloyd
    The Complexity of Near-Optimal Programmable Logic Array Folding. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:4, pp:696-710 [Journal]
  69. R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi
    Spanning Trees - Short or Small. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1996, v:9, n:2, pp:178-200 [Journal]
  70. Christopher L. Barrett, Martin Drozda, Madhav V. Marathe, S. S. Ravi, James P. Smith
    A mobility and traffic generation framework for modeling and simulating ad hoc communication networks. [Citation Graph (0, 0)][DBLP]
    Scientific Programming, 2004, v:12, n:1, pp:1-23 [Journal]
  71. Sreejit Chakravarty, Harry B. Hunt III, S. S. Ravi, Daniel J. Rosenkrantz
    The Complexity of Generating Minimum Test Sets for PLA's and Monotone Combinational Circuits. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1989, v:38, n:6, pp:865-869 [Journal]
  72. Dechang Gu, Daniel J. Rosenkrantz, S. S. Ravi
    Construction of Check Sets for Algorithm-Based Fault Tolerance. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1994, v:43, n:6, pp:641-650 [Journal]
  73. Daniel J. Rosenkrantz, S. S. Ravi
    Improved Bounds for Algorithm-Based Fault Tolerance. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1993, v:42, n:5, pp:630-635 [Journal]
  74. Sreejit Chakravarty, Xin He, S. S. Ravi
    Minimum area layout of series-parallel transistor networks is NP-hard. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1991, v:10, n:7, pp:943-949 [Journal]
  75. Sreejit Chakravarty, S. S. Ravi
    Computing optimal test sequences from complete test sets for stuck-open faults in CMOS circuits. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1990, v:9, n:3, pp:329-331 [Journal]
  76. Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
    Reachability problems for sequential dynamical systems with threshold functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:, pp:41-64 [Journal]
  77. Kay U. Drangmeister, Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi
    Modifying Edges of a Network to Obtain Short Subgraphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:203, n:1, pp:91-121 [Journal]
  78. Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz
    Compact Location Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:181, n:2, pp:379-404 [Journal]
  79. Sven Oliver Krumke, Hartmut Noltemeier, Madhav V. Marathe, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth
    Improving Spanning Trees by Upgrading Nodes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:221, n:1-2, pp:139-155 [Journal]
  80. K. B. Lakshmanan, Daniel J. Rosenkrantz, S. S. Ravi
    Alarm placement in systems with fault propagation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:243, n:1-2, pp:269-288 [Journal]
  81. Madhav V. Marathe, Venkatesh Radhakrishnan, Harry B. Hunt III, S. S. Ravi
    Hierarchically Specified Unit Disk Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:174, n:1-2, pp:23-65 [Journal]
  82. Sven Oliver Krumke, Madhav V. Marathe, S. S. Ravi
    Models and Approximation Algorithms for Channel Assignment in Radio Networks. [Citation Graph (0, 0)][DBLP]
    Wireless Networks, 2001, v:7, n:6, pp:575-584 [Journal]
  83. Giri Kumar Tayi, Daniel J. Rosenkrantz, S. S. Ravi
    Local base station assignment with time intervals in mobile computing environments. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2004, v:157, n:2, pp:267-285 [Journal]
  84. Ian Davidson, S. S. Ravi
    Intractability and clustering with constraints. [Citation Graph (0, 0)][DBLP]
    ICML, 2007, pp:201-208 [Conf]
  85. Ian Davidson, S. S. Ravi, Martin Ester
    Efficient incremental constrained clustering. [Citation Graph (0, 0)][DBLP]
    KDD, 2007, pp:240-249 [Conf]
  86. Liang Zhao, Errol L. Lloyd, S. S. Ravi
    Topology Control for Constant Rate Mobile Networks. [Citation Graph (0, 0)][DBLP]
    GLOBECOM, 2006, pp:- [Conf]
  87. Liang Zhao, Errol L. Lloyd, S. S. Ravi
    Topology Control for Simple Mobile Networks. [Citation Graph (0, 0)][DBLP]
    GLOBECOM, 2006, pp:- [Conf]
  88. Ian Davidson, S. S. Ravi
    The complexity of non-hierarchical clustering with instance and cluster level constraints. [Citation Graph (0, 0)][DBLP]
    Data Min. Knowl. Discov., 2007, v:14, n:1, pp:25-61 [Journal]
  89. Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Mayur Thakur
    Predecessor existence problems for finite discrete dynamical systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:386, n:1-2, pp:3-37 [Journal]

  90. Adversarial Scheduling Analysis of Game-Theoretic Models of Norm Diffusion. [Citation Graph (, )][DBLP]


  91. Complexity of Scheduling in Synthesizing Hardware from Concurrent Action Oriented Specifications. [Citation Graph (, )][DBLP]


  92. Bi-Criteria Approximation Algorithms for Power-Efficient and Low-Interference Topology Control in Unreliable Ad Hoc Networks. [Citation Graph (, )][DBLP]


  93. Finding Critical Nodes for Inhibiting Diffusion of Complex Contagions in Social Networks. [Citation Graph (, )][DBLP]


  94. A SAT-based Framework for Efficient Constrained Clustering. [Citation Graph (, )][DBLP]


  95. A mathematical formalism for agent-based modeling [Citation Graph (, )][DBLP]


  96. Adversarial Scheduling Analysis of Game Theoretic Models of Norm Diffusion [Citation Graph (, )][DBLP]


  97. Adversarial Scheduling in Evolutionary Game Dynamics [Citation Graph (, )][DBLP]


  98. On the orderability problem for PLA folding. [Citation Graph (, )][DBLP]


  99. Using instance-level constraints in agglomerative hierarchical clustering: theoretical and empirical results. [Citation Graph (, )][DBLP]


Search in 0.041secs, Finished in 0.045secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002