Pattern-Avoiding Binary Trees - Generation, Counting, and Bijections. - Petr Gregor; Torsten Mütze; Namrata (ISAAC, 2023)

Kneser Graphs Are Hamiltonian. - Arturo Merino; Torsten Mütze; Namrata (STOC, 2023)

On the Hardness of Gray Code Problems for Combinatorial Objects. - Arturo Merino; Namrata; Aaron Williams 001 (WALCOM, 2024)

Combinatorial generation via permutation languages. VI. Binary trees. - Petr Gregor; Torsten Mütze; Namrata (Eur. J. Comb., 2024)

Socio-economic environment and motivation to innovate: exploring grassroots innovations process in India. - Hemant Kumar; Namrata (Technol. Anal. Strateg. Manag., 2024)

Fairness of linear regression in decision making. - Vincent Cohen-Addad; Surya Teja Gavva; Karthik C. S. 001; Claire Mathieu; Namrata (Int. J. Data Sci. Anal., 2024)

Simple approximation algorithms for Polyamorous Scheduling. - Yuriy Biktairov; Leszek Gasieniec; Wanchote Po Jiamjitrak; Namrata; Benjamin Smith; Sebastian Wild (SOSA, 2025)

Hamiltonicity of Schrijver graphs and stable Kneser graphs. - Torsten Mütze; Namrata (Eur. J. Comb., 2025)

Succinct Preferential Attachment Graphs. - Ziad Ismaili Alaoui; Namrata; Sebastian Wild (CoRR, 2025)