Rian Neogi

According to our database, Rian Neogi authored at least 9 papers between 2017 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Multidimensional Budget-Feasible Mechanism Design.

Rian Neogi, Kanstantsin Pashkovich, Chaitanya Swamy

CoRR, August, 2025

An O(log log n)-approximate budget feasible mechanism for subadditive valuations.

Rian Neogi, Kanstantsin Pashkovich, Chaitanya Swamy

CoRR, June, 2025

An <i>O</i>(log log <i>n</i>)-approximate budget feasible mechanism for subadditive valuations.

Rian Neogi, Kanstantsin Pashkovich, Chaitanya Swamy

Proceedings of the 26th ACM Conference on Economics and Computation, 2025

2024

On the Parameterized Complexity of Deletion to \(\boldsymbol{\mathcal{H}}\)-Free Strong Components.

Rian Neogi, M. S. Ramanujan, Saket Saurabh, Roohani Sharma

SIAM J. Discret. Math., 2024

Budget-Feasible Mechanism Design: Simpler, Better Mechanisms and General Payment Constraints.

Rian Neogi, Kanstantsin Pashkovich, Chaitanya Swamy

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2020

Recognizing k-Clique Extendible Orderings.

Mathew C. Francis, Rian Neogi, Venkatesh Raman

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

On the Parameterized Complexity of Deletion to ℋ-Free Strong Components.

Rian Neogi, M. S. Ramanujan, Saket Saurabh, Roohani Sharma

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2019

Tractability of König edge deletion problems.

Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman, S. Vaishali

Theor. Comput. Sci., 2019

2017

Exact and Parameterized Algorithms for (k, i)-Coloring.

Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman, Prafullkumar Tale

Proceedings of the Algorithms and Discrete Applied Mathematics, 2017