Siddharth Barman

147 papers A* 40A 12B 3Misc 1Journal 82Unranked 8

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Compatibility of Fairness and Nash Welfare under Subadditive Valuations. SODA Siddharth Barman, Mashbat Suzuki
2026	J	`jnl`	Existence and Computation of Fair Allocations under Constraints. CoRR Siddharth Barman, Ioannis Caragiannis, Sudarshan Shyam
2026	A*	`conf`	Fair Division Beyond Monotone Valuations with Applications to Equitable Graph Partitioning. SODA Siddharth Barman, Paritosh Verma
2026	J	`jnl`	Nearly Equitable Allocations Beyond Additivity and Monotonicity. J. Artif. Intell. Res. Siddharth Barman, Umang Bhaskar, Yeshwant Pandit, Soumyajit Pyne
2026	J	`jnl`	Welfarist Formulations for Diverse Similarity Search. CoRR Siddharth Barman, Nirjhar Das, Shivam Gupta, Kirankumar Shiragur
2025	J	`jnl`	Exact Maximin Share Fairness via Adjusted Supply. CoRR Siddharth Barman, Satyanand Rammohan, Aditi Sethia
2025	J	`jnl`	Fair Division Beyond Monotone Valuations. CoRR Siddharth Barman, Paritosh Verma
2025	A*	`conf`	Fair Division with Market Values. AAAI Siddharth Barman, Soroush Ebadian, Mohamad Latifian, Nisarg Shah
2025	J	`jnl`	Fair and Efficient Allocation of Indivisible Mixed Manna. CoRR Siddharth Barman, Vishwa Prakash HV, Aditi Sethia, Mashbat Suzuki
2025	J	`jnl`	Proximately Envy-Free and Efficient Allocation of Mixed Manna. CoRR Siddharth Barman, Paritosh Verma
2024	—	`ed.`	44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2024, Gandhinagar, Gujarat, India, December 16-18, 2024 FSTTCS Siddharth Barman, Slawomir Lasota
2024	J	`jnl`	Causal Contextual Bandits with Adaptive Context. RLJ Rahul Madhavan, Aurghya Maiti, Gaurav Sinha, Siddharth Barman
2024	J	`jnl`	Causal Contextual Bandits with Adaptive Context. CoRR Rahul Madhavan, Aurghya Maiti, Gaurav Sinha, Siddharth Barman
2024	J	`jnl`	Compatibility of Fairness and Nash Welfare under Subadditive Valuations. CoRR Siddharth Barman, Mashbat Suzuki
2024	J	`jnl`	Fair Division with Market Values. CoRR Siddharth Barman, Soroush Ebadian, Mohamad Latifian, Nisarg Shah
2024	A*	`conf`	Generalized Linear Bandits with Limited Adaptivity. NeurIPS Ayush Sawarni, Nirjhar Das, Siddharth Barman, Gaurav Sinha
2024	A*	`conf`	Nearly Equitable Allocations beyond Additivity and Monotonicity. AAAI Siddharth Barman, Umang Bhaskar, Yeshwant Pandit, Soumyajit Pyne
2024	J	`jnl`	Optimal Regret with Limited Adaptivity for Generalized Linear Contextual Bandits. CoRR Ayush Sawarni, Nirjhar Das, Siddharth Barman, Gaurav Sinha
2024	A	`conf`	Parameterized Guarantees for Almost Envy-Free Allocations. AAMAS Siddharth Barman, Debajyoti Kar, Shraddha Pathak
2024	A	`conf`	Sublinear Approximation Algorithm for Nash Social Welfare with XOS Valuations. ITCS Siddharth Barman, Anand Krishna, Pooja Kulkarni, Shivika Narang
2023	A*	`conf`	Approximation Algorithms for Envy-Free Cake Division with Connected Pieces. ICALP Siddharth Barman, Pooja Kulkarni
2023	A	`conf`	Fair Chore Division under Binary Supermodular Costs. AAMAS Siddharth Barman, Vishnu V. Narayan, Paritosh Verma
2023	J	`jnl`	Fair Chore Division under Binary Supermodular Costs. CoRR Siddharth Barman, Vishnu V. Narayan, Paritosh Verma
2023	A*	`conf`	Fairness and Welfare Quantification for Regret in Multi-Armed Bandits. AAAI Siddharth Barman, Arindam Khan, Arnab Maiti, Ayush Sawarni
2023	A*	`conf`	Finding Fair Allocations under Budget Constraints. AAAI Siddharth Barman, Arindam Khan, Sudarshan Shyam, K. V. N. Sreenivas
2023	A*	`conf`	Guaranteeing Envy-Freeness under Generalized Assignment Constraints. EC Siddharth Barman, Arindam Khan, Sudarshan Shyam, K. V. N. Sreenivas
2023	J	`jnl`	Guaranteeing Envy-Freeness under Generalized Assignment Constraints. CoRR Siddharth Barman, Arindam Khan, Sudarshan Shyam, K. V. N. Sreenivas
2023	J	`jnl`	Learning Good Interventions in Causal Graphs via Covering. CoRR Ayush Sawarni, Rahul Madhavan, Gaurav Sinha, Siddharth Barman
2023	A	`conf`	Learning good interventions in causal graphs via covering. UAI Ayush Sawarni, Rahul Madhavan, Gaurav Sinha, Siddharth Barman
2023	A*	`conf`	Nash Regret Guarantees for Linear Bandits. NeurIPS Ayush Sawarni, Soumyabrata Pal, Siddharth Barman
2023	J	`jnl`	Nash Regret Guarantees for Linear Bandits. CoRR Ayush Sawarni, Soumybrata Pal, Siddharth Barman
2023	J	`jnl`	Nearly Equitable Allocations Beyond Additivity and Monotonicity. CoRR Siddharth Barman, Umang Bhaskar, Yeshwant Pandit, Soumyajit Pyne
2023	J	`jnl`	Parameterized Guarantees for Almost Envy-Free Allocations. CoRR Siddharth Barman, Debajyoti Kar, Shraddha Pathak
2023	J	`jnl`	The Edgeworth Conjecture with Small Coalitions and Approximate Equilibria in Large Economies. Math. Oper. Res. Siddharth Barman, Federico Echenique
2022	A*	`conf`	Achieving Envy-Freeness with Limited Subsidies under Dichotomous Valuations. IJCAI Siddharth Barman, Anand Krishna, Yadati Narahari, Soumyarup Sadhukhan
2022	J	`jnl`	Achieving Envy-Freeness with Limited Subsidies under Dichotomous Valuations. CoRR Siddharth Barman, Anand Krishna, Y. Narahari, Soumyarup Sadhukhan
2022	J	`jnl`	Approximation Algorithms for Envy-Free Cake Division with Connected Pieces. CoRR Siddharth Barman, Pooja Kulkarni
2022	J	`jnl`	Fair Cake Division Under Monotone Likelihood Ratios. Math. Oper. Res. Siddharth Barman, Nidhi Rathi
2022	J	`jnl`	Fairness and Welfare Quantification for Regret in Multi-Armed Bandits. CoRR Siddharth Barman, Arindam Khan, Arnab Maiti, Ayush Sawarni
2022	J	`jnl`	Finding Fair Allocations under Budget Constraints. CoRR Siddharth Barman, Arindam Khan, Sudarshan Shyam, K. V. N. Sreenivas
2022	J	`jnl`	Fully Polynomial-Time Approximation Schemes for Fair Rent Division. Math. Oper. Res. Eshwar Ram Arunachaleswaran, Siddharth Barman, Nidhi Rathi
2022	—	`conf`	Nash Welfare Guarantees for Fair and Efficient Coverage. WINE Siddharth Barman, Anand Krishna, Y. Narahari, Soumyarup Sadhukhan
2022	J	`jnl`	Nash Welfare Guarantees for Fair and Efficient Coverage. CoRR Siddharth Barman, Anand Krishna, Y. Narahari, Soumyarup Sadhukhan
2022	J	`jnl`	Tight approximation bounds for maximum multi-coverage. Math. Program. Siddharth Barman, Omar Fawzi, Suprovat Ghoshal, Emirhan Gürpinar
2022	A*	`conf`	Truthful and Fair Mechanisms for Matroid-Rank Valuations. AAAI Siddharth Barman, Paritosh Verma
2022	A*	`conf`	Universal and Tight Online Algorithms for Generalized-Mean Welfare. AAAI Siddharth Barman, Arindam Khan, Arnab Maiti
2021	—	`conf`	Approximating Nash Social Welfare Under Binary XOS and Binary Subadditive Valuations. WINE Siddharth Barman, Paritosh Verma
2021	J	`jnl`	Approximating Nash Social Welfare under Binary XOS and Binary Subadditive Valuations. CoRR Siddharth Barman, Paritosh Verma
2021	A	`conf`	Existence and Computation of Maximin Fair Allocations Under Matroid-Rank Valuations. AAMAS Siddharth Barman, Paritosh Verma
2021	J	`jnl`	Intervention Efficient Algorithm for Two-Stage Causal MDPs. CoRR Rahul Madhavan, Aurghya Maiti, Gaurav Sinha, Siddharth Barman
2021	A*	`conf`	Optimal Algorithms for Range Searching over Multi-Armed Bandits. IJCAI Siddharth Barman, Ramakrishnan Krishnamurthy, Saladi Rahul
2021	J	`jnl`	Optimal Algorithms for Range Searching over Multi-Armed Bandits. CoRR Siddharth Barman, Ramakrishnan Krishnamurthy, Saladi Rahul
2021	J	`jnl`	Sublinear Approximation Algorithm for Nash Social Welfare with XOS Valuations. CoRR Siddharth Barman, Anand Krishna, Pooja Kulkarni, Shivika Narang
2021	A	`conf`	Tight Approximation Guarantees for Concave Coverage Problems. STACS Siddharth Barman, Omar Fawzi, Paul Fermé
2021	J	`jnl`	Truthful and Fair Mechanisms for Matroid-Rank Valuations. CoRR Siddharth Barman, Paritosh Verma
2021	J	`jnl`	Universal and Tight Online Algorithms for Generalized-Mean Welfare. CoRR Siddharth Barman, Arindam Khan, Arnab Maiti
2020	J	`jnl`	Approximation Algorithms for Maximin Fair Division. ACM Trans. Economics and Comput. Siddharth Barman, Sanath Kumar Krishnamurthy
2020	J	`jnl`	Existence and Computation of Maximin Fair Allocations Under Matroid-Rank Valuations. CoRR Siddharth Barman, Paritosh Verma
2020	A*	`conf`	Fair Cake Division Under Monotone Likelihood Ratios. EC Siddharth Barman, Nidhi Rathi
2020	J	`jnl`	Fair Cake Division Under Monotone Likelihood Ratios. CoRR Siddharth Barman, Nidhi Rathi
2020	—	`conf`	Optimal Bounds on the Price of Fairness for Indivisible Goods. WINE Siddharth Barman, Umang Bhaskar, Nisarg Shah
2020	J	`jnl`	Settling the Price of Fairness for Indivisible Goods. CoRR Siddharth Barman, Umang Bhaskar, Nisarg Shah
2020	A*	`conf`	The Edgeworth Conjecture with Small Coalitions and Approximate Equilibria in Large Economies. EC Siddharth Barman, Federico Echenique
2020	A	`conf`	Tight Approximation Algorithms for p-Mean Welfare Under Subadditive Valuations. ESA Siddharth Barman, Umang Bhaskar, Anand Krishna, Ranjani G. Sundaram
2020	J	`jnl`	Tight Approximation Algorithms for p-Mean Welfare Under Subadditive Valuations. CoRR Siddharth Barman, Umang Bhaskar, Anand Krishna, Ranjani G. Sundaram
2020	B	`conf`	Tight Approximation Bounds for Maximum Multi-coverage. IPCO Siddharth Barman, Omar Fawzi, Suprovat Ghoshal, Emirhan Gürpinar
2020	J	`jnl`	Tight Approximation Guarantees for Concave Coverage Problems. CoRR Siddharth Barman, Omar Fawzi, Paul Fermé
2020	A*	`conf`	Uniform Welfare Guarantees Under Identical Subadditive Valuations. IJCAI Siddharth Barman, Ranjani G. Sundaram
2020	J	`jnl`	Uniform Welfare Guarantees Under Identical Subadditive Valuations. CoRR Siddharth Barman, Ranjani G. Sundaram
2019	A	`conf`	Fair Division of Indivisible Goods Among Strategic Agents. AAMAS Siddharth Barman, Ganesh Ghalme, Shweta Jain, Pooja Kulkarni, Shivika Narang
2019	J	`jnl`	Fair Division of Indivisible Goods Among Strategic Agents. CoRR Siddharth Barman, Ganesh Ghalme, Shweta Jain, Pooja Kulkarni, Shivika Narang
2019	A*	`conf`	Fair Division with a Secretive Agent. AAAI Eshwar Ram Arunachaleswaran, Siddharth Barman, Nidhi Rathi
2019	—	`conf`	Fair and Efficient Cake Division with Connected Pieces. WINE Eshwar Ram Arunachaleswaran, Siddharth Barman, Rachitesh Kumar, Nidhi Rathi
2019	J	`jnl`	Fair and Efficient Cake Division with Connected Pieces. CoRR Eshwar Ram Arunachaleswaran, Siddharth Barman, Rachitesh Kumar, Nidhi Rathi
2019	A*	`conf`	Fully Polynomial-Time Approximation Schemes for Fair Rent Division. SODA Eshwar Ram Arunachaleswaran, Siddharth Barman, Nidhi Rathi
2019	A*	`conf`	Matroid Constrained Fair Allocation Problem. AAAI Arpita Biswas, Siddharth Barman
2019	A*	`conf`	On the Proximity of Markets with Integral Equilibria. AAAI Siddharth Barman, Sanath Kumar Krishnamurthy
2019	J	`jnl`	Quantifying Infra-Marginality and Its Trade-off with Group Fairness. CoRR Arpita Biswas, Siddharth Barman, Amit Deshpande, Amit Sharma
2019	J	`jnl`	The Edgeworth Conjecture with Small Coalitions and Approximate Equilibria in Large Economies. CoRR Siddharth Barman, Federico Echenique
2019	J	`jnl`	Tight Approximation Bounds for Maximum Multi-Coverage. CoRR Siddharth Barman, Omar Fawzi, Suprovat Ghoshal, Emirhan Gürpinar
2018	J	`jnl`	Algorithmic Aspects of Optimal Channel Coding. IEEE Trans. Inf. Theory Siddharth Barman, Omar Fawzi
2018	J	`jnl`	Approximating Nash Equilibria and Dense Subgraphs via an Approximate Version of Carathéodory's Theorem. SIAM J. Comput. Siddharth Barman
2018	A*	`conf`	Fair Division Under Cardinality Constraints. IJCAI Arpita Biswas, Siddharth Barman
2018	J	`jnl`	Fair Division Under Cardinality Constraints. CoRR Siddharth Barman, Arpita Biswas
2018	J	`jnl`	Fair Division with a Secretive Agent. CoRR Eshwar Ram Arunachaleswaran, Siddharth Barman, Nidhi Rathi
2018	A*	`conf`	Finding Fair and Efficient Allocations. EC Siddharth Barman, Sanath Kumar Krishnamurthy, Rohit Vaish
2018	J	`jnl`	Fully Polynomial-Time Approximation Schemes for Fair Rent Division. CoRR Eshwar Ram Arunachaleswaran, Siddharth Barman, Nidhi Rathi
2018	A	`conf`	Greedy Algorithms for Maximizing Nash Social Welfare. AAMAS Siddharth Barman, Sanath Kumar Krishnamurthy, Rohit Vaish
2018	J	`jnl`	Greedy Algorithms for Maximizing Nash Social Welfare. CoRR Siddharth Barman, Sanath Kumar Krishna Murthy, Rohit Vaish
2018	A*	`conf`	Groupwise Maximin Fair Allocation of Indivisible Goods. AAAI Siddharth Barman, Arpita Biswas, Sanath Kumar Krishna Murthy, Yadati Narahari
2018	J	`jnl`	On the Proximity of Markets with Integral Equilibria. CoRR Siddharth Barman, Sanath Kumar Krishnamurthy
2018	A*	`conf`	Online Learning for Structured Loss Spaces. AAAI Siddharth Barman, Aditya Gopalan, Aadirupa Saha
2018	A*	`conf`	Testing Sparsity over Known and Unknown Bases. ICML Siddharth Barman, Arnab Bhattacharyya, Suprovat Ghoshal
2017	A	`conf`	Algorithmic Aspects of Private Bayesian Persuasion. ITCS Yakov Babichenko, Siddharth Barman
2017	A*	`conf`	Approximation Algorithms for Maximin Fair Division. EC Siddharth Barman, Sanath Kumar Krishna Murthy
2017	J	`jnl`	Approximation Algorithms for Maximin Fair Division. CoRR Siddharth Barman, Sanath Kumar Krishna Murthy
2017	J	`jnl`	Empirical Distribution of Equilibrium Play and Its Testing Application. Math. Oper. Res. Yakov Babichenko, Siddharth Barman, Ron Peretz
2017	J	`jnl`	Finding Fair and Efficient Allocations. CoRR Siddharth Barman, Sanath Kumar Krishna Murthy, Rohit Vaish
2017	J	`jnl`	Groupwise Maximin Fair Allocation of Indivisible Goods. CoRR Siddharth Barman, Arpita Biswas, Sanath Kumar Krishna Murthy, Y. Narahari
2017	J	`jnl`	Online Learning for Structured Loss Spaces. CoRR Siddharth Barman, Aditya Gopalan, Aadirupa Saha
2016	B	`conf`	Algorithmic aspects of optimal channel coding. ISIT Siddharth Barman, Omar Fawzi
2016	J	`jnl`	Approximating Nash Equilibria in Tree Polymatrix Games. CoRR Siddharth Barman, Katrina Ligett, Georgios Piliouras
2016	J	`jnl`	Computational Aspects of Private Bayesian Persuasion. CoRR Yakov Babichenko, Siddharth Barman
2016	J	`jnl`	The Dictionary Testing Problem. CoRR Siddharth Barman, Arnab Bhattacharyya, Suprovat Ghoshal
2015	J	`jnl`	A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret. CoRR Lachlan L. H. Andrew, Siddharth Barman, Katrina Ligett, Minghong Lin, Adam Meyerson, Alan Roytman, Adam Wierman
2015	J	`jnl`	Algorithmic Aspects of Optimal Channel Coding. CoRR Siddharth Barman, Omar Fawzi
2015	A*	`conf`	Approximating Nash Equilibria and Dense Bipartite Subgraphs via an Approximate Version of Caratheodory's Theorem. STOC Siddharth Barman
2015	B	`conf`	Approximating Nash Equilibria in Tree Polymatrix Games. SAGT Siddharth Barman, Katrina Ligett, Georgios Piliouras
2015	J	`jnl`	Computing Optimal Tolls in Routing Games without Knowing the Latency Functions. CoRR Siddharth Barman, Umang Bhaskar, Chaitanya Swamy
2015	A*	`conf`	Finding Any Nontrivial Coarse Correlated Equilibrium Is Hard. EC Siddharth Barman, Katrina Ligett
2015	J	`jnl`	Finding Any Nontrivial Coarse Correlated Equilibrium Is Hard. CoRR Siddharth Barman, Katrina Ligett
2015	J	`jnl`	Finding any nontrivial coarse correlated equilibrium is hard. SIGecom Exch. Siddharth Barman, Katrina Ligett
2015	A*	`conf`	Online Convex Optimization Using Predictions. SIGMETRICS Niangjun Chen, Anish Agarwal, Adam Wierman, Siddharth Barman, Lachlan L. H. Andrew
2015	J	`jnl`	Online Convex Optimization Using Predictions. CoRR Niangjun Chen, Anish Agarwal, Adam Wierman, Siddharth Barman, Lachlan L. H. Andrew
2015	J	`jnl`	Query Complexity of Correlated Equilibrium. ACM Trans. Economics and Comput. Yakov Babichenko, Siddharth Barman
2014	J	`jnl`	Approximating Carathéodory's Theorem and Nash Equilibria. CoRR Siddharth Barman
2014	—	`conf`	Network Design with Coverage Costs. APPROX-RANDOM Siddharth Barman, Shuchi Chawla, Seeun Umboh
2014	A	`conf`	On Load Shedding in Complex Event Processing. ICDT Yeye He, Siddharth Barman, Jeffrey F. Naughton
2014	—	`conf`	On the Existence of Low-Rank Explanations for Mixed Strategy Behavior. WINE Siddharth Barman, Umang Bhaskar, Federico Echenique, Adam Wierman
2014	A*	`conf`	Simple approximate equilibria in large games. EC Yakov Babichenko, Siddharth Barman, Ron Peretz
2013	J	`jnl`	A 2-Approximation for Redundancy Aware Network Design with Laminar Demands CoRR Siddharth Barman, Shuchi Chawla, Seeun Umboh
2013	A*	`conf`	A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret. COLT Lachlan L. H. Andrew, Siddharth Barman, Katrina Ligett, Minghong Lin, Adam Meyerson, Alan Roytman, Adam Wierman
2013	A*	`conf`	A tale of two metrics: simultaneous bounds on competitiveness and regret. SIGMETRICS Lachlan L. H. Andrew, Siddharth Barman, Katrina Ligett, Minghong Lin, Adam Meyerson, Alan Roytman, Adam Wierman
2013	J	`jnl`	Decomposition Methods for Large Scale LP Decoding. IEEE Trans. Inf. Theory Siddharth Barman, Xishuo Liu, Stark C. Draper, Benjamin Recht
2013	J	`jnl`	Empirical Distribution of Equilibrium Play and Its Testing Application. CoRR Yakov Babichenko, Siddharth Barman, Ron Peretz
2013	J	`jnl`	On Load Shedding in Complex Event Processing. CoRR Yeye He, Siddharth Barman, Jeffrey F. Naughton
2013	J	`jnl`	Query Complexity of Correlated Equilibrium. CoRR Yakov Babichenko, Siddharth Barman
2013	J	`jnl`	Small-Support Approximate Correlated Equilibria. CoRR Yakov Babichenko, Siddharth Barman, Ron Peretz
2013	J	`jnl`	The Complexity of Nash Equilibria as Revealed by Data. CoRR Siddharth Barman, Umang Bhaskar, Federico Echenique, Adam Wierman
2013	J	`jnl`	The Empirical Implications of Rank in Bimatrix Games CoRR Siddharth Barman, Umang Bhaskar, Federico Echenique, Adam Wierman
2013	A*	`conf`	The empirical implications of rank in Bimatrix games. EC Siddharth Barman, Umang Bhaskar, Federico Echenique, Adam Wierman
2012	J	`jnl`	A Bicriteria Approximation for the Reordering Buffer Problem CoRR Siddharth Barman, Shuchi Chawla, Seeun Umboh
2012	A	`conf`	A Bicriteria Approximation for the Reordering Buffer Problem. ESA Siddharth Barman, Shuchi Chawla, Seeun Umboh
2012	A*	`conf`	Approximate String Membership Checking: A Multiple Filter, Optimization-Based Approach. ICDE Chong Sun, Jeffrey F. Naughton, Siddharth Barman
2012	J	`jnl`	Decomposition Methods for Large Scale LP Decoding CoRR Siddharth Barman, Xishuo Liu, Stark C. Draper, Benjamin Recht
2012	—	`conf`	Secretary Problems with Convex Costs. ICALP (1) Siddharth Barman, Seeun Umboh, Shuchi Chawla, David L. Malec
2012	A*	`conf`	Traffic-redundancy aware network design. SODA Siddharth Barman, Shuchi Chawla
2011	—	`conf`	Decomposition methods for large scale LP decoding. Allerton Siddharth Barman, Xishuo Liu, Stark C. Draper, Benjamin Recht
2011	A*	`conf`	On the complexity of privacy-preserving complex event processing. PODS Yeye He, Siddharth Barman, Di Wang, Jeffrey F. Naughton
2011	A*	`conf`	Preventing equivalence attacks in updated, anonymized data. ICDE Yeye He, Siddharth Barman, Jeffrey F. Naughton
2011	J	`jnl`	Secretary Problems with Convex Costs CoRR Siddharth Barman, Seeun Umboh, Shuchi Chawla, David L. Malec
2011	J	`jnl`	Traffic-Redundancy Aware Network Design CoRR Siddharth Barman, Shuchi Chawla
2010	A*	`conf`	Region Growing for Multi-Route Cuts. SODA Siddharth Barman, Shuchi Chawla
2009	A*	`conf`	Packing multiway cuts in capacitated graphs. SODA Siddharth Barman, Shuchi Chawla
2009	J	`jnl`	Region growing for multi-route cuts CoRR Siddharth Barman, Shuchi Chawla
2008	J	`jnl`	Packing multiway cuts in capacitated graphs CoRR Siddharth Barman, Shuchi Chawla
2005	Misc	`conf`	Secure Two-Party Context Free Language Recognition. ICDCIT Anshuman Singh, Siddharth Barman, Kaushal K. Shukla