default search action
Arijit Bishnu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j26]Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, Gopinath Mishra
:
Faster Counting and Sampling Algorithms using Colorful Decision Oracle. ACM Trans. Comput. Theory 16(2): 12:1-12:19 (2024) - [c34]Arijit Bishnu, Mathew C. Francis, Pritam Majumder:
Geometric Covering Number: Covering Points with Curves. CALDAM 2024: 88-102 - [i21]Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Sayantan Sen:
Near Uniform Triangle Sampling Over Adjacency List Graph Streams. CoRR abs/2405.10167 (2024) - 2023
- [j25]Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh:
Almost optimal query algorithm for hitting set using a subset query. J. Comput. Syst. Sci. 137: 50-65 (2023) - [j24]Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh:
Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams. Theory Comput. Syst. 67(6): 1241-1267 (2023) - [c33]Arijit Bishnu, Arijit Ghosh, Gopinath Mishra:
On the Complexity of Triangle Counting Using Emptiness Queries. APPROX/RANDOM 2023: 48:1-48:22 - 2022
- [c32]Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar
Counting and Sampling from Substructures Using Linear Algebraic Queries. FSTTCS 2022: 8:1-8:20 - [c31]Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, Gopinath Mishra:
Faster Counting and Sampling Algorithms Using Colorful Decision Oracle. STACS 2022: 10:1-10:16 - [i20]Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, Gopinath Mishra:
Faster Counting and Sampling Algorithms using Colorful Decision Oracle. CoRR abs/2201.04975 (2022) - 2021
- [j23]Binay Bhattacharya, Arijit Bishnu, Otfried Cheong
Computation of spatial skyline points. Comput. Geom. 93: 101698 (2021) - [j22]Arijit Bishnu, Arijit Ghosh, Rogers Mathew
Grid obstacle representation of graphs. Discret. Appl. Math. 296: 39-51 (2021) - [j21]Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, Gopinath Mishra:
On Triangle Estimation Using Tripartite Independent Set Queries. Theory Comput. Syst. 65(8): 1165-1192 (2021) - [c30]Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar
Query Complexity of Global Minimum Cut. APPROX-RANDOM 2021: 6:1-6:15 - [c29]Arijit Bishnu, Arijit Ghosh, Gopinath Mishra:
Distance Estimation Between Unknown Matrices Using Sublinear Projections on Hamming Cube. APPROX-RANDOM 2021: 44:1-44:22 - [c28]Anup Bhattacharya, Arijit Bishnu, Gopinath Mishra, Anannya Upasana:
Even the Easiest(?) Graph Coloring Problem Is Not Easy in Streaming! ITCS 2021: 15:1-15:19 - [i19]Arijit Bishnu, Arijit Ghosh, Gopinath Mishra:
Distance Estimation Between Unknown Matrices Using Sublinear Projections on Hamming Cube. CoRR abs/2107.02666 (2021) - [i18]Arijit Bishnu, Arijit Ghosh, Gopinath Mishra:
Bipartite Independent Set Oracles and Beyond: Can it Even Count Triangles in Polylogarithmic Queries? CoRR abs/2110.03836 (2021) - 2020
- [j20]Arijit Bishnu, Sameer Desai, Arijit Ghosh, Gopinath Mishra, Subhabrata Paul:
Existence of planar support for geometric hypergraphs using elementary techniques. Discret. Math. 343(6): 111853 (2020) - [c27]Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh:
Fixed Parameter Tractability of Graph Deletion Problems over Data Streams. COCOON 2020: 652-663 - [c26]Manu Basavaraju, Arijit Bishnu, Mathew C. Francis, Drimit Pattanayak:
The Linear Arboricity Conjecture for 3-Degenerate Graphs. WG 2020: 376-387 - [i17]Manu Basavaraju, Arijit Bishnu, Mathew C. Francis, Drimit Pattanayak:
The linear arboricity conjecture for 3-degenerate graphs. CoRR abs/2007.06066 (2020) - [i16]Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar:
Query Complexity of Global Minimum Cut. CoRR abs/2007.09202 (2020) - [i15]Anup Bhattacharya, Arijit Bishnu, Gopinath Mishra, Anannya Upasana:
Even the Easiest(?) Graph Coloring Problem is not Easy in Streaming! CoRR abs/2010.13143 (2020) - [i14]Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar:
Query Complexity of Global Minimum Cut. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c25]Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, Gopinath Mishra:
Triangle Estimation Using Tripartite Independent Set Queries. ISAAC 2019: 19:1-19:17 - [i13]Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh:
Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams. CoRR abs/1906.05458 (2019) - [i12]Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar:
Inner Product Oracle can Estimate and Sample. CoRR abs/1906.07398 (2019) - [i11]Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, Gopinath Mishra:
Hyperedge Estimation using Polylogarithmic Subset Queries. CoRR abs/1908.04196 (2019) - 2018
- [c24]Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh:
Parameterized Query Complexity of Hitting Set Using Stability of Sunflowers. ISAAC 2018: 25:1-25:12 - [i10]Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Sandeep Sen:
On the streaming complexity of fundamental geometric problems. CoRR abs/1803.06875 (2018) - [i9]Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh:
Parameterized Query Complexity of Hitting Set using Stability of Sunflowers. CoRR abs/1807.06272 (2018) - [i8]Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, Gopinath Mishra:
Triangle Estimation using Polylogarithmic Queries. CoRR abs/1808.00691 (2018) - 2017
- [j19]Arijit Bishnu, Arijit Ghosh, Subhabrata Paul:
Linear kernels for k-tuple and liar's domination in bounded genus graphs. Discret. Appl. Math. 231: 67-77 (2017) - [j18]Arijit Bishnu, Sameer Desai, Arijit Ghosh, Mayank Goswami, Subhabrata Paul:
Uniformity of Point Samples in Metric Spaces Using Gap Ratio. SIAM J. Discret. Math. 31(3): 2138-2171 (2017) - [i7]Arijit Bishnu, Arijit Ghosh, Rogers Mathew, Gopinath Mishra, Subhabrata Paul:
Grid obstacle representation of graphs. CoRR abs/1708.01765 (2017) - 2016
- [j17]Arijit Bishnu, Kunal Dutta
(1, j)-set problem in graphs. Discret. Math. 339(10): 2515-2525 (2016) - 2015
- [c23]Arijit Bishnu, Amit Chakrabarti
On Density, Threshold and Emptiness Queries for Intervals in the Streaming Model. FSTTCS 2015: 336-349 - [c22]Arijit Bishnu, Sameer Desai, Arijit Ghosh, Mayank Goswami, Subhabrata Paul:
Uniformity of Point Samples in Metric Spaces Using Gap Ratio. TAMC 2015: 347-358 - 2014
- [j16]Dinesh Dash
Line coverage measures in wireless sensor networks. J. Parallel Distributed Comput. 74(7): 2596-2614 (2014) - [i6]Arijit Bishnu, Kunal Dutta, Arijit Ghosh, Subhabrata Paul:
$(1, j)$-set problem in graphs. CoRR abs/1410.3091 (2014) - [i5]Arijit Bishnu, Sameer Desai, Arijit Ghosh, Mayank Goswami, Subhabrata Paul:
Uniformity of point samples in metric spaces using gap ratio. CoRR abs/1411.7819 (2014) - 2013
- [j15]Arindam Khan, Sudebkumar Prasant Pal, Mridul Aanjaneya, Arijit Bishnu, Subhas C. Nandy:
Diffuse reflection diameter and radius for convex-quadrilateralizable polygons. Discret. Appl. Math. 161(10-11): 1496-1505 (2013) - [j14]Dinesh Dash
Approximation algorithms for deployment of sensors for line segment coverage in wireless sensor networks. Wirel. Networks 19(5): 857-870 (2013) - [i4]Arijit Bishnu, Subir Kumar Ghosh, Partha P. Goswami, Sudebkumar Prasant Pal, Swami Sarvattomananda:
An Algorithm for Computing Constrained Reflection Paths in Simple Polygon. CoRR abs/1304.4320 (2013) - [i3]Arijit Bishnu, Arijit Ghosh, Subhabrata Paul:
Parameterized complexity of k-tuple and liar's domination. CoRR abs/1309.5461 (2013) - 2012
- [c21]Dinesh Dash
Approximation algorithms for deployment of sensors for line segment coverage in wireless sensor networks. COMSNETS 2012: 1-10 - [c20]Dinesh Dash
Finding the Quality of Line Coverage of a Sensor Network - (Poster Paper). ICDCN 2012: 214-217 - 2011
- [j13]Debashis Mondal, Abhay Kumar, Arijit Bishnu, Krishnendu Mukhopadhyaya
Measuring the Quality of Surveillance in a Wireless Sensor Network. Int. J. Found. Comput. Sci. 22(4): 983-998 (2011) - 2010
- [j12]Dinesh Dash
Dynamic Maintenance of Support Coverage in Sensor Networks. Parallel Process. Lett. 20(2): 155-172 (2010) - [c19]Sanjib Sadhu, Arijit Bishnu, Subhas C. Nandy, Partha P. Goswami:
Cluster connecting problem inside a polygon. CCCG 2010: 265-268 - [c18]Binay K. Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink
Computation of Non-dominated Points Using Compact Voronoi Diagrams. WALCOM 2010: 82-93 - [c17]Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya:
A Simple Algorithm for Approximate Partial Point Set Pattern Matching under Rigid Motion. WALCOM 2010: 102-112 - [i2]Dinesh Dash, Arijit Bishnu, Arobinda Gupta, Subhas C. Nandy:
Approximation Algorithm for Line Segment Coverage for Wireless Sensor Network. CoRR abs/1006.2955 (2010)
2000 – 2009
- 2009
- [j11]Anvesh Komuravelli, Arnab Sinha, Arijit Bishnu:
Connectivity preserving transformations for higher dimensional binary images. Discret. Appl. Math. 157(16): 3372-3385 (2009) - [j10]Pritha Banerjee
Fast Unified Floorplan Topology Generation and Sizing on Heterogeneous FPGAs. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 28(5): 651-661 (2009) - [j9]Pritha Banerjee
FPGA placement using space-filling curves: Theory meets practice. ACM Trans. Embed. Comput. Syst. 9(2): 12:1-12:23 (2009) - [c16]Arijit Ghosh, Rushin Shah, Arijit Bishnu, Bhargab B. Bhattacharya:
Algorithms for Biological Cell Sorting with a Lab-on-a-chip. NaBIC 2009: 104-109 - [i1]Binay K. Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink:
On Finding Non-dominated Points using Compact Voronoi Diagrams. CoRR abs/0909.0814 (2009) - 2008
- [c15]Anvesh Komuravelli, Arnab Sinha, Arijit Bishnu:
Connectivity Preserving Voxel Transformation. IWCIA 2008: 1-12 - [c14]Bishal Prasad, Arijit Bishnu, Tetsuo Asano:
Linear Boundary and Corner Detection Using Limited Number of Sensor Rows. IWCIA 2008: 250-261 - 2007
- [j8]Sabyasachi Dey, Bhargab B. Bhattacharya, Malay K. Kundu, Arijit Bishnu, Tinku Acharya:
A Co-processor for Computing the Euler Number of a Binary Image using Divide-and-Conquer Strategy. Fundam. Informaticae 76(1-2): 75-89 (2007) - [j7]Xuefeng Liang, Arijit Bishnu, Tetsuo Asano:
A Combinatorial Approach to Fingerprint Binarization and Minutiae Extraction Using Euclidean Distance Transform. Int. J. Pattern Recognit. Artif. Intell. 21(7): 1141-1158 (2007) - [j6]Arijit Bishnu, Bhargab B. Bhattacharya:
Stacked Euler Vector (SERVE): A Gray-Tone Image Feature Based on Bit-Plane Augmentation. IEEE Trans. Pattern Anal. Mach. Intell. 29(2): 350-355 (2007) - [j5]Xuefeng Liang, Arijit Bishnu, Tetsuo Asano:
A Robust Fingerprint Indexing Scheme Using Minutia Neighborhood Structure and Low-Order Delaunay Triangles. IEEE Trans. Inf. Forensics Secur. 2(4): 721-733 (2007) - [c13]Anirvan DuttaGupta, Arijit Bishnu, Indranil Sengupta:
Maximal Breach in Wireless Sensor Networks: Geometric Characterization and Algorithms. ALGOSENSORS 2007: 126-137 - [c12]Pritha Banerjee
Floorplanning in Modern FPGAs. VLSI Design 2007: 893-898 - 2006
- [j4]Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya:
Simple algorithms for partial point set pattern matching under rigid motion. Pattern Recognit. 39(9): 1662-1671 (2006) - [c11]Anirvan DuttaGupta, Arijit Bishnu, Indranil Sengupta:
Optimisation Problems Based on the Maximal Breach Path Measure for Wireless Sensor Network Coverage. ICDCIT 2006: 27-40 - [c10]Xuefeng Liang, Tetsuo Asano, Arijit Bishnu:
Distorted Fingerprint Indexing Using Minutia Detail and Delaunay Triangle. ISVD 2006: 217-223 - 2005
- [j3]Partha Bhowmick, Arijit Bishnu, Bhargab B. Bhattacharya, Malay Kumar Kundu, C. A. Murthy, Tinku Acharya:
Determination of Minutiae Scores for Fingerprint Image Applications. Int. J. Image Graph. 5(3): 537-572 (2005) - [j2]Arijit Bishnu, Bhargab B. Bhattacharya, Malay K. Kundu, C. A. Murthy, Tinku Acharya:
A pipeline architecture for computing the Euler number of a binary image. J. Syst. Archit. 51(8): 470-487 (2005) - [j1]Arijit Bishnu, Bhargab B. Bhattacharya, Malay Kumar Kundu, C. A. Murthy, Tinku Acharya:
Euler vector for search and retrieval of gray-tone images. IEEE Trans. Syst. Man Cybern. Part B 35(4): 801-812 (2005) - [c9]Piyush Kanti Bhunre, C. A. Murthy, Arijit Bishnu, Bhargab B. Bhattacharya, Malay Kumar Kundu:
A Hybrid Data and Space Partitioning Technique for Similarity Queries on Bounded Clusters. PReMI 2005: 544-550 - 2004
- [c8]Xuefeng Liang, Arijit Bishnu, Tetsuo Asano:
A Near-Linear Time Algorithm for Binarization of Fingerprint Images Using Distance Transform. IWCIA 2004: 197-208 - 2003
- [c7]Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya:
An Improved Algorithm for Point Set Pattern Matching under Rigid Motion. CIAC 2003: 36-45 - 2002
- [c6]Arijit Bishnu, Swarup Bhunia, C. A. Murthy, Bhargab B. Bhattacharya, Malay Kumar Kundu, Tinku Acharya:
Content based image retrieval: related issues using Euler vector. ICIP (2) 2002: 585-588 - [c5]Partha Bhowmick, Arijit Bishnu, Bhargab B. Bhattacharya, Malay Kumar Kundu, C. A. Murthy, Tinku Acharya:
Determination of Minutiae Scores for Fingerprint Image Applications. ICVGIP 2002 - [c4]Arijit Bishnu, Partha Bhowmick, Sabyasachi Dey, Bhargab B. Bhattacharya, Malay Kumar Kundu, C. A. Murthy, Tinku Acharya:
Combinatorial Classification of Pixels for Ridge Extraction in a Gray-Scale Fingerprint Image. ICVGIP 2002 - [c3]Arijit Bishnu, Bhargab B. Bhattacharya, Malay Kumar Kundu, C. A. Murthy, Tinku Acharya:
Euler Vector: A Combinatorial Signature for Gray-Tone Images. ITCC 2002: 121-127 - 2001
- [c2]Arijit Bishnu, Bhargab B. Bhattacharya, Malay Kumar Kundu, C. A. Murthy, Tinku Acharya:
On-chip computation of Euler number of a binary image for efficient database search. ICIP (3) 2001: 310-313
1990 – 1999
- 1999
- [c1]Arijit Bishnu, B. B. Chaudhuri:
Segmentation of Bangla Handwritten Text into Characters by Recursive Contour Following. ICDAR 1999: 402-405
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-10-09 20:27 CEST 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: