|
Associate Professor, Network Dynamics and Simulation Science Laboratory
Associate Professor, Department of Computer Science
Phone: (540) 231-3968
Email:akumar@vbi.vt.edu
Fax: 540-231-2891
Personal_Page
| Network Dynamics and Simulation Science Laboratory
| NDSSL Research Group
Publications:
Barrett C, Channakeshava K, Eubank S, Kumar VSA, Marathe M. From biological and social network metaphors to coupled bio-social wireless networks. International Journal of Autonomous Adaptive Communications. 2011;4:122–144.
Channakeshava K, Bisset K, Marathe M, Vullikanti A, Yardi S. High performance scalable and expressive modeling environment to study mobile malware in large dynamic networks. Anchorage, Alaska, May 16-20, 2011; 2011. Proceedings of 25th IEEE International Parallel & Distributed Processing Symposium.
Kim J, Kumar VSA, Marathe A, Pei G, Saha S, Subbiah B. Impact of geographic complementarity in dynamic spectrum access. Aachen, Germany, May 3-6, 2011, In press; 2011. Proceedings of IEEE Dynamic Spectrum Access Networks (DySPAN).
Kuhlman C, Kumar VSA, Marathe M, et al. A general-purpose graph dynamical system modeling framework. Phoenix, Arizona, December 11-14, 2011; 2011. Proceedings of the 2011 Winter Simulation Conference.
Kuhlman C, Kumar VSA, Marathe M, Ravi S, Rosenkrantz D. Effects of opposition on the diffusion of complex contagions in social networks: An empirical study. College Park, Maryland, March 29-30, 2011; 2011. 2011 International Conference on Social Computing, Behavioral-Cultural Modeling and Prediction (Post.
Kuhlman C, Kumar VSA, Marathe M, et al. A bi-threshold model of complex contagion and its application to the spread of smoking behavior. San Diego, CA; 2011. Social Network Mining and Analysis (SNA) Workshop held in conjunction with the KDD 2011. http://www.snakdd.com/pc.html
Pei G, Kumar VSA, Parthasarathy S, Srinivasan A. Approximation algorithms for throughput maximization in wireless networks with delay constraints. Shanghai, China, April 10-15, 2011.; 2011. Proceedings of IEEE INFOCOM. http://www.cs.umd.edu/~srin/PDF/2010/chants-conf.pdf
Beckman R, Channakeshava K, Huang F, et al. Implications of dynamic spectrum access on the efficiency of primary wireless market. Singapore, April 6-9, 2010; 2010:1–12. Proceedings of IEEE International New Frontiers in Dynamic Spectrum Access Networks. http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5457849
Eubank S, Kumar VSA, Khan M, Marathe M, Barrett C. Beyond Degree Distributions: Local to Global Structure of Social Contact Graphs. In: Advances in Social Computing, Third International Conference on Social Computing, Behavioral Modeling, and Prediction (SBP). Vol. 6007. Springer Berlin / Heidelberg; 2010:1. http://www.springerlink.com/content/98592811k4k95680/
Han B, Hui P, Kumar VSA, Marathe M, Pei G, Srinivasan A. Cellular traffic offloading through opportunistic communications: A case study. Chicago, Ilinois, September 2010.: Acm; 2010:31–38. Proceedings of the 5th ACM Workshop on Challenged Networks (CHANTS). http://portal.acm.org/citation.cfm?id=1859943
Kuhlman C, Kumar VSA, Marathe M, Ravi S, Rosenkrantz D. Finding critical nodes for inhibiting diffusion of complex contagions in social networks. In: Proceeding of European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases. Vol. Lncs 6322. Barcelona, Spain, September 20-24, 2010.: Springer Berlin / Heidelberg; 2010:111–127. http://www.springerlink.com/content/b8h32020ux0571v0/
Kumar VSA, Rajaraman R, Sundaram R, Sun Z. Existence theorems and approximation algorithms for generalized network security games. Genoa, Italy; 2010:348–357. Proceedings of 30th International Conference on Distributed Computing Systems (ICDCS).
Kumar VSA, Tripathi R, Valkanova E. On strategy improvement algorithms for simple stochastic games. In: Algorithms andComplexity. Rome, Italy: Springer Berlin / Heidelberg; 2010:240–251. Lecture Notes in Computer Science 6078. http://www.springerlink.com/content/382627283g1486h0/
Atkins K, Chen J, Kumar A, Marathe A. The structure of electrical networks: A graph theory based analysis. International Journal of Critical Infrastructure. 2009;5:265–284.
Atkins K, Chen J, Kumar AVS, Marathe A. Structure of electrical networks: A graphy theory based analysis. Special Issue of International Journal of Critical Infrastructure. 2009;5:265–284.
Atkins K, Chen J, Kumar VSA, Marathe A. Structure of electrical networks: A graph theory based analysis. International Journal of Accounting, Auditing and Performance Evaluation. 2009;5:265–284.
Barrett C, DuBois T, Eubank S, Kumar AVS, Marathe M, Srinivasan A. Sequestering critical workers in event of epidemics. Austin, TX; 2009. ACM-SIAM Symposium on Discrete Algorithms (SODA10).
Channakeshava K, Chafekar D, Bisset K, Kumar VSA, Marathe M. EpiNet: A simulation framework to study the spread of malware in wireless networks. Rome, Italy, March 2-6, 2009; 2009. Proceeding of 2nd International Conference on Simulation Tools and Techniques (SIMUTools '09). http://portal.acm.org/citation.cfm?id=1537622
Channakeshava K, Kumar AVS, Marathe M. Strategies for controlling mobile epidemics: insights from using realistic mobile networks. Chicago, IL; 2009. 16th ACM Conference on Computer and Communications Security 2009.
Han B, Kumar VSA, Marathe M, Parthasarathy S, Srinivasan A. Distributed strategies for channel allocation and scheduling in software-defined radio networks. Rio de Janeiro, Brazil; 2009:1521–1529. Proceedings of the 28th Conference on Computer Communication (INFOCOM). http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5062069
Huang F, Ravindran B, Vullikanti A. An approximation algorithm for minimum-delay peer-to-peer streaming. Seattle, Washington; 2009. Ninth International Conference on Peer-to-Peer Computing (P2P 2009).
Khan M, Kumar VSA, Marathe M, Pandurangan G, Ravi SS. Bi-Criteria approximation algorithms for power-efficient and low-interference topology control in unreliable ad hoc networks. Rio De Janeiro, Brazil; 2009:370–378. Proceedings of the 28th Conference on Computer Communications. http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5061941&tag=1
Barrett CL, Beckman R, Bisset K, et al. Investigating the role of public policies and individual behavior on epidemics: a multi-agent systems approach. Chicago, Illinois; 2008. Proceedings of Association for the Advancement of Artificial Intelligence.
Chafekar D, Kumar A, Marathe M, Parthasarathy S, Srinivasan A. Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints. Phoenix, Arizona; 2008:1166–1174. Proceedings of the 27th IEEE International Conference on Computer Communications (INFOCOM). http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4509767
Choi Y, Khan M, Kumar AVS, Pandurangan G. Energy-optimal distributed algorithms for Euclidean minimum spanning trees. Munich, Germany; 2008. 20th ACM Symposium on Parallelism in Algorithms and Architectures.
Choi Y, Khan M, Kumar AVS, Pandurangan G. Energy-optimal distributed algorithms for minimum spanning trees. Munich, Germany: Acm; 2008. Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures.
Halloran ME, Ferguson NM, Eubank S, et al. Modeling targeted layered containment of an influenza pandemic in the United States. Proceedings of the National Academy of Sciences (PNAS). 2008;105:4639–4644. http://www.pnas.org/content/105/12/4639.abstract
Kumar VSA, Marathe M, Parthasarathy S, Srinivasan A. Minimum weighted completion time. In: Kao M, ed. Encyclopedia of Algorithms. Vol. 12. Springer Verlag; 2008:1–99.
Barrett C, Bisset K, Chen J, et al. Effect of public policies and individual behavior on the co-evolution of social networks and infectious disease dynamics. Rutgers University; 2007. Paper Presented at DIMACS Workshop on Computational Methods for Dynamic Interaction Networks.
Barrett C, Vullikanti A, Marathe MV. An integrated approach to computing capacity and developing cross layer protocols for wireless networks. North Brunswick, NJ; 2007. Deriving Mobility Models from First Principles and Their Applications NSF Workshop – Mobility in Wir.
Chafekar D, Kumar VSA, Marathe M, Parthasarathy S, Srinivasan A. Cross-layer latency minimization in wireless networks with SINR constraints. Montreal, Quebec, Canada: ACM, New York, NY, USA; 2007:110–119. Proceedings of the 8th ACM International symposium on Mobile ad hoc networking and computing. http://doi.acm.org/10.1145/1288107.1288123
Atkins K, Chen J, Anil Kumar VS, Macauley M, Marathe A. Locational market power in power markets. Potsdam, Germany; 2006. Proceedings of 29th IAEE International Conference.
Atkins K, Chen J, Kumar VSA, Marathe A. Structural analysis of electrical power networks.; 2006. Proceedings of 3rd International Conference on Critical Infrastructures.
Duncan C, Kobourov S, Anil Kumar VS. Optimal constrained graph exploration. ACM Transactions of Algorithms. 2006;2:380–402.
Eidenbenz S, Kumar VSA. Equilibria in topology control games for ad hoc networks. Mobile Networks and Applications. 2006;11:143–159.
Kumar VSA, Marathe M, Thakur M, Sundaram R, Thulasidasan S. Scaling laws for the internet over urban regions, CAIDA (Cooperative Association for Internet Data Analysis). Proceedings are in electronic form.; 2006. ISMA 2006 WIT: Workshop on the Internet Topology. http://www.ccs.neu.edu/home/koods/papers/kumar06scaling.pdf
Kumar VSA, Marathe MV, Parthasarathy S, Srinivasan A, Zust S. Provable Algorithms for Parallel Generalized Sweep Scheduling. Journal of Parallel and Distributed Computing (JPDC). 2006;66:807–821.
Barrett C, Drozda M, Engelhart D, et al. Structural Analysis of Ad Hoc Networks: Implications for Protocol Performance.; 2005. Proceedings of the IEEE International Conference on Wireless and Mobile Computing, Communications, a.
Kumar A. Approximation Algorithms for Scheduling on Parallel Machines with Tree Shaped Precedence Constraints. Berkeley, CA,; 2005. Approx Workshop.
Kumar AVS, Marathe MV, Parthasarathy S, Srinivasan A. Algorithmic aspects of capacity in wireless. ACM Press New York, NY, USA; 2005:133–144. Proceedings of the International Conference on Measurements and Modeling of Computer Systems (Sigmet.
Kumar VSA, Marathe MV, Parthasarathy S, Srinivasan A. Approximation algorithms for scheduling on multiple machines. Pittsburgh, Pennsylvania; 2005:254–263. Proceedings of 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
Kumar VSA, Marathe MV, Parthasarathy S, Srinivasan A, Zust S. Provable algorithms for parallel sweep scheduling on unstructured meshes.; 2005:26–36. Proceedings of International Parallel and Distributed Processing Symposium (IPDPS).
Kumar VSA, Parthasarathy S, Marathe MV, Srinivasan A, Zust S. Provable algorithms for parallel sweep scheduling for unstructured meshs. Denver, Colorado; 2005. 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS-05).
Barrett C, Eubank S, Kumar VSA, Marathe M. Understanding Large-Scale Social and Infrastructure Networks: A Simulation-Based Approach. SIAM News. 2004;37:1–5. Appears as part of Math Awareness Month on th.
Eubank S, Kumar VSA, Marathe M, Srinivasan A, Wang N. Structural and algorithmic aspects of massive social networks. New Orleans, Louisiana: Society for Industrial and Applied Mathematics; 2004:718–727. Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms. http://portal.acm.org/citation.cfm?id=982792.982902
Eidenbenz S, Kumar VSA, Zust S. Equilibria in Topology control games for ad hoc networks.; 2003. Proceedings of the Workshop on Discrete Algorithms and Methods for Mobile Computing and Communicatio.
Kumar VSA, Marathe M. Improved Results for Stackelberg Scheduling Strategies. Malaga, Spain; 2002:776–787. Proceedings of the 29th International Colloquium on Automata, Languages and Programming, 2002 (ICALP 2380.
Duncan C, Kobourov S, Kumar VSA. Optimal constrained graph exploration.; 2001:807–814. Proceedings of the 12th ACM Symposium on DiscreteAlgorithms (SODA).
Krysta P, Kumar VSA. Approximation algorithms for minimum size 2-connectivity problems. Vol. 2010. Proceedings of the 18th International Symposium on Theoretical Aspects of Computer Science (STACS): Springer; 2001:431–442.
Kumar VSA, Hariharan R. Markovian Coupling vs Conductance for the Jerrum-Sinclair Chain. Random Structures and Algorithms. 2001;181:1–17.
Kumar VSA, Arya S, R. H. Hardness of Set Covering with Intersection 1. Vol. 1853. Proceedings of the 27th International Colloquium on Automata, Languages and Programming (ICALP): Lecture Notes in Computer Science; 2000:624–635.
Kumar VSA, Hariharan R. Markovian Coupling vs Conductance for the Jerrum-Sinclair Chain. Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science (FOCS); 1999:241–252.
|
