# Mohit Singh

**Type:** Researchers  
**Canonical URL:** https://scholariq.org/researchers/mohit-singh/

## Facts

| Field | Value |
| --- | --- |
| Citations | 2,440 |
| Field | Complexity and Algorithms in Graphs |
| h-index | 27 |
| i10-index | 54 |
| Last Known Institution | Georgia Institute of Technology |
| OpenAlex ID | https://openalex.org/A5020914506 |
| ORCID iD | 0000-0002-0827-233X |
| Works | 196 |

## Researcher papers

- [Iterative Methods in Combinatorial Optimization](https://scholariq.org/papers/iterative-methods-in-combinatorial-optimization/)
- [A Randomized Rounding Approach to the Traveling Salesman Problem](https://scholariq.org/papers/a-randomized-rounding-approach-to-the-traveling-salesman-problem/)
- [Approximating minimum bounded degree spanning trees to within one of optimal](https://scholariq.org/papers/approximating-minimum-bounded-degree-spanning-trees-to-within-one-of-optimal-2/)
- [A geometric alternative to Nesterov's accelerated gradient descent](https://scholariq.org/papers/a-geometric-alternative-to-nesterov-s-accelerated-gradient-descent/)
- [How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems](https://scholariq.org/papers/how-to-pay-come-what-may-approximation-algorithms-for-demand-robust-covering/)
- [Survivable Network Design with Degree or Order Constraints](https://scholariq.org/papers/survivable-network-design-with-degree-or-order-constraints-2/)
- [Entropy, optimization and counting](https://scholariq.org/papers/entropy-optimization-and-counting/)
- [Survivable network design with degree or order constraints](https://scholariq.org/papers/survivable-network-design-with-degree-or-order-constraints/)
- [Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs](https://scholariq.org/papers/improved-approximation-ratios-for-traveling-salesperson-tours-and-paths-in/)
- [Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal](https://scholariq.org/papers/approximating-minimum-bounded-degree-spanning-trees-to-within-one-of-optimal/)
- [A Convolutional Neural Network Framework for Early Plant Disease Detection via Leaf Health Classification](https://scholariq.org/papers/a-convolutional-neural-network-framework-for-early-plant-disease-detection-via/)

## Researcher topics

- [Complexity and Algorithms in Graphs](https://scholariq.org/topics/complexity-and-algorithms-in-graphs/)
- [Advanced Graph Theory Research](https://scholariq.org/topics/advanced-graph-theory-research/)
- [Optimization and Search Problems](https://scholariq.org/topics/optimization-and-search-problems/)
- [Vehicle Routing Optimization Methods](https://scholariq.org/topics/vehicle-routing-optimization-methods/)
- [Quantum Dots Synthesis And Properties](https://scholariq.org/topics/quantum-dots-synthesis-and-properties/)

## Researcher university

- [Georgia Institute of Technology](https://scholariq.org/institutions/georgia-institute-of-technology/)

---
Source: ScholarIQ — public research metadata, principally OpenAlex. See https://scholariq.org/sources/ for provenance and https://scholariq.org/methodology/ for what these figures mean.