default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDS. S. Ravi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j77]Daniel J. Rosenkrantz
, Madhav V. Marathe, S. S. Ravi, Richard Edwin Stearns:
Synchronous Dynamical Systems on Directed Acyclic Graphs: Complexity and Algorithms. ACM Trans. Comput. Theory 16(2): 11:1-11:34 (2024)- [c130]Zirou Qiu, Abhijin Adiga, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti:
Learning the Topology and Behavior of Discrete Dynamical Systems. AAAI 2024: 14722-14730 - [c129]Abhijin Adiga, Yohai Trabelsi, Tanvir Ferdousi, Madhav V. Marathe, S. S. Ravi, Samarth Swarup, Anil Kumar S. Vullikanti, Mandy L. Wilson, Sarit Kraus, Reetwika Basu, Supriya Savalkar, Matthew Yourek, Michael Brady, Kirti Rajagopalan, Jonathan Yoder:
Value-based Resource Matching with Fairness Criteria: Application to Agricultural Water Trading. AAMAS 2024: 13-21 - [c128]Zirou Qiu, Abhijin Adiga, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Kumar S. Vullikanti:
Efficient PAC Learnability of Dynamical Systems Over Multilayer Networks. ICML 2024 - [c127]Ian Davidson, Michael J. Livanos, Antoine Gourru, Peter B. Walker, Julien Velcin, S. S. Ravi:
An Exemplars-Based Approach for Explainable Clustering: Complexity and Efficient Approximation Algorithms. SDM 2024: 46-54 - [i21]Abhijin Adiga, Yohai Trabelsi, Tanvir Ferdousi, Madhav V. Marathe, S. S. Ravi, Samarth Swarup, Anil Kumar S. Vullikanti, Mandy L. Wilson, Sarit Kraus, Reetwika Basu, Supriya Savalkar, Matthew Yourek, Michael Brady, Kirti Rajagopalan, Jonathan Yoder:
Value-based Resource Matching with Fairness Criteria: Application to Agricultural Water Trading. CoRR abs/2402.06576 (2024) - [i20]Zirou Qiu, Abhijin Adiga, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti:
Learning the Topology and Behavior of Discrete Dynamical Systems. CoRR abs/2402.11686 (2024) - [i19]Zirou Qiu, Abhijin Adiga, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti:
Efficient PAC Learnability of Dynamical Systems Over Multilayer Networks. CoRR abs/2405.06884 (2024) - [i18]Abhijin Adiga, Ayush Chopra, Mandy L. Wilson, S. S. Ravi, Dawen Xie, Samarth Swarup, Bryan Lewis, Ramesh Raskar, Madhav V. Marathe:
A High-Resolution, US-scale Digital Similar of Interacting Livestock, Wild Birds, and Human Ecosystems with Applications to Multi-host Epidemic Spread. CoRR abs/2411.01386 (2024) - 2023
- [j76]Ian Davidson, Zilong Bai, Cindy Mylinh Tran, S. S. Ravi:
Making clusterings fairer by post-processing: algorithms, complexity results and experiments. Data Min. Knowl. Discov. 37(4): 1404-1440 (2023) - [c126]Zirou Qiu, Chen Chen, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti:
Networked Anti-coordination Games Meet Graphical Dynamical Systems: Equilibria and Convergence. AAAI 2023: 11663-11671 - [c125]Yohai Trabelsi, Abhijin Adiga, Sarit Kraus, S. S. Ravi, Daniel J. Rosenkrantz:
Resource Sharing through Multi-Round Matchings. AAAI 2023: 11681-11690 - [c124]Zirou Qiu, Andrew Yuan, Chen Chen, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti:
Assigning Agents to Increase Network-Based Neighborhood Diversity. AAMAS 2023: 600-608 - [c123]Swapna Thorve, Aparna Kishore, Dustin Machi, S. S. Ravi, Madhav V. Marathe:
A Network Synthesis and Analytics Pipeline with Applications to Sustainable Energy in Smart Grid. e-Science 2023: 1-10 - [c122]Galen Harrison, Amro Alabsi Aljundi, Jiangzhuo Chen, S. S. Ravi, Anil Kumar S. Vullikanti, Madhav V. Marathe, Abhijin Adiga:
Identifying Complicated Contagion Scenarios from Cascade Data. KDD 2023: 4135-4145 - [c121]Tanvir Ferdousi, Abhijin Adiga, Mandy L. Wilson, S. S. Ravi, Anil Vullikanti, Madhav V. Marathe, Samarth Swarup, Mingliang Liu, Kirti Rajagopalan, Jennifer Adam:
A Machine Learning Framework to Explain Complex Geospatial Simulations: A Climate Change Case Study. WSC 2023: 2990-3001 - [i17]Zirou Qiu, Andrew Yuan, Chen Chen, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti:
Assigning Agents to Increase Network-Based Neighborhood Diversity. CoRR abs/2301.02876 (2023) - [i16]Zirou Qiu, Chen Chen, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti:
Networked Anti-Coordination Games Meet Graphical Dynamical Systems: Equilibria and Convergence. CoRR abs/2301.02889 (2023) - [i15]Zirou Qiu, Chen Chen, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti:
Finding Nontrivial Minimum Fixed Points in Discrete Dynamical Systems. CoRR abs/2301.04090 (2023) - 2022
- [j75]Abhijin Adiga, Nicholas Palmer, Young Yun Baek, Henning S. Mortveit, S. S. Ravi:
Network Models and Simulation Analytics for Multi-scale Dynamics of Biological Invasions. Frontiers Big Data 5: 796897 (2022) - [j74]Teresa M. Harrison, Catherine L. Dumas, Nic DePaula, Tim Fake, William May, Akanksha Atrey, Jooyeon Lee, Lokesh Rishi, S. S. Ravi:
Exploring E-petitioning and media: The case of #BringBackOurGirls. Gov. Inf. Q. 39(1): 101569 (2022) - [j73]Abhijin Adiga, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Using Active Queries to Infer Symmetric Node Functions of Graph Dynamical Systems. J. Mach. Learn. Res. 23: 251:1-251:43 (2022) - [j72]Henry L. Carscadden, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz:
Techniques for blocking the propagation of two simultaneous contagions over networks using a graph dynamical systems framework. Netw. Sci. 10(3): 234-260 (2022) - [j71]Daniel J. Rosenkrantz, Anil Vullikanti, S. S. Ravi, Richard Edwin Stearns, Simon A. Levin, H. Vincent Poor, Madhav V. Marathe:
Fundamental limitations on efficiently forecasting certain epidemic measures in network models. Proc. Natl. Acad. Sci. USA 119(4): e2109228119 (2022) - [c120]Zirou Qiu, Chen Chen, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti:
Finding Nontrivial Minimum Fixed Points in Discrete Dynamical Systems: Complexity, Special Case Algorithms and Heuristics. AAAI 2022: 9422-9430 - [c119]Robert Chen Bao, Matthew Hancock, Chris J. Kuhlman, S. S. Ravi:
Using Dominating Sets to Block Contagions in Social Networks. ASONAM 2022: 22-25 - [c118]Yohai Trabelsi, Abhijin Adiga, Sarit Kraus, S. S. Ravi:
Maximizing Resource Allocation Likelihood with Minimum Compromise. AAMAS 2022: 1738-1740 - [c117]Tanvir Ferdousi, Aparna Kishore, Lucas Machi, Dustin Machi, Chris J. Kuhlman, S. S. Ravi:
A Web-Based System for Contagion Simulations on Networked Populations. e-Science 2022: 306-315 - [c116]Yohai Trabelsi, Abhijin Adiga, Sarit Kraus, S. S. Ravi:
Resource Allocation to Agents with Restrictions: Maximizing Likelihood with Minimum Compromise. EUMAS 2022: 403-420 - [c115]Daniel J. Rosenkrantz, Abhijin Adiga, Madhav V. Marathe, Zirou Qiu, S. S. Ravi, Richard Edwin Stearns, Anil Vullikanti:
Efficiently Learning the Topology and Behavior of a Networked Dynamical System Via Active Queries. ICML 2022: 18796-18808 - [i14]Yohai Trabelsi, Abhijin Adiga, Sarit Kraus, S. S. Ravi:
Resource Allocation to Agents with Restrictions: Maximizing Likelihood with Minimum Compromise. CoRR abs/2209.05170 (2022) - [i13]Ian Davidson, Michael J. Livanos, Antoine Gourru, Peter B. Walker, Julien Velcin, S. S. Ravi:
Explainable Clustering via Exemplars: Complexity and Efficient Approximation Algorithms. CoRR abs/2209.09670 (2022) - [i12]Ian Davidson, S. S. Ravi:
Towards Auditing Unsupervised Learning Algorithms and Human Processes For Fairness. CoRR abs/2209.11762 (2022) - [i11]Yohai Trabelsi, Abhijin Adiga, Sarit Kraus, S. S. Ravi, Daniel J. Rosenkrantz:
Resource Sharing Through Multi-Round Matchings. CoRR abs/2211.17199 (2022) - 2021
- [j70]Chris J. Kuhlman, Gizem Korkmaz, S. S. Ravi, Fernando Vega-Redondo:
Theoretical and computational characterizations of interaction mechanisms on Facebook dynamics using a common knowledge model. Soc. Netw. Anal. Min. 11(1): 116 (2021) - [c114]Daniel J. Rosenkrantz, Madhav V. Marathe, S. S. Ravi, Richard Edwin Stearns:
Synchronous Dynamical Systems on Directed Acyclic Graphs: Complexity and Algorithms. AAAI 2021: 11334-11342 - [c113]Aparna Kishore, Lucas Machi, Chris J. Kuhlman, Dustin Machi, S. S. Ravi:
A Framework for Simulating Multiple Contagions Over Multiple Networks. COMPLEX NETWORKS 2021: 241-252 - [c112]Matthew Hancock, Nafisa Halim, Chris J. Kuhlman, Achla Marathe, Pallab Mozumder, S. S. Ravi, Anil Vullikanti:
Effect of Peer Influence and Looting Concerns on Evacuation Behavior During Natural Disasters. COMPLEX NETWORKS 2021: 377-389 - [c111]Matthew Hancock, Nafisa Halim, Chris J. Kuhlman, Achla Marathe, Pallab Mozumder, S. S. Ravi, Anil Vullikanti:
Data-Driven Modeling of Evacuation Decision-Making in Extreme Weather Events. COMPLEX NETWORKS 2021: 681-692 - [c110]Golda Barrow, Chris J. Kuhlman, Dustin Machi, S. S. Ravi:
Interactive Demonstrations and Hands-On Use of thenet.science Cyberinfrastructure for Network Science Chairs' Welcome and Tutorial Summary. WebSci (Companion) 2021: 137 - [c109]Henry L. Carscadden, Lucas Machi, Aparna Kishore, Chris J. Kuhlman, Dustin Machi, S. S. Ravi:
ExecutionManager: A Software System to Control Execution of Third-Party Software that Performs Network Computations. WSC 2021: 1-12 - [c108]Henry L. Carscadden, Lucas Machi, Chris J. Kuhlman, Dustin Machi, S. S. Ravi:
GraphTrans: A Software System for Network Conversions for Simulation, Structural Analysis, and Graph Operations. WSC 2021: 1-12 - [c107]Joshua D. Priest, Aparna Kishore, Lucas Machi, Chris J. Kuhlman, Dustin Machi, S. S. Ravi:
CSonNet: An Agent-Based Modeling Software System for Discrete Time Simulation. WSC 2021: 1-12 - 2020
- [j69]Vanessa Cedeno-Mieles, Zhihao Hu, Yihui Ren, Xinwei Deng, Abhijin Adiga, Christopher L. Barrett, Noshir Contractor, Saliya Ekanayake, Joshua M. Epstein, Brian J. Goode, Gizem Korkmaz, Chris J. Kuhlman, Dustin Machi, Michael W. Macy, Madhav V. Marathe, Naren Ramakrishnan, S. S. Ravi, Parang Saraf, Nathan Self:
Networked experiments and modeling for producing collective identity in a group of human subjects using an iterative abduction framework. Soc. Netw. Anal. Min. 10(1): 11 (2020) - [j68]Prachi Joshi, S. S. Ravi, Qingyu Liu, Unmesh D. Bordoloi, Soheil Samii, Sandeep Kumar Shukla, Haibo Zeng:
Approaches for Assigning Offsets to Signals for Improving Frame Packing in CAN-FD. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 39(5): 1109-1122 (2020) - [c106]Prathyush Sambaturu, Aparna Gupta, Ian Davidson, S. S. Ravi, Anil Vullikanti, Andrew Warren:
Efficient Algorithms for Generating Provably Near-Optimal Cluster Descriptors for Explainability. AAAI 2020: 1636-1643 - [c105]Abhijin Adiga, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti:
Bounds and Complexity Results for Learning Coalition-Based Interaction Functions in Networked Social Systems. AAAI 2020: 3138-3145 - [c104]Ian Davidson, S. S. Ravi:
Making Existing Clusterings Fairer: Algorithms, Complexity Results and Insights. AAAI 2020: 3733-3740 - [c103]Karen Kuhlman Amos, Chris J. Kuhlman, S. S. Ravi:
Despotic Regimes Instilling Fear in Citizens to Suppress Protests. ASONAM 2020: 369-373 - [c102]Abhijin Adiga, Sarit Kraus, S. S. Ravi:
Boolean Games: Inferring Agents' Goals Using Taxation Queries. AAMAS 2020: 1735-1737 - [c101]Chris J. Kuhlman, Gizem Korkmaz, S. S. Ravi, Fernando Vega-Redondo:
Effect of Interaction Mechanisms on Facebook Dynamics Using a Common Knowledge Model. COMPLEX NETWORKS (1) 2020: 395-407 - [c100]Henry L. Carscadden, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz:
Blocking the Propagation of Two Simultaneous Contagions over Networks. COMPLEX NETWORKS (1) 2020: 455-468 - [c99]Joshua D. Priest, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Evolution of Similar Configurations in Graph Dynamical Systems. COMPLEX NETWORKS (1) 2020: 544-555 - [c98]Ian Davidson, S. S. Ravi:
A Framework for Determining the Fairness of Outlier Detection. ECAI 2020: 2465-2472 - [c97]Abhijin Adiga, Sarit Kraus, Oleg Maksimov, S. S. Ravi:
Boolean Games: Inferring Agents' Goals Using Taxation Queries. IJCAI 2020: 1585-1591 - [c96]Zilong Bai, S. S. Ravi, Ian Davidson:
Towards Description of Block Model on Graph. ECML/PKDD (3) 2020: 37-53 - [c95]Hongjing Zhang, S. S. Ravi, Ian Davidson:
A Graph-Based Approach for Active Learning in Regression. SDM 2020: 280-288 - [c94]Chris J. Kuhlman, S. S. Ravi, Gizem Korkmaz, Fernando Vega-Redondo:
An Agent-Based Model of Common Knowledge and Collective Action Dynamics on Social Networks. WSC 2020: 218-229 - [i10]Hongjing Zhang, S. S. Ravi, Ian Davidson:
A Graph-Based Approach for Active Learning in Regression. CoRR abs/2001.11143 (2020) - [i9]Prathyush Sambaturu, Aparna Gupta, Ian Davidson, S. S. Ravi, Anil Vullikanti, Andrew Warren:
Efficient Algorithms for Generating Provably Near-Optimal Cluster Descriptors for Explainability. CoRR abs/2002.02487 (2020)
2010 – 2019
- 2019
- [j67]Daniel J. Rosenkrantz, Madhav V. Marathe, S. S. Ravi, Richard Edwin Stearns:
Symmetry Properties of Nested Canalyzing Functions. Discret. Math. Theor. Comput. Sci. 21(4) (2019) - [c93]Vanessa Cedeno-Mieles, Zhihao Hu, Xinwei Deng, Yihui Ren, Abhijin Adiga, Christopher L. Barrett, Saliya Ekanayake, Gizem Korkmaz, Chris J. Kuhlman, Dustin Machi, Madhav V. Marathe, S. S. Ravi, Brian J. Goode, Naren Ramakrishnan, Parang Saraf, Nathan Self, Noshir Contractor, Joshua M. Epstein, Michael W. Macy:
Mechanistic and data-driven agent-based models to explain human behavior in online networked group anagram games. ASONAM 2019: 357-364 - [c92]Abhijin Adiga, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Anil Vullikanti:
PAC Learnability of Node Functions in Networked Dynamical Systems. ICML 2019: 82-91 - [c91]Zhihao Hu, Dustin Machi, Madhav V. Marathe, S. S. Ravi, Yihui Ren, Vanessa Cedeno-Mieles, Saliya Ekanayake, Xinwei Deng, Brian J. Goode, Naren Ramakrishnan, Parang Saraf, Nathan Self, Abhijin Adiga, Gizem Korkmaz, Chris J. Kuhlman:
On the Modeling and Agent-Based Simulation of a Cooperative Group Anagram Game. WSC 2019: 169-180 - [c90]Abhijin Adiga, Samarth Swarup, Anil Vullikanti, Christopher L. Barrett, Stephen G. Eubank, Chris J. Kuhlman, Madhav V. Marathe, Henning S. Mortveit, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Validating Agent-Based Models of Large Networked Systems. WSC 2019: 2807-2818 - [i8]Daniel J. Rosenkrantz, Madhav V. Marathe, S. S. Ravi, Richard Edwin Stearns:
Symmetry Properties of Nested Canalyzing Functions. CoRR abs/1906.03752 (2019) - 2018
- [j66]Richard Edwin Stearns, Daniel J. Rosenkrantz, S. S. Ravi, Madhav V. Marathe:
A characterization of nested canalyzing functions with maximum average sensitivity. Discret. Appl. Math. 251: 5-14 (2018) - [j65]Gizem Korkmaz, Chris J. Kuhlman, S. S. Ravi, Fernando Vega-Redondo:
Spreading of social contagions without key players. World Wide Web 21(5): 1187-1221 (2018) - [c89]Abhijin Adiga, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Learning the Behavior of a Dynamical System Via a "20 Questions" Approach. AAAI 2018: 4630-4637 - [c88]Yihui Ren, Vanessa Cedeno-Mieles, Zhihao Hu, Xinwei Deng, Abhijin Adiga, Christopher L. Barrett, Saliya Ekanayake, Brian J. Goode, Gizem Korkmaz, Chris J. Kuhlman, Dustin Machi, Madhav V. Marathe, Naren Ramakrishnan, S. S. Ravi, Parang Saraf, Nathan Self, Noshir Contractor, Joshua M. Epstein, Michael W. Macy:
Generative Modeling of Human Behavior and Social Interactions Using Abductive Analysis. ASONAM 2018: 413-420 - [c87]Daniel J. Rosenkrantz, Madhav V. Marathe, S. S. Ravi, Richard Edwin Stearns:
Testing Phase Space Properties of Synchronous Dynamical Systems with Nested Canalyzing Local Functions. AAMAS 2018: 1585-1594 - [c86]Aditya Pratapa, Amogh P. Jalihal, S. S. Ravi, T. M. Murali:
Efficient Synthesis of Mutants Using Genetic Crosses. BCB 2018: 53-62 - [c85]Abhijin Adiga, Vanessa Cedeno-Mieles, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Inferring Probabilistic Contagion Models Over Networks Using Active Queries. CIKM 2018: 377-386 - [c84]Abhijin Adiga, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Using Active Queries to Learn Local Stochastic Behaviors in Social Networks. COMPLEX NETWORKS (2) 2018: 246-257 - [c83]Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Computational Aspects of Fault Location and Resilience Problems for Interdependent Infrastructure Networks. COMPLEX NETWORKS (1) 2018: 879-890 - [c82]Thi-Bich-Hanh Dao, Chia-Tung Kuo, S. S. Ravi, Christel Vrain, Ian Davidson:
Descriptive Clustering: ILP and CP Formulations with Applications. IJCAI 2018: 1263-1269 - [c81]Anamitra Pal, Pavan Rangudu, S. S. Ravi, Anil Kumar S. Vullikanti:
Using Activity Patterns to Place Electric Vehicle Charging Stations in Urban Regions. IPDPS Workshops 2018: 1143-1152 - [c80]Ian Davidson, Antoine Gourru, S. S. Ravi:
The Cluster Description Problem - Complexity Results, Formulations and Approximations. NeurIPS 2018: 6193-6203 - [p2]Gruia Calinescu, Errol L. Lloyd, S. S. Ravi:
Topology Control Problems for Wireless Ad hoc Networks. Handbook of Approximation Algorithms and Metaheuristics (2) 2018 - [p1]S. S. Ravi, Daniel J. Rosenkrantz, Giri Kumar Tayi:
Approximation Algorithms for Facility Dispersion. Handbook of Approximation Algorithms and Metaheuristics (2) 2018 - 2017
- [j64]Goutam Paul, Ian Davidson, Imon Mukherjee, S. S. Ravi:
Keyless dynamic optimal multi-bit image steganography using energetic pixels. Multim. Tools Appl. 76(5): 7445-7471 (2017) - [j63]Abhijin Adiga, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Inferring local transition functions of discrete dynamical systems from observations of system behavior. Theor. Comput. Sci. 679: 126-144 (2017) - [c79]Chia-Tung Kuo, S. S. Ravi, Thi-Bich-Hanh Dao, Christel Vrain, Ian Davidson:
A Framework for Minimal Clustering Modification via Constraint Programming. AAAI 2017: 1389-1395 - [c78]Teresa M. Harrison, Catherine L. Dumas, Nic DePaula, Tim Fake, William May, Akanksha Atrey, Jooyeon Lee, Lokesh Rishi, S. S. Ravi:
E-Petitioning and Online Media: The Case of #BringBackOurGirls. DG.O 2017: 11-20 - [c77]Prachi Joshi, Haibo Zeng, Unmesh D. Bordoloi, Soheil Samii, S. S. Ravi, Sandeep K. Shukla:
The Multi-Domain Frame Packing Problem for CAN-FD. ECRTS 2017: 12:1-12:22 - [c76]Prachi Joshi, S. S. Ravi, Soheil Samii, Unmesh D. Bordoloi, Sandeep K. Shukla, Haibo Zeng:
Offset Assignment to Signals for Improving Frame Packing in CAN-FD. RTSS 2017: 167-177 - 2016
- [c75]Sherif Elmeligy Abdelhamid, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi:
Interactive exploration and understanding of contagion dynamics in networked populations. BESC 2016: 1-6 - [c74]Catherine L. Dumas, Akanksha Atrey, Jooyeon Lee, Teresa M. Harrison, Tim Fake, Xiaoyi Zhao, S. S. Ravi:
E-petition Information Diffusion in Online Social Networks. DG.O 2016: 515-517 - [c73]Gizem Korkmaz, Chris J. Kuhlman, S. S. Ravi, Fernando Vega-Redondo:
Approximate Contagion Model of Common Knowledge on Facebook. HT 2016: 231-236 - [c72]Sherif Hanie El Meligy Abdelhamid, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi:
Network Services and their Compositions for Network Science Applications. ICCS 2016: 472-483 - 2015
- [j62]Catherine L. Dumas, Dan Lamanna, Teresa M. Harrison, S. S. Ravi, Christopher Kotfila, Norman Gervais, Loni Hagen, Feng Chen:
Examining political mobilization of online communities through e-petitioning behavior in We the People. Big Data Soc. 2(2): 205395171559817 (2015) - [j61]Chris J. Kuhlman, V. S. Anil Kumar, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz:
Inhibiting diffusion of complex contagions in social networks: theoretical and experimental results. Data Min. Knowl. Discov. 29(2): 423-465 (2015) - [j60]Bin Xue, Sandeep K. Shukla, S. S. Ravi:
Optimization of Latency Insensitive Systems Through Back Pressure Minimization. IEEE Trans. Computers 64(2): 464-476 (2015) - [c71]Daniel J. Rosenkrantz, Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi, Richard Edwin Stearns:
Analysis Problems for Graphical Dynamical Systems: A Unified Approach Through Graph Predicates. AAMAS 2015: 1501-1509 - [c70]Sherif Elmeligy Abdelhamid, Chris J. Kuhlman, Gizem Korkmaz, Madhav V. Marathe, S. S. Ravi:
EDISON: a web application for computational health informatics at scale. BCB 2015: 413-422 - [c69]Abhijin Adiga, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Complexity of Inferring Local Transition Functions of Discrete Dynamical Systems. CIAA 2015: 21-34 - 2014
- [j59]Jonathan Muckell, Paul W. Olsen, Jeong-Hyon Hwang, Catherine T. Lawson, S. S. Ravi:
Compression of trajectory data: a comprehensive evaluation and new approach. GeoInformatica 18(3): 435-460 (2014) - [c68]Sherif Hanie El Meligy Abdelhamid, Md. Maksudul Alam, Richard A. Aló, Shaikh Arifuzzaman, Peter H. Beckman, Tirtha Bhattacharjee, Md Hasanuzzaman Bhuiyan, Keith R. Bisset, Stephen G. Eubank, Albert C. Esterline, Edward A. Fox, Geoffrey C. Fox, S. M. Shamimul Hasan, Harshal Hayatnagarkar, Maleq Khan, Chris J. Kuhlman, Madhav V. Marathe, Natarajan Meghanathan, Henning S. Mortveit, Judy Qiu, S. S. Ravi, Zalia Shams, Ongard Sirisaengtaksin, Samarth Swarup, Anil Kumar S. Vullikanti, Tak-Lon Wu:
CINET 2.0: A CyberInfrastructure for Network Science. eScience 2014: 324-331 - 2013
- [j58]Chris J. Kuhlman, V. S. Anil Kumar, S. S. Ravi:
Controlling opinion propagation in online networks. Comput. Networks 57(10): 2121-2132 (2013) - [c67]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. Fundamental Problems in Computing 2013: 241-266 - [c66]Jonathan Muckell, Paul W. Olsen, Jeong-Hyon Hwang, S. S. Ravi, Catherine T. Lawson:
A Framework for Efficient and Convenient Evaluation of Trajectory Compression Algorithms. COM.Geo 2013: 24-31 - [c65]Kyuseo Park, Jeremy Birnbaum, Paul W. Olsen, Yuchao Ma, Jayadevan Vijayan, S. S. Ravi, Jeong-Hyon Hwang, Jonathan Muckell, Catherine T. Lawson:
TrajMetrix: a trajectory compression benchmarking framework. SIGSPATIAL/GIS 2013: 542-545 - [c64]Chris J. Kuhlman, Gaurav Tuli, Samarth Swarup, Madhav V. Marathe, S. S. Ravi:
Blocking Simple and Complex Contagion by Edge Removal. ICDM 2013: 399-408 - 2012
- [j57]Gabriel Istrate, Madhav V. Marathe, S. S. Ravi:
Adversarial scheduling in discrete models of social dynamics. Math. Struct. Comput. Sci. 22(5): 788-815 (2012) - [c63]Sherif Elmeligy Abdelhamid, Richard A. Aló, S. M. Arifuzzaman, Peter H. Beckman, Md Hasanuzzaman Bhuiyan, Keith R. Bisset, Edward A. Fox, Geoffrey Charles Fox, Kevin Hall, S. M. Shamimul Hasan, Anurodh Joshi, Maleq Khan, Chris J. Kuhlman, Spencer J. Lee, Jonathan Leidig, Hemanth Makkapati, Madhav V. Marathe, Henning S. Mortveit, Judy Qiu, S. S. Ravi, Zalia Shams, Ongard Sirisaengtaksin, Rajesh Subbiah, Samarth Swarup, Nick Trebon, Anil Vullikanti, Zhao Zhao:
CINET: A cyberinfrastructure for network science. eScience 2012: 1-8 - [c62]Fei Che, Errol L. Lloyd, Jason O. Hallstrom, S. S. Ravi:
Topology control with a limited number of relays. GLOBECOM 2012: 645-651 - [c61]Goutam Paul, Ian Davidson, Imon Mukherjee, S. S. Ravi:
Keyless Steganography in Spatial Domain Using Energetic Pixels. ICISS 2012: 134-148 - [c60]Gaurav Tuli, Madhav V. Marathe, S. S. Ravi, Samarth Swarup:
Addiction Dynamics May Explain the Slow Decline of Smoking Prevalence. SBP 2012: 114-122 - [c59]Jeong-Hyon Hwang, Jeremy Birnbaum, Rohini Vabbalareddy, S. S. Ravi, Chanyeol Park:
A Graph Database Approach for Efficient and Scalable Management of Simulations. SC Companion 2012: 1310-1311 - [c58]Chris J. Kuhlman, V. S. Anil Kumar, S. S. Ravi:
Controlling opinion bias in online social networks. WebSci 2012: 165-174 - 2011
- [j56]Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems. Theor. Comput. Sci. 412(30): 3932-3946 (2011) - [c57]Christopher James Kuhlman, V. S. Anil Kumar, Madhav V. Marathe, Samarth Swarup, Gaurav Tuli, S. S. Ravi, Daniel J. Rosenkrantz:
Inhibiting the Diffusion of Contagions in Bi-Threshold Systems: Analytical and Experimental Results. AAAI Fall Symposium: Complex Adaptive Systems 2011 - [c56]Jonathan Muckell, Jeong-Hyon Hwang, Vikram Patil, Catherine T. Lawson, Fan Ping, S. S. Ravi:
SQUISH: an online approach for GPS trajectory compression. COM.Geo 2011: 13:1-13:8 - [c55]Chris J. Kuhlman, V. S. Anil Kumar, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz:
Effects of Opposition on the Diffusion of Complex Contagions in Social Networks: An Empirical Study. SBP 2011: 188-196 - [c54]Chris J. Kuhlman, V. S. Anil Kumar, Madhav V. Marathe, Henning S. Mortveit, Samarth Swarup, Gaurav Tuli, S. S. Ravi, Daniel J. Rosenkrantz:
A general-purpose graph dynamical system modeling framework. WSC 2011: 296-308 - 2010
- [j55]Liang Zhao, Errol L. Lloyd, S. S. Ravi:
Topology control in constant rate mobile ad hoc networks. Wirel. Networks 16(2): 467-480 (2010) - [c53]Jonathan Muckell, Jeong-Hyon Hwang, Catherine T. Lawson, S. S. Ravi:
Algorithms for compressing GPS trajectory data: an empirical evaluation. GIS 2010: 402-405 - [c52]Bin Xue, Sandeep K. Shukla, S. S. Ravi:
Minimizing back pressure for latency insensitive system synthesis. MEMOCODE 2010: 189-198 - [c51]Chris J. Kuhlman, V. S. Anil Kumar, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz:
Finding Critical Nodes for Inhibiting Diffusion of Complex Contagions in Social Networks. ECML/PKDD (2) 2010: 111-127 - [c50]Ian Davidson, S. S. Ravi, Leonid Shamis:
A SAT-based Framework for Efficient Constrained Clustering. SDM 2010: 94-105
2000 – 2009
- 2009
- [j54]Ian Davidson, S. S. Ravi:
Using instance-level constraints in agglomerative hierarchical clustering: theoretical and empirical results. Data Min. Knowl. Discov. 18(2): 257-282 (2009) - [j53]Daniel J. Rosenkrantz, Sanjay Goel, S. S. Ravi, Jagdish Gangolly:
Resilience Metrics for Service-Oriented Networks: A Service Allocation Approach. IEEE Trans. Serv. Comput. 2(3): 183-196 (2009) - [c49]Maleq Khan, V. S. Anil Kumar, Madhav V. Marathe, Gopal Pandurangan, S. S. Ravi:
Bi-Criteria Approximation Algorithms for Power-Efficient and Low-Interference Topology Control in Unreliable Ad Hoc Networks. INFOCOM 2009: 370-378 - [e2]S. S. Ravi, Sandeep K. Shukla:
Fundamental Problems in Computing, Essays in Honor of Professor Daniel J. Rosenkrantz. Springer 2009, ISBN 978-1-4020-9687-7 [contents] - [r3]Reinhard C. Laubenbacher, Abdul Salam Jarrah, Henning S. Mortveit, S. S. Ravi:
Agent Based Modeling, Mathematical Formalism for. Encyclopedia of Complexity and Systems Science 2009: 160-176 - 2008
- [j52]Paolo Penna, S. S. Ravi:
Guest editors' introduction. ACM SIGMOBILE Mob. Comput. Commun. Rev. 12(1): 15-16 (2008) - [j51]Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Mayur Thakur:
Errata for the paper "Predecessor existence problems for finite discrete dynamical systems" [TCS 386 (1-2) (2007) 3-37]. Theor. Comput. Sci. 395(1): 132-133 (2008) - [c48]Gabriel Istrate, Madhav V. Marathe, S. S. Ravi:
Adversarial Scheduling Analysis of Game-Theoretic Models of Norm Diffusion. CiE 2008: 273-282 - [i7]Reinhard C. Laubenbacher, Abdul Salam Jarrah, Henning S. Mortveit, S. S. Ravi:
A mathematical formalism for agent-based modeling. CoRR abs/0801.0249 (2008) - [i6]Gabriel Istrate, Madhav V. Marathe, S. S. Ravi:
Adversarial Scheduling Analysis of Game Theoretic Models of Norm Diffusion. CoRR abs/0803.2495 (2008) - [i5]Gabriel Istrate, Madhav V. Marathe, S. S. Ravi:
Adversarial Scheduling in Evolutionary Game Dynamics. CoRR abs/0812.1194 (2008) - 2007
- [j50]Ian Davidson, S. S. Ravi:
The complexity of non-hierarchical clustering with instance and cluster level constraints. Data Min. Knowl. Discov. 14(1): 25-61 (2007) - [j49]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. Theor. Comput. Sci. 386(1-2): 3-37 (2007) - [c47]Ian Davidson, S. S. Ravi:
Intractability and clustering with constraints. ICML 2007: 201-208 - [c46]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. IJCAI 2007: 2268-2273 - [c45]Ian Davidson, S. S. Ravi, Martin Ester:
Efficient incremental constrained clustering. KDD 2007: 240-249 - [r2]S. S. Ravi, Errol L. Lloyd:
Topology Control Problems for Wireless Ad Hoc Networks. Handbook of Approximation Algorithms and Metaheuristics 2007 - [r1]Daniel J. Rosenkrantz, S. S. Ravi, Giri Kumar Tayi:
Approximation Algorithms for Facility Dispersion. Handbook of Approximation Algorithms and Metaheuristics 2007 - [i4]Gaurav Singh, S. S. Ravi, Sumit Ahuja, Sandeep K. Shukla:
Complexity of Scheduling in Synthesizing Hardware from Concurrent Action Oriented Specifications. Power-aware Computing Systems 2007 - 2006
- [j48]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. J. Comput. Syst. Sci. 72(8): 1317-1345 (2006) - [j47]Errol L. Lloyd, Rui Liu, S. S. Ravi:
Approximating the Minimum Number of Maximum Power Users in Ad hoc Networks. Mob. Networks Appl. 11(2): 129-142 (2006) - [j46]Daniel J. Rosenkrantz, Giri Kumar Tayi, S. S. Ravi:
Obtaining online approximation algorithms for facility dispersion from offline algorithms. Networks 47(4): 206-217 (2006) - [c44]Ian Davidson, S. S. Ravi:
Identifying and Generating Easy Sets of Constraints for Clustering. AAAI 2006: 336-341 - [c43]Liang Zhao, Errol L. Lloyd, S. S. Ravi:
Topology Control for Constant Rate Mobile Networks. GLOBECOM 2006 - [c42]Liang Zhao, Errol L. Lloyd, S. S. Ravi:
Topology Control for Simple Mobile Networks. GLOBECOM 2006 - [e1]Thomas Kunz, S. S. Ravi:
Ad-Hoc, Mobile, and Wireless Networks, 5th International Conference, ADHOC-NOW 2006, Ottawa, Canada, August 17-19, 2006, Proceedings. Lecture Notes in Computer Science 4104, Springer 2006, ISBN 3-540-37246-6 [contents] - 2005
- [j45]Giri Kumar Tayi, Ram Ramanathan, S. S. Ravi, Sanjay Goel:
Guest Editors' Introduction. Inf. Syst. Frontiers 7(2): 111-112 (2005) - [j44]Errol L. Lloyd, Rui Liu, Madhav V. Marathe, Ram Ramanathan, S. S. Ravi:
Algorithmic Aspects of Topology Control Problems for Ad Hoc Networks. Mob. Networks Appl. 10(1-2): 19-34 (2005) - [c41]Daniel J. Rosenkrantz, Sanjay Goel, S. S. Ravi, Jagdish Gangolly:
Structure-Based Resilience Metrics for Service-Oriented Networks. EDCC 2005: 345-362 - [c40]Ian Davidson, S. S. Ravi:
Agglomerative Hierarchical Clustering with Constraints: Theoretical and Empirical Results. PKDD 2005: 59-70 - [c39]Ian Davidson, S. S. Ravi:
Clustering with Constraints: Feasibility Issues and the k-Means Algorithm. SDM 2005: 138-149 - [c38]Christopher L. Barrett, Martin Drozda, D. Charles Engelhart, V. S. Anil Kumar, Madhav V. Marathe, Monique Morin, S. S. Ravi, James P. Smith:
Understanding protocol performance and robustness of ad hoc networks through structural analysis. WiMob (3) 2005: 65-72 - 2004
- [j43]Giri Kumar Tayi, Daniel J. Rosenkrantz, S. S. Ravi:
Local base station assignment with time intervals in mobile computing environments. Eur. J. Oper. Res. 157(2): 267-285 (2004) - [j42]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. Sci. Program. 12(1): 1-23 (2004) - [c37]Errol L. Lloyd, Rui Liu, S. S. Ravi:
Approximating the Minimum Number of Maximum Power Users in Ad Hoc Networks. ADHOC-NOW 2004: 1-13 - 2003
- [j41]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. Theor. Comput. Sci. 295: 41-64 (2003) - [c36]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. ADHOC-NOW 2003: 187-198 - [c35]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. DMCS 2003: 69-80 - 2002
- [j40]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. Inf. Comput. 173(1): 40-63 (2002) - [c34]Errol L. Lloyd, Rui Liu, Madhav V. Marathe, Ram Ramanathan, S. S. Ravi:
Algorithmic aspects of topology control problems for ad hoc networks. MobiHoc 2002: 123-134 - [c33]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. SAC 2002: 122-126 - [c32]Sven Oliver Krumke, Madhav V. Marathe, Diana Poensgen, S. S. Ravi, Hans-Christoph Wirth:
Budgeted Maximum Graph Coverage. WG 2002: 321-332 - 2001
- [j39]Daniel J. Rosenkrantz, Lin Yu, S. S. Ravi:
Efficient Construction of Minimum Makespan Schedules for Tasks with a Fixed Number of Distinct Execution Times. Algorithmica 30(1): 83-100 (2001) - [j38]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. Algorithmica 31(1): 58-78 (2001) - [j37]Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth:
Upgrading bottleneck constrained forests. Discret. Appl. Math. 108(1-2): 129-142 (2001) - [j36]Sven Oliver Krumke, Madhav V. Marathe, S. S. Ravi:
Models and Approximation Algorithms for Channel Assignment in Radio Networks. Wirel. Networks 7(6): 575-584 (2001) - [c31]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. DM-CCG 2001: 95-110 - [c30]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. MFCS 2001: 159-172 - [c29]Gabriel Istrate, Madhav V. Marathe, S. S. Ravi:
Adversarial models in evolutionary game dynamics. SODA 2001: 719-720 - 2000
- [j35]Daniel J. Rosenkrantz, Giri Kumar Tayi, S. S. Ravi:
Algorithms for Path-Based Placement of Inspection Stations on Networks. INFORMS J. Comput. 12(2): 136-149 (2000) - [j34]Daniel J. Rosenkrantz, Giri Kumar Tayi, S. S. Ravi:
Facility Dispersion Problems Under Capacity and Cost Constraints. J. Comb. Optim. 4(1): 7-33 (2000) - [j33]Srinivas Doddi, Madhav V. Marathe, S. S. Ravi, David Scot Taylor, Peter Widmayer:
Approximation Algorithms for Clustering to Minimize the Sum of Diameters. Nord. J. Comput. 7(3): 185-203 (2000) - [j32]K. B. Lakshmanan, Daniel J. Rosenkrantz, S. S. Ravi:
Alarm placement in systems with fault propagation. Theor. Comput. Sci. 243(1-2): 269-288 (2000) - [c28]Srinivas Doddi, Madhav V. Marathe, S. S. Ravi, David Scot Taylor, Peter Widmayer:
Approximation Algorithms for Clustering to Minimize the Sum of Diameters. SWAT 2000: 237-250
1990 – 1999
- 1999
- [j31]Ragini Narasimhan, Daniel J. Rosenkrantz, S. S. Ravi:
Using Data Flow Information to Obtain Efficient Check Sets for Algorithm-Based Fault Tolerance. Int. J. Parallel Program. 27(4): 289-323 (1999) - [j30]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. J. Algorithms 33(1): 92-111 (1999) - [j29]Giri Kumar Tayi, Daniel J. Rosenkrantz, S. S. Ravi:
Path problems in networks with vector-valued edge weights. Networks 34(1): 19-35 (1999) - [j28]Sven Oliver Krumke, Hartmut Noltemeier, Madhav V. Marathe, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth:
Improving Spanning Trees by Upgrading Nodes. Theor. Comput. Sci. 221(1-2): 139-155 (1999) - 1998
- [j27]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. J. Algorithms 26(2): 238-274 (1998) - [j26]Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III:
Bicriteria Network Design Problems. J. Algorithms 28(1): 142-171 (1998) - [j25]Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi:
Approximation Algorithms for Certain Network Improvement Problems. J. Comb. Optim. 2(3): 257-288 (1998) - [j24]Kay U. Drangmeister, Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi:
Modifying Edges of a Network to Obtain Short Subgraphs. Theor. Comput. Sci. 203(1): 91-121 (1998) - [c27]Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth:
Upgrading Bottleneck Constrained Forests. WG 1998: 215-226 - [i3]Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III:
Bicriteria Network Design Problems. CoRR cs.CC/9809103 (1998) - 1997
- [j23]Madhav V. Marathe, Venkatesh Radhakrishnan, Harry B. Hunt III, S. S. Ravi:
Hierarchically Specified Unit Disk Graphs. Theor. Comput. Sci. 174(1-2): 23-65 (1997) - [j22]Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz:
Compact Location Problems. Theor. Comput. Sci. 181(2): 379-404 (1997) - [c26]Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi:
Network improvement problems. Network Design: Connectivity and Facilities Location 1997: 247-268 - [c25]Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth:
Improving Spanning Trees by Upgrading Nodes. ICALP 1997: 281-291 - [c24]Parvathi Chundi, Daniel J. Rosenkrantz, S. S. Ravi:
Multi-site distributed database transactions utilizing deferred update. SAC 1997: 118-122 - 1996
- [j21]Evangelos Kranakis, Danny Krizanc, S. S. Ravi:
On Multi-Label Linear Interval Routing Schemes. Comput. J. 39(2): 133-139 (1996) - [j20]Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi:
Efficient Approximation Algorithms for Domatic Partition and on-line Coloring of Circular Arc Graphs. Discret. Appl. Math. 64(2): 135-149 (1996) - [j19]Madhav V. Marathe, S. S. Ravi:
On Approximation Algorithms for the Minimum Satisfiability Problem. Inf. Process. Lett. 58(1): 23-29 (1996) - [j18]R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi:
Spanning Trees - Short or Small. SIAM J. Discret. Math. 9(2): 178-200 (1996) - [c23]Sandeep K. Shukla, Daniel J. Rosenkrantz, S. S. Ravi:
A simulation and validation tool for self-stabilizing protocols. The Spin Verification System 1996: 153-164 - [c22]Parvathi Chundi, Daniel J. Rosenkrantz, S. S. Ravi:
Deferred Updates and Data Placement in Distributed Databases. ICDE 1996: 469-476 - [c21]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). PODC 1996: 122 - [c20]Sven Oliver Krumke, Hartmut Noltemeier, Madhav V. Marathe, S. S. Ravi, Kay U. Drangmeister:
Modifying Networks to Obtain Low Cost Trees. WG 1996: 293-307 - 1995
- [j17]Madhav V. Marathe, Heinz Breu, Harry B. Hunt III, S. S. Ravi, Daniel J. Rosenkrantz:
Simple heuristics for unit disk graphs. Networks 25(2): 59-68 (1995) - [c19]Sven Oliver Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe:
Compact Location Problems with Budget and Communication Constraints. COCOON 1995: 510-519 - [c18]Ragini Narasimhan, Daniel J. Rosenkrantz, S. S. Ravi:
Efficient algorithms for analyzing and synthesizing fault-tolerant datapaths. DFT 1995: 81-89 - [c17]Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III:
Bicriteria Network Design Problems. ICALP 1995: 487-498 - [c16]Parvathi Chundi, Ragini Narasimhan, Daniel J. Rosenkrantz, S. S. Ravi:
Active Client Primary-Backup Protocols (Abstract). PODC 1995: 264 - [c15]Sven Oliver Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe:
Complexity and Approximability of Certain Bicriteria Location Problems. WG 1995: 73-87 - 1994
- [j16]Young C. Wee, Seth Chaiken, S. S. Ravi:
Rectilinear Steiner Tree Heuristics and Minimum Spanning Tree Algorithms Using Geographic Nearest Neighbors. Algorithmica 12(6): 421-435 (1994) - [j15]S. S. Ravi, Daniel J. Rosenkrantz, Giri Kumar Tayi:
Heuristic and Special Case Algorithms for Dispersion Problems. Oper. Res. 42(2): 299-310 (1994) - [j14]Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi:
The Complexity of Approximation PSPACE-Complete Problems for Hierarchical Specifications. Nord. J. Comput. 1(3): 275-316 (1994) - [j13]Dechang Gu, Daniel J. Rosenkrantz, S. S. Ravi:
Construction of Check Sets for Algorithm-Based Fault Tolerance. IEEE Trans. Computers 43(6): 641-650 (1994) - [c14]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. ESA 1994: 424-435 - [c13]Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Approximation Schemes Using L-Reductions. FSTTCS 1994: 342-353 - [c12]R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi:
Spanning Trees Short or Small. SODA 1994: 546-555 - [i2]Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi:
The complexity of approximating PSPACE-Complete problems for hierarchical specifications. CoRR abs/math/9409225 (1994) - [i1]Madhav V. Marathe, Heinz Breu, Harry B. Hunt III, S. S. Ravi, Daniel J. Rosenkrantz:
Geometry based heuristics for unit disk graphs. CoRR abs/math/9409226 (1994) - 1993
- [j12]S. S. Ravi, Errol L. Lloyd:
Graph Theoretic Analysis of PLA Folding Heuristics. J. Comput. Syst. Sci. 46(3): 326-348 (1993) - [j11]Dechang Gu, Daniel J. Rosenkrantz, S. S. Ravi:
Determining Performance Measures of Algorithm-Based Fault Tolerant Systems. J. Parallel Distributed Comput. 18(1): 56-70 (1993) - [j10]Daniel J. Rosenkrantz, S. S. Ravi:
Improved Bounds for Algorithm-Based Fault Tolerance. IEEE Trans. Computers 42(5): 630-635 (1993) - [c11]Venkatesh Radhakrishnan, Sven Oliver Krumke, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi:
Compact Location Problems. FSTTCS 1993: 238-247 - [c10]Ragini Shamsunder, Daniel J. Rosenkrantz, S. S. Ravi:
Exploiting Data Flow Information in Algorithm-Based Fault Tolerance. FTCS 1993: 280-289 - [c9]Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi:
The Complexity of Approximating PSPACE-Complete Problems for Hierarchical Specifications (Extended Abstract). ICALP 1993: 76-87 - [c8]Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi:
Efficient Approximation Algorithms for Domatic Partition and On-Line Coloring of Circular Arc Graphs. ICCI 1993: 26-30 - [c7]R. Ravi, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III:
Many birds with one stone: multi-objective approximation algorithms. STOC 1993: 438-447 - [c6]Madhav V. Marathe, Venkatesh Radhakrishnan, Harry B. Hunt III, S. S. Ravi:
Hierarchical Specified Unit Disk Graphs (Extended Abstract). WG 1993: 21-32 - [c5]Evangelos Kranakis, Danny Krizanc, S. S. Ravi:
On Multi-Label Linear Interval Routing Schemes (Extended Abstract). WG 1993: 338-349 - 1991
- [j9]Sreejit Chakravarty, Xin He, S. S. Ravi:
Minimum area layout of series-parallel transistor networks is NP-hard. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 10(7): 943-949 (1991) - [c4]Dechang Gu, Daniel J. Rosenkrantz, S. S. Ravi:
Construction and Analysis of Fault-Secure Multiprocessor Schedules. FTCS 1991: 120-127 - [c3]S. S. Ravi, Daniel J. Rosenkrantz, Giri Kumar Tayi:
Facility Dispersion Problems: Heuristics and Special Cases (Extended Abstract). WADS 1991: 355-366 - 1990
- [j8]S. S. Ravi:
Journal backlog report. SIGACT News 21(1): 26 (1990) - [j7]Sreejit Chakravarty, S. S. Ravi:
Computing optimal test sequences from complete test sets for stuck-open faults in CMOS circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 9(3): 329-331 (1990) - [c2]Dechang Gu, Daniel J. Rosenkrantz, S. S. Ravi:
Design and analysis of test schemes for algorithm-based fault tolerance. FTCS 1990: 106-113
1980 – 1989
- 1989
- [j6]S. S. Ravi:
On the orderability problem for PLA folding. Discret. Appl. Math. 25(3): 317-320 (1989) - [j5]Peter A. Bloniarz, S. S. Ravi:
An O(n log n) Lower Bound for Decomposing a Set of Points into Chains. Inf. Process. Lett. 31(6): 319-322 (1989) - [j4]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. IEEE Trans. Computers 38(6): 865-869 (1989) - 1988
- [j3]S. S. Ravi, Errol L. Lloyd:
The Complexity of Near-Optimal Programmable Logic Array Folding. SIAM J. Comput. 17(4): 696-710 (1988) - [c1]S. S. Ravi, Dechang Gu:
On approximation algorithms for microcode bit minimization. MICRO 1988: 67-69 - 1987
- [j2]S. S. Ravi, Harry B. Hunt III:
An Application of the Planar Separator Theorem to Counting Problems. Inf. Process. Lett. 25(5): 317-322 (1987) - 1984
- [j1]Errol L. Lloyd, S. S. Ravi:
One-Layer Routing without Component Constraints. J. Comput. Syst. Sci. 28(3): 420-438 (1984)
Coauthor Index
Chris J. Kuhlman
aka: Christopher James Kuhlman
aka: Christopher James Kuhlman
[j77] [c130] [c129] [c128] [i21] [i20] [i19] [i18] [c126] [c124] [c123] [c122] [c121] [i17] [i16] [i15] [j73] [j72] [j71] [c120] [c115] [c114] [j69] [c105] [c100] [c99] [j67] [c93] [c92] [c91] [c90] [i8] [j66] [c89] [c88] [c87] [c85] [c84] [c83] [j63] [c75] [c72] [j61] [c71] [c70] [c69] [c68] [c67] [c64] [j57] [c63] [c60] [j56] [c57] [c55] [c54] [c51] [c49] [j51] [c48] [i6] [i5] [j49] [c46] [j48] [j44] [c38] [j42] [j41] [c36] [c35] [j40] [c34] [c33] [c32] [j38] [j37] [j36] [c31] [c30] [c29] [j33] [c28] [j30] [j28] [j27] [j26] [j25] [j24] [c27] [i3] [j23] [j22] [c26] [c25] [j20] [j19] [j18] [c20] [j17] [c19] [c17] [c15] [j14] [c14] [c13] [c12] [i2] [i1] [c11] [c9] [c8] [c7] [c6]
[j77] [c130] [c128] [i20] [i19] [c126] [c125] [c124] [i17] [i16] [i15] [j73] [j72] [j71] [c120] [c115] [i11] [c114] [c105] [c100] [c99] [j67] [c90] [i8] [j66] [c89] [c87] [c85] [c84] [c83] [p1] [j63] [j61] [c71] [c69] [c67] [j56] [c57] [c55] [c54] [c51] [j53] [j51] [j49] [c46] [r1] [j48] [j46] [c41] [j43] [j41] [c35] [j40] [j39] [j38] [c31] [c30] [j35] [j34] [j32] [j31] [j29] [j27] [j26] [i3] [j22] [c24] [j18] [c23] [c22] [c21] [j17] [c18] [c17] [c16] [j15] [j13] [c14] [c13] [c12] [i1] [j11] [j10] [c11] [c10] [c7] [c4] [c3] [c2] [j4]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-12 21:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
