Publications

Komusiewicz, Christian, Diptapriyo Majumdar and Frank Sommer (2026). ‘Polynomial-Size Enumeration Kernelizations for Long Path Enumeration’. In: Graph-Theoretic Concepts in Computer Science. Ed. by Henning Fernau and Philipp Kindermann. Cham: Springer Nature Switzerland, pp. 331–344. isbn: 978-3-032-11835-6. doi: 10 . 1007 / 978 - 3 - 032 - 11835 - 6 _ 24. url: https://doi.org/10.1007/978-3-032-11835-6_24.

Ágoston, Péter, Adrian Dumitrescu, Arsenii Sagdeev, Karamjeet Singh and Ji Zeng(2026). ‘Maximizing the maximum degree in ordered nearest neighbor graphs’. In: Computational Geometry 132, p. 102229. issn: 0925-7721. doi: https://doi.org/10.1016/j.comgeo.2025.102229. url: https://www.sciencedirect.com/science/article/pii/S0925772125000677.

Ágoston, Péter, Adrian Dumitrescu, Arsenii Sagdeev, Karamjeet Singh and Ji Zeng (2025). Ordered Yao graphs: maximum degree, edge numbers, and clique numbers. arXiv: 2504.13819 [math.CO]. url: https://arxiv.org/abs/2504.13819.

Damásdi, Gábor, Balázs Keszegh, Dömötör Pálvölgyi and Karamjeet Singh (2025). ‘The complexity of recognizing ABAB-free hypergraphs’. In: Discrete Mathematics & Theoretical Computer Science (DMTCS) 27.Special issues. doi: 10.46298/dmtcs.14610. url: http://dx.doi.org/10.46298/dmtcs.14610.

Bera, Debajyoti and Santanu Majhi (2025). ‘Reviving a Grover based Quantum Secret Sharing Scheme’. In: IACR Cryptol. ePrint Arch., p. 1008. URL: https://eprint.iacr.org/2025/1008.

Chakraborty, Dipayan, Florent Foucaud, Diptapriyo Majumdar and Prafullkumar Tale (2025). ‘Structural Parameterization of Locating-Dominating Set and Test Cover’. In: Algorithms and Complexity - 14th International Conference, CIAC 2025, Rome, Italy, June 10-12, 2025, Pro-ceedings, Part I. Ed. by Irene Finocchi and Loukas Georgiadis. Vol. 15679. Lecture Notes in Computer Science. Springer, pp. 187–204. DOI: 10 . 1007 / 978 - 3 - 031 - 92932 - 8 \ _13. URL: https://doi.org/10.1007/978-3-031-92932-8%5C_13.

Chatterjee, Sagnik, Manuj Mukherjee and Alhad Sethi (2025). ‘Generalization Bounds for Dependent Data using Online-to-Batch Conversion’. In: International Conference on Artificial Intelligence and Statistics, AISTATS 2025, Mai Khao, Thailand, 3-5 May 2025. Ed. by Yingzhen Li, Stephan Mandt, Shipra Agrawal and Mohammad Emtiyaz Khan. Vol. 258. Proceedings of Machine Learning Research. PMLR, pp. 2152–2160. url: https://proceedings.mlr.press/v258/chatterjee25b.html.

Crampton, Jason, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan and Diptapriyo Majumdar (2025). ‘Bi-objective Optimization in Role Mining’. In: ACM Trans. Priv. Secur. 28.1, 5:1–5:22. DOI: 10.1145/3697833. URL: https://doi.org/10.1145/3697833.

Das, Syamantak and Andreas Wiese (2025). ‘A simpler QPTAS for scheduling jobs with precedence constraints’. In: CoRR abs/2501.09091. DOI: 10.48550/ARXIV.2501.09091. arXiv: 2501.09091. URL: https://doi.org/10.48550/arXiv.2501.09091.

Goyal, Dishant, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar and Venkatesh Raman (2025). ‘Parameterized complexity of dominating set variants in almost cluster and split graphs’. In: J. Comput. Syst. Sci. 150, p. 103631. DOI: 10.1016/J.JCSS.2025.103631. URL: https://doi.org/10.1016/j.jcss.2025.103631.

Raman, Rajiv and Karamjeet Singh (2025a). ‘On Supports for graphs of bounded genus’. In: CoRR abs/2503.21287. DOI: 10.48550/ARXIV.2503.21287. arXiv: 2503.21287. URL: https://doi.org/10.48550/arXiv.2503.21287.

— (2025b). ‘Supports for Outerplanar and Bounded Treewidth Graphs’. In: CoRR abs/2504.05039. DOI: 10.48550/ARXIV.2504.05039. arXiv: 2504.05039. URL: https://doi.org/10.48550/arXiv.2504.05039.

Raychaudhury, Rahul, Wen-Zhi Li, Syamantak Das, Sainyam Galhotra and Stavros Sintos (2025). ‘Metric Clustering and Graph Optimization Problems using Weak Comparison Oracles’. In: The Thirty Eighth Annual Conference on Learning Theory, 30-4 July 2025, Lyon, France. Ed. by Nika Haghtalab and Ankur Moitra. Vol. 291. Proceedings of Machine Learning Research. PMLR, pp. 4777–4830. URL: https://proceedings.mlr.press/v291/raychaudhury25a.html.

Acharyya, Ankush, Vahideh Keikha, Diptapriyo Majumdar and Supantha Pandit (2024). ‘Constrained hitting set problem with intervals: Hardness, FPT and approximation algorithms’. In: Theor. Comput. Sci. 990, p. 114402. DOI: 10 . 1016 / J . TCS . 2024 . 114402. URL: https://doi.org/10.1016/j.tcs.2024.114402.

Aggarwal, Mudit and Manuj Mukherjee (2024a). ‘Improved Bounds on the Interactive Capacity via Error Pattern Analysis’. In: IEEE International Symposium on Information Theory, ISIT 2024, Athens, Greece, July 7-12, 2024. IEEE, pp. 2975–2980. doi: 10.1109/ISIT57864.2024. 10619345. url: https://doi.org/10.1109/ISIT57864.2024.10619345.

— (2024b). ‘Improved bounds on the interactive capacity via error pattern analysis’. In: CoRR abs/2401.15355. doi: 10.48550/ARXIV.2401.15355. arXiv: 2401.15355. url: https://doi.org/10.48550/arXiv.2401.15355.

Ahmed, Syed Quiser, Bharathi Vokkaliga Ganesh, Sathyanarayana Sampath Kumar, Prakhar Mishra, Ravi Anand and Bhanuteja Akurathi (2024). ‘A Comprehensive Review of Adversarial Attacks on Machine Learning’. In: CoRR abs/2412.11384. DOI: 10.48550/ARXIV.2412.11384. arXiv: 2412.11384. URL: https://doi.org/10.48550/arXiv.2412.11384.

