Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGautam K. Das
Person information
- affiliation: Indian Institute of Technology Guwahati (IITG), Department of Mathematics, Assam, India
- affiliation: University of New Brunswick, Faculty of Computer Science, Fredericton, NB, Canada
- affiliation: Indian Statistical Institute Kolkata, Advanced Computing and Microelectronics Unit, India
- not to be confused with: Gautam Das 0003
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c27]Sasmita Rout, Gautam Kumar Das:
Semi-total Domination in Unit Disk Graphs. CALDAM 2024: 117-129- 2022
- [j24]Sangram Kishor Jena
, Gautam K. Das:
Vertex-edge domination in unit disk graphs. Discret. Appl. Math. 319: 351-361 (2022) - [j23]Sangram Kishor Jena, Ramesh K. Jallu, Gautam K. Das:
On d-distance m-tuple (ℓ, r)-domination in graphs. Inf. Process. Lett. 174: 106178 (2022) - 2021
- [j22]Manjanna Basappa, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy:
The Euclidean k-supplier problem in IR2. Oper. Res. Lett. 49(1): 48-54 (2021) - [j21]Gautam Kumar Das, Subhas C. Nandy, M. Sohel Rahman:
Algorithms and Discrete Mathematics - celebrating the silver jubilee of IITG Guwahati. Theor. Comput. Sci. 864: 139-140 (2021) - [c26]Sangram Kishor Jena, Gautam K. Das:
Total Domination in Geometric Unit Disk Graphs. CCCG 2021: 219-227 - [c25]Pawan K. Mishra, Gautam K. Das:
Approximation Algorithms for the Euclidean Dispersion Problems. CCCG 2021: 303-311 - [i11]Pawan K. Mishra, Gautam K. Das:
Approximation Algorithms For The Euclidean Dispersion Problems. CoRR abs/2105.09217 (2021) - [i10]Pawan K. Mishra, Gautam K. Das:
Approximation Algorithms For The Dispersion Problems in a Metric Space. CoRR abs/2105.09313 (2021) - [i9]Sasmita Rout, Gautam K. Das:
Roman Domination in Convex Bipartite Graphs. CoRR abs/2111.09040 (2021) - 2020
- [j20]Gautam K. Das, Guilherme Dias da Fonseca, Ramesh K. Jallu:
Efficient independent set approximation in unit disk graphs. Discret. Appl. Math. 280: 63-70 (2020) - [j19]Pawan K. Mishra, Sangram Kishor Jena, Gautam K. Das, S. V. Rao:
Capacitated discrete unit disk cover. Discret. Appl. Math. 285: 242-251 (2020) - [j18]Ramesh K. Jallu, Gautam K. Das:
Liar's dominating set problem on unit disk graphs. Discret. Appl. Math. 286: 91-99 (2020) - [j17]Manjanna Basappa, Ramesh K. Jallu, Gautam K. Das:
Constrained k-Center Problem on a Convex Polygon. Int. J. Found. Comput. Sci. 31(2): 275-291 (2020) - [j16]Ramesh K. Jallu, Sangram Kishor Jena, Gautam K. Das:
Liar's domination in unit disk graphs. Theor. Comput. Sci. 845: 38-49 (2020) - [c24]Sangram Kishor Jena, Gautam K. Das:
Vertex-Edge Domination in Unit Disk Graphs. CALDAM 2020: 67-78 - [i8]Ramesh K. Jallu, Sangram Kishor Jena, Gautam K. Das:
Liar's Domination in Unit Disk Graphs. CoRR abs/2005.13913 (2020) - [i7]Sangram Kishor Jena, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy:
The Generalized Independent and Dominating Set Problems on Unit Disk Graphs. CoRR abs/2006.15381 (2020) - [i6]Sangram Kishor Jena, Gautam K. Das:
Total Domination in Unit Disk Graphs. CoRR abs/2007.11997 (2020)
2010 – 2019
- 2019
- [c23]Pawan K. Mishra, Sangram Kishor Jena, Gautam K. Das, S. V. Rao:
Capacitated Discrete Unit Disk Cover. WALCOM 2019: 407-418 - [e1]Gautam K. Das, Partha Sarathi Mandal, Krishnendu Mukhopadhyaya, Shin-Ichi Nakano:
WALCOM: Algorithms and Computation - 13th International Conference, WALCOM 2019, Guwahati, India, February 27 - March 2, 2019, Proceedings. Lecture Notes in Computer Science 11355, Springer 2019, ISBN 978-3-030-10563-1 [contents] - [i5]Sangram Kishor Jena, Ramesh K. Jallu, Gautam K. Das:
Generalized Liar's Dominating Set in Graphs. CoRR abs/1907.11416 (2019) - 2018
- [j15]Manjanna Basappa, Gautam K. Das:
Discrete unit square cover problem. Discret. Math. Algorithms Appl. 10(6): 1850072:1-1850072:18 (2018) - [c22]Ramesh K. Jallu, Sangram Kishor Jena, Gautam K. Das:
Liar's Dominating Set in Unit Disk Graphs. COCOON 2018: 516-528 - [c21]Sangram Kishor Jena, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy:
The Maximum Distance-d Independent Set Problem on Unit Disk Graphs. FAW 2018: 68-80 - [c20]Nitesh Tripathi, Manjish Pal, Minati De, Gautam K. Das, Subhas C. Nandy:
Guarding Polyhedral Terrain by k-Watchtowers. FAW 2018: 112-125 - 2017
- [j14]Ramesh K. Jallu, Prajwal R. Prasad, Gautam K. Das:
Distributed construction of connected dominating set in unit disk graphs. J. Parallel Distributed Comput. 104: 159-166 (2017) - [c19]Ramesh K. Jallu, Gautam K. Das:
Liar's Domination in 2D. CALDAM 2017: 219-229 - 2016
- [c18]Manjanna Basappa, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy:
The Euclidean k-Supplier Problem in. ALGOSENSORS 2016: 129-140 - [c17]Ramesh K. Jallu, Gautam K. Das:
Improved Algorithm for Maximum Independent Set on Unit Disk Graph. CALDAM 2016: 212-223 - [i4]Ramesh K. Jallu, Gautam K. Das:
Hardness of Liar's Domination on Unit Disk Graphs. CoRR abs/1611.07808 (2016) - 2015
- [j13]Paz Carmi, Gautam K. Das, Ramesh K. Jallu, Subhas C. Nandy, Prajwal R. Prasad, Yael Stein:
Minimum Dominating Set Problem for Unit Disks Revisited. Int. J. Comput. Geom. Appl. 25(3): 227- (2015) - [j12]Gautam K. Das, Minati De, Sudeshna Kolay, Subhas C. Nandy, Susmita Sur-Kolay:
Approximation algorithms for maximum independent set of a unit disk graph. Inf. Process. Lett. 115(3): 439-446 (2015) - [j11]Manjanna Basappa, Rashmisnata Acharyya, Gautam K. Das:
Unit disk cover problem in 2D. J. Discrete Algorithms 33: 193-201 (2015) - [c16]Manjanna Basappa, Ramesh K. Jallu, Gautam K. Das:
Constrained k-Center Problem on a Convex Polygon. ICCSA (2) 2015: 209-222 - 2013
- [j10]Minati De, Gautam K. Das, Paz Carmi, Subhas C. Nandy:
Approximation Algorithms for a Variant of discrete Piercing Set Problem for Unit Disks. Int. J. Comput. Geom. Appl. 23(6): 461- (2013) - [c15]Rashmisnata Acharyya, Manjanna Basappa, Gautam K. Das:
Unit Disk Cover Problem in 2D. ICCSA (2) 2013: 73-85 - [c14]Pragya Agrawal, Gautam K. Das:
Improved Interference in Wireless Sensor Networks. ICDCIT 2013: 92-102 - [i3]Ramesh K. Jallu, Prajwal R. Prasad, Gautam K. Das:
Minimum Dominating Set for a Point Set in $\IR^2$. CoRR abs/1312.7243 (2013) - 2012
- [j9]Gautam K. Das, Robert Fraser, Alejandro López-Ortiz, Bradford G. Nickerson:
On the discrete Unit Disk Cover Problem. Int. J. Comput. Geom. Appl. 22(5): 407-420 (2012) - [i2]Pragya Agrawal, Gautam K. Das:
Improved Interference in Wireless Sensor Networks. CoRR abs/1207.5708 (2012) - [i1]Rashmisnata Acharyya, Manjanna Basappa, Gautam K. Das:
Unit Disk Cover Problem. CoRR abs/1209.2951 (2012) - 2011
- [c13]Minati De, Gautam K. Das, Subhas C. Nandy:
Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks. CCCG 2011 - [c12]Gautam K. Das, Robert Fraser, Alejandro López-Ortiz, Bradford G. Nickerson:
On the Discrete Unit Disk Cover Problem. WALCOM 2011: 146-157 - 2010
- [j8]Gautam K. Das, Sandip Das, Subhas C. Nandy:
Homogeneous 2-hop broadcast in 2D. Comput. Geom. 43(2): 182-190 (2010) - [j7]Francisco Claude, Gautam K. Das, Reza Dorrigiv, Stephane Durocher, Robert Fraser, Alejandro López-Ortiz, Bradford G. Nickerson, Alejandro Salinger:
An Improved Line-Separable Algorithm for Discrete Unit Disk Cover. Discret. Math. Algorithms Appl. 2(1): 77-88 (2010) - [c11]Gautam K. Das, Asish Mukhopadhyay, Subhas C. Nandy, Sangameswar Patil, S. V. Rao:
Computing the straight skeleton of a monotone polygon in O(n log n) time. CCCG 2010: 207-210 - [c10]Gautam K. Das, Bradford G. Nickerson:
I/O-efficient triangular range search and its application. CCCG 2010: 245-248 - [c9]Gautam K. Das, Bradford G. Nickerson:
I/O-Efficient Rectangular Segment Search. ICCSA Workshops 2010: 61-67
2000 – 2009
- 2009
- [j6]Gautam K. Das, Debapriyay Mukhopadhyay, Subhas C. Nandy:
Improved algorithm for the widest empty 1-corner corridor. Inf. Process. Lett. 109(18): 1060-1065 (2009) - [c8]Gautam K. Das, Debapriyay Mukhopadhyay, Subhas C. Nandy:
Improved Algorithm for a Widest 1-Corner Corridor. WALCOM 2009: 83-92 - 2008
- [j5]Gautam K. Das, Sasanka Roy, Sandip Das, Subhas C. Nandy:
Variations of Base-Station Placement Problem on the Boundary of a Convex Region. Int. J. Found. Comput. Sci. 19(2): 405-427 (2008) - [j4]Gautam K. Das, Subhas C. Nandy:
Weighted broadcast in linear radio networks. Inf. Process. Lett. 106(4): 136-143 (2008) - 2007
- [j3]Gautam K. Das, Sasthi C. Ghosh, Subhas C. Nandy:
Improved Algorithm for Minimum Cost Range Assignment Problem for Linear Radio Networks. Int. J. Found. Comput. Sci. 18(3): 619-635 (2007) - [c7]Gautam K. Das, Sasanka Roy, Sandip Das, Subhas C. Nandy:
Base Station Placement Problem on the Boundary of a Convex Region. WALCOM 2007: 151-152 - 2006
- [j2]Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhabani P. Sinha:
Efficient algorithm for placing a given number of base stations to cover a convex region. J. Parallel Distributed Comput. 66(11): 1353-1358 (2006) - [j1]Gautam K. Das, Sandip Das, Subhas C. Nandy:
Range assignment for energy efficient broadcasting in linear radio networks. Theor. Comput. Sci. 352(1-3): 332-341 (2006) - [c6]Gautam K. Das, Subhas C. Nandy:
Weighted Broadcast in Linear Radio Networks. AAIM 2006: 343-353 - [c5]Gautam K. Das, Sandip Das, Subhas C. Nandy:
Homogeneous 2-Hops Broadcast in 2D. ICCSA (2) 2006: 750-759 - 2005
- [c4]Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhabani P. Sinha:
Placing a Given Number of Base Stations to Cover a Convex Region. IWDC 2005: 57-62 - 2004
- [c3]Gautam K. Das, Sasthi C. Ghosh, Subhas C. Nandy:
An efficient heuristic algorithm for 2D h-hops range assignment problem. GLOBECOM 2004: 1051-1055 - [c2]Gautam K. Das, Sandip Das, Subhas C. Nandy:
Efficient Algorithm for Energy Efficient Broadcasting in Linear Radio Networks. HiPC 2004: 420-429 - [c1]Gautam K. Das, Sasthi C. Ghosh, Subhas C. Nandy:
Improved Algorithm for Minimum Cost Range Assignment Problem for Linear Radio Networks. IWDC 2004: 412-423
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-03-22 19:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
