2018 - SIAM Fellow For contributions to high performance computing algorithms and software systems for network science and public health epidemiology.
2014 - Fellow of the American Association for the Advancement of Science (AAAS)
2013 - ACM Fellow For contributions to high performance computing algorithms and software environments for simulating and analyzing socio-technical systems.
2013 - IEEE Fellow For contributions to development of formal models and software tools for understanding socio-technical networks
His primary scientific interests are in Approximation algorithm, Distributed computing, Combinatorics, Computer network and Wireless network. His research integrates issues of Time complexity, Wireless ad hoc network, Steiner tree problem and Spanning tree in his study of Approximation algorithm. Madhav V. Marathe combines subjects such as Parallel algorithm, Scalability, Computational epidemiology and Heuristic with his study of Distributed computing.
His studies deal with areas such as Discrete mathematics and Computational complexity theory as well as Combinatorics. His biological study spans a wide range of topics, including Mobile broadband and Mobile data offloading. The Wireless network study combines topics in areas such as Distributed algorithm and Network packet.
His primary scientific interests are in Approximation algorithm, Combinatorics, Discrete mathematics, Mathematical optimization and Distributed computing. His Approximation algorithm study is concerned with the larger field of Algorithm. His work on Time complexity, Vertex, Degree and Tree as part of general Combinatorics research is frequently linked to Node, bridging the gap between disciplines.
His work in Discrete mathematics addresses issues such as Computational complexity theory, which are connected to fields such as Theoretical computer science. His studies in Theoretical computer science integrate themes in fields like Graph and Artificial intelligence. His study looks at the relationship between Distributed computing and topics such as Computer network, which overlap with Wireless network.
His scientific interests lie mostly in Theoretical computer science, Data science, Machine learning, Artificial intelligence and Work. His Theoretical computer science study incorporates themes from Sequence, Graph dynamical system and Social system. Madhav V. Marathe has researched Data science in several fields, including Bayesian calibration, Emerging infectious disease, Management science and Computational model.
The concepts of his Big data study are interwoven with issues in Ubiquitous computing, Voltage regulation and Computational epidemiology. His Resilience study combines topics from a wide range of disciplines, such as Function and Distributed computing. His study on Distributed computing is mostly dedicated to connecting different topics, such as Optimization problem.
Machine learning, Artificial intelligence, Data-driven, Benchmark and Series are his primary areas of study. His work on Deep learning and Artificial neural network is typically connected to Consistency and County level as part of general Machine learning study, connecting several disciplines of science. In his work, Madhav V. Marathe performs multidisciplinary research in Artificial intelligence and Preparedness.
Madhav V. Marathe interconnects Bayesian calibration, Emerging infectious disease, Computational model and Data science in the investigation of issues within Data-driven. His Benchmark study integrates concerns from other disciplines, such as Data modeling and High performance computation.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Modelling disease outbreaks in realistic urban social networks.
Stephen Eubank;Hasan Guclu;V S Anil Kumar;Madhav V Marathe.
Mobile Data Offloading through Opportunistic Communications and Social Participation
Bo Han;Pan Hui;V. S. A. Kumar;M. V. Marathe.
IEEE Transactions on Mobile Computing (2012)
Simple heuristics for unit disk graphs
Madhav V. Marathe;H. Breu;Harry B. Hunt;S. S. Ravi.
Algorithmic aspects of topology control problems for ad hoc networks
Errol L. Lloyd;Rui Liu;Madhav V. Marathe;Ram Ramanathan.
Mobile Networks and Applications (2005)
NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
Harry B Hunt;Madhav V Marathe;Venkatesh Radhakrishnan;S.S Ravi.
Journal of Algorithms (1998)
Cellular traffic offloading through opportunistic communications: a case study
Bo Han;Pan Hui;V.S. Anil Kumar;Madhav V. Marathe.
workshop challenged networks (2010)
EpiSimdemics: an efficient algorithm for simulating the spread of infectious disease over large realistic social networks
Christopher L. Barrett;Keith R. Bisset;Stephen G. Eubank;Xizhou Feng.
ieee international conference on high performance computing data and analytics (2008)
Algorithmic aspects of capacity in wireless networks
V. S. Anil Kumar;Madhav V. Marathe;Srinivasan Parthasarathy;Aravind Srinivasan.
measurement and modeling of computer systems (2005)
Spanning Trees---Short or Small
R. Ravi;R. Sundaram;M. V. Marathe;D. J. Rosenkrantz.
SIAM Journal on Discrete Mathematics (1996)
Modeling the Impact of Interventions on an Epidemic of Ebola in Sierra Leone and Liberia
Caitlin M. Rivers;Eric T. Lofgren;Madhav Marathe;Stephen Eubank.
PLOS Currents (2014)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: