S. S. Ravi

Orcid: 0000-0002-0893-4364

According to our database1, S. S. Ravi authored at least 211 papers between 1984 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Synchronous Dynamical Systems on Directed Acyclic Graphs: Complexity and Algorithms.
ACM Trans. Comput. Theory, 2024

A High-Resolution, US-scale Digital Similar of Interacting Livestock, Wild Birds, and Human Ecosystems with Applications to Multi-host Epidemic Spread.
CoRR, 2024

An Exemplars-Based Approach for Explainable Clustering: Complexity and Efficient Approximation Algorithms.
Proceedings of the 2024 SIAM International Conference on Data Mining, 2024

Efficient PAC Learnability of Dynamical Systems Over Multilayer Networks.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Value-based Resource Matching with Fairness Criteria: Application to Agricultural Water Trading.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

Learning the Topology and Behavior of Discrete Dynamical Systems.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Making clusterings fairer by post-processing: algorithms, complexity results and experiments.
Data Min. Knowl. Discov., 2023

Finding Nontrivial Minimum Fixed Points in Discrete Dynamical Systems.
CoRR, 2023

A Machine Learning Framework to Explain Complex Geospatial Simulations: A Climate Change Case Study.
Proceedings of the Winter Simulation Conference, 2023

Identifying Complicated Contagion Scenarios from Cascade Data.
Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

A Network Synthesis and Analytics Pipeline with Applications to Sustainable Energy in Smart Grid.
Proceedings of the 19th IEEE International Conference on e-Science, 2023

Assigning Agents to Increase Network-Based Neighborhood Diversity.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Resource Sharing through Multi-Round Matchings.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

Networked Anti-coordination Games Meet Graphical Dynamical Systems: Equilibria and Convergence.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Fundamental limitations on efficiently forecasting certain epidemic measures in network models.
Proc. Natl. Acad. Sci. USA, 2022

Techniques for blocking the propagation of two simultaneous contagions over networks using a graph dynamical systems framework.
Netw. Sci., 2022

Using Active Queries to Infer Symmetric Node Functions of Graph Dynamical Systems.
J. Mach. Learn. Res., 2022

Exploring <i>E</i>-petitioning and media: The case of #BringBackOurGirls.
Gov. Inf. Q., 2022

Network Models and Simulation Analytics for Multi-scale Dynamics of Biological Invasions.
Frontiers Big Data, 2022

Towards Auditing Unsupervised Learning Algorithms and Human Processes For Fairness.
CoRR, 2022

Explainable Clustering via Exemplars: Complexity and Efficient Approximation Algorithms.
CoRR, 2022

Efficiently Learning the Topology and Behavior of a Networked Dynamical System Via Active Queries.
Proceedings of the International Conference on Machine Learning, 2022

Resource Allocation to Agents with Restrictions: Maximizing Likelihood with Minimum Compromise.
Proceedings of the Multi-Agent Systems - 19th European Conference, 2022

A Web-Based System for Contagion Simulations on Networked Populations.
Proceedings of the 18th IEEE International Conference on e-Science, 2022

Maximizing Resource Allocation Likelihood with Minimum Compromise.
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

Using Dominating Sets to Block Contagions in Social Networks.
Proceedings of the IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2022

Finding Nontrivial Minimum Fixed Points in Discrete Dynamical Systems: Complexity, Special Case Algorithms and Heuristics.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Theoretical and computational characterizations of interaction mechanisms on Facebook dynamics using a common knowledge model.
Soc. Netw. Anal. Min., 2021

CSonNet: An Agent-Based Modeling Software System for Discrete Time Simulation.
Proceedings of the Winter Simulation Conference, 2021

GraphTrans: A Software System for Network Conversions for Simulation, Structural Analysis, and Graph Operations.
Proceedings of the Winter Simulation Conference, 2021

ExecutionManager: A Software System to Control Execution of Third-Party Software that Performs Network Computations.
Proceedings of the Winter Simulation Conference, 2021

Interactive Demonstrations and Hands-On Use of thenet.science Cyberinfrastructure for Network Science Chairs' Welcome and Tutorial Summary.
Proceedings of the WebSci '21: 13th ACM Web Science Conference 2021, 2021

A Framework for Simulating Multiple Contagions Over Multiple Networks.
Proceedings of the Complex Networks & Their Applications X - Volume 2, Proceedings of the Tenth International Conference on Complex Networks and Their Applications COMPLEX NETWORKS 2021, Madrid, Spain, November 30, 2021

Effect of Peer Influence and Looting Concerns on Evacuation Behavior During Natural Disasters.
Proceedings of the Complex Networks & Their Applications X - Volume 2, Proceedings of the Tenth International Conference on Complex Networks and Their Applications COMPLEX NETWORKS 2021, Madrid, Spain, November 30, 2021

