![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Neeldhara Misra
Indian Institute of Technology, Gandhinagar, India
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 144 matches
- 2024
- Jayakrishnan Madathil, Neeldhara Misra, Yash More:
Opinion Diffusion on Society Graphs Based on Approval Ballots. AAMAS 2024: 2372-2374 - Koustav De
, Harshil Mittal, Palash Dey
, Neeldhara Misra
:
Parameterized Aspects of Distinct Kemeny Rank Aggregation. CALDAM 2024: 14-28 - Jyothi Krishnan, Neeldhara Misra, Saraswati Girish Nanoti:
A Little Aggression Goes a Long Way. CoRR abs/2406.05742 (2024) - Jayakrishnan Madathil, Neeldhara Misra, Aditi Sethia:
The Cost and Complexity of Minimizing Envy in House Allocation. CoRR abs/2406.09744 (2024) - 2023
- 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) - Jayakrishnan Madathil, Neeldhara Misra, Aditi Sethia:
The Complexity of Minimizing Envy in House Allocation. AAMAS 2023: 2673-2675 - Neeldhara Misra, Harshil Mittal, Saket Saurabh, Dhara Thakkar:
On the Complexity of the Eigenvalue Deletion Problem. ISAAC 2023: 53:1-53:17 - Neeldhara Misra
, Yash More:
Finding Perfect Matching Cuts Faster. IWOCA 2023: 307-318 - Neeldhara Misra, Saraswati Girish Nanoti:
Spartan Bipartite Graphs Are Essentially Elementary. MFCS 2023: 68:1-68:15 - Umang Bhaskar, Neeldhara Misra, Aditi Sethia, Rohit Vaish:
The Price of Equity with Binary Valuations and Few Agent Types. SAGT 2023: 271-289 - Neeldhara Misra
, Magnus Wahlström
:
18th International Symposium on Parameterized and Exact Computation, IPEC 2023, September 6-8, 2023, Amsterdam, The Netherlands. LIPIcs 285, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-305-8 [contents] - Umang Bhaskar, Neeldhara Misra, Aditi Sethia, Rohit Vaish:
The Price of Equity with Binary Valuations and Few Agent Types. CoRR abs/2307.06726 (2023) - Neeldhara Misra, Saraswati Girish Nanoti:
Spartan Bipartite Graphs are Essentially Elementary. CoRR abs/2308.04548 (2023) - Koustav De, Harshil Mittal, Palash Dey, Neeldhara Misra:
Parameterized Aspects of Distinct Kemeny Rank Aggregation. CoRR abs/2309.03517 (2023) - Neeldhara Misra, Harshil Mittal, Saket Saurabh, Dhara Thakkar:
On the Complexity of the Eigenvalue Deletion Problem. CoRR abs/2310.00600 (2023) - 2022
- Pradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh:
Exact Multi-Covering Problems with Geometric Sets. Theory Comput. Syst. 66(1): 89-113 (2022) - Neeldhara Misra, Debanuj Nayak:
On Fair Division with Binary Valuations Respecting Social Networks. CALDAM 2022: 265-278 - Neeldhara Misra, Harshil Mittal, Saraswati Nanoti:
Diverse Non Crossing Matchings. CCCG 2022: 249-256 - Jasine Babu, Neeldhara Misra
, Saraswati Nanoti:
Eternal Vertex Cover on Bipartite Graphs. CSR 2022: 64-76 - Neeldhara Misra, Manas Mulpuri, Prafullkumar Tale, Gaurav Viramgami:
Romeo and Juliet Meeting in Forest like Regions. FSTTCS 2022: 27:1-27:22 - N. R. Aravind, Neeldhara Misra, Harshil Mittal:
Chess Is Hard Even for a Single Player. FUN 2022: 5:1-5:20 - Neeldhara Misra, Saraswati Nanoti:
Eternal Vertex Cover on Bipartite and Co-Bipartite Graphs. CoRR abs/2201.03820 (2022) - N. R. Aravind, Neeldhara Misra, Harshil Mittal:
Chess is hard even for a single player. CoRR abs/2203.14864 (2022) - Neeldhara Misra, Manas Mulpuri, Prafullkumar Tale, Gaurav Viramgami:
Romeo and Juliet Meeting in Forest Like Regions. CoRR abs/2210.02582 (2022) - Maria Chudnovsky, Neeldhara Misra, Daniël Paulusma
, Oliver Schaudt, Akanksha Agrawal:
Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481). Dagstuhl Reports 12(11): 109-123 (2022) - 2021
- Palash Dey, Neeldhara Misra, Swaprava Nath
, Garima Shakya:
A parameterized perspective on protecting elections. Theor. Comput. Sci. 874: 15-31 (2021) - Neeldhara Misra, Harshil Mittal:
Imbalance parameterized by twin cover revisited. Theor. Comput. Sci. 895: 1-15 (2021) - Neeldhara Misra, Aditi Sethia:
Fair Division Is Hard Even for Amicable Agents. SOFSEM 2021: 421-430 - Neeldhara Misra, Chinmay Sonar, P. R. Vaidyanathan, Rohit Vaish:
Equitable Division of a Path. CoRR abs/2101.09794 (2021) - Neeldhara Misra, Debanuj Nayak:
On Fair Division with Binary Valuations Respecting Social Networks. CoRR abs/2111.11528 (2021)
skipping 114 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
retrieved on 2024-07-27 15:57 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint