S. S. Ravi

According to our database1, S. S. Ravi authored at least 152 papers between 1984 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
PAC Learnability of Node Functions in Networked Dynamical Systems.
Proceedings of the 36th International Conference on Machine Learning, 2019

2018
Spreading of social contagions without key players.
World Wide Web, 2018

A characterization of nested canalyzing functions with maximum average sensitivity.
Discrete Applied Mathematics, 2018

The Cluster Description Problem - Complexity Results, Formulations and Approximations.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Using Activity Patterns to Place Electric Vehicle Charging Stations in Urban Regions.
Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium Workshops, 2018

Descriptive Clustering: ILP and CP Formulations with Applications.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Computational Aspects of Fault Location and Resilience Problems for Interdependent Infrastructure Networks.
Proceedings of the Complex Networks and Their Applications VII, 2018

Using Active Queries to Learn Local Stochastic Behaviors in Social Networks.
Proceedings of the Complex Networks and Their Applications VII, 2018

Inferring Probabilistic Contagion Models Over Networks Using Active Queries.
Proceedings of the 27th ACM International Conference on Information and Knowledge Management, 2018

Efficient Synthesis of Mutants Using Genetic Crosses.
Proceedings of the 2018 ACM International Conference on Bioinformatics, 2018

Testing Phase Space Properties of Synchronous Dynamical Systems with Nested Canalyzing Local Functions.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

Generative Modeling of Human Behavior and Social Interactions Using Abductive Analysis.
Proceedings of the IEEE/ACM 2018 International Conference on Advances in Social Networks Analysis and Mining, 2018

Learning the Behavior of a Dynamical System Via a "20 Questions" Approach.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Inferring local transition functions of discrete dynamical systems from observations of system behavior.
Theor. Comput. Sci., 2017

Keyless dynamic optimal multi-bit image steganography using energetic pixels.
Multimedia Tools Appl., 2017

Offset Assignment to Signals for Improving Frame Packing in CAN-FD.
Proceedings of the 2017 IEEE Real-Time Systems Symposium, 2017

The Multi-Domain Frame Packing Problem for CAN-FD.
Proceedings of the 29th Euromicro Conference on Real-Time Systems, 2017

E-Petitioning and Online Media: The Case of #BringBackOurGirls.
Proceedings of the 18th Annual International Conference on Digital Government Research, 2017

A Framework for Minimal Clustering Modification via Constraint Programming.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Network Services and their Compositions for Network Science Applications.
Proceedings of the International Conference on Computational Science 2016, 2016

Approximate Contagion Model of Common Knowledge on Facebook.
Proceedings of the 27th ACM Conference on Hypertext and Social Media, 2016

E-petition Information Diffusion in Online Social Networks.
Proceedings of the 17th International Digital Government Research Conference on Digital Government Research, 2016

Interactive exploration and understanding of contagion dynamics in networked populations.
Proceedings of the 2016 International Conference on Behavioral, 2016

2015
Optimization of Latency Insensitive Systems Through Back Pressure Minimization.
IEEE Trans. Computers, 2015

Inhibiting diffusion of complex contagions in social networks: theoretical and experimental results.
Data Min. Knowl. Discov., 2015

Complexity of Inferring Local Transition Functions of Discrete Dynamical Systems.
Proceedings of the Implementation and Application of Automata, 2015

EDISON: a web application for computational health informatics at scale.
Proceedings of the 6th ACM Conference on Bioinformatics, 2015

Analysis Problems for Graphical Dynamical Systems: A Unified Approach Through Graph Predicates.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2014
Compression of trajectory data: a comprehensive evaluation and new approach.
GeoInformatica, 2014


2013
Controlling opinion propagation in online networks.
Computer Networks, 2013

Blocking Simple and Complex Contagion by Edge Removal.
Proceedings of the 2013 IEEE 13th International Conference on Data Mining, 2013

TrajMetrix: a trajectory compression benchmarking framework.
Proceedings of the 21st SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2013

A Framework for Efficient and Convenient Evaluation of Trajectory Compression Algorithms.
Proceedings of the Fourth International Conference on Computing for Geospatial Research and Application, 2013

Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems.
Proceedings of the Fundamental Problems in Computing, 2013

