default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSiddharth Barman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c60]Siddharth Barman, Umang Bhaskar, Yeshwant Pandit, Soumyajit Pyne:
Nearly Equitable Allocations beyond Additivity and Monotonicity. AAAI 2024: 9494-9501- [c59]Siddharth Barman, Debajyoti Kar, Shraddha Pathak:
Parameterized Guarantees for Almost Envy-Free Allocations. AAMAS 2024: 151-159 - [c58]Siddharth Barman, Anand Krishna, Pooja Kulkarni, Shivika Narang:
Sublinear Approximation Algorithm for Nash Social Welfare with XOS Valuations. ITCS 2024: 8:1-8:23 - [i62]Ayush Sawarni, Nirjhar Das, Siddharth Barman, Gaurav Sinha:
Optimal Regret with Limited Adaptivity for Generalized Linear Contextual Bandits. CoRR abs/2404.06831 (2024) - [i61]Rahul Madhavan, Aurghya Maiti, Gaurav Sinha, Siddharth Barman:
Causal Contextual Bandits with Adaptive Context. CoRR abs/2405.18626 (2024) - [i60]Siddharth Barman, Mashbat Suzuki:
Compatibility of Fairness and Nash Welfare under Subadditive Valuations. CoRR abs/2407.12461 (2024) - 2023
- [j11]Siddharth Barman
, Federico Echenique:
The Edgeworth Conjecture with Small Coalitions and Approximate Equilibria in Large Economies. Math. Oper. Res. 48(1): 313-331 (2023) - [c57]Siddharth Barman, Arindam Khan, Sudarshan Shyam, K. V. N. Sreenivas:
Finding Fair Allocations under Budget Constraints. AAAI 2023: 5481-5489 - [c56]Siddharth Barman, Arindam Khan, Arnab Maiti, Ayush Sawarni:
Fairness and Welfare Quantification for Regret in Multi-Armed Bandits. AAAI 2023: 6762-6769 - [c55]Siddharth Barman, Vishnu V. Narayan, Paritosh Verma:
Fair Chore Division under Binary Supermodular Costs. AAMAS 2023: 2863-2865 - [c54]Siddharth Barman, Pooja Kulkarni:
Approximation Algorithms for Envy-Free Cake Division with Connected Pieces. ICALP 2023: 16:1-16:19 - [c53]Ayush Sawarni, Soumyabrata Pal, Siddharth Barman:
Nash Regret Guarantees for Linear Bandits. NeurIPS 2023 - [c52]Siddharth Barman, Arindam Khan, Sudarshan Shyam, K. V. N. Sreenivas:
Guaranteeing Envy-Freeness under Generalized Assignment Constraints. EC 2023: 242-269 - [c51]Ayush Sawarni, Rahul Madhavan, Gaurav Sinha, Siddharth Barman:
Learning good interventions in causal graphs via covering. UAI 2023: 1827-1836 - [i59]Siddharth Barman, Vishnu V. Narayan, Paritosh Verma:
Fair Chore Division under Binary Supermodular Costs. CoRR abs/2302.11530 (2023) - [i58]Siddharth Barman, Arindam Khan, Sudarshan Shyam, K. V. N. Sreenivas:
Guaranteeing Envy-Freeness under Generalized Assignment Constraints. CoRR abs/2305.01339 (2023) - [i57]Ayush Sawarni, Rahul Madhavan, Gaurav Sinha, Siddharth Barman:
Learning Good Interventions in Causal Graphs via Covering. CoRR abs/2305.04638 (2023) - [i56]Ayush Sawarni, Soumybrata Pal, Siddharth Barman:
Nash Regret Guarantees for Linear Bandits. CoRR abs/2310.02023 (2023) - [i55]Siddharth Barman, Umang Bhaskar, Yeshwant Pandit, Soumyajit Pyne:
Nearly Equitable Allocations Beyond Additivity and Monotonicity. CoRR abs/2312.07195 (2023) - [i54]Siddharth Barman, Debajyoti Kar, Shraddha Pathak:
Parameterized Guarantees for Almost Envy-Free Allocations. CoRR abs/2312.13791 (2023) - 2022
- [j10]Siddharth Barman, Nidhi Rathi:
Fair Cake Division Under Monotone Likelihood Ratios. Math. Oper. Res. 47(3): 1875-1903 (2022) - [j9]Eshwar Ram Arunachaleswaran, Siddharth Barman, Nidhi Rathi:
Fully Polynomial-Time Approximation Schemes for Fair Rent Division. Math. Oper. Res. 47(3): 1970-1998 (2022) - [j8]Siddharth Barman, Omar Fawzi, Suprovat Ghoshal, Emirhan Gürpinar:
Tight approximation bounds for maximum multi-coverage. Math. Program. 192(1): 443-476 (2022) - [c50]Siddharth Barman, Arindam Khan, Arnab Maiti:
Universal and Tight Online Algorithms for Generalized-Mean Welfare. AAAI 2022: 4793-4800 - [c49]Siddharth Barman, Paritosh Verma:
Truthful and Fair Mechanisms for Matroid-Rank Valuations. AAAI 2022: 4801-4808 - [c48]Siddharth Barman, Anand Krishna, Yadati Narahari, Soumyarup Sadhukhan:
Achieving Envy-Freeness with Limited Subsidies under Dichotomous Valuations. IJCAI 2022: 60-66 - [c47]Siddharth Barman, Anand Krishna, Y. Narahari, Soumyarup Sadhukhan:
Nash Welfare Guarantees for Fair and Efficient Coverage. WINE 2022: 256-272 - [i53]Siddharth Barman, Anand Krishna, Y. Narahari, Soumyarup Sadhukhan:
Achieving Envy-Freeness with Limited Subsidies under Dichotomous Valuations. CoRR abs/2201.07419 (2022) - [i52]Siddharth Barman, Arindam Khan, Arnab Maiti, Ayush Sawarni:
Fairness and Welfare Quantification for Regret in Multi-Armed Bandits. CoRR abs/2205.13930 (2022) - [i51]Siddharth Barman, Anand Krishna, Y. Narahari, Soumyarup Sadhukhan:
Nash Welfare Guarantees for Fair and Efficient Coverage. CoRR abs/2207.01970 (2022) - [i50]Siddharth Barman, Arindam Khan, Sudarshan Shyam, K. V. N. Sreenivas:
Finding Fair Allocations under Budget Constraints. CoRR abs/2208.08168 (2022) - [i49]Siddharth Barman, Pooja Kulkarni:
Approximation Algorithms for Envy-Free Cake Division with Connected Pieces. CoRR abs/2208.08670 (2022) - 2021
- [c46]Siddharth Barman, Paritosh Verma:
Existence and Computation of Maximin Fair Allocations Under Matroid-Rank Valuations. AAMAS 2021: 169-177 - [c45]Siddharth Barman, Ramakrishnan Krishnamurthy, Saladi Rahul:
Optimal Algorithms for Range Searching over Multi-Armed Bandits. IJCAI 2021: 2177-2183 - [c44]Siddharth Barman, Omar Fawzi, Paul Fermé:
Tight Approximation Guarantees for Concave Coverage Problems. STACS 2021: 9:1-9:17 - [c43]Siddharth Barman, Paritosh Verma:
Approximating Nash Social Welfare Under Binary XOS and Binary Subadditive Valuations. WINE 2021: 373-390 - [i48]Siddharth Barman, Ramakrishnan Krishnamurthy, Saladi Rahul:
Optimal Algorithms for Range Searching over Multi-Armed Bandits. CoRR abs/2105.01390 (2021) - [i47]Siddharth Barman, Paritosh Verma:
Approximating Nash Social Welfare under Binary XOS and Binary Subadditive Valuations. CoRR abs/2106.02656 (2021) - [i46]Siddharth Barman, Arindam Khan, Arnab Maiti:
Universal and Tight Online Algorithms for Generalized-Mean Welfare. CoRR abs/2109.00874 (2021) - [i45]Siddharth Barman, Paritosh Verma:
Truthful and Fair Mechanisms for Matroid-Rank Valuations. CoRR abs/2109.05810 (2021) - [i44]Siddharth Barman, Anand Krishna, Pooja Kulkarni, Shivika Narang:
Sublinear Approximation Algorithm for Nash Social Welfare with XOS Valuations. CoRR abs/2110.00767 (2021) - [i43]Rahul Madhavan, Aurghya Maiti, Gaurav Sinha, Siddharth Barman:
Intervention Efficient Algorithm for Two-Stage Causal MDPs. CoRR abs/2111.00886 (2021) - 2020
- [j7]Siddharth Barman, Sanath Kumar Krishnamurthy:
Approximation Algorithms for Maximin Fair Division. ACM Trans. Economics and Comput. 8(1): 5:1-5:28 (2020) - [c42]Siddharth Barman, Umang Bhaskar, Anand Krishna, Ranjani G. Sundaram:
Tight Approximation Algorithms for p-Mean Welfare Under Subadditive Valuations. ESA 2020: 11:1-11:17 - [c41]Siddharth Barman, Ranjani G. Sundaram:
Uniform Welfare Guarantees Under Identical Subadditive Valuations. IJCAI 2020: 46-52 - [c40]Siddharth Barman, Omar Fawzi, Suprovat Ghoshal, Emirhan Gürpinar:
Tight Approximation Bounds for Maximum Multi-coverage. IPCO 2020: 66-77 - [c39]Siddharth Barman, Nidhi Rathi:
Fair Cake Division Under Monotone Likelihood Ratios. EC 2020: 401-437 - [c38]Siddharth Barman, Federico Echenique:
The Edgeworth Conjecture with Small Coalitions and Approximate Equilibria in Large Economies. EC 2020: 765-766 - [c37]Siddharth Barman, Umang Bhaskar, Nisarg Shah:
Optimal Bounds on the Price of Fairness for Indivisible Goods. WINE 2020: 356-369 - [i42]Siddharth Barman, Ranjani G. Sundaram:
Uniform Welfare Guarantees Under Identical Subadditive Valuations. CoRR abs/2005.00504 (2020) - [i41]Siddharth Barman, Umang Bhaskar, Anand Krishna, Ranjani G. Sundaram:
Tight Approximation Algorithms for p-Mean Welfare Under Subadditive Valuations. CoRR abs/2005.07370 (2020) - [i40]Siddharth Barman, Nidhi Rathi:
Fair Cake Division Under Monotone Likelihood Ratios. CoRR abs/2006.00481 (2020) - [i39]Siddharth Barman, Umang Bhaskar, Nisarg Shah:
Settling the Price of Fairness for Indivisible Goods. CoRR abs/2007.06242 (2020) - [i38]Siddharth Barman, Omar Fawzi, Paul Fermé:
Tight Approximation Guarantees for Concave Coverage Problems. CoRR abs/2010.00970 (2020) - [i37]Siddharth Barman, Paritosh Verma:
Existence and Computation of Maximin Fair Allocations Under Matroid-Rank Valuations. CoRR abs/2012.12710 (2020)
2010 – 2019
- 2019
- [c36]Eshwar Ram Arunachaleswaran, Siddharth Barman, Nidhi Rathi:
Fair Division with a Secretive Agent. AAAI 2019: 1732-1739 - [c35]Siddharth Barman, Sanath Kumar Krishnamurthy:
On the Proximity of Markets with Integral Equilibria. AAAI 2019: 1748-1755 - [c34]Arpita Biswas, Siddharth Barman:
Matroid Constrained Fair Allocation Problem. AAAI 2019: 9921-9922 - [c33]Siddharth Barman, Ganesh Ghalme, Shweta Jain, Pooja Kulkarni, Shivika Narang:
Fair Division of Indivisible Goods Among Strategic Agents. AAMAS 2019: 1811-1813 - [c32]Eshwar Ram Arunachaleswaran, Siddharth Barman, Nidhi Rathi:
Fully Polynomial-Time Approximation Schemes for Fair Rent Division. SODA 2019: 1994-2013 - [c31]Eshwar Ram Arunachaleswaran, Siddharth Barman, Rachitesh Kumar, Nidhi Rathi:
Fair and Efficient Cake Division with Connected Pieces. WINE 2019: 57-70 - [i36]Siddharth Barman, Ganesh Ghalme, Shweta Jain, Pooja Kulkarni, Shivika Narang:
Fair Division of Indivisible Goods Among Strategic Agents. CoRR abs/1901.09427 (2019) - [i35]Siddharth Barman, Omar Fawzi, Suprovat Ghoshal, Emirhan Gürpinar:
Tight Approximation Bounds for Maximum Multi-Coverage. CoRR abs/1905.00640 (2019) - [i34]Siddharth Barman, Federico Echenique:
The Edgeworth Conjecture with Small Coalitions and Approximate Equilibria in Large Economies. CoRR abs/1905.05165 (2019) - [i33]Eshwar Ram Arunachaleswaran, Siddharth Barman, Rachitesh Kumar, Nidhi Rathi:
Fair and Efficient Cake Division with Connected Pieces. CoRR abs/1907.11019 (2019) - [i32]Arpita Biswas, Siddharth Barman, Amit Deshpande, Amit Sharma:
Quantifying Infra-Marginality and Its Trade-off with Group Fairness. CoRR abs/1909.00982 (2019) - 2018
- [j6]Siddharth Barman:
Approximating Nash Equilibria and Dense Subgraphs via an Approximate Version of Carathéodory's Theorem. SIAM J. Comput. 47(3): 960-981 (2018) - [j5]Siddharth Barman, Omar Fawzi:
Algorithmic Aspects of Optimal Channel Coding. IEEE Trans. Inf. Theory 64(2): 1038-1045 (2018) - [c30]Siddharth Barman, Arpita Biswas, Sanath Kumar Krishna Murthy, Yadati Narahari:
Groupwise Maximin Fair Allocation of Indivisible Goods. AAAI 2018: 917-924 - [c29]Siddharth Barman, Aditya Gopalan, Aadirupa Saha:
Online Learning for Structured Loss Spaces. AAAI 2018: 2696-2703 - [c28]Siddharth Barman, Sanath Kumar Krishnamurthy, Rohit Vaish:
Greedy Algorithms for Maximizing Nash Social Welfare. AAMAS 2018: 7-13 - [c27]Siddharth Barman, Arnab Bhattacharyya, Suprovat Ghoshal:
Testing Sparsity over Known and Unknown Bases. ICML 2018: 500-509 - [c26]Arpita Biswas, Siddharth Barman:
Fair Division Under Cardinality Constraints. IJCAI 2018: 91-97 - [c25]Siddharth Barman, Sanath Kumar Krishnamurthy, Rohit Vaish:
Finding Fair and Efficient Allocations. EC 2018: 557-574 - [i31]Siddharth Barman, Sanath Kumar Krishna Murthy, Rohit Vaish:
Greedy Algorithms for Maximizing Nash Social Welfare. CoRR abs/1801.09046 (2018) - [i30]Siddharth Barman, Arpita Biswas:
Fair Division Under Cardinality Constraints. CoRR abs/1804.09521 (2018) - [i29]Eshwar Ram Arunachaleswaran, Siddharth Barman, Nidhi Rathi:
Fully Polynomial-Time Approximation Schemes for Fair Rent Division. CoRR abs/1807.04163 (2018) - [i28]Siddharth Barman, Sanath Kumar Krishnamurthy:
On the Proximity of Markets with Integral Equilibria. CoRR abs/1811.08673 (2018) - [i27]Eshwar Ram Arunachaleswaran, Siddharth Barman, Nidhi Rathi:
Fair Division with a Secretive Agent. CoRR abs/1811.10859 (2018) - 2017
- [j4]Yakov Babichenko, Siddharth Barman, Ron Peretz:
Empirical Distribution of Equilibrium Play and Its Testing Application. Math. Oper. Res. 42(1): 15-29 (2017) - [c24]Yakov Babichenko, Siddharth Barman:
Algorithmic Aspects of Private Bayesian Persuasion. ITCS 2017: 34:1-34:16 - [c23]Siddharth Barman, Sanath Kumar Krishna Murthy:
Approximation Algorithms for Maximin Fair Division. EC 2017: 647-664 - [i26]Siddharth Barman, Sanath Kumar Krishna Murthy:
Approximation Algorithms for Maximin Fair Division. CoRR abs/1703.01851 (2017) - [i25]Siddharth Barman, Aditya Gopalan, Aadirupa Saha:
Online Learning for Structured Loss Spaces. CoRR abs/1706.04125 (2017) - [i24]Siddharth Barman, Sanath Kumar Krishna Murthy, Rohit Vaish:
Finding Fair and Efficient Allocations. CoRR abs/1707.04731 (2017) - [i23]Siddharth Barman, Arpita Biswas, Sanath Kumar Krishna Murthy, Y. Narahari:
Groupwise Maximin Fair Allocation of Indivisible Goods. CoRR abs/1711.07621 (2017) - 2016
- [c22]Siddharth Barman, Omar Fawzi:
Algorithmic aspects of optimal channel coding. ISIT 2016: 905-909 - [i22]Yakov Babichenko, Siddharth Barman:
Computational Aspects of Private Bayesian Persuasion. CoRR abs/1603.01444 (2016) - [i21]Siddharth Barman, Katrina Ligett, Georgios Piliouras:
Approximating Nash Equilibria in Tree Polymatrix Games. CoRR abs/1604.02676 (2016) - [i20]Siddharth Barman, Arnab Bhattacharyya, Suprovat Ghoshal:
The Dictionary Testing Problem. CoRR abs/1608.01275 (2016) - 2015
- [j3]Siddharth Barman, Katrina Ligett:
Finding any nontrivial coarse correlated equilibrium is hard. SIGecom Exch. 14(1): 76-79 (2015) - [j2]Yakov Babichenko, Siddharth Barman:
Query Complexity of Correlated Equilibrium. ACM Trans. Economics and Comput. 3(4): 22:1-22:9 (2015) - [c21]Siddharth Barman, Katrina Ligett, Georgios Piliouras:
Approximating Nash Equilibria in Tree Polymatrix Games. SAGT 2015: 285-296 - [c20]Siddharth Barman, Katrina Ligett:
Finding Any Nontrivial Coarse Correlated Equilibrium Is Hard. EC 2015: 815-816 - [c19]Niangjun Chen, Anish Agarwal, Adam Wierman, Siddharth Barman, Lachlan L. H. Andrew:
Online Convex Optimization Using Predictions. SIGMETRICS 2015: 191-204 - [c18]Siddharth Barman:
Approximating Nash Equilibria and Dense Bipartite Subgraphs via an Approximate Version of Caratheodory's Theorem. STOC 2015: 361-369 - [i19]Siddharth Barman, Katrina Ligett:
Finding Any Nontrivial Coarse Correlated Equilibrium Is Hard. CoRR abs/1504.06314 (2015) - [i18]Niangjun Chen, Anish Agarwal, Adam Wierman, Siddharth Barman, Lachlan L. H. Andrew:
Online Convex Optimization Using Predictions. CoRR abs/1504.06681 (2015) - [i17]Siddharth Barman, Umang Bhaskar, Chaitanya Swamy:
Computing Optimal Tolls in Routing Games without Knowing the Latency Functions. CoRR abs/1505.04897 (2015) - [i16]Lachlan L. H. Andrew, Siddharth Barman, Katrina Ligett, Minghong Lin, Adam Meyerson, Alan Roytman, Adam Wierman:
A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret. CoRR abs/1508.03769 (2015) - [i15]Siddharth Barman, Omar Fawzi:
Algorithmic Aspects of Optimal Channel Coding. CoRR abs/1508.04095 (2015) - 2014
- [c17]Siddharth Barman, Shuchi Chawla, Seeun Umboh:
Network Design with Coverage Costs. APPROX-RANDOM 2014: 48-63 - [c16]Yeye He, Siddharth Barman, Jeffrey F. Naughton:
On Load Shedding in Complex Event Processing. ICDT 2014: 213-224 - [c15]Yakov Babichenko, Siddharth Barman, Ron Peretz:
Simple approximate equilibria in large games. EC 2014: 753-770 - [c14]Siddharth Barman, Umang Bhaskar, Federico Echenique, Adam Wierman:
On the Existence of Low-Rank Explanations for Mixed Strategy Behavior. WINE 2014: 447-452 - [i14]Siddharth Barman:
Approximating Carathéodory's Theorem and Nash Equilibria. CoRR abs/1406.2296 (2014) - 2013
- [j1]Siddharth Barman, Xishuo Liu, Stark C. Draper, Benjamin Recht:
Decomposition Methods for Large Scale LP Decoding. IEEE Trans. Inf. Theory 59(12): 7870-7886 (2013) - [c13]Lachlan L. H. Andrew, Siddharth Barman, Katrina Ligett, Minghong Lin, Adam Meyerson, Alan Roytman, Adam Wierman:
A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret. COLT 2013: 741-763 - [c12]Siddharth Barman, Umang Bhaskar, Federico Echenique, Adam Wierman:
The empirical implications of rank in Bimatrix games. EC 2013: 55-72 - [c11]Lachlan L. H. Andrew, Siddharth Barman, Katrina Ligett, Minghong Lin, Adam Meyerson, Alan Roytman, Adam Wierman:
A tale of two metrics: simultaneous bounds on competitiveness and regret. SIGMETRICS 2013: 329-330 - [i13]Siddharth Barman, Shuchi Chawla, Seeun Umboh:
A 2-Approximation for Redundancy Aware Network Design with Laminar Demands. CoRR abs/1304.3868 (2013) - [i12]Siddharth Barman, Umang Bhaskar, Federico Echenique, Adam Wierman:
The Empirical Implications of Rank in Bimatrix Games. CoRR abs/1305.3336 (2013) - [i11]Yakov Babichenko, Siddharth Barman:
Query Complexity of Correlated Equilibrium. CoRR abs/1306.2437 (2013) - [i10]Yakov Babichenko, Siddharth Barman, Ron Peretz:
Small-Support Approximate Correlated Equilibria. CoRR abs/1308.6025 (2013) - [i9]Yakov Babichenko, Siddharth Barman, Ron Peretz:
Empirical Distribution of Equilibrium Play and Its Testing Application. CoRR abs/1310.7654 (2013) - [i8]Siddharth Barman, Umang Bhaskar, Federico Echenique, Adam Wierman:
The Complexity of Nash Equilibria as Revealed by Data. CoRR abs/1311.2655 (2013) - [i7]Yeye He, Siddharth Barman, Jeffrey F. Naughton:
On Load Shedding in Complex Event Processing. CoRR abs/1312.4283 (2013) - 2012
- [c10]Siddharth Barman, Shuchi Chawla, Seeun Umboh:
A Bicriteria Approximation for the Reordering Buffer Problem. ESA 2012: 157-168 - [c9]Siddharth Barman, Seeun Umboh, Shuchi Chawla, David L. Malec:
Secretary Problems with Convex Costs. ICALP (1) 2012: 75-87 - [c8]Chong Sun, Jeffrey F. Naughton, Siddharth Barman:
Approximate String Membership Checking: A Multiple Filter, Optimization-Based Approach. ICDE 2012: 882-893 - [c7]Siddharth Barman, Shuchi Chawla:
Traffic-redundancy aware network design. SODA 2012: 1487-1498 - [i6]Siddharth Barman, Xishuo Liu, Stark C. Draper, Benjamin Recht:
Decomposition Methods for Large Scale LP Decoding. CoRR abs/1204.0556 (2012) - [i5]Siddharth Barman, Shuchi Chawla, Seeun Umboh:
A Bicriteria Approximation for the Reordering Buffer Problem. CoRR abs/1204.5823 (2012) - 2011
- [c6]Siddharth Barman, Xishuo Liu, Stark C. Draper, Benjamin Recht:
Decomposition methods for large scale LP decoding. Allerton 2011: 253-260 - [c5]Yeye He, Siddharth Barman, Jeffrey F. Naughton:
Preventing equivalence attacks in updated, anonymized data. ICDE 2011: 529-540 - [c4]Yeye He, Siddharth Barman, Di Wang, Jeffrey F. Naughton:
On the complexity of privacy-preserving complex event processing. PODS 2011: 165-174 - [i4]Siddharth Barman, Shuchi Chawla:
Traffic-Redundancy Aware Network Design. CoRR abs/1110.4150 (2011) - [i3]Siddharth Barman, Seeun Umboh, Shuchi Chawla, David L. Malec:
Secretary Problems with Convex Costs. CoRR abs/1112.1136 (2011) - 2010
- [c3]Siddharth Barman, Shuchi Chawla:
Region Growing for Multi-Route Cuts. SODA 2010: 404-418
2000 – 2009
- 2009
- [c2]Siddharth Barman, Shuchi Chawla:
Packing multiway cuts in capacitated graphs. SODA 2009: 1048-1057 - [i2]Siddharth Barman, Shuchi Chawla:
Region growing for multi-route cuts. CoRR abs/0908.0350 (2009) - 2008
- [i1]Siddharth Barman, Shuchi Chawla:
Packing multiway cuts in capacitated graphs. CoRR abs/0810.0674 (2008) - 2005
- [c1]Anshuman Singh, Siddharth Barman, Kaushal K. Shukla:
Secure Two-Party Context Free Language Recognition. ICDCIT 2005: 117-124
Coauthor Index
Sanath Kumar Krishna Murthy
aka: Sanath Kumar Krishnamurthy
aka: Sanath Kumar Krishnamurthy
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-25 19:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
