V. S. Anil Kumar

发表

High Performance Scalable and Expressive Modeling Environment to Study Mobile Malware in Large Dynamic Networks

Madhav V. Marathe, Karthik Channakeshava, Keith R. Bisset, 2011, 2011 IEEE International Parallel & Distributed Processing Symposium.

Provable algorithms for parallel generalized sweep scheduling

Aravind Srinivasan, Madhav V. Marathe, V. S. Anil Kumar, 2006, J. Parallel Distributed Comput..

Improved Results for Stackelberg Scheduling Strategies

Madhav V. Marathe, V. S. Anil Kumar, M. Marathe, 2002, ICALP.

Cross-layer latency minimization in wireless networks with SINR constraints

Aravind Srinivasan, Madhav V. Marathe, V. S. Anil Kumar, 2007, MobiHoc '07.

On Strategy Improvement Algorithms for Simple Stochastic Games

V. S. Anil Kumar, Rahul Tripathi, Elena Valkanova, 2010, CIAC.

Optimal constrained graph exploration

V. S. Anil Kumar, Stephen G. Kobourov, Christian A. Duncan, 2001, SODA '01.

Subgraph Enumeration in Large Social Contact Networks Using Parallel Color Coding and Streaming

Madhav V. Marathe, V. S. Anil Kumar, Maleq Khan, 2010, 2010 39th International Conference on Parallel Processing.

A unified approach to scheduling on unrelated parallel machines

Aravind Srinivasan, Madhav V. Marathe, V. S. Anil Kumar, 2009, JACM.

From biological and social network metaphors to coupled bio-social wireless networks

Madhav V. Marathe, Karthik Channakeshava, V. S. Anil Kumar, 2011, Int. J. Auton. Adapt. Commun. Syst..

Structure of Social Contact Networks and Their Impact on Epidemics

Aravind Srinivasan, Madhav V. Marathe, V. S. Anil Kumar, 2004, Discrete Methods in Epidemiology.

Minimum Weighted Completion Time

Aravind Srinivasan, Madhav V. Marathe, V. S. Anil Kumar, 2008, Encyclopedia of Algorithms.

Optimizing epidemic protection for socially essential workers

Aravind Srinivasan, Madhav V. Marathe, Keith R. Bisset, 2012, IHI '12.

Bi-Criteria Approximation Algorithms for Power-Efficient and Low-Interference Topology Control in Unreliable Ad Hoc Networks

Madhav V. Marathe, S. S. Ravi, V. S. Anil Kumar, 2009, IEEE INFOCOM 2009.

Cellular traffic offloading through opportunistic communications: a case study

Aravind Srinivasan, Madhav V. Marathe, V. S. Anil Kumar, 2010, CHANTS '10.

Power Efficient Throughput Maximization in Multi-Hop Wireless Networks

Madhav V. Marathe, V. S. Anil Kumar, Srinivasan Parthasarathy, 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

Approximation algorithms for scheduling on multiple machines

Aravind Srinivasan, Madhav V. Marathe, V. S. Anil Kumar, 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

Labeled cuts in graphs

Madhav V. Marathe, V. S. Anil Kumar, Lenwood S. Heath, 2016, Theor. Comput. Sci..

A general-purpose graph dynamical system modeling framework

Samarth Swarup, Madhav V. Marathe, S. S. Ravi, 2011, Proceedings of the 2011 Winter Simulation Conference (WSC).

Epidemiology and Wireless Communication: Tight Analogy or Loose Metaphor?

Madhav V. Marathe, V. S. Anil Kumar, Stephen Eubank, 2008, BIOWIRE.

Controlling opinion propagation in online networks

S. S. Ravi, V. S. Anil Kumar, Chris J. Kuhlman, 2013, Comput. Networks.

Capacity of Asynchronous Random-Access Scheduling in Wireless Networks

Aravind Srinivasan, Madhav V. Marathe, V. S. Anil Kumar, 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor Networks

V. S. Anil Kumar, Maleq Khan, Gopal Pandurangan, 2009, IEEE Transactions on Parallel and Distributed Systems.