Anand, Ravi, Subhadeep Banik, Andrea Caforio, Tatsuya Ishikawa, Takanori Isobe, Fukang Liu, Kazuhiko Minematsu, Mostafizar Rahman and Kosei Sakamoto (2024). ‘Gleeok: A Family of Low-Latency PRFs and its Applications to Authenticated Encryption’. In: IACR Trans. Cryptogr. Hardw. Embed. Syst. 2024.2, pp. 545–587. DOI: 10.46586/TCHES.V2024.I2.545- 587. URL: https://doi.org/10.46586/tches.v2024.i2.545-587.

Anand, Ravi, Shibam Ghosh, Takanori Isobe and Rentaro Shiba (2024a). ‘Quantum Key Recovery Attacks on 4-Round Iterated Even-Mansour with Two Keys’. In: Information Security - 27th International Conference, ISC 2024, Arlington, VA, USA, October 23-25, 2024, Proceedings, Part I. Ed. by Nicky Mouha and Nick Nikiforakis. Vol. 15257. Lecture Notes in Computer Science. Springer, pp. 87–103. DOI: 10.1007/978-3-031-75757-0\_5. URL: https://doi.org/10.1007/978-3-031-75757-0%5C_5.

— (2024b). ‘Quantum Key Recovery Attacks on 4-round Iterated Even-Mansour with Two Keys’. In: IACR Cryptol. ePrint Arch., p. 1278. URL: https://eprint.iacr.org/2024/1278.

Anand, Ravi, Takanori Isobe, Anup Kumar Kundu, Mostafizar Rahman and Sahiba Suryawanshi (2024). ‘Differential fault attack on AES-based encryption schemes: application to B5G/6G ciphers - Rocca, Rocca-S and AEGIS’. In: J. Cryptogr. Eng. 14.4, pp. 595–607. DOI: 10.1007/S13389-024-00360-6. URL: https://doi.org/10.1007/s13389-024-00360-6.

Anand, Ravi and Rajib Kumar Mandal (2024). ‘A novel 13-level switched-capacitor step-up inverter with reduced component count’. In: Int. J. Circuit Theory Appl. 52.10, pp. 5295–5317. DOI: 10.1002/CTA.4002. URL: https://doi.org/10.1002/cta.4002.

Anand, Ravi, Rimpa Nandi and Takanori Isobe (2024). ‘Analysis of Atom against quantum attacks’. In: IET Quantum Commun. 5.1, pp. 88–102. DOI: 10.1049/QTC2.12076. URL: https://doi.org/10.1049/qtc2.12076.

Bandopadhyay, Susobhan, Suman Banerjee, Diptapriyo Majumdar and Fahad Panolan (2024). ‘Parameterized Complexity of Shortest Path with Positive Disjunctive Constraints’. In: Combinatorial Optimization and Applications - 17th International Conference, COCOA 2024, Beijing, China, December 6-8, 2024, Proceedings, Part II. Ed. by Donglei Du, Lu Han and Dachuan Xu. Vol. 15435. Lecture Notes in Computer Science. Springer, pp. 14–25. DOI: 10.1007/978-981-96-4448-3\_2. URL: https://doi.org/10.1007/978-981-96-4448-3%5C_2.

Bandopadhyay, Susobhan, Aritra Banik, Diptapriyo Majumdar and Abhishek Sahu (2024). ‘Tractability of Packing Vertex-Disjoint A-Paths Under Length Constraints’. In: 49th International Symposium on Mathematical Foundations of Computer Science, MFCS 2024, August 26-30, 2024, Bratislava, Slovakia. Ed. by Rastislav Královic and Antonín Kucera. Vol. 306. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 16:1–16:18. DOI: 10.4230/LIPICS.MFCS.2024.16. URL: https://doi.org/10.4230/LIPIcs.MFCS.2024.16.

Bera,DebajyotiandSAPVTharrmashastha(2024a).‘Low-Space Quantum Algorithms for Estimate-Mark-Amplify Tasks’. In: Proceedings of the 25th Italian Conference on Theoretical Computer Science, Torino, Italy, September 11-13, 2024. Ed. by Ugo de’Liguoro, Matteo Palazzo and Luca Roversi. Vol. 3811. CEUR Workshop Proceedings. CEUR-WS.org, pp. 42–65. URL: https://ceur-ws.org/Vol-3811/paper260.pdf.

Bera, Debajyoti and SAPV Tharrmashastha (2024b). ‘Quantum Query-Space Lower Bounds Using Branching Programs’. In: CoRR abs/2407.06872. DOI: 10.48550/ARXIV.2407.06872. arXiv: 2407.06872. URL: https://doi.org/10.48550/arXiv.2407.06872.

Bisht, Pranav, Nikhil Gupta, Prajakta Nimbhorkar and Ilya Volkovich (2024). ‘Launching Identity Testing into (Bounded) Space’. In: Electron. Colloquium Comput. Complex. TR24-041. ECCC: TR24-041. URL: https://eccc.weizmann.ac.il/report/2024/041.

Chakraborty, Dipayan, Florent Foucaud, Diptapriyo Majumdar and Prafullkumar Tale (2024a). ‘Structural Parameterization of Locating-Dominating Set and Test Cover’. In:CoRR abs/2411.17948. DOI: 10.48550/ARXIV.2411.17948. arXiv: 2411.17948. URL: https://doi.org/10.48550/arXiv.2411.17948.

— (2024b). ‘Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover’. In: 35th International Symposium on Algorithms and Computation, ISAAC 2024, December 8-11, 2024, Sydney, Australia. Ed. by Julián Mestre and Anthony Wirth. Vol. 322. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 19:1–19:18. DOI: 10.4230/LIPICS.ISAAC.2024.19. URL: https://doi.org/10.4230/LIPIcs.ISAAC.2024.19.

— (2024c). ‘Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover’. In: CoRR abs/2402.08346. DOI: 10 . 48550 / ARXIV . 2402 . 08346. arXiv: 2402.08346. URL: https://doi.org/10.48550/arXiv.2402.08346.

Chatterjee, Sagnik, SAPV Tharrmashastha and Debajyoti Bera (2024). ‘Efficient Quantum Agnostic Improper Learning of Decision Trees’. In: International Conference on Artificial Intelligence and Statistics, 2-4 May 2024, Palau de Congressos, Valencia, Spain. Ed. by Sanjoy Dasgupta, Stephan Mandt and Yingzhen Li. Vol. 238. Proceedings of Machine Learning Research. PMLR, pp. 514–522. URL: https://proceedings.mlr.press/v238/chatterjee24a.html.

Crampton, Jason, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan and Diptapriyo Majumdar (2024). ‘Bi-objective Optimization in Role Mining’. In: CoRR abs/2403.16757. DOI: 10.48550/ARXIV.2403.16757. arXiv: 2403.16757. URL: https://doi.org/10.48550/arXiv.2403.16757.

Dalal, Suryendu, Rahul Gangopadhyay, Rajiv Raman and Saurabh Ray (2024a). ‘Sweeping Arrangements of Non-Piercing Curves in Plane’. In: CoRR abs/2403.16474. DOI: 10.48550/ARXIV.2403.16474. arXiv: 2403.16474. URL: https://doi.org/10.48550/arXiv.2403.16474.

