Personal information

Websites & social links

https://web.iitd.ac.in/~minati/

Other IDs

Scopus Author ID: 55222217000

Countries

India

Activities

Collapse all

Employment (3)

Indian Institute of Technology Delhi: New Delhi, Delhi, IN

2018-04-04 to present | Assistant Professor (Mathematics)
Employment
Source: Self-asserted source
Minati De

Indian Institute of Science Bangalore: Bengaluru, Karnataka, IN

2015-01 to 2018-04 | INSPIRE Faculty (Computer Science and Automation)
Employment
Source: Self-asserted source
Minati De

Technion Israel Institute of Technology: Haifa, Haifa, IL

2014 to 2015 | Postdoctoral Fellow (Computer Science)
Employment
Source: Self-asserted source
Minati De

Education and qualifications (3)

Indian Statistical Institute: Kolkata, WB, IN

2010-08-16 to 2013-12-31 | PhD
Education
Source: Self-asserted source
Minati De

Indian Statistical Institute: Kolkata, WB, IN

2008-07-14 to 2010-07-31 | MTech
Education
Source: Self-asserted source
Minati De

Bengal Engineering and Science University: Howrah, WB, IN

2004-07-14 to 2008-06-31 | BE
Education
Source: Self-asserted source
Minati De

Works (34)

Online Dominating Set and Coloring

2024 | Book chapter
DOI: 10.1007/978-3-031-49611-0_5
Contributors: Minati De; Sambhav Khurana; Satyam Singh
Source: check_circle
Crossref

Online class cover problem

Computational Geometry
2024-12 | Journal article
DOI: 10.1016/j.comgeo.2024.102120
Part of ISSN: 0925-7721
Contributors: Minati De; Anil Maheshwari; Ratnadip Mandal
Source: Self-asserted source
Minati De

Online Geometric Covering and Piercing

Algorithmica
2024-09 | Journal article
DOI: 10.1007/s00453-024-01244-1
Part of ISSN: 0178-4617
Part of ISSN: 1432-0541
Contributors: Minati De; Saksham Jain; Sarat Varma Kallepalli; Satyam Singh
Source: Self-asserted source
Minati De

Online hitting of unit balls and hypercubes in R^d using points from Z^d

Theoretical Computer Science
2024-04 | Journal article
DOI: 10.1016/j.tcs.2024.114452
Part of ISSN: 0304-3975
Contributors: Minati De; Satyam Singh
Source: Self-asserted source
Minati De

Geometric dominating-set and set-cover via local-search

Computational Geometry
2023-08 | Journal article
DOI: 10.1016/j.comgeo.2023.102007
Contributors: Minati De; Abhiruk Lahiri
Source: check_circle
Crossref

Hitting Geometric Objects Online via Points in $$\mathbb {Z}^d$$

2022 | Book chapter
DOI: 10.1007/978-3-031-22105-7_48
Contributors: Minati De; Satyam Singh
Source: check_circle
Crossref

Online Piercing of Geometric Objects

42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India
2022 | Conference paper
DOI: 10.4230/LIPIcs.FSTTCS.2022.17
Contributors: Minati De and Saksham Jain and Sarat Varma Kallepalli and Satyam Singh; Anuj Dawar and Venkatesan Guruswami
Source: Self-asserted source
Minati De

Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons

Algorithmica
2021-07-05 | Journal article
DOI: 10.1007/s00453-021-00824-9
Contributors: Gill Barequet; Minati De; Michael T. Goodrich
Source: check_circle
Crossref

Variations of largest rectangle recognition amidst a bichromatic point set

Discrete Applied Mathematics
2020-11 | Journal article
DOI: 10.1016/j.dam.2019.05.012
Part of ISSN: 0166-218X
Contributors: Ankush Acharyya; Minati De; Subhas C. Nandy; Supantha Pandit
Source: Self-asserted source
Minati De

Constant work-space algorithms for facility location problems

Discrete Applied Mathematics
2020-09 | Journal article
DOI: 10.1016/j.dam.2020.01.040
Part of ISSN: 0166-218X
Contributors: Minati De
Source: Self-asserted source
Minati De

Range assignment of base-stations maximizing coverage area without interference

Theoretical Computer Science
2020-01 | Journal article
DOI: 10.1016/j.tcs.2019.10.044
Contributors: Ankush Acharyya; Minati De; Subhas C. Nandy; Bodhayan Roy
Source: check_circle
Crossref

A Lower Bound on the Growth Constant of Polyaboloes on the Tetrakis Lattice

Lecture Notes in Computer Science
2019 | Book chapter
DOI: 10.1007/978-3-030-26176-4_2
Part of ISBN: 9783030261757
Part of ISBN: 9783030261764
Part of ISSN: 0302-9743
Part of ISSN: 1611-3349
Contributors: Minati De; Gill Barequet
Source: Self-asserted source
Minati De

Approximation Schemes for Geometric Coverage Problems

ESA 2018
2018 | Conference paper
DOI: 10.4230/LIPICS.ESA.2018.17
Contributors: Minati De
Source: Self-asserted source
Minati De

Brief Announcement: Approximation Schemes for Geometric Coverage Problems

ICALP 2018
2018 | Conference paper
DOI: 10.4230/LIPICS.ICALP.2018.107
Contributors: Minati De
Source: Self-asserted source
Minati De

Computing Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons

Lecture Notes in Computer Science
2018 | Book chapter
DOI: 10.1007/978-3-319-94776-1_12
Part of ISBN: 9783319947754
Part of ISBN: 9783319947761
Part of ISSN: 0302-9743
Part of ISSN: 1611-3349
Contributors: Gill Barequet; Minati De; Michael T. Goodrich
Source: Self-asserted source
Minati De

Guarding Polyhedral Terrain by k-Watchtowers

2018 | Book chapter
DOI: 10.1007/978-3-319-78455-7_9
Contributors: Nitesh Tripathi; Manjish Pal; Minati De; Gautam Das; Subhas C. Nandy
Source: check_circle
Crossref

Circular separation dimension of a subclass of planar graphs

Discrete Mathematics and Theoretical Computer Science
2017 | Journal article
EID:

2-s2.0-85033564420
Contributors: Bharathi, A.P.; De, M.; Lahiri, A.
Source: Self-asserted source
Minati De via Scopus - Elsevier

Demand hitting and covering of intervals

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2017 | Book
DOI: 10.1007/978-3-319-53007-9_24
EID:

2-s2.0-85012273295
Contributors: Datta Krupa, R.; Roy, A.B.; De, M.; Govindarajan, S.
Source: Self-asserted source
Minati De via Scopus - Elsevier

Range Assignment of Base-Stations Maximizing Coverage Area without Interference

Proceedings of the 29th Canadian Conference on Computational Geometry, CCCG 2017, July 26-28, 2017, Carleton University, Ottawa, Ontario, Canada
2017 | Conference paper
Source: Self-asserted source
Minati De

Voronoi diagram for convex polygonal sites with convex polygon-offset distance function

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2017 | Book
DOI: 10.1007/978-3-319-53007-9_3
EID:

2-s2.0-85012248831
Contributors: Barequet, G.; De, M.
Source: Self-asserted source
Minati De via Scopus - Elsevier

Rectilinear path problems in restricted memory setup

Discrete Applied Mathematics
2017-09 | Journal article
DOI: 10.1016/j.dam.2016.05.031
Part of ISSN: 0166-218X
Contributors: Minati De
Source: Self-asserted source
Minati De
grade
Preferred source (of 2)‎

Rectilinear path problems in restricted memory setup

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2015 | Book
EID:

2-s2.0-84922275266
Contributors: Bhattacharya, B.K.; De, M.; Maheshwari, A.; Nandy, S.C.; Roy, S.
Source: Self-asserted source
Minati De via Scopus - Elsevier

Approximation algorithms for maximum independent set of a unit disk graph

