Ramesh K. Jallu

Employment

• IIIT Raichur Assistant Professor
  2021 - Present
• Academy of Sciences of the Czech Republic
  2019 - 2020

Education

Education history is unavailable.

Projects & Funding

Projects & funding information is unavailable.

Publications (13)

• On d-distance m-tuple (ℓ,r)-domination in graphs
  Information Processing Letters 2022 DOI: 10.1016/j.ipl.2021.106178
  +Save
• Liar's domination in unit disk graphs
  Theoretical Computer Science 2020 DOI: 10.1016/j.tcs.2020.08.029
  +Save
• Liar’s dominating set problem on unit disk graphs
  Discrete Applied Mathematics 2020 DOI: 10.1016/j.dam.2020.01.017
  +Save
• Efficient independent set approximation in unit disk graphs
  Discrete Applied Mathematics 2018 DOI: 10.1016/j.dam.2018.05.049
  +Save
• Liar’s dominating set in unit disk graphs
  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2018 DOI: 10.1007/978-3-319-94776-1_43
  +Save
• Minimum spanning tree of line segments
  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2018 DOI: 10.1007/978-3-319-94776-1_44
  +Save
• The maximum distance-d independent set problem on unit disk graphs
  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2018 DOI: 10.1007/978-3-319-78455-7_6
  +Save
• Distributed construction of connected dominating set in unit disk graphs
  Journal of Parallel and Distributed Computing 2017 DOI: 10.1016/j.jpdc.2017.01.023
  +Save
• Liar’s domination in 2D
  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2017 DOI: 10.1007/978-3-319-53007-9_20
  +Save
• The Euclidean k-supplier problem in IR2
  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2017 DOI: 10.1007/978-3-319-53058-1_9
  +Save