2012
Adversarial scheduling in discrete models of social dynamics.
Mathematical Structures in Computer Science, 2012

Controlling opinion bias in online social networks.
Proceedings of the Web Science 2012, 2012

A Graph Database Approach for Efficient and Scalable Management of Simulations.
Proceedings of the 2012 SC Companion: High Performance Computing, 2012

Addiction Dynamics May Explain the Slow Decline of Smoking Prevalence.
Proceedings of the Social Computing, Behavioral - Cultural Modeling and Prediction, 2012

Keyless Steganography in Spatial Domain Using Energetic Pixels.
Proceedings of the Information Systems Security, 8th International Conference, 2012

Topology control with a limited number of relays.
Proceedings of the 2012 IEEE Global Communications Conference, 2012


2011
Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems.
Theor. Comput. Sci., 2011

A general-purpose graph dynamical system modeling framework.
Proceedings of the Winter Simulation Conference 2011, 2011

Effects of Opposition on the Diffusion of Complex Contagions in Social Networks: An Empirical Study.
Proceedings of the Social Computing, Behavioral-Cultural Modeling and Prediction, 2011

SQUISH: an online approach for GPS trajectory compression.
Proceedings of the 2nd International Conference and Exhibition on Computing for Geospatial Research & Application, 2011

Inhibiting the Diffusion of Contagions in Bi-Threshold Systems: Analytical and Experimental Results.
Proceedings of the Complex Adaptive Systems: Energy, 2011

2010
Topology control in constant rate mobile ad hoc networks.
Wireless Networks, 2010

A SAT-based Framework for Efficient Constrained Clustering.
Proceedings of the SIAM International Conference on Data Mining, 2010

Finding Critical Nodes for Inhibiting Diffusion of Complex Contagions in Social Networks.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2010

Minimizing back pressure for latency insensitive system synthesis.
Proceedings of the 8th ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE 2010), 2010

Algorithms for compressing GPS trajectory data: an empirical evaluation.
Proceedings of the 18th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2010

2009
Agent Based Modeling, Mathematical Formalism for.
Proceedings of the Encyclopedia of Complexity and Systems Science, 2009

Resilience Metrics for Service-Oriented Networks: A Service Allocation Approach.
IEEE Trans. Services Computing, 2009

Using instance-level constraints in agglomerative hierarchical clustering: theoretical and empirical results.
Data Min. Knowl. Discov., 2009

Bi-Criteria Approximation Algorithms for Power-Efficient and Low-Interference Topology Control in Unreliable Ad Hoc Networks.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

2008
Errata for the paper "Predecessor existence problems for finite discrete dynamical systems" [TCS 386 (1-2) (2007) 3-37].
Theor. Comput. Sci., 2008

Guest editors' introduction.
Mobile Computing and Communications Review, 2008

Adversarial Scheduling Analysis of Game-Theoretic Models of Norm Diffusion.
Proceedings of the Logic and Theory of Algorithms, 2008

2007
Approximation Algorithms for Facility Dispersion.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Topology Control Problems for Wireless Ad Hoc Networks.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Predecessor existence problems for finite discrete dynamical systems.
Theor. Comput. Sci., 2007

The complexity of non-hierarchical clustering with instance and cluster level constraints.
Data Min. Knowl. Discov., 2007

Efficient incremental constrained clustering.
Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2007

Computational Aspects of Analyzing Social Network Dynamics.
Proceedings of the IJCAI 2007, 2007

Intractability and clustering with constraints.
Proceedings of the Machine Learning, 2007

Complexity of Scheduling in Synthesizing Hardware from Concurrent Action Oriented Specifications.
Proceedings of the Power-aware Computing Systems, 21.01. - 26.01.2007, 2007

2006
Obtaining online approximation algorithms for facility dispersion from offline algorithms.
Networks, 2006

Complexity of reachability problems for finite discrete dynamical systems.
J. Comput. Syst. Sci., 2006

Topology Control for Simple Mobile Networks.
Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November, 2006

Topology Control for Constant Rate Mobile Networks.
Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November, 2006

Identifying and Generating Easy Sets of Constraints for Clustering.
Proceedings of the Proceedings, 2006

