What is he best known for?
The fields of study he is best known for:
- Computer network
- Combinatorics
- Algorithm
Aravind Srinivasan mainly investigates Approximation algorithm, Combinatorics, Discrete mathematics, Computer network and Mathematical optimization.
His Approximation algorithm study integrates concerns from other disciplines, such as Rounding, Bipartite graph and Random graph.
The concepts of his Combinatorics study are interwoven with issues in Upper and lower bounds and Set cover problem.
His Discrete mathematics study incorporates themes from Routing and Combinatorial optimization.
His Computer network research incorporates themes from Wireless network and Distributed computing.
His Distributed computing research is multidisciplinary, relying on both Cellular network, Mobile broadband, Mobile data offloading and Femtocell.
His most cited work include:
- Modelling disease outbreaks in realistic urban social networks. (1612 citations)
- Mobile Data Offloading through Opportunistic Communications and Social Participation (443 citations)
- Splitters and near-optimal derandomization (269 citations)
What are the main themes of his work throughout his whole career to date?
His main research concerns Approximation algorithm, Combinatorics, Discrete mathematics, Mathematical optimization and Algorithm.
Aravind Srinivasan has included themes like Scheduling, Rounding and Combinatorial optimization in his Approximation algorithm study.
His work carried out in the field of Scheduling brings together such families of science as Wireless network and Distributed computing.
His research in Combinatorics intersects with topics in Parallel algorithm and Upper and lower bounds.
The Discrete mathematics study combines topics in areas such as Set cover problem, Polynomial and Integer programming.
When carried out as part of a general Mathematical optimization research project, his work on Linear programming, Facility location problem and Stochastic optimization is frequently linked to work in Matching, therefore connecting diverse disciplines of study.
He most often published in these fields:
- Approximation algorithm (34.42%)
- Combinatorics (30.07%)
- Discrete mathematics (27.17%)
What were the highlights of his more recent work (between 2015-2021)?
- Approximation algorithm (34.42%)
- Theoretical computer science (12.68%)
- Mathematical optimization (19.93%)
In recent papers he was focusing on the following fields of study:
Aravind Srinivasan focuses on Approximation algorithm, Theoretical computer science, Mathematical optimization, Combinatorics and Algorithm.
His Approximation algorithm study combines topics from a wide range of disciplines, such as Discrete mathematics, Matroid, Set cover problem and Rounding.
His Theoretical computer science research is multidisciplinary, incorporating perspectives in Vertex, Bipartite graph, Graph and Cluster analysis.
As part of one scientific family, he deals mainly with the area of Mathematical optimization, narrowing it down to issues related to the Distribution, and often Order.
His work on Lovász local lemma as part of general Combinatorics research is often related to Negative correlation, thus linking different fields of science.
The various areas that he examines in his Algorithm study include Structure and Competitive analysis.
Between 2015 and 2021, his most popular works were:
- New Algorithms, Better Bounds, and a Novel Model for Online Stochastic Matching (24 citations)
- Lift-and-round to improve weighted completion time on unrelated machines (22 citations)
- Allocation Problems in Ride-Sharing Platforms: Online Matching with Offline Reusable Resources (19 citations)
In his most recent research, the most cited papers focused on:
- Computer network
- Algorithm
- Artificial intelligence
Aravind Srinivasan mainly focuses on Competitive analysis, Approximation algorithm, Mathematical optimization, Matching and Lovász local lemma.
Aravind Srinivasan combines subjects such as Linear programming, Algorithm, Bipartite graph and Artificial intelligence with his study of Competitive analysis.
His research ties Outlier and Approximation algorithm together.
His work on Combinatorial optimization as part of general Mathematical optimization study is frequently linked to Impossibility, therefore connecting diverse disciplines of science.
His research on Discrete mathematics and Combinatorics is centered around Lovász local lemma.
His studies deal with areas such as Satisfiability, Polynomial and Solution set as well as Combinatorics.
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.