Minimum Weighted Completion Time ( 1999 ; Afrati et al . ) ∗

V. S. Anil Kumar, Srinivasan Parthasarathy, S. Parthasarathy, 2007 .

EpiNet: a simulation framework to study the spread of malware in wireless networks

Madhav V. Marathe, Karthik Channakeshava, Keith R. Bisset, 2009, SimuTools.

Finding Critical Nodes for Inhibiting Diffusion of Complex Contagions in Social Networks

Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, 2010, ECML/PKDD.

Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints

Aravind Srinivasan, Madhav V. Marathe, V. S. Anil Kumar, 2005, APPROX-RANDOM.

Energy-optimal distributed algorithms for minimum spanning trees

V. S. Anil Kumar, Maleq Khan, Gopal Pandurangan, 2009, IEEE Journal on Selected Areas in Communications.

Generation and analysis of large synthetic social contact networks

Madhav V. Marathe, V. S. Anil Kumar, Christopher L. Barrett, 2009, Proceedings of the 2009 Winter Simulation Conference (WSC).

A study of the structure and vulnerabilities of metropolitan area networks

Madhav V. Marathe, V. S. Anil Kumar, Ravi Sundaram, 2016, 2016 8th International Conference on Communication Systems and Networks (COMSNETS).

Mobile Data Offloading through Opportunistic Communications and Social Participation

Aravind Srinivasan, Madhav V. Marathe, V. S. Anil Kumar, 2012, IEEE Transactions on Mobile Computing.

Controlling opinion bias in online social networks

S. S. Ravi, V. S. Anil Kumar, Chris J. Kuhlman, 2012, WebSci '12.

On strategy improvement algorithms for simple stochastic games

V. S. Anil Kumar, Rahul Tripathi, Elena Valkanova, 2011, J. Discrete Algorithms.

Interactions among human behavior, social networks, and societal infrastructures: A Case Study in Computational Epidemiology

Madhav V. Marathe, Keith R. Bisset, V. S. Anil Kumar, 2013, Fundamental Problems in Computing.

Minimum Weighted Completion Time

Aravind Srinivasan, Madhav V. Marathe, V. S. Anil Kumar, 2008, Encyclopedia of Algorithms.

Interaction-based HPC modeling of social, biological, and economic contagions over large networks

Madhav V. Marathe, Keith R. Bisset, V. S. Anil Kumar, 2011, Proceedings of the 2011 Winter Simulation Conference (WSC).

Scheduling on Unrelated Machines under Tree-Like Precedence Constraints

Aravind Srinivasan, Madhav V. Marathe, V. S. Anil Kumar, 2005, Algorithmica.

Understanding protocol performance and robustness of ad hoc networks through structural analysis

Madhav V. Marathe, S. S. Ravi, V. S. Anil Kumar, 2005, WiMob'2005), IEEE International Conference on Wireless And Mobile Computing, Networking And Communications, 2005..

Social Networks

Madhav V. Marathe, V. S. Anil Kumar, Maleq Khan, 2011, Encyclopedia of Parallel Computing.

SAHAD: Subgraph Analysis in Massive Networks Using Hadoop

Madhav V. Marathe, Guanying Wang, V. S. Anil Kumar, 2012, 2012 IEEE 26th International Parallel and Distributed Processing Symposium.

Structural and algorithmic aspects of massive social networks

Aravind Srinivasan, Madhav V. Marathe, V. S. Anil Kumar, 2004, SODA '04.

STRUCTURAL ANALYSIS OF ELECTRICAL NETWORKS

V. S. Anil Kumar, Achla Marathe, Jiangzhuo Chen, 2006 .

Bifurcations in Boolean Networks

V. S. Anil Kumar, Henning S. Mortveit, David Murrugarra, 2011, Automata.

Provable algorithms for parallel sweep scheduling on unstructured meshes

Aravind Srinivasan, Madhav V. Marathe, V. S. Anil Kumar, 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints

Aravind Srinivasan, Madhav V. Marathe, V. S. Anil Kumar, 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

Distributed Strategies for Channel Allocation and Scheduling in Software-Defined Radio Networks

Aravind Srinivasan, Madhav V. Marathe, V. S. Anil Kumar, 2009, IEEE INFOCOM 2009.

Synthesis and Analysis of Spatio-Temporal Spectrum Demand Patterns: A First Principles Approach

Madhav V. Marathe, Karthik Channakeshava, V. S. Anil Kumar, 2010, 2010 IEEE Symposium on New Frontiers in Dynamic Spectrum (DySPAN).

Markovian coupling vs. conductance for the Jerrum-Sinclair chain

V. S. Anil Kumar, H. Ramesh, 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

EpiFast: a fast algorithm for large scale realistic epidemic simulations on distributed memory systems

Madhav V. Marathe, Xizhou Feng, Keith R. Bisset, 2009, ICS.

The distance-2 matching problem and its relationship to the MAC-Layer capacity of ad hoc wireless networks

Madhav V. Marathe, V. S. Anil Kumar, Hari Balakrishnan, 2004, IEEE Journal on Selected Areas in Communications.

A simple randomized scheme for constructing low-weight k-connected spanning subgraphs with applications to distributed algorithms

V. S. Anil Kumar, Maleq Khan, Gopal Pandurangan, 2007, Theor. Comput. Sci..

Effects of Opposition on the Diffusion of Complex Contagions in Social Networks: An Empirical Study

Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, 2011, SBP.

Covering Rectilinear Polygons with Axis-Parallel Rectangles

V. S. Anil Kumar, H. Ramesh, 2003, SIAM J. Comput..

Computational Epidemiology in a Connected World

Samarth Swarup, Madhav V. Marathe, V. S. Anil Kumar, 2009, Computer.

End-to-end packet-scheduling in wireless ad-hoc networks

Aravind Srinivasan, Madhav V. Marathe, V. S. Anil Kumar, 2004, SODA '04.

Distributed Algorithms for End-to-End Packet Scheduling in Wireless Ad Hoc Networks

Aravind Srinivasan, Madhav V. Marathe, V. S. Anil Kumar, 2016, TALG.

Energy-Optimal Distributed Algorithms for Minimum Spanning Trees

V. S. Anil Kumar, Maleq Khan, Gopal Pandurangan, 2009, IEEE J. Sel. Areas Commun..

Inhibiting diffusion of complex contagions in social networks: theoretical and experimental results

Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, 2014, Data Mining and Knowledge Discovery.

Covering rectilinear polygons with axis-parallel rectangles

V. S. Anil Kumar, H. Ramesh, 1999, STOC '99.

Hardness of Set Cover with Intersection 1

V. S. Anil Kumar, Sunil Arya, H. Ramesh, 2000, ICALP.

Capacity of wireless networks under SINR interference constraints

Aravind Srinivasan, Madhav V. Marathe, V. S. Anil Kumar, 2011, Wirel. Networks.

Strong edge coloring for channel assignment in wireless radio networks

Madhav V. Marathe, V. S. Anil Kumar, Christopher L. Barrett, 2006, Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06).

Algorithmic aspects of capacity in wireless networks

Aravind Srinivasan, Madhav V. Marathe, V. S. Anil Kumar, 2005, SIGMETRICS '05.

Coupling vs. conductance for the Jerrum-Sinclair chain

V. S. Anil Kumar, H. Ramesh, 2001, Random Struct. Algorithms.

Inhibiting the Diffusion of Contagions in Bi-Threshold Systems: Analytical and Experimental Results

Samarth Swarup, Madhav V. Marathe, S. S. Ravi, 2011, AAAI Fall Symposium: Complex Adaptive Systems.

Locational market power in network constrained markets

V. S. Anil Kumar, Achla Marathe, Jiangzhuo Chen, 2009 .

A Bi-Threshold Model of Complex Contagion and its Application to the Spread of Smoking Behavior

Samarth Swarup, Daniel J. Rosenkrantz, V. S. Anil Kumar, 2011 .

Effect of Public Policies and Individual Behavior on the Co-evolution of Social Networks and Infectious Disease Dynamics

Madhav V. Marathe, V. S. Anil Kumar, Christopher L. Barrett, 2007 .