2005
Guest Editors' Introduction.
Information Systems Frontiers, 2005

Understanding protocol performance and robustness of ad hoc networks through structural analysis.
Proceedings of the 2005 IEEE International Conference on Wireless And Mobile Computing, 2005

Clustering with Constraints: Feasibility Issues and the k-Means Algorithm.
Proceedings of the 2005 SIAM International Conference on Data Mining, 2005

Agglomerative Hierarchical Clustering with Constraints: Theoretical and Empirical Results.
Proceedings of the Knowledge Discovery in Databases: PKDD 2005, 2005

Structure-Based Resilience Metrics for Service-Oriented Networks.
Proceedings of the Dependable Computing, 2005

2004
A mobility and traffic generation framework for modeling and simulating ad hoc communication networks.
Scientific Programming, 2004

Local base station assignment with time intervals in mobile computing environments.
European Journal of Operational Research, 2004

Approximating the Minimum Number of Maximum Power Users in Ad Hoc Networks.
Proceedings of the Ad-Hoc, Mobile, and Wireless Networks: Third International Conference, 2004

2003
Reachability problems for sequential dynamical systems with threshold functions.
Theor. Comput. Sci., 2003

Predecessor and Permutation Existence Problems for Sequential Dynamical Systems.
Proceedings of the Discrete Models for Complex Systems, 2003

Topology Control Problems under Symmetric and Asymmetric Power Thresholds.
Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, Second International Conference, 2003

2002
Parallel Approximation Schemes for a Class of Planar and Near Planar Combinatorial Optimization Problems.
Inf. Comput., 2002

Budgeted Maximum Graph Coverage.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

A mobility and traffic generation framework for modeling and simulating ad hoc communication networks.
Proceedings of the 2002 ACM Symposium on Applied Computing (SAC), 2002

Algorithmic aspects of topology control problems for ad hoc networks.
Proceedings of the 3rd ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2002

2001
Models and Approximation Algorithms for Channel Assignment in Radio Networks.
Wireless Networks, 2001

Efficient Construction of Minimum Makespan Schedules for Tasks with a Fixed Number of Distinct Execution Times.
Algorithmica, 2001

Adversarial models in evolutionary game dynamics.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Analysis Problems for Sequential Dynamical Systems and Communicating State Machines.
Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

Gardens of Eden and Fixed Points in Sequential Dynamical Systems.
Proceedings of the Discrete Models: Combinatorics, Computation, and Geometry, 2001

2000
Alarm placement in systems with fault propagation.
Theor. Comput. Sci., 2000

Facility Dispersion Problems Under Capacity and Cost Constraints.
J. Comb. Optim., 2000

Algorithms for Path-Based Placement of Inspection Stations on Networks.
INFORMS Journal on Computing, 2000

Approximation Algorithms for Clustering to Minimize the Sum of Diameters.
Proceedings of the Algorithm Theory, 2000

1999
Improving Spanning Trees by Upgrading Nodes.
Theor. Comput. Sci., 1999

Path problems in networks with vector-valued edge weights.
Networks, 1999

Improving Minimum Cost Spanning Trees by Upgrading Nodes.
J. Algorithms, 1999

Using Data Flow Information to Obtain Efficient Check Sets for Algorithm-Based Fault Tolerance.
International Journal of Parallel Programming, 1999

1998
Modifying Edges of a Network to Obtain Short Subgraphs.
Theor. Comput. Sci., 1998

Approximation Algorithms for Certain Network Improvement Problems.
J. Comb. Optim., 1998

NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs.
J. Algorithms, 1998

Upgrading Bottleneck Constrained Forests.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998

1997
Hierarchically Specified Unit Disk Graphs.
Theor. Comput. Sci., 1997

Compact Location Problems.
Theor. Comput. Sci., 1997

Multi-site distributed database transactions utilizing deferred update.
Proceedings of the 1997 ACM symposium on Applied Computing, 1997

Improving Spanning Trees by Upgrading Nodes.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

Network improvement problems.
Proceedings of the Network Design: Connectivity and Facilities Location, 1997

1996
Spanning Trees - Short or Small.
SIAM J. Discrete Math., 1996

