On the rectilinear crossing number of complete uniform hypergraphs. - Anurag Anshu; Rahul Gangopadhyay; Saswata Shannigrahi; Satyanarayana Vusirikala (Comput. Geom., 2017)

k-Sets and rectilinear crossings in complete uniform hypergraphs. - Rahul Gangopadhyay; Saswata Shannigrahi (Comput. Geom., 2020)

Rectilinear Crossings in Complete Balanced d-Partite d-Uniform Hypergraphs. - Rahul Gangopadhyay; Saswata Shannigrahi (Graphs Comb., 2020)

Processor and Bus Co-scheduling Strategies for Real-time Tasks with Multiple Service-levels. - Sanjit Kumar Roy; Arnab Sarkar 001; Rahul Gangopadhyay (RTCSA, 2021)

Morphing tree drawings in a small 3D grid. - Elena Arseneva; Rahul Gangopadhyay; Aleksandra Istomina (J. Graph Algorithms Appl., 2023)

DELICIOUS: Deadline-Aware Approximate Computing in Cache-Conscious Multicore. - Sangeet Saha; Shounak Chakraborty 001; Sukarn Agarwal; Rahul Gangopadhyay; Magnus Själander; Klaus D. McDonald-Maier (IEEE Trans. Parallel Distributed Syst., 2023)

Maximum Rectilinear Crossing Number of Uniform Hypergraphs. - Rahul Gangopadhyay; Ayan (Graphs Comb., 2023)

Sweeping Arrangements of Non-Piercing Regions in the Plane. - Suryendu Dalal; Rahul Gangopadhyay; Rajiv Raman 001; Saurabh Ray (SoCG, 2024)

Sweeping Arrangements of Non-Piercing Curves in Plane. - Suryendu Dalal; Rahul Gangopadhyay; Rajiv Raman 001; Saurabh Ray (CoRR, 2024)