Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Madhav V. Marathe
2010 – today
- 2013
[j53]Richard J. Beckman, Karthik Channakeshava, Fei Huang, Junwhan Kim, Achla Marathe, Madhav V. Marathe, Guanhong Pei, Sudip Saha, Anil Kumar S. Vullikanti: Integrated Multi-Network Modeling Environment for Spectrum Management. IEEE Journal on Selected Areas in Communications 31(6): 1158-1168 (2013)- [c111]Tariq Kamal, Keith R. Bisset, Ali Raza Butt, Youngyun Chungbaek, Madhav V. Marathe: Load balancing in large-scale epidemiological simulations. HPDC 2013: 123-124
- [c110]S. M. Shamimul Hasan, Keith R. Bisset, Edward A. Fox, Kevin Hall, Jonathan Leidig, Madhav V. Marathe: An Extensible Digital Library Service to Support Network Science. ICCS 2013: 419-428
- [c109]Shridhar Chandan, Sudip Saha, Christopher L. Barrett, Stephen Eubank, Achla Marathe, Madhav V. Marathe, Samarth Swarup, Anil Kumar S. Vullikanti: Modeling the Interaction between Emergency Communications and Behavior in the Aftermath of a Disaster. SBP 2013: 476-485
- 2012
- [j52]Gabriel Istrate, Madhav V. Marathe, S. S. Ravi: Adversarial scheduling in discrete models of social dynamics. Mathematical Structures in Computer Science 22(5): 788-815 (2012)
- [j51]Bo Han, Pan Hui, V. S. Anil Kumar, Madhav V. Marathe, Jianhua Shao, Aravind Srinivasan: Mobile Data Offloading through Opportunistic Communications and Social Participation. IEEE Trans. Mob. Comput. 11(5): 821-834 (2012)
- [c108]Yongguo Mei, Raquel Hontecillas, Xiaoying Zhang, Keith R. Bisset, Stephen Eubank, Stefan Hoops, Madhav V. Marathe, Josep Bassaganya-Riera: ENISI Visual, an agent-based simulator for modeling gut immunity. BIBM 2012: 1-5
- [c107]Sherif Elmeligy Abdelhamid, Richard 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
- [c106]Christopher L. Barrett, Richard J. Beckman, Keith R. Bisset, Jiangzhuo Chen, Thomas DuBois, Stephen Eubank, V. S. Anil Kumar, Bryan Lewis, Madhav V. Marathe, Aravind Srinivasan, Paula Elaine Stretz: Optimizing epidemic protection for socially essential workers. IHI 2012: 31-40
- [c105]Suruchi Deodhar, Keith R. Bisset, Jiangzhuo Chen, Yifei Ma, Madhav V. Marathe: Enhancing user-productivity and capability through integration of distinct software in epidemiological systems. IHI 2012: 171-180
- [c104]Keith R. Bisset, Md. Maksudul Alam, Josep Bassaganya-Riera, Adria Carbo, Stephen Eubank, Raquel Hontecillas, Stefan Hoops, Yongguo Mei, Katherine V. Wendelsdorf, Dawen Xie, Jae-Seung Yeom, Madhav V. Marathe: High-Performance Interaction-Based Simulation of Gut Immunopathologies with ENteric Immunity Simulator (ENISI). IPDPS 2012: 48-59
- [c103]Zhao Zhao, Guanying Wang, Ali Raza Butt, Maleq Khan, V. S. Anil Kumar, Madhav V. Marathe: SAHAD: Subgraph Analysis in Massive Networks Using Hadoop. IPDPS 2012: 390-401
- [c102]Keith R. Bisset, Ashwin M. Aji, Eric J. Bohm, Laxmikant V. Kalé, Tariq Kamal, Madhav V. Marathe, Jae-Seung Yeom: Simulating the Spread of Infectious Disease over Large Realistic Social Networks Using Charm++. IPDPS Workshops 2012: 507-518
- [c101]Gaurav Tuli, Madhav V. Marathe, S. S. Ravi, Samarth Swarup: Addiction Dynamics May Explain the Slow Decline of Smoking Prevalence. SBP 2012: 114-122
- [c100]S. M. Arifuzzaman, Maleq Khan, Madhav V. Marathe: Abstract: Parallel Algorithms for Counting Triangles and Computing Clustering Coefficients. SC Companion 2012: 1448-1449
- [c99]S. M. Arifuzzaman, Maleq Khan, Madhav V. Marathe: Poster: Parallel Algorithms for Counting Triangles and Computing Clustering Coefficients. SC Companion 2012: 1450
- [c98]Keith R. Bisset, Stephen Eubank, Madhav V. Marathe: High performance informatics for pandemic preparedness. Winter Simulation Conference 2012: 72
- 2011
- [j50]Christopher L. Barrett, Karthik Channakeshava, Stephen Eubank, V. S. Anil Kumar, Madhav V. Marathe: From biological and social network metaphors to coupled bio-social wireless networks. IJAACS 4(2): 122-144 (2011)
- [j49]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)
- [j48]Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan: Capacity of wireless networks under SINR interference constraints. Wireless Networks 17(7): 1605-1624 (2011)
- [c97]Katherine V. Wendelsdorf, Josep Bassaganya-Riera, Keith R. Bisset, Stephen Eubank, Raquel Hontecillas, Madhav V. Marathe: ENteric Immunity SImulator: A Tool for in silico Study of Gut Immunopathologies. BIBM 2011: 462-469
- [c96]Yifei Ma, Keith R. Bisset, Jiangzhuo Chen, Suruchi Deodhar, Madhav V. Marathe: Formal Specification and Experimental Analysis of an Interactive Epidemic Simulation Framework. HPCC 2011: 790-795
- [c95]Keith R. Bisset, Ashwin M. Aji, Madhav V. Marathe, Wu-chun Feng: High-performance biocomputing for simulating the spread of contagion over large contact networks. ICCABS 2011: 26-32
- [c94]Karthik Channakeshava, Keith R. Bisset, V. S. Anil Kumar, Madhav V. Marathe, Shrirang M. Yardi: High Performance Scalable and Expressive Modeling Environment to Study Mobile Malware in Large Dynamic Networks. IPDPS 2011: 770-781
- [c93]Jonathan Leidig, Edward A. Fox, Kevin Hall, Madhav V. Marathe, Henning S. Mortveit: SimDL: a model ontology driven digital library for simulation systems. JCDL 2011: 81-84
- [c92]Jonathan Leidig, Edward A. Fox, Kevin Hall, Madhav V. Marathe, Henning S. Mortveit: Improving simulation management systems through ontology generation and utilization. JCDL 2011: 435-436
- [c91]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
- [c90]Huadong Xia, Jiangzhuo Chen, Madhav V. Marathe, Henning S. Mortveit: Synthesis and Refinement of Detailed Subnetworks in a Social Contact Network for Epidemic Simulations. SBP 2011: 366-373
- [c89]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. Winter Simulation Conference 2011: 296-308
- [c88]Yifei Ma, Keith R. Bisset, Jiangzhuo Chen, Suruchi Deodhar, Madhav V. Marathe: Efficient implementation of complex interventions in large scale epidemic simulations. Winter Simulation Conference 2011: 1354-1366
- [c87]Keith R. Bisset, Jiangzhuo Chen, Chris J. Kuhlman, V. S. Anil Kumar, Madhav V. Marathe: Interaction-based HPC modeling of social, biological, and economic contagions over large networks. Winter Simulation Conference 2011: 2938-2952
- [r3]Maleq Khan, V. S. Anil Kumar, Madhav V. Marathe, Paula Elaine Stretz: Social Networks. Encyclopedia of Parallel Computing 2011: 1842-1848
- 2010
- [j47]Christopher L. Barrett, Keith R. Bisset, Jonathan Leidig, Achla Marathe, Madhav V. Marathe: An Integrated Modeling Environment to Study the Co-evolution of Networks, Individual Behavior and Epidemics. AI Magazine 31(1): 75-87 (2010)
- [c86]Zhao Zhao, Maleq Khan, V. S. Anil Kumar, Madhav V. Marathe: Subgraph Enumeration in Large Social Contact Networks Using Parallel Color Coding and Streaming. ICPP 2010: 594-603
- [c85]Keith R. Bisset, Jiangzhuo Chen, Xizhou Feng, Yifei Ma, Madhav V. Marathe: Indemics: an interactive data intensive framework for high performance epidemic simulation. ICS 2010: 233-242
- [c84]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
- [c83]Stephen Eubank, Anil Vullikanti, Maleq Khan, Madhav V. Marathe, Christopher L. Barrett: Beyond Degree Distributions: Local to Global Structure of Social Contact Graphs. SBP 2010: 1
- [c82]Jiangzhuo Chen, Achla Marathe, Madhav V. Marathe: Coevolution of Epidemics, Social Networks, and Individual Behavior: A Case Study. SBP 2010: 218-227
2000 – 2009
- 2009
- [j46]V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan: Scheduling on Unrelated Machines under Tree-Like Precedence Constraints. Algorithmica 55(1): 205-226 (2009)
- [j45]Andrea Apolloni, V. S. Anil Kumar, Madhav V. Marathe, Samarth Swarup: Computational Epidemiology in a Connected World. IEEE Computer 42(11): 83-86 (2009)
- [j44]V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan: A unified approach to scheduling on unrelated parallel machines. J. ACM 56(5) (2009)
- [c81]Christopher L. Barrett, Keith R. Bisset, Jonathan Leidig, Achla Marathe, Madhav V. Marathe: Estimating the Impact of Public and Private Strategies for Controlling an Epidemic: A Multi-Agent Approach. IAAI 2009
- [c80]Keith R. Bisset, Jiangzhuo Chen, Xizhou Feng, V. S. Anil Kumar, Madhav V. Marathe: EpiFast: a fast algorithm for large scale realistic epidemic simulations on distributed memory systems. ICS 2009: 430-439
- [c79]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
- [c78]Bo Han, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan: Distributed Strategies for Channel Allocation and Scheduling in Software-Defined Radio Networks. INFOCOM 2009: 1521-1529
- [c77]Karthik Channakeshava, Deepti Chafekar, Keith R. Bisset, V. S. Anil Kumar, Madhav V. Marathe: EpiNet: a simulation framework to study the spread of malware in wireless networks. SimuTools 2009: 6
- [c76]Christopher L. Barrett, Richard J. Beckman, Maleq Khan, V. S. Anil Kumar, Madhav V. Marathe, Paula Elaine Stretz, Tridib Dutta, Bryan Lewis: Generation and Analysis of Large Synthetic Social Contact Networks. Winter Simulation Conference 2009: 1003-1014
- [c75]Keith R. Bisset, Xizhou Feng, Madhav V. Marathe, Shrirang M. Yardi: Modeling Interaction between Individuals, Social Networks and Public Policy to Support Public Health Epidemiology. Winter Simulation Conference 2009: 2020-2031
- 2008
- [j43]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)
- [c74]Christopher L. Barrett, Stephen Eubank, Madhav V. Marathe: An Interaction-Based Approach to Computational Epidemiology. AAAI 2008: 1590-1593
- [c73]Christopher L. Barrett, Keith R. Bisset, Martin Holzer, Goran Konjevod, Madhav V. Marathe, Dorothea Wagner: Engineering Label-Constrained Shortest-Path Algorithms. AAIM 2008: 27-37
- [c72]Gabriel Istrate, Madhav V. Marathe, S. S. Ravi: Adversarial Scheduling Analysis of Game-Theoretic Models of Norm Diffusion. CiE 2008: 273-282
- [c71]Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy: Power Efficient Throughput Maximization in Multi-Hop Wireless Networks. GLOBECOM 2008: 4895-4900
- [c70]Deepti Chafekar, Dave Levin, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan: Capacity of Asynchronous Random-Access Scheduling in Wireless Networks. INFOCOM 2008: 1148-1156
- [c69]Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan: Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints. INFOCOM 2008: 1166-1174
- [c68]Christopher L. Barrett, Keith R. Bisset, Stephen Eubank, Xizhou Feng, Madhav V. Marathe: EpiSimdemics: an efficient algorithm for simulating the spread of infectious disease over large realistic social networks. SC 2008: 37
- [r2]V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan: Minimum Weighted Completion Time. Encyclopedia of Algorithms 2008
- [r1]Christopher L. Barrett, Stephen Eubank, Bryan Lewis, Madhav V. Marathe: Pandemics, Detection and Management. Encyclopedia of GIS 2008: 839-843
- [i5]Gabriel Istrate, Madhav V. Marathe, S. S. Ravi: Adversarial Scheduling Analysis of Game Theoretic Models of Norm Diffusion. CoRR abs/0803.2495 (2008)
- [i4]Gabriel Istrate, Madhav V. Marathe, S. S. Ravi: Adversarial Scheduling in Evolutionary Game Dynamics. CoRR abs/0812.1194 (2008)
- 2007
- [j42]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)
- [c67]Stephen Eubank, V. S. Anil Kumar, Madhav V. Marathe: Epidemiology and Wireless Communication: Tight Analogy or Loose Metaphor?. BIOWIRE 2007: 91-104
- [c66]Christopher L. Barrett, Keith R. Bisset, Stephen Eubank, Edward A. Fox, Yi Ma, Madhav V. Marathe, Xiaoyu Zhang: A Scalable Data Management Tool to Support Epidemiological Modeling of Large Urban Regions. ECDL 2007: 546-548
- [c65]Ryan W. Thomas, Luiz A. DaSilva, Madhav V. Marathe, Kerry N. Wood: Critical Design Decisions for Cognitive Networks. ICC 2007: 3993-3998
- [c64]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
- [c63]Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan: Cross-layer latency minimization in wireless networks with SINR constraints. MobiHoc 2007: 110-119
- 2006
- [j41]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)
- [j40]V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan, Sibylle Zust: Provable algorithms for parallel generalized sweep scheduling. J. Parallel Distrib. Comput. 66(6): 807-821 (2006)
- [j39]Chris Bailey-Kellogg, Naren Ramakrishnan, Madhav V. Marathe: Spatial data mining to support pandemic preparedness. SIGKDD Explorations 8(1): 80-82 (2006)
- [c62]Jiangzhuo Chen, Ravi Sundaram, Madhav V. Marathe, Rajmohan Rajaraman: The Confluent Capacity of the Internet: Congestion vs. Dilation. ICDCS 2006: 5
- [c61]Gabriel Istrate, Anders Hansson, Sunil Thulasidasan, Madhav V. Marathe, Christopher L. Barrett: Semantic Compression of TCP Traces. Networking 2006: 123-135
- [c60]Christopher L. Barrett, V. S. Anil Kumar, Madhav V. Marathe, Shripad Thite, Gabriel Istrate: Strong Edge Coloring for Channel Assignment in Wireless Radio Networks. PerCom Workshops 2006: 106-110
- 2005
- [j38]Errol L. Lloyd, Rui Liu, Madhav V. Marathe, Ram Ramanathan, S. S. Ravi: Algorithmic Aspects of Topology Control Problems for Ad Hoc Networks. MONET 10(1-2): 19-34 (2005)
- [j37]Christopher L. Barrett, Stephan Eidenbenz, Lukas Kroc, Madhav V. Marathe, James P. Smith: Parametric Probabilistic Routing in Sensor Networks. MONET 10(4): 529-544 (2005)
- [c59]V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan: Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints. APPROX-RANDOM 2005: 146-157
- [c58]V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan: Approximation Algorithms for Scheduling on Multiple Machines. FOCS 2005: 254-263
- [c57]V. S. Anil Kumar, Srinivasan Parthasarathy, Madhav V. Marathe, Aravind Srinivasan, Sibylle Zust: Provable Algorithms for Parallel Sweep Scheduling on Unstructured Meshes. IPDPS 2005
- [c56]Christopher L. Barrett, Stephan Eidenbenz, Lukas Kroc, Madhav V. Marathe, James P. Smith: Probabilistic multi-path vs. deterministic single-path protocols for dynamic ad-hoc network scenarios. SAC 2005: 1166-1173
- [c55]V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan: Algorithmic aspects of capacity in wireless networks. SIGMETRICS 2005: 133-144
- [c54]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
- [j36]Goran Konjevod, Sven Oliver Krumke, Madhav V. Marathe: Budget constrained minimum cost connected medians. J. Discrete Algorithms 2(4): 453-469 (2004)
- [j35]Madhav V. Marathe, Alessandro Panconesi, Larry D. Risinger Jr.: An experimental study of a simple, distributed edge-coloring algorithm. ACM Journal of Experimental Algorithmics 9 (2004)
- [j34]Hari Balakrishnan, Christopher L. Barrett, V. S. Anil Kumar, Madhav V. Marathe, Shripad Thite: The distance-2 matching problem and its relationship to the MAC-Layer capacity of ad hoc wireless networks. IEEE Journal on Selected Areas in Communications 22(6): 1069-1079 (2004)
- [j33]Christopher L. Barrett, Madhav V. Marathe, D. Charles Engelhart, Anand Sivasubramaniam: Approximating the connectivity between nodes when simulating large-scale mobile ad hoc radio networks. Journal of Systems and Software 73: 63-74 (2004)
- [j32]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. Scientific Programming 12(1): 1-23 (2004)
- [c53]D. Charles Engelhart, Anand Sivasubramaniam, Christopher L. Barrett, Madhav V. Marathe, James P. Smith, Monique Morin: A Spatial Analysis of Mobility Models: Application to Wireless Ad Hoc Network Simulation. Annual Simulation Symposium 2004: 35-42
- [c52]Stephen Eubank, V. S. Anil Kumar, Madhav V. Marathe, Aravind Srinivasan, Nan Wang: Structural and algorithmic aspects of massive social networks. SODA 2004: 718-727
- [c51]V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan: End-to-end packet-scheduling in wireless ad-hoc networks. SODA 2004: 1021-1030
- 2003
- [j31]Christopher L. Barrett, Achla Marathe, Madhav V. Marathe, Doug Cook, Gregory Hicks, Vance Faber, Aravind Srinivasan, Yoram J. Sussmann, Heidi Thornquist: Statistical Analysis of Algorithms: A Case Study of Market-Clearing Mechanisms in the Power Industry. J. Graph Algorithms Appl. 7(1): 3-31 (2003)
- [j30]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)
- [c50]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
- [c49]Christopher L. Barrett, Madhav V. Marathe, D. Charles Engelhart, Anand Sivasubramaniam: Approximate Connectivity Graph Generation in Mobile Ad Hoc Radio Networks. Annual Simulation Symposium 2003: 81-88
- [c48]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
- [c47]Christopher L. Barrett, Martin Drozda, Achla Marathe, Madhav V. Marathe: Analyzing interaction between network protocols, topology and traffic in wireless radio networks. WCNC 2003: 1760-1766
- [c46]Christopher L. Barrett, Stephan Eidenbenz, Lukas Kroc, Madhav V. Marathe, James P. Smith: Parametric probabilistic sensor network routing. Wireless Sensor Networks and Applications 2003: 122-131
- 2002
- [j29]Madhav V. Marathe: Routing in Very Large Multi-Modal Time Dependent Networks: Theory and Practice (Invited Talk). Electr. Notes Theor. Comput. Sci. 66(6): 1-7 (2002)
- [j28]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)
- [j27]Srinivas Doddi, Madhav V. Marathe, Bernard M. E. Moret: Point Set Labeling with Specified Positions. Int. J. Comput. Geometry Appl. 12(1-2): 29-66 (2002)
- [c45]Christopher L. Barrett, Keith R. Bisset, Riko Jacob, Goran Konjevod, Madhav V. Marathe: Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router. ESA 2002: 126-138
- [c44]
- [c43]V. S. Anil Kumar, Madhav V. Marathe: Improved Results for Stackelberg Scheduling Strategies. ICALP 2002: 776-787
- [c42]Christopher L. Barrett, Madhav V. Marathe, D. Charles Engelhart, Anand Sivasubramaniam: Analyzing the Short-Term Fairness of IEEE 802.11 in Wireless Multi-Hop Radio Networks. MASCOTS 2002: 137-144
- [c41]Christopher L. Barrett, Achla Marathe, Madhav V. Marathe, Martin Drozda: Characterizing the interaction between routing and MAC protocols in ad-hoc networks. MobiHoc 2002: 92-103
- [c40]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
- [c39]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
- [c38]Sven Oliver Krumke, Madhav V. Marathe, Diana Poensgen, S. S. Ravi, Hans-Christoph Wirth: Budgeted Maximum Graph Coverage. WG 2002: 321-332
- 2001
- [j26]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)
- [j25]Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth: Upgrading bottleneck constrained forests. Discrete Applied Mathematics 108(1-2): 129-142 (2001)
- [j24]Harry B. Hunt III, Madhav V. Marathe, Richard Edwin Stearns: Complexity and Approximability of Quantified and Stochastic Constraint Satisfaction Problems. Electronic Notes in Discrete Mathematics 9: 217-230 (2001)
- [j23]Srinivasa Rao Arikati, Anders Dessmark, Andrzej Lingas, Madhav V. Marathe: Approximation algorithms for maximum two-dimensional pattern matching. Theor. Comput. Sci. 255(1-2): 51-62 (2001)
- [j22]Sven Oliver Krumke, Madhav V. Marathe, S. S. Ravi: Models and Approximation Algorithms for Channel Assignment in Radio Networks. Wireless Networks 7(6): 575-584 (2001)
- [c37]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
- [c36]Harry B. Hunt III, Madhav V. Marathe, Richard Edwin Stearns: Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structures. ISSAC 2001: 183-191
- [c35]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
- [c34]Gabriel Istrate, Madhav V. Marathe, S. S. Ravi: Adversarial models in evolutionary game dynamics. SODA 2001: 719-720
- [c33]Christopher L. Barrett, Doug Cook, Gregory Hicks, Vance Faber, Achla Marathe, Madhav V. Marathe, Aravind Srinivasan, Yoram J. Sussmann, Heidi Thornquist: Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry. Algorithm Engineering 2001: 172-184
- 2000
- [j21]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)
- [j20]Christopher L. Barrett, Riko Jacob, Madhav V. Marathe: Formal-Language-Constrained Path Problems. SIAM J. Comput. 30(3): 809-837 (2000)
- [c32]Srinivas Doddi, Madhav V. Marathe, Bernard M. E. Moret: Point set labeling with specified positions. Symposium on Computational Geometry 2000: 182-190
- [c31]Robert D. Carr, Srinivas Doddi, Goran Konjevod, Madhav V. Marathe: On the red-blue set cover problem. SODA 2000: 345-353
- [c30]Éva Czabarka, Goran Konjevod, Madhav V. Marathe, Allon G. Percus, David C. Torney: Algorithms for optimizing production DNA sequencing. SODA 2000: 399-408
- [c29]Madhav V. Marathe, Alessandro Panconesi, Larry D. Risinger Jr.: An experimental study of a simple, distributed edge coloring algorithm. SPAA 2000: 166-175
- [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
- [c27]Goran Konjevod, Sven Oliver Krumke, Madhav V. Marathe: Budget Constrained Minimum Cost Connected Medians. WG 2000: 267-278
1990 – 1999
- 1999
- [j19]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)
- [j18]Riko Jacob, Madhav V. Marathe, Kai Nagel: A Computational Study of Routing Algorithms for Realistic Transportation Networks. ACM Journal of Experimental Algorithmics 4: 6 (1999)
- [j17]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)
- [c26]Federico Bassetti, Kei Davis, Madhav V. Marathe, Daniel J. Quinlan, Bobby Philip: Improving Cache Utilization of Linear Relaxation Methods: Theory and Practice. ISCOPE 1999: 25-36
- 1998
- [j16]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)
- [j15]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)
- [j14]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)
- [j13]Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, Richard Edwin Stearns: The Complexity of Planar Counting Problems. SIAM J. Comput. 27(4): 1142-1167 (1998)
- [j12]Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan: Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems. SIAM J. Comput. 27(5): 1237-1261 (1998)
- [j11]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)
- [c25]Madhav V. Marathe, Harry B. Hunt III, Daniel J. Rosenkrantz, Richard Edwin Stearns: Theory of Periodically Specified Problems: Complexity and Approximability. IEEE Conference on Computational Complexity 1998: 106-
- [c24]Doug Cook, Vance Faber, Madhav V. Marathe, Aravind Srinivasan, Yoram J. Sussmann: Low-Bandwidth Routing and Electrical Power Networks. ICALP 1998: 604-615
- [c23]Christopher L. Barrett, Riko Jacob, Madhav V. Marathe: Formal Language Constrained Path Problems. SWAT 1998: 234-245
- [c22]Riko Jacob, Madhav V. Marathe, Kai Nagel: A Computational Study of Routing Algorithms for Realistic Transportation Networks. Algorithm Engineering 1998: 167-178
- [c21]Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth: Upgrading Bottleneck Constrained Forests. WG 1998: 215-226
- [i3]Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, Richard Edwin Stearns: The Complexity of Planar Counting Problems. CoRR cs.CC/9809017 (1998)
- [i2]Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan: Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems. CoRR cs.CC/9809064 (1998)
- [i1]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
- [j10]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)
- [j9]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)
- [c20]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
- [c19]Srinivas Doddi, Madhav V. Marathe, Andy Mirzaian, Bernard M. E. Moret, Binhai Zhu: Map Labeling and Its Generalizations. SODA 1997: 148-157
- 1996
- [j8]Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi: Efficient Approximation Algorithms for Domatic Partition and on-line Coloring of Circular Arc Graphs. Discrete Applied Mathematics 64(2): 135-149 (1996)
- [j7]Madhav V. Marathe, S. S. Ravi: On Approximation Algorithms for the Minimum Satisfiability Problem. Inf. Process. Lett. 58(1): 23-29 (1996)
- [j6]Madhav V. Marathe, R. Ravi, Ravi Sundaram: Service-Constrained Network Design Problems. Nord. J. Comput. 3(4): 367-387 (1996)
- [j5]R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi: Spanning Trees - Short or Small. SIAM J. Discrete Math. 9(2): 178-200 (1996)
- [c18]Srinivasa Rao Arikati, Anders Dessmark, Andrzej Lingas, Madhav V. Marathe: Approximation Algorithms for Maximum Two-Dimensional Pattern Matching. CPM 1996: 348-360
- [c17]Madhav V. Marathe, R. Ravi, Ravi Sundaram: Service-Constrained Network Design Problems. SWAT 1996: 28-40
- [c16]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
- [j4]Madhav V. Marathe, H. Breu, Harry B. Hunt III, S. S. Ravi, Daniel J. Rosenkrantz: Simple heuristics for unit disk graphs. Networks 25(2): 59-68 (1995)
- [c15]Sven Oliver Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe: Compact Location Problems with Budget and Communication Constraints. COCOON 1995: 510-519
- [c14]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
- [c13]Sven Oliver Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe: Complexity and Approximability of Certain Bicriteria Location Problems. WG 1995: 73-87
- 1994
- [j3]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)
- [c12]Harry B. Hunt III, Madhav V. Marathe, Richard Edwin Stearns: Generalized CNF Satisfiability Problems and Non-Efficient. Structure in Complexity Theory Conference 1994: 356-366
- [c11]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
- [c10]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
- [c9]R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi: Spanning Trees Short or Small. SODA 1994: 546-555
- [c8]Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan: Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version). STOC 1994: 468-477
- 1993
- [c7]Venkatesh Radhakrishnan, Sven Oliver Krumke, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi: Compact Location Problems. FSTTCS 1993: 238-247
- [c6]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
- [c5]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
- [c4]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
- [c3]Madhav V. Marathe, Venkatesh Radhakrishnan, Harry B. Hunt III, S. S. Ravi: Hierarchical Specified Unit Disk Graphs (Extended Abstract). WG 1993: 21-32
- 1992
- [j2]Madhav V. Marathe, R. Ravi, C. Pandu Rangan: Generalized Vertex Covering in Interval Graphs. Discrete Applied Mathematics 39(1): 87-93 (1992)
- [j1]R. Ravi, Madhav V. Marathe, C. Pandu Rangan: An optimal algorithm to solve the all-pair shortest path problem on interval graphs. Networks 22(1): 21-35 (1992)
1980 – 1989
- 1981
- [c2]Madhav V. Marathe, Sujit Kumar: Analytical Models for an Ethernet-Like Local Area Network Link. SIGMETRICS 1981: 205-215
1970 – 1979
- 1977
- [c1]Madhav V. Marathe, Samuel H. Fuller: A Study of Multiprocessor Contention for Shared Data in C.MMP. Int. CMG Conference 1977: 255-262
Coauthor Index
[j52] [c107] [c101] [j49] [c91] [c89] [c84] [c79] [j43] [c72] [i5] [i4] [j42] [c64] [j41] [j38] [c54] [j32] [j30] [c50] [c48] [j28] [c40] [c39] [c38] [j26] [j25] [j22] [c37] [c35] [c34] [j21] [c28] [j19] [j17] [j16] [j15] [j14] [j11] [c21] [i1] [j10] [j9] [c20] [j8] [j7] [j5] [c16] [j4] [c15] [c14] [c13] [j3] [c11] [c10] [c9] [c7] [c6] [c5] [c4] [c3]
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18 22:12 CEST by the dblp team