Rian Neogi

13 papers A* 1A 1B 2Journal 8Unranked 1
YearRankTypeTitle / Venue / Authors
2025 A* conf
An
EC
Rian Neogi, Kanstantsin Pashkovich, Chaitanya Swamy
2025 J jnl
An O(log log n)-approximate budget feasible mechanism for subadditive valuations.
CoRR
Rian Neogi, Kanstantsin Pashkovich, Chaitanya Swamy
2025 J jnl
Multidimensional Budget-Feasible Mechanism Design.
CoRR
Rian Neogi, Kanstantsin Pashkovich, Chaitanya Swamy
2024 A conf
Budget-Feasible Mechanism Design: Simpler, Better Mechanisms and General Payment Constraints.
ITCS
Rian Neogi, Kanstantsin Pashkovich, Chaitanya Swamy
2024 J jnl
On the Parameterized Complexity of Deletion to \(\boldsymbol{\mathcal{H}}\)-Free Strong Components.
SIAM J. Discret. Math.
Rian Neogi, M. S. Ramanujan, Saket Saurabh, Roohani Sharma
2021 J jnl
Recognizing k-Clique Extendible Orderings.
Algorithmica
Mathew C. Francis, Rian Neogi, Venkatesh Raman
2020 J jnl
On the Parameterized Complexity of Deletion to H-free Strong Components.
CoRR
Rian Neogi, M. S. Ramanujan, Saket Saurabh, Roohani Sharma
2020 B conf
On the Parameterized Complexity of Deletion to ℋ-Free Strong Components.
MFCS
Rian Neogi, M. S. Ramanujan, Saket Saurabh, Roohani Sharma
2020 B conf
Recognizing k-Clique Extendible Orderings.
WG
Mathew C. Francis, Rian Neogi, Venkatesh Raman
2020 J jnl
Recognizing k-Clique Extendible Orderings.
CoRR
Mathew C. Francis, Rian Neogi, Venkatesh Raman
2019 J jnl
Tractability of König edge deletion problems.
Theor. Comput. Sci.
Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman, S. Vaishali
2018 J jnl
Tractability of Konig Edge Deletion Problems.
CoRR
Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman, S. Vaishali
2017 — conf
Exact and Parameterized Algorithms for (k, i)-Coloring.
CALDAM
Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman, Prafullkumar Tale