— (2024b). ‘Sweeping Arrangements of Non-Piercing Regions in the Plane’. In: 40th International Symposium on Computational Geometry, SoCG 2024, June 11-14, 2024, Athens, Greece. Ed. by Wolfgang Mulzer and Jeff M. Phillips. Vol. 293. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 45:1–45:15. DOI: 10.4230/LIPICS.SOCG.2024.45. URL: https://doi.org/10.4230/LIPIcs.SoCG.2024.45.

Das, Syamantak, Nikhil Kumar and Daniel Vaz (2024a). ‘Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs’. In: 49th International Symposium on Mathematical Foundations of Computer Science, MFCS 2024, August 26-30, 2024, Bratislava, Slovakia. Ed. by Rastislav Královic and Antonín Kucera. Vol. 306. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 45:1–45:17. DOI: 10.4230/LIPICS.MFCS.2024.45. URL: https://doi.org/10.4230/LIPIcs.MFCS.2024.45.

— (2024b). ‘Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs’. In:CoRR abs/2407.09433. DOI: 10.48550/ARXIV.2407.09433. arXiv: 2407.09433. URL: https://doi.org/10.48550/arXiv.2407.09433.

Goyal, Dishant, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar and Venkatesh Raman (2024). ‘Parameterized Complexity of Dominating Set Variants in Almost Cluster and Split Graphs’. In: CoRR abs/2405.10556. DOI: 10.48550/ARXIV.2405.10556. arXiv: 2405.10556. URL: https://doi.org/10.48550/arXiv.2405.10556.

Jacob, Ashwin, Diptapriyo Majumdar and Meirav Zehavi (2024a). ‘A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees’. In: 35th International Symposium on Algorithms and Computation, ISAAC 2024, December 8-11, 2024, Sydney, Australia. Ed. byJulián Mestre and Anthony Wirth. Vol. 322. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 41:1–41:17. DOI: 10.4230/LIPICS.ISAAC.2024.41. URL: https://doi.org/10.4230/LIPIcs.ISAAC.2024.41.

— (2024b). ‘A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees’. In: CoRR abs/2409.14209. DOI: 10.48550/ARXIV.2409.14209. arXiv: 2409.14209. URL: https://doi.org/10.48550/arXiv.2409.14209.

Jain, Mohit, Anis Mishra, Syamantak Das, Andreas Wiese, Arani Bhattacharya and Mukulika Maity (2024). ‘A Deadline Aware Scheduler for Smart Factory using WiFi6’. In:CoRR abs/2408.12274. DOI: 10.48550/ARXIV.2408.12274. arXiv: 2408.12274. URL: https://doi.org/10.48550/arXiv.2408.12274.

Jain, Mohit, Anis Mishra, Andreas Wiese, Syamantak Das, Arani Bhattacharya and Mukulika Maity (2024). ‘A Deadline-Aware Scheduler for Smart Factory using WiFi 6’. In: Proceedings of the Twenty-fifth International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing, MOBIHOC 2024, Athens, Greece, October 14-17, 2024. Ed. by Symeon Papavassiliou and Stefan Schmid. ACM, pp. 221–230. DOI: 10.1145/3641512.3686387. URL: https://doi.org/10.1145/3641512.3686387.

Mukherjee, Manuj and Ran Gelles (2024a). ‘Computation in Server-Assisted Noisy Networks’. In: IEEE International Symposium on Information Theory, ISIT 2024, Athens, Greece, July 7-12, 2024. IEEE, pp. 3297–3301. doi: 10 . 1109 / ISIT57864 . 2024 . 10619253. url: https://doi.org/10.1109/ISIT57864.2024.10619253.

— (2024b). ‘Information Exchange is Harder with Noise at Source’. In: IEEE International Symposium on Information Theory, ISIT 2024, Athens, Greece, July 7-12, 2024. IEEE, pp. 3285-3290. doi: 10.1109/ISIT57864.2024.10619523. url: https://doi.org/10.1109/ISIT57864.2024.10619523.

Pal, Ambar, Rajiv Raman, Saurabh Ray and Karamjeet Singh (2024a). ‘A Fast Algorithm for Computing a Planar Support for Non-Piercing Rectangles’. In: 35th International Symposium on Algorithms and Computation, ISAAC 2024, December 8-11, 2024, Sydney, Australia. Ed. by Julián Mestre and Anthony Wirth. Vol. 322. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 53:1–53:18. DOI: 10.4230/LIPICS.ISAAC.2024.53. URL: https://doi.org/10.4230/LIPIcs.ISAAC.2024.53.

Pal, Ambar, Rajiv Raman, Saurabh Ray and Karamjeet Singh (2024b). ‘A fast algorithm for computing a planar support for non-piercing rectangles’. In: CoRR abs/2410.02449. DOI: 10.48550/ARXIV.2410.02449. arXiv: 2410.02449. URL: https://doi.org/10.48550/arXiv.2410.02449.

Ranjan, Sanskar and Supratim Shit (2024). ‘Accurate Coresets for Latent Variable Models and Regularized Regression’. In: CoRR abs/2412.20189. DOI: 10.48550/ARXIV.2412.20189. arXiv: 2412.20189. URL: https://doi.org/10.48550/arXiv.2412.20189.

Singh, Ashutosh Kumar, Rajib Kumar Mandal and Ravi Anand (2024). ‘A Novel 5L Boosting Inverter With Reduced Spike Current’. In: IEEE Trans. Circuits Syst. II Express Briefs 71.10, pp. 4556–4560. DOI: 10.1109/TCSII.2024.3379211. URL: https://doi.org/10.1109/TCSII.2024.3379211.

Anand, Ravi, Subhadeep Banik, Andrea Caforio, Kazuhide Fukushima, Takanori Isobe, Shinsaku Kiyomoto, Fukang Liu, Yuto Nakano, Kosei Sakamoto and Nobuyuki Takeuchi (2023). ‘An Ultra-High Throughput AES-Based Authenticated Encryption Scheme for 6G: Design and Implementation’. In: Computer Security - ESORICS 2023 - 28th European Symposium on Research in Computer Security, The Hague, The Netherlands, September 25-29, 2023, Proceedings, Part I. Ed. by Gene Tsudik, Mauro Conti, Kaitai Liang and Georgios Smaragdakis. Vol. 14344. Lecture Notes in Computer Science. Springer, pp. 229–248. DOI: 10.1007/978- 3- 031- 50594- 2\_12. URL: https://doi.org/10.1007/978-3-031-50594-2%5C_12.

Anand, Ravi, Debarati Dutta and Anirban Sarkar (2023). ‘On the Road to the Development of Noninvasive Highly Sensitive Electromagnetic Bio-Sensor for Bone Crack Detection’. In: 2023 IEEE SENSORS, Vienna, Austria, October 29 - Nov. 1, 2023. IEEE, pp. 1–4. DOI: 10.1109/SENSORS56945 . 2023 . 10324914. URL: https://doi.org/10.1109/SENSORS56945.2023.10324914.

Anand, Ravi and Takanori Isobe (2023). ‘Quantum security analysis of Rocca’. In: Quantum Inf. Process. 22.4, p. 164.DOI: 10.1007/S11128-023-03908-3. URL: https://doi.org/10.1007/s11128-023-03908-3.

Anand, Ravi, Dibyendu Roy and Santanu Sarkar (2023). ‘Some results on lightweight stream ciphers Fountain v1 & Lizard’. In: Adv. Math. Commun. 17.2, pp. 298–319.DOI: 10.3934/AMC.2020128. URL: https://doi.org/10.3934/amc.2020128.

Bandopadhyay, Susobhan, Suman Banerjee, Diptapriyo Majumdar and Fahad Panolan (2023). ‘Shortest Path with Positive Disjunctive Constraints - a Parameterized Perspective’. In: CoRR abs/2309.04346.DOI: 10.48550/ARXIV.2309.04346. arXiv: 2309.04346.URL: https://doi.org/10.48550/arXiv.2309.04346.

Banik, Aritra, Rajiv Raman and Saurabh Ray (2023). ‘On the geometric priority set cover problem’. In: Comput. Geom. 112, p. 101984. DOI: 10 . 1016 / J . COMGEO . 2023 . 101984.URL: https ://doi.org/10.1016/j.comgeo.2023.101984.

Basu, Sabyasachi and Manuj Mukherjee (2023). ‘Optimal storage codes on graphs with fixed locality’. In: CoRR abs/2307.08680. doi: 10.48550/ARXIV.2307.08680. arXiv: 2307.08680. url: https://doi.org/10.48550/arXiv.2307.08680.

Batra, Jatin, Syamantak Das and Agastya Vibhuti Jha (2023). ‘Tight Approximation Algorithms for Ordered Covering’. In: Algorithms and Data Structures - 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 - August 2, 2023, Proceedings. Ed. by Pat Morin and Subhash Suri. Vol. 14079. Lecture Notes in Computer Science. Springer, pp. 120–135.DOI: 10.1007/978- 3- 031- 38906- 1\_9. URL: https://doi.org/10.1007/978-3-031-38906-1%5C_9.

Bera, Debajyoti, Rameshwar Pratap and Bhisham Dev Verma (2023). ‘Dimensionality Reduction for Categorical Data’. In: IEEE Trans. Knowl. Data Eng. 35.4, pp. 3658–3671. DOI: 10.1109/TKDE.2021.3132373.URL: https://doi.org/10.1109/TKDE.2021.3132373.

Bera, Debajyoti, Rameshwar Pratap, Bhisham Dev Verma, Biswadeep Senand Tanmoy Chakraborty (2023). ‘QUINT: Node Embedding Using Network Hashing’. In: IEEE Trans. Knowl. Data Eng. 35.3, pp. 2987–3000.DOI: 10.1109/TKDE.2021.3111997. URL: https://doi.org/10.1109/TKDE.2021.3111997.

Bera, Debajyoti and SAPV Tharrmashastha (2023a). ‘A Generalized Quantum Branching Program’. In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India. Ed. by Patricia Bouyer and Srikanth Srinivasan. Vol. 284. LIPIcs. Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 31:1–31:21. DOI: 10 . 4230 / LIPICS . FSTTCS . 2023 . 31. URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2023.31.

— (2023b). ‘A Generalized Quantum Branching Program’. In: CoRR abs/2307.11395. DOI: 10 .48550/ARXIV.2307.11395. arXiv: 2307.11395. URL: https://doi.org/10.48550/arXiv.2307.11395.

Bisht, Pranav, Nikhil Gupta and Ilya Volkovich (2023a). ‘Towards Identity Testing for Sums of Products of Read-Once and Multilinear Bounded-Read Formulae’. In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India. Ed. by Patricia Bouyer and Srikanth Srinivasan. Vol. 284. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 9:1–9:23. DOI: 10 . 4230 / LIPICS . FSTTCS . 2023 . 9. URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2023.9.

— (2023b).‘Towards Identity Testing for Sums of Products of Read-Once and Multilinear Bounded-Read Formulae’. In: Electron. Colloquium Comput. Complex. TR23-109. ECCC: TR23-109. URL: https://eccc.weizmann.ac.il/report/2023/109.

Chakraborty, Diptarka, Syamantak Das, Arindam Khan and Aditya Subramanian (2023). ‘Fair Rank Aggregation’. In: CoRR abs/2308.10499. DOI: 10 . 48550 / ARXIV . 2308 . 10499. arXiv: 2308.10499. URL: https://doi.org/10.48550/arXiv.2308.10499.

Chatterjee, Sagnik, Rohan Bhatia, Parmeet Singh Chani and Debajyoti Bera (2023). ‘Quantum boosting using domain-partitioning hypotheses’. In: Quantum Mach. Intell. 5.2, pp. 1–20. DOI: 10.1007/S42484-023-00122-3. URL: https://doi.org/10.1007/s42484-023-00122-3.

Chatterjee, Sagnik and Vyacheslav Kungurtsev (2023). ‘Quantum Solutions to the Privacy vs. Utility Tradeoff’. In: CoRR abs/2307.03118. doi: 10.48550/ARXIV.2307.03118.arXiv:2307.03118. url: https://doi.org/10.48550/arXiv.2307.03118.

Dutta, Debarati, Ravi Anand and Anirban Sarkar (2023) ‘Independently Operational Dual-Frequency Band Metamaterial Based EM Biosensor for Identification and Quantification of Impurities in Vegetable Oils’. In: 2023 IEEE SENSORS, Vienna, Austria, October 29 - Nov. 1, 2023. IEEE, pp. 1–4. DOI: 10.1109/SENSORS56945.2023.10325059. URL: https://doi.org/10.1109/SENSORS56945.2023.10325059.

Eiben, Eduard, Diptapriyo Majumdar and M. S. Ramanujan (2023a). ‘Finding a Highly Connected Steiner Subgraph and its Applications’. In: 48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, August 28 to September 1, 2023, Bordeaux, France. Ed. by Jérôme Leroux, Sylvain Lombardy and David Peleg. Vol. 272. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 45:1–45:15. DOI: 10.4230/LIPICS.MFCS.2023.45. URL: https://doi.org/10.4230/LIPIcs.MFCS.2023.45.

— (2023b). ‘Highly Connected Steiner Subgraph - Parameterized Algorithms and Applications to Hitting Set Problems’. In: CoRR abs/2311.02708. DOI: 10.48550/ARXIV.2311.02708. arXiv: 2311.02708. URL: https://doi.org/10.48550/arXiv.2311.02708. 

Einarson, Carl, Gregory Z. Gutin, Bart M. P. Jansen, Diptapriyo Majumdar and MagnusWahlström (2023). ‘p-Edge/vertex-connected vertex cover: Parameterized and approximation algorithms’. In: J. Comput. Syst. Sci. 133, pp. 23–40. DOI: 10.1016/J.JCSS.2022.11.002. URL: https: //doi.org/10.1016/j.jcss.2022.11.002.

Ghosh, Soumava, Ravi Anand, Tanmoy Bhowmik and Siddhanth Chandrashekhar (2023). ‘GoS-age: Heterogeneous Graph Neural Network Using Hierarchical Attention for Collusion Fraud Detection’. In: 4th ACM International Conference on AI in Finance, ICAIF 2023, Brooklyn, NY, USA, November 27-29, 2023. ACM, pp. 185–192. DOI: 10.1145/3604237.3626856. URL: https://doi.org/10.1145/3604237.3626856.

Gupta, Nikhil, Chandan Saha and Bhargav Thankey (2023). ‘Equivalence Test for Read-Once Arithmetic Formulas’. In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023. Ed. by Nikhil Bansal and Viswanath Nagarajan. SIAM, pp. 4205–4272. DOI: 10.1137/1.9781611977554.CH162. URL: https://doi.org/10.1137/1.9781611977554.ch162.

Jacob, Ashwin, Jari J. H. de Kroon, Diptapriyo Majumdar and Venkatesh Raman (2023). ‘Deletion to scattered graph classes I - Case of finite number of graph classes’. In: J. Comput. Syst. Sci. 138, p. 103460. DOI: 10.1016/J.JCSS.2023.05.005. URL: https://doi.org/10.1016/j.jcss.2023.05.005.

Jacob, Ashwin, Diptapriyo Majumdar and Venkatesh Raman (2023a). ‘Deletion to scattered graph classes II - improved FPT algorithms for deletion to pairs of graph classes’. In: J. Comput. Syst. Sci. 136, pp. 280–301. DOI: 10.1016/J.JCSS.2023.03.004. URL: https://doi.org/10.1016/j.jcss.2023.03.004.

— (2023b). ‘Expansion Lemma - Variations and Applications to Polynomial-Time Preprocessing’. In: Algorithms 16.3, p. 144. DOI: 10 . 3390 / A16030144. URL: https://doi.org/10.3390/a16030144.

— (2023c). ‘Expansion Lemma - Variations and Applications to Polynomial-Time Preprocessing’. In: CoRR abs/2303.02687. DOI: 10 . 48550 / ARXIV . 2303 . 02687. arXiv: 2303 . 02687. URL: https://doi.org/10.48550/arXiv.2303.02687.

Komusiewicz, Christian and Diptapriyo Majumdar (2023) ‘Enumeration Kernels of Polynomial Size for Cuts of Bounded Degree’. In: CoRR abs/2308.01286. DOI: 10.48550/ARXIV.2308.01286. arXiv: 2308.01286. URL: https://doi.org/10.48550/arXiv.2308.01286.

Liu, Fukang, Ravi Anand, Libo Wang, Willi Meier and Takanori Isobe (2023) ‘Coefficient Grouping: Breaking Chaghri and More’. In: Advances in Cryptology - EUROCRYPT 2023 - 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023, Proceedings, Part IV. Ed. by Carmit Hazay and Martijn Stam. Vol. 14007. Lecture Notes in Computer Science. Springer, pp. 287–317. DOI: 10.1007/978-3-031-30634-1\_10. URL: https://doi.org/10.1007/978-3-031-30634-1%5C_10.

Liu, Fukang, Gaoli Wang, Santanu Sarkar, Ravi Anand, Willi Meier, Yingxin Li and Takanori Isobe (2023a). ‘Analysis of RIPEMD-160: New Collision Attacks and Finding Characteristics with MILP’. In: IACR Cryptol. ePrint Arch., p. 277. URL: https://eprint.iacr.org/2023/277. 

— (2023b). ‘Analysis of RIPEMD-160: New Collision Attacks and Finding Characteristics with MILP’. In: Advances in Cryptology - EUROCRYPT 2023 - 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023, Proceedings, Part IV. Ed. by Carmit Hazay and Martijn Stam. Vol. 14007. Lecture Notes in Computer Science. Springer, pp. 189–219. DOI: 10.1007/978- 3- 031- 30634- 1\_7. URL: https://doi.org/10.1007/978-3-031-30634-1%5C_7. 

Luo, Kelin, Alexandre M. Florio, Syamantak Das and Xiangyu Guo (2023). ‘A Hierarchical Grouping Algorithm for the Multi-Vehicle Dial-a-Ride Problem’. In:Proc. VLDB Endow.16.5,pp.1195–1207. DOI: 10.14778/3579075.3579091. URL: https://www.vldb.org/pvldb/vol16/p1195-guo.pdf.

Mukherjee, Manuj, Aslan Tchamkerten and Chadi Jabbour (2023). ‘Reconfigurable Adaptive Channel Sensing’. In: IEEE Trans. Green Commun. Netw. 7.3, pp. 1394–1406. doi: 10.1109/TGCN.2023.3238176. url: https://doi.org/10.1109/TGCN.2023.3238176.

Nakahashi, Motoki, Rentaro Shiba, Ravi Anand, Mostafizar Rahman, Kosei Sakamoto, Fukang Liu and Takanori Isobe (2023). ‘Ghidle: Efficient Large-State Block Ciphers for Post-quantum  Security’. In: Information Security and Privacy - 28th Australasian Conference, ACISP 2023, Brisbane, QLD, Australia, July 5-7, 2023, Proceedings. Ed. by Leonie Simpson and Mir Ali Rezazadeh Baee. Vol. 13915. Lecture Notes in Computer Science. Springer, pp. 403–430. DOI: 10.1007/978- 3- 031- 35486- 1\_18. URL: https://doi.org/10.1007/978-3-031-35486-1%5C_18. 

Raman, Rajiv and Karamjeet Singh (2023). ‘On Hypergraph Supports’. In: CoRR abs/2303.16515. DOI: 10.48550/ARXIV.2303.16515. arXiv: 2303.16515. URL: https://doi.org/10.48550/arXiv.2303.16515.

Shiba, Rentaro, Ravi Anand, Kazuhiko Minematsu and Takanori Isobe (2023). ‘Cubicle: A family of space-hard ciphers for IoT’. In: IET Inf. Secur. 17.1, pp. 131–146. DOI: 10.1049/ISE2.12086. URL: https://doi.org/10.1049/ise2.12086.

Singh, Daman Deep, Syamantak Das and Abhijnan Chakraborty (2023). ‘FairAssign: Stochastically Fair Driver Assignment in Gig Delivery Platforms’. In: Proceedings of the 2023 ACM Conference on Fairness, Accountability, and Transparency, FAccT 2023, Chicago, IL, USA, June 12-15, 2023. ACM, pp. 753–763. DOI: 10.1145/3593013.3594040. URL: https://doi.org/10.1145/3593013.3594040.

Ailon, Nir and Supratim Shit (2022). ‘Efficient NTK using Dimensionality Reduction’. In: CoRR abs/2210.04807. doi: 10.48550/ARXIV.2210.04807. arXiv: 2210.04807. url: https://doi.org/10.48550/arXiv.2210.04807.

Bera, Debajyoti and Sagnik Chatterjee (2022). ‘Efficient Quantum Agnostic Improper Learning of Decision Trees’. In: CoRR abs/2210.00212. doi: 10 . 48550 / ARXIV . 2210 . 00212. arXiv: 2210.00212. url: https://doi.org/10.48550/arXiv.2210.00212.

Bera, Debajyoti and SAPV Tharrmashastha (2022). ‘Few Quantum Algorithms on Amplitude Dis-tribution’. In: CoRR abs/2208.00162. doi: 0.48550/ARXIV.2208.00162. arXiv: 2208.00162. url: https://doi.org/10.48550/arXiv.2208.00162.

Bera, Debajyoti and SAPV Tharrmashastha (2022). ‘Few Quantum Algorithms on Amplitude Distribution’. In: CoRR abs/2208.00162. doi: 10.48550/ARXIV.2208.00162. arXiv: 2208.00162. url:https://doi.org/10.48550/arXiv.2208.00162.

Bera, Suman K., Syamantak Das, Sainyam Galhotra and Sagar Sudhir Kale (2022). ‘Fair k-Center Clustering in MapReduce and Streaming Settings’. In: WWW ’22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25 - 29, 2022. Ed. by Frédérique Laforest, Raphaël Troncy, Elena Simperl, Deepak Agarwal, Aristides Gionis, Ivan Herman and Lionel Médini. ACM, pp. 1414–1422. doi: 10.1145/3485447.3512188. url: https://doi.org/10.1145/3485447.3512188.

Chakraborty, Diptarka, Syamantak Das, Arindam Khan and Aditya Subramanian (2022). ‘Fair Rank Aggregation’. In: Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, NeurIPS 2022, New Orleans, LA, USA,November 28 - December 9, 2022. Ed. by Sanmi Koyejo, S. Mohamed, A. Agarwal, Danielle Belgrave, K. Cho and A. Oh. url: http://papers.nips.cc/paper%5C_files/paper/2022/hash/974309ef51ebd89034adc64a57e304f2-Abstract-Conference.html.

Chhaya, Rachit, Anirban Dasgupta, Jayesh Choudhari and Supratim Shit (2022). ‘On Coresets for Fair Regression and Individually Fair Clustering’. In: International Conference on Artificial Intelligence and Statistics, AISTATS 2022, 28-30 March 2022, Virtual Event. Ed. by Gustau Camps-Valls, Francisco J. R. Ruiz and Isabel Valera. Vol. 151. Proceedings of Machine Learning Research. PMLR, pp. 9603–9625. url: https://proceedings.mlr.press/v151/chhaya22a.html.

Crampton, Jason, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan and Diptapriyo Majumdar (2022a). ‘Generalized Noise Role Mining’. In: SACMAT ’22: The 27th ACM Symposium on Access Control Models and Technologies, New York, NY, USA, June 8 - 10, 2022. Ed. by Sven Dietrich, Omar Chowdhury and Daniel Takabi. ACM, pp. 91–102. doi: 10 . 1145 / 3532105 . 3535024. url: https://doi.org/10.1145/3532105.3535024. 

— (2022b). ‘Valued Authorization Policy Existence Problem: Theory and Experiments’. In: ACMTrans. Priv. Secur. 25.4, 28:1–28:32. doi: 10.1145/3528101. url: https://doi.org/10.1145/3528101.

Das,SyamantakandAndreasWiese(2022).ASimplerQPTASforSchedulingJobswithPrecedence Constraints’. In: 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany. Ed. by Shiri Chechik, Gonzalo Navarro, Eva Rotenberg and Grzegorz Herman. Vol. 244. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 40:140:11. doi: 10.4230/LIPICS.ESA.2022.40. url: https://doi.org/10.4230/LIPIcs.ESA.2022.40.

Eiben, Eduard, Diptapriyo Majumdar and M. S. Ramanujan (2022a). ‘An Improved Time-Efficient Approximate Kernelization for Connected Treedepth Deletion Set’. In: CoRR abs/2212.00418.doi: 10.48550/ARXIV.2212.00418. arXiv: 2212.00418. url: https://doi.org/10.48550/arXiv.2212.00418.

—(2022b)‘OntheLossyKernelizationforConnectedTreedepthDeletionSet’.In:Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, Tübingen, Germany, June 22-24, 2022, Revised Selected Papers. Ed. by Michael A. Bekos and Michael Kaufmann. Vol. 13453. Lecture Notes in Computer Science. Springer, pp. 201–214. doi: 10.1007/978-3-031-15914-5\_15. url: https://doi.org/10.1007/978-3-031-15914-5%5C_15.

Gupta, Naman, Syamantak Das and Mukulika Maity (2022). ‘FairSplit - An efficient near-optimal bandwidth splitting strategy for OFDMA in IEEE 802.11ax’. In: IEEE International Conference on Communications, ICC 2022, Seoul, Korea, May 16-20, 2022. IEEE, pp. 285–290. doi: 10.1109/ICC45855.2022.9838440. url: https://doi.org/10.1109/ICC45855.2022.9838440.

Gupta, Nikhil, Chandan Saha and Bhargav Thankey (2022). ‘Equivalence Test for Read-Once Arithmetic Formulas’. In: Electron. Colloquium Comput. Complex. TR22-099. ECCC: TR22 - 099. url: https://eccc.weizmann.ac.il/report/2022/099.

Jacob, Ashwin, Diptapriyo Majumdar and Venkatesh Raman (2022). ‘Deletion to Scattered Graph Classes II - Improved FPT Algorithms for Deletion to Pairs of Graph Classes’. In: CoRR abs/2201.03142. arXiv: 2201.03142. url: https://arxiv.org/abs/2201.03142.

Kundu, Surajit, Santam Chakraborty, Jayanta Mukhopadhyay, Syamantak Das, Sanjoy Chatterjee, Rimpa Basu Achari, Indranil Mallick, Partha Pratim Das, Moses Arunsingh, Tapesh Bhattacharyyaa and Soumendranath Ray (2022). ‘Design and Development of a Medical Image Databank for Assisting Studies in Radiomics’. In: J. Digit. Imaging 35.3, pp. 408–423. doi: 10.1007/S10278-021-00576-6. url: https://doi.org/10.1007/s10278-021-00576-6.

Liu, Fukang, Ravi Anand, Libo Wang, Willi Meier and Takanori Isobe (2022).‘Coefficient Grouping: Breaking Chaghri and More’. In: IACR Cryptol. ePrint Arch., p. 991. url: https://eprint.iacr.org/2022/991.

Luo, Kelin, Chaitanya Agarwal, Syamantak Das and Xiangyu Guo (2022). ‘The Multi-vehicle Ride Sharing Problem’. In: WSDM ’22: The Fifteenth ACM International Conference on Web Search and Data Mining, Virtual Event / Tempe, AZ, USA, February 21 - 25, 2022. Ed. by K. Selcuk Candan, Huan Liu, Leman Akoglu, Xin Luna Dong and Jiliang Tang. ACM, pp. 628–637. doi: 10.1145/3488560.3498449. url: https://doi.org/10.1145/3488560.3498449.

