default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPalash Dey
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Arnab Maiti, Palash Dey
:
On Parameterized Complexity of Binary Networked Public Goods Game. Algorithmica 86(1): 307-333 (2024)- [j14]Arnab Maiti, Palash Dey:
Query complexity of tournament solutions. Theor. Comput. Sci. 991: 114422 (2024) - [c42]Rangeet Bhattacharyya, Parvik Dave, Palash Dey, Swaprava Nath:
Optimal Referral Auction Design. AAMAS 2024: 198-206 - [c41]Adway Mitra, Palash Dey:
Evaluating District-based Election Surveys with Synthetic Dirichlet Likelihood. AAMAS 2024: 1400-1408 - [c40]Koustav De, Harshil Mittal, Palash Dey, Neeldhara Misra:
Parameterized Aspects of Distinct Kemeny Rank Aggregation. CALDAM 2024: 14-28 - [c39]Palash Dey, Sudeshna Kolay, Sipra Singh:
Knapsack: Connectedness, Path, and Shortest-Path. LATIN (2) 2024: 162-176 - [c38]Arnab Maiti, Palash Dey:
On Binary Networked Public Goods Game with Altruism. LATIN (2) 2024: 289-303 - [i44]Palash Dey, Ashlesha Hota, Sudeshna Kolay, Sipra Singh:
Knapsack with Vertex Cover, Set Cover, and Hitting Set. CoRR abs/2406.01057 (2024) - 2023
- [j13]Palash Dey, Neeldhara Misra:
On the exact amount of missing information that makes finding possible winners hard. J. Comput. Syst. Sci. 135: 32-54 (2023) - [j12]Palash Dey:
Priced Gerrymandering. Theor. Comput. Sci. 972: 114080 (2023) - [j11]Neel Karia, Faraaz Mallick, Palash Dey:
How hard is safe bribery? Theor. Comput. Sci. 979: 114156 (2023) - [c37]Debajyoti Kar, Palash Dey, Swagato Sanyal:
Sampling-Based Winner Prediction in District-Based Elections. AAMAS 2023: 2661-2663 - [c36]Debajyoti Kar, Mert Kosan, Debmalya Mandal, Sourav Medya, Arlei Silva, Palash Dey, Swagato Sanyal:
Feature-based Individual Fairness in k-clustering. AAMAS 2023: 2772-2774 - [i43]Palash Dey, Sudeshna Kolay, Sipra Singh:
Knapsack: Connectedness, Path, and Shortest-Path. CoRR abs/2307.12547 (2023) - [i42]Koustav De, Harshil Mittal, Palash Dey, Neeldhara Misra:
Parameterized Aspects of Distinct Kemeny Rank Aggregation. CoRR abs/2309.03517 (2023) - [i41]Adway Mitra, Palash Dey:
Evaluating District-based Election Surveys with Synthetic Dirichlet Likelihood. CoRR abs/2312.15179 (2023) - 2022
- [c35]Neel Karia, Faraaz Mallick, Palash Dey:
How Hard is Safe Bribery? AAMAS 2022: 714-722 - [c34]Arnab Maiti, Palash Dey:
On Parameterized Complexity of Binary Networked Public Goods Game. AAMAS 2022: 871-879 - [c33]Palash Dey:
Priced Gerrymandering. AAMAS 2022: 1575-1577 - [c32]Arnab Maiti, Palash Dey:
Parameterized Algorithms for Kidney Exchange. AAMAS 2022: 1693-1695 - [c31]Arnab Maiti, Palash Dey:
Parameterized Algorithms for Kidney Exchange. IJCAI 2022: 405-411 - [i40]Neel Karia, Faraaz Mallick, Palash Dey:
How Hard is Safe Bribery? CoRR abs/2201.10383 (2022) - [i39]Palash Dey, Debajyoti Kar, Swagato Sanyal:
Sampling-Based Winner Prediction in District-Based Elections. CoRR abs/2203.00083 (2022) - [i38]Arnab Maiti, Palash Dey:
On Binary Networked Public Goods Game with Altruism. CoRR abs/2205.00442 (2022) - [i37]Rangeet Bhattacharyya, Palash Dey, Swaprava Nath:
Myerson on a Network. CoRR abs/2208.09326 (2022) - 2021
- [j10]Arnab Bhattacharyya, Palash Dey:
Predicting winner and estimating margin of victory in elections using sampling. Artif. Intell. 296: 103476 (2021) - [j9]Palash Dey:
Local distance constrained bribery in voting. Theor. Comput. Sci. 849: 1-21 (2021) - [j8]Palash Dey, Neeldhara Misra, Swaprava Nath, Garima Shakya:
A parameterized perspective on protecting elections. Theor. Comput. Sci. 874: 15-31 (2021) - [j7]Aditya Anand, Palash Dey:
Distance restricted manipulation in voting. Theor. Comput. Sci. 891: 149-165 (2021) - [c30]Palash Dey, Suman Kalyan Maity, Sourav Medya, Arlei Silva:
Network Robustness via Global k-cores. AAMAS 2021: 438-446 - [c29]Palash Dey, Arnab Maiti, Amatya Sharma:
On Parameterized Complexity of Liquid Democracy. CALDAM 2021: 83-94 - [c28]Nuno Mota, Negar Mohammadi, Palash Dey, Krishna P. Gummadi, Abhijnan Chakraborty:
Fair Partitioning of Public Resources: Redrawing District Boundary to Minimize Spatial Inequality in School Funding. WWW 2021: 646-657 - [i36]Debajyoti Kar, Sourav Medya, Debmalya Mandal, Arlei Silva, Palash Dey, Swagato Sanyal:
Feature-based Individual Fairness in k-Clustering. CoRR abs/2109.04554 (2021) - [i35]Arnab Maiti, Palash Dey:
Parameterized Algorithms for Kidney Exchange. CoRR abs/2112.10250 (2021) - 2020
- [c27]Palash Dey, Sourav Medya:
Manipulating Node Similarity Measures in Networks. AAMAS 2020: 321-329 - [c26]Ana-Andreea Stoica, Abhijnan Chakraborty, Palash Dey, Krishna P. Gummadi:
Minimizing Margin of Victory for Fair Political and Educational Districting. AAMAS 2020: 1305-1313 - [c25]Chinmay Sonar, Palash Dey, Neeldhara Misra:
On the Complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules. IJCAI 2020: 89-95 - [c24]Palash Dey, Jaikumar Radhakrishnan, Santhoshini Velusamy:
Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes. MFCS 2020: 28:1-28:12 - [i34]Chinmay Sonar, Palash Dey, Neeldhara Misra:
On the complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules. CoRR abs/2004.13933 (2020) - [i33]Palash Dey, Arnab Maiti, Amatya Sharma:
On Parameterized Complexity of Liquid Democracy. CoRR abs/2011.14192 (2020) - [i32]Arnab Maiti, Palash Dey:
On Parameterized Complexity of Binary Networked Public Goods Game. CoRR abs/2012.01880 (2020) - [i31]Palash Dey, Suman Kalyan Maity, Sourav Medya, Arlei Silva:
Network Robustness via Global k-cores. CoRR abs/2012.10036 (2020)
2010 – 2019
- 2019
- [j6]Arnab Bhattacharyya, Palash Dey, David P. Woodruff:
An Optimal Algorithm for ℓ1-Heavy Hitters in Insertion Streams and Related Problems. ACM Trans. Algorithms 15(1): 2:1-2:27 (2019) - [j5]Palash Dey, Neeldhara Misra, Y. Narahari:
Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers. Theor. Comput. Sci. 783: 53-70 (2019) - [c23]Palash Dey, Sourav Medya:
Covert Networks: How Hard is It to Hide? AAMAS 2019: 628-637 - [c22]Palash Dey, Swaprava Nath, Garima Shakya:
Testing Preferential Domains Using Sampling. AAMAS 2019: 855-863 - [c21]Palash Dey:
Local Distance Restricted Bribery in Voting. AAMAS 2019: 1925-1927 - [c20]Palash Dey, Pravesh K. Kothari, Swaprava Nath:
The Social Network Effect on Surprise in Elections. COMAD/CODS 2019: 1-9 - [c19]Palash Dey, Neeldhara Misra, Swaprava Nath, Garima Shakya:
A Parameterized Perspective on Protecting Elections. IJCAI 2019: 238-244 - [i30]Palash Dey:
Optimal Bribery in Voting. CoRR abs/1901.08711 (2019) - [i29]Palash Dey, Swaprava Nath, Garima Shakya:
Testing Preferential Domains Using Sampling. CoRR abs/1902.08930 (2019) - [i28]Palash Dey, Sourav Medya:
Covert Networks: How Hard is It to Hide? CoRR abs/1903.05832 (2019) - [i27]Palash Dey, Neeldhara Misra, Swaprava Nath, Garima Shakya:
A Parameterized Perspective on Protecting Elections. CoRR abs/1905.11838 (2019) - [i26]Palash Dey:
Gerrymandering: A Briber's Perspective. CoRR abs/1909.01583 (2019) - [i25]Aditya Anand, Palash Dey:
Stable Manipulation in Voting. CoRR abs/1909.03162 (2019) - [i24]Ana-Andreea Stoica, Abhijnan Chakraborty, Palash Dey, Krishna P. Gummadi:
Minimizing Margin of Victory for Fair Political and Educational Districting. CoRR abs/1909.05583 (2019) - [i23]Palash Dey, Sourav Medya:
Manipulating Node Similarity Measures in Network. CoRR abs/1910.11529 (2019) - 2018
- [j4]Palash Dey, Neeldhara Misra, Y. Narahari:
Complexity of manipulation with partial information in voting. Theor. Comput. Sci. 726: 78-99 (2018) - [j3]Palash Dey:
Manipulative elicitation - A new attack on elections with incomplete preferences. Theor. Comput. Sci. 731: 36-49 (2018) - [c18]Palash Dey:
Manipulative Elicitation - A New Attack on Elections with Incomplete Preferences. AAAI 2018: 4670-4677 - [i22]Palash Dey, Pravesh K. Kothari, Swaprava Nath:
Surprise in Elections. CoRR abs/1801.10110 (2018) - 2017
- [j2]Palash Dey, Neeldhara Misra, Y. Narahari:
Frugal bribery in voting. Theor. Comput. Sci. 676: 15-32 (2017) - [c17]Palash Dey:
Query Complexity of Tournament Solutions. AAAI 2017: 2992-2998 - [c16]Palash Dey, Nimrod Talmon, Otniel van Handel:
Proportional Representation in Vote Streams. AAMAS 2017: 15-23 - [c15]Palash Dey, Neeldhara Misra, Y. Narahari:
Parameterized Dichotomy of Choosing Committees Based on Approval Votes in the Presence of Outliers. AAMAS 2017: 42-50 - [c14]Palash Dey, Neeldhara Misra:
On the Exact Amount of Missing Information that Makes Finding Possible Winners Hard. MFCS 2017: 57:1-57:14 - [i21]Palash Dey, Nimrod Talmon, Otniel van Handel:
Proportional Representation in Vote Streams. CoRR abs/1702.08862 (2017) - [i20]Palash Dey:
Resolving the Complexity of Some Fundamental Problems in Computational Social Choice. CoRR abs/1703.08041 (2017) - [i19]Palash Dey:
Manipulative Elicitation - A New Attack on Elections with Incomplete Preferences. CoRR abs/1711.03948 (2017) - 2016
- [j1]Palash Dey, Neeldhara Misra, Y. Narahari:
Kernelization complexity of possible winner and coalitional manipulation problems in voting. Theor. Comput. Sci. 616: 111-125 (2016) - [c13]Palash Dey, Neeldhara Misra, Y. Narahari:
Frugal Bribery in Voting. AAAI 2016: 2466-2472 - [c12]Palash Dey, Neeldhara Misra:
Elicitation for Preferences Single Peaked on Trees. IJCAI 2016: 215-221 - [c11]Palash Dey, Neeldhara Misra:
Preference Elicitation for Single Crossing Domain. IJCAI 2016: 222-228 - [c10]Palash Dey, Neeldhara Misra, Y. Narahari:
Complexity of Manipulation with Partial Information in Voting. IJCAI 2016: 229-235 - [c9]Arnab Bhattacharyya, Palash Dey, David P. Woodruff:
An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems. PODS 2016: 385-400 - [i18]Arnab Bhattacharyya, Palash Dey, David P. Woodruff:
An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems. CoRR abs/1603.00213 (2016) - [i17]Palash Dey, Neeldhara Misra, Y. Narahari:
Complexity of Manipulation with Partial Information in Voting. CoRR abs/1604.04359 (2016) - [i16]Palash Dey, Neeldhara Misra:
Elicitation for Preferences Single Peaked on Trees. CoRR abs/1604.04403 (2016) - [i15]Palash Dey, Neeldhara Misra:
Preference Elicitation For Single Crossing Domain. CoRR abs/1604.05194 (2016) - [i14]Palash Dey, Neeldhara Misra:
On the Exact Amount of Missing Information that makes Finding Possible Winners Hard. CoRR abs/1610.08407 (2016) - [i13]Palash Dey:
Recognizing and Eliciting Weakly Single Crossing Profiles on Trees. CoRR abs/1611.04175 (2016) - [i12]Palash Dey:
Query Complexity of Tournament Solutions. CoRR abs/1611.06189 (2016) - 2015
- [c8]Palash Dey, Neeldhara Misra, Y. Narahari:
Kernelization Complexity of Possible Winner and Coalitional Manipulation Problems in Voting. AAMAS 2015: 87-96 - [c7]Palash Dey, Arnab Bhattacharyya:
Sample Complexity for Winner Prediction in Elections. AAMAS 2015: 1421-1430 - [c6]Palash Dey, Neeldhara Misra, Y. Narahari:
Detecting Possible Manipulators in Elections. AAMAS 2015: 1441-1450 - [c5]Palash Dey:
Computational Complexity of Fundamental Problems in Social Choice Theory. AAMAS 2015: 1973-1974 - [c4]Palash Dey, Y. Narahari:
Estimating the Margin of Victory of an Election Using Sampling. IJCAI 2015: 1120-1126 - [i11]Arnab Bhattacharyya, Palash Dey:
Sample Complexity for Winner Prediction in Elections. CoRR abs/1502.04354 (2015) - [i10]Palash Dey, Neeldhara Misra, Y. Narahari:
Frugal Bribery in Voting. CoRR abs/1504.08248 (2015) - [i9]Palash Dey, Neeldhara Misra, Y. Narahari:
Manipulation is Harder with Incomplete Votes. CoRR abs/1504.08256 (2015) - [i8]Palash Dey, Y. Narahari:
Estimating the Margin of Victory of an Election using Sampling. CoRR abs/1505.00566 (2015) - [i7]Arnab Bhattacharyya, Palash Dey:
Fishing out Winners from Vote Streams. CoRR abs/1508.04522 (2015) - [i6]Palash Dey, Neeldhara Misra, Y. Narahari:
On Choosing Committees Based on Approval Votes in the Presence of Outliers. CoRR abs/1511.04190 (2015) - [i5]Arnab Bhattacharyya, Palash Dey:
Sample Complexity for Winner Prediction in Elections. Electron. Colloquium Comput. Complex. TR15 (2015) - [i4]Arnab Bhattacharyya, Palash Dey:
Fishing out Winners from Vote Streams. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [c3]Palash Dey, Y. Narahari:
Asymptotic collusion-proofness of voting rules: the case of large number of candidates. AAMAS 2014: 1419-1420 - [c2]Palash Dey, Prachi Goyal, Neeldhara Misra:
UNO Gets Easier for a Single Player. FUN 2014: 147-157 - [i3]Palash Dey, Neeldhara Misra, Y. Narahari:
Detecting Possible Manipulators in Elections. CoRR abs/1404.2367 (2014) - [i2]Palash Dey, Neeldhara Misra, Y. Narahari:
Complexity of Kernelization in the Possible Winner Problem. CoRR abs/1405.3865 (2014) - 2013
- [i1]Palash Dey, Y. Narahari:
Asymptotic Collusion-proofness of Voting Rules when the Number of Candidates is Large. CoRR abs/1305.5053 (2013) - 2010
- [c1]Palash Dey, Arkadeep Kundu, Mrinal K. Naskar, Amitava Mukherjee, Mita Nasipuri:
Dynamic Multipath Bandwidth Provisioning with Jitter, Throughput, SLA Constraints in MPLS over WDM Network. ICDCN 2010: 376-391
Coauthor Index
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-05 21:14 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:
