Tanmay Inamdar

83 papers A* 7A 13B 7C 1Misc 1Journal 46Unranked 8

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	FPT Approximations for Connected Maximum Coverage. ITCS Tanmay Inamdar, Satyabrata Jana, Madhumita Kundu, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2026	J	`jnl`	FPT Approximations for Connected Maximum Coverage. CoRR Tanmay Inamdar, Satyabrata Jana, Madhumita Kundu, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2026	J	`jnl`	Minimum Envy Graphical House Allocation Beyond Identical Valuations. CoRR Tanmay Inamdar, Pallavi Jain, Pranjal Pandey
2026	A*	`conf`	Tight Parameterized (In)tractability of Layered Crossing Minimization: Subexponential Algorithms and Kernelization. SODA Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2025	C	`conf`	Bicriteria FPT-Approximation Algorithms for Vertex Deletion to Bounded Degeneracy Graphs. IWOCA Tanmay Inamdar, Lawqueen Kanesh, R. Krithika, Harshil Mittal, Saket Saurabh
2025	J	`jnl`	Coreset Strikes Back: Improved Parameterized Approximation Schemes for (Constrained) k-Median/Means. CoRR Sujoy Bhore, Ameet Gadekar, Tanmay Inamdar
2025	A	`conf`	Dimension-Free Parameterized Approximation Schemes for Hybrid Clustering. STACS Ameet Gadekar, Tanmay Inamdar
2025	J	`jnl`	Dimension-Free Parameterized Approximation Schemes for Hybrid Clustering. CoRR Ameet Gadekar, Tanmay Inamdar
2025	—	`conf`	Exact and Parameterized Algorithms for Window Width Minimization in Bipartite Arrangement. CIAC (2) Shashank Chauhan, Tanmay Inamdar, Lawqueen Kanesh, Sanjukta Roy
2025	A	`conf`	Exponential-Time Approximation (Schemes) for Vertex-Ordering Problems. ITCS Matthias Bentert, Fedor V. Fomin, Tanmay Inamdar, Saket Saurabh
2025	J	`jnl`	Exponential-Time Approximation (Schemes) for Vertex-Ordering Problems. CoRR Matthias Bentert, Fedor V. Fomin, Tanmay Inamdar, Saket Saurabh
2025	J	`jnl`	FPT approximation for capacitated clustering with outliers. Theor. Comput. Sci. Rajni Dabas, Neelima Gupta, Tanmay Inamdar
2025	J	`jnl`	Fixed-parameter algorithms for Fair Hitting Set problems. Inf. Comput. Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, Saket Saurabh
2025	J	`jnl`	Hybrid k-Clustering: Blending k-Median and k-Center. ACM Trans. Comput. Theory Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2025	A	`conf`	Multivariate Exploration of Metric Dilation. STACS Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh
2025	J	`jnl`	Multivariate Exploration of Metric Dilation. CoRR Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh
2025	—	`conf`	PTAS for Stabbing Unit Squares and Variants. CCCG Tanmay Inamdar, Sounak Modak, Kushal Singanporia
2025	A	`conf`	Parameterized Geometric Graph Modification with Disk Scaling. ITCS Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2025	J	`jnl`	Tight Parameterized (In)tractability of Layered Crossing Minimization: Subexponential Algorithms and Kernelization. CoRR Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2024	J	`jnl`	(Re)packing Equal Disks into Rectangle. Discret. Comput. Geom. Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2024	A	`conf`	Controlling Delegations in Liquid Democracy. AAMAS Shiri Alouf-Heffetz, Tanmay Inamdar, Pallavi Jain, Nimrod Talmon, Yash More Hiren
2024	J	`jnl`	Controlling Delegations in Liquid Democracy. CoRR Shiri Alouf-Heffetz, Tanmay Inamdar, Pallavi Jain, Yash More, Nimrod Talmon
2024	A	`conf`	Cuts in Graphs with Matroid Constraints. ESA Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh
2024	J	`jnl`	Cuts in Graphs with Matroid Constraints. CoRR Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh
2024	A	`conf`	Exponential-Time Approximation Schemes via Compression. ITCS Tanmay Inamdar, Madhumita Kundu, Pekka Parviainen, M. S. Ramanujan, Saket Saurabh
2024	J	`jnl`	FPT approximation and subexponential algorithms for covering few or many edges. Inf. Process. Lett. Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Tomohiro Koana
2024	A	`conf`	Hybrid k-Clustering: Blending k-Median and k-Center. APPROX/RANDOM Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2024	J	`jnl`	Hybrid k-Clustering: Blending k-Median and k-Center. CoRR Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2024	J	`jnl`	Parameterized Geometric Graph Modification with Disk Scaling. CoRR Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2024	A*	`conf`	Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints. ICALP Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Anannya Upasana
2024	J	`jnl`	Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints. CoRR Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Anannya Upasana
2024	—	`conf`	When Far Is Better: The Chamberlin-Courant Approach to Obnoxious Committee Selection. FSTTCS Sushmita Gupta, Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2024	J	`jnl`	When far is better: The Chamberlin-Courant approach to obnoxious committee selection. CoRR Sushmita Gupta, Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2023	A*	`conf`	Clustering What Matters: Optimal Approximation for Clustering with Outliers. AAAI Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, Jie Xue
2023	J	`jnl`	Clustering what Matters: Optimal Approximation for Clustering with Outliers. J. Artif. Intell. Res. Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, Jie Xue
2023	A*	`conf`	Coresets for Clustering in Geometric Intersection Graphs. SoCG Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar
2023	J	`jnl`	Coresets for Clustering in Geometric Intersection Graphs. CoRR Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar
2023	B	`conf`	FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges. MFCS Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Tomohiro Koana
2023	J	`jnl`	FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges. CoRR Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Tomohiro Koana
2023	J	`jnl`	FPT Approximations for Capacitated/Fair Clustering with Outliers. CoRR Rajni Dabas, Neelima Gupta, Tanmay Inamdar
2023	—	`conf`	FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less. FSTTCS Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, M. S. Ramanujan, Saket Saurabh
2023	J	`jnl`	FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less. CoRR Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, M. S. Ramanujan, Saket Saurabh
2023	B	`conf`	Fixed-Parameter Algorithms for Fair Hitting Set Problems. MFCS Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, Saket Saurabh
2023	J	`jnl`	Fixed-Parameter Algorithms for Fair Hitting Set Problems. CoRR Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, Saket Saurabh
2023	A	`conf`	Kernelization for Spreading Points. ESA Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2023	J	`jnl`	Kernelization for Spreading Points. CoRR Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2023	A	`conf`	Parameterized Complexity of Fair Bisection: (FPT-Approximation meets Unbreakability). ESA Tanmay Inamdar, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan
2023	J	`jnl`	Parameterized Complexity of Fair Bisection: FPT-Approximation meets Unbreakability. CoRR Tanmay Inamdar, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan
2023	—	`conf`	Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem. GD (2) Walter Didimo, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Stephen G. Kobourov, Marie Diana Sieper
2023	J	`jnl`	Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem. CoRR Walter Didimo, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Stephen G. Kobourov, Marie Diana Sieper
2023	B	`conf`	Proportionally Fair Matching with Multiple Groups. WG Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Kirill Simonov
2023	J	`jnl`	Proportionally Fair Matching with Multiple Groups. CoRR Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Kirill Simonov
2023	B	`conf`	Socially Fair Matching: Exact and Approximation Algorithms. WADS Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Fahad Panolan, Kirill Simonov
2022	A*	`conf`	(Re)packing Equal Disks into Rectangle. ICALP Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Meirav Zehavi
2022	J	`jnl`	(Re)packing Equal Disks into Rectangle. CoRR Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2022	J	`jnl`	Algorithms for Intersection Graphs for t-Intervals and t-Pseudodisks. Theory Comput. Chandra Chekuri, Tanmay Inamdar
2022	J	`jnl`	Algorithms for covering multiple submodular constraints and applications. J. Comb. Optim. Chandra Chekuri, Tanmay Inamdar, Kent Quanrud, Kasturi R. Varadarajan, Zhao Zhang
2022	J	`jnl`	Clustering What Matters: Optimal Approximation for Clustering with Outliers. CoRR Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, Jie Xue
2022	B	`conf`	Exact Exponential Algorithms for Clustering Problems. IPEC Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Nidhi Purohit, Saket Saurabh
2022	J	`jnl`	Exact Exponential Algorithms for Clustering Problems. CoRR Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Nidhi Purohit, Saket Saurabh
2022	J	`jnl`	Near-optimal clustering in the Theor. Comput. Sci. Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, Sriram V. Pemmaraju
2022	—	`conf`	Non-Uniform k-Center and Greedy Clustering. SWAT Tanmay Inamdar, Kasturi R. Varadarajan
2021	—	`conf`	ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space. FSTTCS Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh
2021	J	`jnl`	ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space. CoRR Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh
2021	J	`jnl`	Fault-Tolerant Covering Problems in Metric Spaces. Algorithmica Santanu Bhowmick, Tanmay Inamdar, Kasturi R. Varadarajan
2021	J	`jnl`	Non-Uniform k-Center and Greedy Clustering. CoRR Tanmay Inamdar, Kasturi R. Varadarajan
2020	J	`jnl`	Capacitated Covering Problems in Geometric Spaces. Discret. Comput. Geom. Sayan Bandyapadhyay, Santanu Bhowmick, Tanmay Inamdar, Kasturi R. Varadarajan
2020	A	`conf`	Capacitated Sum-Of-Radii Clustering: An FPT Approximation. ESA Tanmay Inamdar, Kasturi R. Varadarajan
2019	A	`conf`	A Constant Approximation for Colorful k-Center. ESA Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, Kasturi R. Varadarajan
2019	J	`jnl`	A Constant Approximation for Colorful k-Center. CoRR Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, Kasturi R. Varadarajan
2019	J	`jnl`	Algorithms for Intersection Graphs of Multiple Intervals and Pseudo Disks. CoRR Chandra Chekuri, Tanmay Inamdar
2019	B	`conf`	Fault Tolerant Clustering with Outliers. WAOA Tanmay Inamdar, Kasturi R. Varadarajan
2019	—	`conf`	Local Search for Geometric Partial Covering Problems. CCCG Tanmay Inamdar
2018	A*	`conf`	Capacitated Covering Problems in Geometric Spaces. SoCG Sayan Bandyapadhyay, Santanu Bhowmick, Tanmay Inamdar, Kasturi R. Varadarajan
2018	B	`conf`	Large-Scale Distributed Algorithms for Facility Location with Outliers. OPODIS Tanmay Inamdar, Shreyas Pai, Sriram V. Pemmaraju
2018	J	`jnl`	Large-Scale Distributed Algorithms for Facility Location with Outliers. CoRR Tanmay Inamdar, Shreyas Pai, Sriram V. Pemmaraju
2018	Misc	`conf`	Near-Optimal Clustering in the k-machine model. ICDCN Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, Sriram V. Pemmaraju
2018	A*	`conf`	On Partial Covering For Geometric Set Systems. SoCG Tanmay Inamdar, Kasturi R. Varadarajan
2018	J	`jnl`	On the Partition Set Cover Problem. CoRR Tanmay Inamdar, Kasturi R. Varadarajan
2017	J	`jnl`	A Unified Framework for Capacitated Covering Problems in Metric and Geometric Spaces. CoRR Sayan Bandyapadhyay, Santanu Bhowmick, Tanmay Inamdar, Kasturi R. Varadarajan
2017	J	`jnl`	Near-Optimal Clustering in the k-machine model. CoRR Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, Sriram V. Pemmaraju
2017	J	`jnl`	On Partial Covering For Geometric Set Systems. CoRR Tanmay Inamdar, Kasturi R. Varadarajan
2016	J	`jnl`	Improved Approximation for Metric Multi-Cover. CoRR Santanu Bhowmick, Tanmay Inamdar, Kasturi R. Varadarajan