Luo, Kelin, Alexandre M. Florio, Syamantak Das and Xiangyu Guo (2022). ‘A Hierarchical Grouping Algorithm for the Multi-Vehicle Dial-a-Ride Problem’. In: CoRR abs/2210.05000. doi:10 . 48550 / ARXIV . 2210 . 05000. arXiv: 2210 . 05000. url: https : //doi.org/10.48550/arXiv.2210.05000.

Raman, Rajiv and Saurabh Ray (2022). ‘On the Geometric Set Multicover Problem’. In: Discret. Comput. Geom. 68.2, pp. 566–591. doi: 10.1007/S00454-022-00402-Y. url: https://doi.org/10.1007/s00454-022-00402-y.

Shit, Supratim, Anirban Dasgupta, Rachit Chhaya and Jayesh Choudhari (2022). ‘Online Coresets for Parameteric and Non-Parametric Bregman Clustering’. In: Trans. Mach. Learn. Res. 2022.url: https://openreview.net/forum?id=lAv8fShACA.

Verma, Bhisham Dev, Rameshwar Pratap and Debajyoti Bera (2022). ‘Efficient binary embedding of categorical data using BinSketch’. In: Data Min. Knowl. Discov. 36.2, pp. 537–565. doi:10.1007/S10618-021-00815-Y. url: https://doi.org/10.1007/s10618-021-00815-y.

Acharyya, Ankush, Vahideh Keikha, Diptapriyo Majumdar and Supantha Pandit (2021). ‘Constrained Hitting Set Problem with Intervals’. In: Computing and Combinatorics - 27th International Conference, COCOON 2021, Tainan, Taiwan, October 24-26, 2021, Proceedings. Ed. by Chi-Yeh Chen, Wing-Kai Hon, Ling-Ju Hung and Chia-Wei Lee. Vol. 13025. Lecture Notes in Computer Science. Springer, pp. 604–616. doi: 10 . 1007 / 978 - 3 - 030 - 89543 - 3 \ _50. url: https://doi.org/10.1007/978-3-030-89543-3%5C_50.

Anand, Ravi and Takanori Isobe (2021). ‘Differential Fault Attack on Rocca’. In: Information Security and Cryptology - ICISC 2021 - 24th International Conference, Seoul, South Korea, December 1-3, 2021, Revised Selected Papers. Ed. by Jong Hwan Park and Seung-Hyun Seo. Vol. 13218. Lecture Notes in Computer Science. Springer, pp. 283–295. doi: 10.1007/978-3-031-08896-4\_14. url: https://doi.org/10.1007/978-3-031-08896-4%5C_14.

Anand, Ravi, Arpita Maitra, Subhamoy Maitra, Chandra Sekhar Mukherjee and Sourav Mukhopadhyay (2021). ‘Quantum Resource Estimation for FSR Based Symmetric Ciphers and Related Grover’s Attacks’. In: Progress in Cryptology - INDOCRYPT 2021 - 22nd International Conference on Cryptology in India, Jaipur, India, December 12-15, 2021, Proceedings. Ed. by Avishek Adhikari, Ralf Küsters and Bart Preneel. Vol. 13143. Lecture Notes in Computer Science. Springer, pp. 179–198. doi: 10.1007/978- 3- 030- 92518- 5\_9. url: https: //doi.org/10.1007/978-3-030-92518-5%5C_9.

Baksi, Anubhab, Santanu Sarkar, Akhilesh Siddhanti, Ravi Anand and Anupam Chattopadhyay (2021). ‘Differential fault location identification by machine learning’. In: CAAI Trans. Intell. Technol. 6.1, pp. 17–24. doi: 10.1049/CIT2.12027. url: https://doi.org/10.1049/cit2.12027.

Banik, Aritra, Rajiv Raman and Saurabh Ray (2021). ‘On Geometric Priority Set Cover Problems’. In: 32nd International Symposium on Algorithms and Computation, ISAAC 2021, December 6-8, 2021, Fukuoka, Japan. Ed. by Hee-Kap Ahn and Kunihiko Sadakane. Vol. 212. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 12:1–12:14. doi: 10.4230/LIPICS.ISAAC.2021.12. url: https://doi.org/10.4230/LIPIcs.ISAAC.2021.12.

Bathe, Bhagwan N., Ravi Anand and Suman Dutta(2021) ‘Evaluation of Grover’s algorithm toward quantum cryptanalysis on ChaCha’. In: Quantum Inf. Process. 20.12, p. 394. doi: 10.1007/S11128-021-03322-7. url: https://doi.org/10.1007/s11128-021-03322-7.

Bathe, Bhagwan N., Siddhartha Tiwari, Ravi Anand, Dibyendu Roy and Subhamoy Maitra (2021). ‘Differential Fault Attack on Espresso’. In: Progress in Cryptology - INDOCRYPT 2021 - 22nd International Conference on Cryptology in India, Jaipur, India, December 12-15, 2021, Proceedings. Ed. by Avishek Adhikari, Ralf Küsters and Bart Preneel. Vol. 13143. Lecture Notes in Computer Science. Springer, pp. 271–286. doi: 10.1007/978- 3- 030- 92518- 5\_13. url: https://doi.org/10.1007/978-3-030-92518-5%5C_13.

Bera, Debajyoti and Sagnik Chatterjee (2021). ‘Quantum Boosting using Domain-Partitioning Hypotheses’. In: CoRR abs/2110.12793. arXiv: 2110.12793. url: https://arxiv.org/abs/2110.12793.

Bera, Debajyoti, Rameshwar Pratap and Bhisham Dev Verma (2021). ‘Dimensionality Reduction for Categorical Data’. In: CoRR abs/2112.00362. arXiv: 2112.00362. url: https://arxiv.org/abs/2112.00362.

Bera, Debajyoti, Rameshwar Pratap, Bhisham Dev Verma, Biswadeep Senand Tanmoy Chakraborty (2021). ‘QUINT: Node embedding using network hashing’. In: CoRR abs/2109.04206. arXiv: 2109.04206. url: https://arxiv.org/abs/2109.04206.

Bera, Debajyoti and SAPV Tharrmashastha (2021a). ‘Quantum and Randomised Algorithms for Non-linearityEstimation’. In: CoRRabs/2103.07934.arXiv:2103.07934. url:https://arxiv.org/abs/2103.07934.

Bera, Debajyoti and SAPV Tharrmashastha (2021b). ‘Space efficient quantum algorithms for mode, min-entropy and k-distinctness’. In: CoRR abs/2103.09033. arXiv: 2103.09033. url: https://arxiv.org/abs/2103.09033.

Chalermsook, Parinya, Syamantak Das, Yunbum Kook, Bundit Laekhanukit, Yang P. Liu, Richard Peng, Mark Sellke and Daniel Vaz (2021). ‘Vertex Sparsification for Edge Connectivity’. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021. Ed. by Dániel Marx. SIAM, pp. 1206–1225. doi: 10.1137/1.9781611976465.74. url: https://doi.org/10.1137/1.9781611976465.74.

Crampton, Jason, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan and Diptapriyo Majumdar (2021a). ‘Valued Authorization Policy Existence Problem’. In: SACMAT ’21: The 26th ACM Symposium on Access Control Models and Technologies, Virtual Event, Spain, June 16-18, 2021. Ed. by Jorge Lobo, Roberto Di Pietro, Omar Chowdhury and Hongxin Hu. ACM, pp. 83–94. doi: 10.1145/3450569.3463571. url: https://doi.org/10.1145/3450569.3463571.

— (2021b). ‘Valued Authorization Policy Existence Problem: Theory and Experiments’. In: CoRR abs/2106.05761. arXiv: 2106.05761. url: https://arxiv.org/abs/2106.05761.

Crampton, Jason, Gregory Z. Gutin and Diptapriyo Majumdar (2021a). ‘Towards Better Understanding of User Authorization Query Problem via Multi-variable Complexity Analysis’. In: ACM Trans. Priv. Secur. 24.3, 21:1–21:22. doi: 10.1145/3450768. url: https://doi.org/10.1145/3450768.

Crampton, Jason, Gregory Z. Gutin and Diptapriyo Majumdar (2021b). ‘Towards Better Understanding of User Authorization Query Problem via Multi-variable Complexity Analysis’. In: CoRR abs/2104.05983. arXiv: 2104.05983. url: https://arxiv.org/abs/2104.05983.

Dawar, Siddharth, Vikram Goyal and Debajyoti Bera (2021). ‘SMIM Framework to Generalize High-Utility Itemset Mining’. In: Advanced Data Mining and Applications - 17th International Conference, ADMA 2021, Sydney, NSW, Australia, February 2-4, 2022, Proceedings, Part II. Ed. by Bohan Li, Lin Yue, Jing Jiang, Weitong Chen, Xue Li, Guodong Long, Fei Fang and Han Yu. Vol. 13088. Lecture Notes in Computer Science. Springer, pp. 3–15. doi: 10.1007/978-3-030-95408-6\_1. url: https://doi.org/10.1007/978-3-030-95408-6%5C_1.

Gutin, Gregory Z., Diptapriyo Majumdar, Sebastian Ordyniak and Magnus Wahlström (2021). ‘ParameterizedPre-Coloring ExtensionandListColoringProblems’. In:SIAM J. Discret. Math. 35.1, pp. 575–596. doi: 10.1137/20M1323369. url: https://doi.org/10.1137/20M1323369.

Jacob, Ashwin, Jari J. H. de Kroon, Diptapriyo Majumdar and Venkatesh Raman (2021). ‘Deletion to Scattered Graph Classes I – case of finite number of graph classes’. In: CoRR abs/2105.04660. arXiv: 2105.04660. url: https://arxiv.org/abs/2105.04660.

Jacob, Ashwin, Diptapriyo Majumdar and Venkatesh Raman (2021a). ‘Faster FPT Algorithms for Deletion to Pairs of Graph Classes’. In: Fundamentals of Computation Theory - 23rd International Symposium, FCT 2021, Athens, Greece, September 12-15, 2021, Proceedings. Ed. by Evripidis Bampis and Aris Pagourtzis. Vol. 12867. Lecture Notes in Computer Science. Springer, pp. 314–326. doi: 10.1007/978-3-030-86593-1\_22. url: https://doi.org/10.1007/978-3-030-86593-1%5C_22.

Jacob, Ashwin, Diptapriyo Majumdar and Venkatesh Raman (2021b). ‘Parameterized Complexity of Conflict-Free Set Cover’. In: Theory Comput. Syst. 65.3, pp. 515–540. doi: 10.1007/S00224-020-10022-9. url: https://doi.org/10.1007/s00224-020-10022-9.

Kundu, Surajit, Santam Chakraborty, Jayanta Mukhopadhyay, Syamantak Das, Sanjoy Chatterjee, Rimpa Basu Achari, Indranil Mallick, Partha Pratim Das, Moses Arunsingh, Tapesh Bhattacharyyaa and Soumendranath Ray (2021). ‘Research Goal-Driven Data Model and Harmonization for De-Identifying Patient Data in Radiomics’. In: J. Digit. Imaging 34.4, pp. 986–1004. doi: 10.1007/S10278-021-00476-9. url: https://doi.org/10.1007/s10278-021-00476-9.

Mukherjee, Manuj and Ran Gelles (2021a). ‘Multiparty Interactive Coding Over Networks of Intersecting Broadcast Links’. In: IEEE J. Sel. Areas Inf. Theory 2.4, pp. 1078–1092. doi: 10.1109/JSAIT.2021.3126422. url: https://doi.org/10.1109/JSAIT.2021.3126422.

— (2021b). ‘Multiparty Interactive Coding over Networks of Intersecting Broadcast Links’. In: CoRR abs/2105.01506. arXiv: 2105.01506. url: https://arxiv.org/abs/2105.01506.

Mukherjee, Manuj and Ran Gelles (2021c). ‘Multiparty Interactive Communication with Broadcast Links’. In: IEEE Information Theory Workshop, ITW 2021, Kanazawa, Japan, October 17-21, 2021. IEEE, pp. 1–6. doi: 10.1109/ITW48936.2021.9611505. url: https://doi.org/10.1109/ITW48936.2021.9611505.

Mukherjee, Manuj, Aslan Tchamkerten and Chadi Jabbour (2021). ‘Reconfigurable Adaptive Channel Sensing’. In: CoRR abs/2104.12460. arXiv: 2104.12460. url: https://arxiv.org/abs/2104.12460.

Mukherjee, Manuj, Aslan Tchamkerten and Mansoor I. Yousefi (2021). ‘Approximating Probability Distributions by ReLU Networks’. In: CoRR abs/2101.09973. arXiv: 2101.09973. url: https://arxiv.org/abs/2101.09973.

Shit, Supratim (2021). ‘Lp Subspace Embedding in Input Sparsity Time’. In: CODS-COMAD 2021: 8th ACM IKDD CODS and 26th COMAD, Virtual Event, Bangalore, India, January 2-4, 2021. Ed. by Jayant R. Haritsa, Shourya Roy, Manish Gupta, Sharad Mehrotra, Balaji Vasan Srinivasan and Yogesh Simmhan. ACM, p. 418. doi: 10.1145/3430984.3431063. url: https://doi.org/10.1145/3430984.3431063.

Tharrmashastha, SAPV, Debajyoti Bera, Arpita Maitra and Subhamoy Maitra (2021). Quantum Algorithms for Cryptographically Significant Boolean Functions - An IBMQ Experience.Springer Briefs in Computer Science. Springer. isbn: 978-981-16-3060-6. doi: 10.1007/978-981-16-3061-3. url: https://doi.org/10.1007/978-981-16-3061-3.

Verma, Bhisham Dev, Rameshwar Pratap and Debajyoti Bera (2021). ‘Efficient Binary Embedding of Categorical Data using BinSketch’. In: CoRR abs/2111.07163. arXiv: 2111 . 07163. url: https://arxiv.org/abs/2111.07163.