Data-Driven Modeling of Evacuation Decision-Making in Extreme Weather Events.
Proceedings of the Complex Networks & Their Applications X - Volume 1, Proceedings of the Tenth International Conference on Complex Networks and Their Applications COMPLEX NETWORKS 2021, Madrid, Spain, November 30, 2021

2020
Approaches for Assigning Offsets to Signals for Improving Frame Packing in CAN-FD.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2020

Networked experiments and modeling for producing collective identity in a group of human subjects using an iterative abduction framework.
Soc. Netw. Anal. Min., 2020

An Agent-Based Model of Common Knowledge and Collective Action Dynamics on Social Networks.
Proceedings of the Winter Simulation Conference, 2020

A Graph-Based Approach for Active Learning in Regression.
Proceedings of the 2020 SIAM International Conference on Data Mining, 2020

Towards Description of Block Model on Graph.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2020

Boolean Games: Inferring Agents' Goals Using Taxation Queries.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

A Framework for Determining the Fairness of Outlier Detection.
Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

Evolution of Similar Configurations in Graph Dynamical Systems.
Proceedings of the Complex Networks & Their Applications IX, 2020

Effect of Interaction Mechanisms on Facebook Dynamics Using a Common Knowledge Model.
Proceedings of the Complex Networks & Their Applications IX, 2020

Blocking the Propagation of Two Simultaneous Contagions over Networks.
Proceedings of the Complex Networks & Their Applications IX, 2020

Boolean Games: Inferring Agents' Goals Using Taxation Queries.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

Despotic Regimes Instilling Fear in Citizens to Suppress Protests.
Proceedings of the IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2020

Efficient Algorithms for Generating Provably Near-Optimal Cluster Descriptors for Explainability.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Making Existing Clusterings Fairer: Algorithms, Complexity Results and Insights.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Bounds and Complexity Results for Learning Coalition-Based Interaction Functions in Networked Social Systems.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Symmetry Properties of Nested Canalyzing Functions.
Discret. Math. Theor. Comput. Sci., 2019

On the Modeling and Agent-Based Simulation of a Cooperative Group Anagram Game.
Proceedings of the 2019 Winter Simulation Conference, 2019

Validating Agent-Based Models of Large Networked Systems.
Proceedings of the 2019 Winter Simulation Conference, 2019

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

Mechanistic and data-driven agent-based models to explain human behavior in online networked group anagram games.
Proceedings of the ASONAM '19: International Conference on Advances in Social Networks Analysis and Mining, 2019

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

A characterization of nested canalyzing functions with maximum average sensitivity.
Discret. Appl. Math., 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

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

Topology Control Problems for Wireless Ad hoc Networks.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 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.
Multim. 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
Examining political mobilization of online communities through e-petitioning behavior in <i>We the People</i>.
Big Data Soc., December, 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.
Comput. 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

2012
Adversarial scheduling in discrete models of social dynamics.
Math. Struct. Comput. Sci., 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 <i>Energetic</i> 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.
Wirel. 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. Serv. Comput., 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.
ACM SIGMOBILE Mob. Comput. Commun. Rev., 2008

Adversarial Scheduling in Evolutionary Game Dynamics
CoRR, 2008

A mathematical formalism for agent-based modeling
CoRR, 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

Approximating the Minimum Number of Maximum Power Users in Ad hoc Networks.
Mob. Networks Appl., 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
Algorithmic Aspects of Topology Control Problems for Ad Hoc Networks.
Mob. Networks Appl., 2005

Guest Editors' Introduction.
Inf. Syst. 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.
Sci. Program., 2004

Local base station assignment with time intervals in mobile computing environments.
Eur. J. Oper. Res., 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

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

Upgrading bottleneck constrained forests.
Discret. Appl. Math., 2001

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

Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems.
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

Approximation Algorithms for Clustering to Minimize the Sum of Diameters.
Nord. J. Comput., 2000

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

Algorithms for Path-Based Placement of Inspection Stations on Networks.
INFORMS J. Comput., 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.
Int. J. Parallel Program., 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

Bicriteria Network Design Problems.
J. Algorithms, 1998

NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs.
J. Algorithms, 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

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

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

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

Efficient Approximation Algorithms for Domatic Partition and on-line Coloring of Circular Arc Graphs.
Discret. Appl. Math., 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

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.
Oper. Res., 1994

The complexity of approximating PSPACE-Complete problems for hierarchical specifications.
CoRR, 1994

Geometry based heuristics for unit disk graphs.
CoRR, 1994

Rectilinear Steiner Tree Heuristics and Minimum Spanning Tree Algorithms Using Geographic Nearest Neighbors.
Algorithmica, 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 Distributed 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

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. Comput. Aided Des. Integr. Circuits Syst., 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. Comput. Aided Des. Integr. Circuits Syst., 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.
Discret. Appl. Math., 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...