Information Processing Letters
2015-03 | Journal article
DOI: 10.1016/j.ipl.2014.11.002
Source: Self-asserted source
Minati De
grade
Preferred source (of 2)‎

Back-up 2-center on a path/tree/cycle/unicycle

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2014 | Book
DOI: 10.1007/978-3-319-08783-2_36
EID:

2-s2.0-84904753330
Contributors: Bhattacharya, B.; De, M.; Kameda, T.; Roy, S.; Sokol, V.; Song, Z.
Source: Self-asserted source
Minati De via Scopus - Elsevier

In-place algorithms for computing a largest clique in geometric intersection graphs

Discrete Applied Mathematics
2014 | Journal article
DOI: 10.1016/j.dam.2014.06.025
EID:

2-s2.0-84907711694
Contributors: De, M.; Nandy, S.C.; Roy, S.
Source: Self-asserted source
Minati De via Scopus - Elsevier

Maximum independent set for interval graphs and trees in space efficient models

26th Canadian Conference on Computational Geometry, CCCG 2014
2014 | Conference paper
EID:

2-s2.0-84926066925
Contributors: Bhattacharya, B.K.; De, M.; Nandy, S.C.; Roy, S.
Source: Self-asserted source
Minati De via Scopus - Elsevier

Prune-and-search with limited workspace

Journal of Computer and System Sciences
2014 | Journal article
DOI: 10.1016/j.jcss.2014.08.001
EID:

2-s2.0-84927671100
Contributors: De, M.; Nandy, S.C.; Roy, S.
Source: Self-asserted source
Minati De via Scopus - Elsevier

An in-place min-max priority search tree

Computational Geometry: Theory and Applications
2013 | Journal article
DOI: 10.1016/j.comgeo.2012.09.007
EID:

2-s2.0-84869083403
Contributors: De, M.; Maheshwari, A.; Nandy, S.C.; Smid, M.
Source: Self-asserted source
Minati De via Scopus - Elsevier

Approximation algorithms for a variant of discrete piercing set problem for unit disks

International Journal of Computational Geometry and Applications
2013 | Journal article
DOI: 10.1142/S021819591350009X
EID:

2-s2.0-84904340979
Contributors: De, M.; Das, G.K.; Carmi, P.; Nandy, S.C.
Source: Self-asserted source
Minati De via Scopus - Elsevier

In-place algorithms for computing a largest clique in geometric intersection graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2012 | Book
DOI: 10.1007/978-3-642-29700-7_30
EID:

2-s2.0-84861218611
Contributors: De, M.; Nandy, S.C.; Roy, S.
Source: Self-asserted source
Minati De via Scopus - Elsevier

Minimum enclosing circle with few extra variables

Leibniz International Proceedings in Informatics, LIPIcs
2012 | Conference paper
DOI: 10.4230/LIPIcs.FSTTCS.2012.510
EID:

2-s2.0-84880251276
Contributors: De, M.; Nandy, S.C.; Roy, S.
Source: Self-asserted source
Minati De via Scopus - Elsevier

An in-place priority search tree

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011
2011 | Conference paper
EID:

2-s2.0-84882967122
Contributors: De, M.; Maheshwari, A.; Nandy, S.C.; Smid, M.
Source: Self-asserted source
Minati De via Scopus - Elsevier

Approximation algorithms for the discrete piercing set problem for unit disks

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011
2011 | Conference paper
EID:

2-s2.0-84882952038
Contributors: De, M.; Das, G.K.; Nandy, S.C.
Source: Self-asserted source
Minati De via Scopus - Elsevier

Space-efficient algorithms for empty space recognition among a point set in 2D and 3D

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011
2011 | Conference paper
EID:

2-s2.0-84882961640
Contributors: De, M.; Nandy, S.C.
Source: Self-asserted source
Minati De via Scopus - Elsevier

Peer review (1 review for 1 publication/grant)

Review activity for Optimization letters. (1)
How many people are using ORCID?