On Approximation Algorithms for the Minimum Satisfiability Problem.
Inf. Process. Lett., 1996

On Multi-Label Linear Interval Routing Schemes.
Comput. J., 1996

Modifying Networks to Obtain Low Cost Trees.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996

I/O Automata Based Verification of Finite State Distributed Systems: Complexity Issues (Abstract).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

Deferred Updates and Data Placement in Distributed Databases.
Proceedings of the Twelfth International Conference on Data Engineering, February 26, 1996

A simulation and validation tool for self-stabilizing protocols.
Proceedings of the Spin Verification System, 1996

1995
Simple heuristics for unit disk graphs.
Networks, 1995

Complexity and Approximability of Certain Bicriteria Location Problems.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1995

Active Client Primary-Backup Protocols (Abstract).
Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

Bicriteria Network Design Problems.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

Efficient algorithms for analyzing and synthesizing fault-tolerant datapaths.
Proceedings of the 1995 IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems, 1995

Compact Location Problems with Budget and Communication Constraints.
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994
Construction of Check Sets for Algorithm-Based Fault Tolerance.
IEEE Trans. Computers, 1994

The Complexity of Approximation PSPACE-Complete Problems for Hierarchical Specifications.
Nord. J. Comput., 1994

Heuristic and Special Case Algorithms for Dispersion Problems.
Operations Research, 1994

Rectilinear Steiner Tree Heuristics and Minimum Spanning Tree Algorithms Using Geographic Nearest Neighbors.
Algorithmica, 1994

Spanning Trees Short or Small.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Approximation Schemes Using L-Reductions.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994

A Unified Approach to Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs.
Proceedings of the Algorithms, 1994

1993
Improved Bounds for Algorithm-Based Fault Tolerance.
IEEE Trans. Computers, 1993

Determining Performance Measures of Algorithm-Based Fault Tolerant Systems.
J. Parallel Distrib. Comput., 1993

Graph Theoretic Analysis of PLA Folding Heuristics.
J. Comput. Syst. Sci., 1993

Hierarchical Specified Unit Disk Graphs (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

On Multi-Label Linear Interval Routing Schemes (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

Many birds with one stone: multi-objective approximation algorithms.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Efficient Approximation Algorithms for Domatic Partition and On-Line Coloring of Circular Arc Graphs.
Proceedings of the Computing and Information, 1993

The Complexity of Approximating PSPACE-Complete Problems for Hierarchical Specifications (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

Exploiting Data Flow Information in Algorithm-Based Fault Tolerance.
Proceedings of the Digest of Papers: FTCS-23, 1993

Compact Location Problems.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1993

1991
Minimum area layout of series-parallel transistor networks is NP-hard.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1991

Facility Dispersion Problems: Heuristics and Special Cases (Extended Abstract).
Proceedings of the Algorithms and Data Structures, 1991

Construction and Analysis of Fault-Secure Multiprocessor Schedules.
Proceedings of the 1991 International Symposium on Fault-Tolerant Computing, 1991

1990
Computing optimal test sequences from complete test sets for stuck-open faults in CMOS circuits.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1990

Journal backlog report.
SIGACT News, 1990

Design and analysis of test schemes for algorithm-based fault tolerance.
Proceedings of the 20th International Symposium on Fault-Tolerant Computing, 1990

1989
The Complexity of Generating Minimum Test Sets for PLA's and Monotone Combinational Circuits.
IEEE Trans. Computers, 1989

An O(n log n) Lower Bound for Decomposing a Set of Points into Chains.
Inf. Process. Lett., 1989

On the orderability problem for PLA folding.
Discrete Applied Mathematics, 1989

1988
The Complexity of Near-Optimal Programmable Logic Array Folding.
SIAM J. Comput., 1988

On approximation algorithms for microcode bit minimization.
Proceedings of the 21st Annual Workshop and Symposium on Microprogramming and Microarchitecture, 1988, San Diego, California, USA, November 28, 1988

1987
An Application of the Planar Separator Theorem to Counting Problems.
Inf. Process. Lett., 1987

1984
One-Layer Routing without Component Constraints.
J. Comput. Syst. Sci., 1984


  Loading...