If you made any changes in Pure, your changes will be visible here soon.

Fingerprint Fingerprint is based on mining the text of the experts' scientific documents to create an index of weighted terms, which defines the key subjects of each individual researcher.

  • 10 Similar Profiles
Approximation algorithms Engineering & Materials Science
Approximation Algorithms Mathematics
Open Shop Scheduling Mathematics
Vertex Cover Mathematics
Scheduling Engineering & Materials Science
Approximation Mathematics
Completion Time Mathematics
Graph in graph theory Mathematics

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Projects 2008 2017

computer science
student
graduate
school
mathematics
computer science
India
student
university teacher
female student
Computer science
Students
Teaching
Scheduling
Scheduling Problem
Approximation Algorithms
Discrete mathematics
Communication Networks
Computer Science

Research Output 2000 2018

  • 777 Citations
  • 15 h-Index
  • 20 Article
  • 8 Conference contribution
  • 3 Conference article
  • 1 Paper

On maximum leaf trees and connections to connected maximum cut problems

Gandhi, R., Hajiaghayi, M. T., Kortsarz, G., Purohit, M. & Sarpatwar, K., Jan 1 2018, In : Information Processing Letters. 129, p. 31-34 4 p.

Rutgers, The State University

Research output: Contribution to journalArticle

Approximation algorithms
Leaves
Max-cut Problem
Max-cut
Weighted Graph
1 Citation (Scopus)

Bi-covering: Covering edges with two small subsets of vertices

Bhangale, A., Gandhi, R., Hajiaghayi, M. T., Khandekar, R. & Kortsarz, G., Jan 1 2017, In : SIAM Journal on Discrete Mathematics. 31, 4, p. 2626-2646 21 p.

Rutgers, The State University

Research output: Contribution to journalArticle

Covering
Subset
Graph in graph theory
Clique
Approximation

Bicovering: Covering edges with two small subsets of vertices

Bhangale, A., Gandhi, R., Hajiaghayi, M. T., Khandekar, R. & Kortsarz, G., Aug 1 2016, 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016. Rabani, Y., Chatzigiannakis, I., Sangiorgi, D. & Mitzenmacher, M. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 6. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 55).

Rutgers, The State University

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Covering
Subset
Graph in graph theory
Clique
Hardness
1 Citation (Scopus)
Edge Cover
Approximation algorithms
Costs
Computational complexity
Approximation
3 Citations (Scopus)

Radio aggregation scheduling

Gandhi, R., Halldórsson, M. M., Konrad, C., Kortsarz, G. & Oh, H., Jan 1 2015, Algorithms for Sensor Systems - 11th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2015, Revised Selected Papers. Römer, K., Wattenhofer, R., Gąsieniec, L. A. & Bose, P. (eds.). Springer Verlag, p. 169-182 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9536).

Rutgers, The State University

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Aggregation
Scheduling
Graph in graph theory
Radio Networks
Interval Graphs