default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMeher Chaitanya
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2024
[b1]Meher Chaitanya:
Influence Processes on Networks. ETH Zurich, Zürich, Switzerland, 2024
Journal Articles
- 2025
- [j4]Meher Chaitanya, Kshitijaa Jaglan, Ulrik Brandes:
Adjacency Search Embeddings. Trans. Mach. Learn. Res. 2025 (2025) - 2018
- [j3]Debarshi Dutta, Meher Chaitanya, Kishore Kothapalli, Debajyoti Bera:
Applications of Ear Decomposition to Efficient Heterogeneous Algorithms for Shortest Path/Cycle Problems. Int. J. Netw. Comput. 8(1): 73-92 (2018) - 2016
- [j2]Meher Chaitanya, Kishore Kothapalli:
Efficient Multicore Algorithms For Identifying Biconnected Components. Int. J. Netw. Comput. 6(1): 87-106 (2016) - 2015
- [j1]Dip Sankar Banerjee
, Ashutosh Kumar, Meher Chaitanya, Shashank Sharma, Kishore Kothapalli:
Work efficient parallel algorithms for large graph exploration on emerging heterogeneous architectures. J. Parallel Distributed Comput. 76: 81-93 (2015)
Conference and Workshop Papers
- 2025
- [c6]Michael Brauweiler, Meher Chaitanya Pindiprolu, Jürgen Pfeffer, Ulrik Brandes:
Decentralized Discourse: Interaction Dynamics on Mastodon. WebSci 2025: 358-368 - 2024
- [c5]Kshitijaa Jaglan, Meher Chaitanya, Triansh Sharma, Abhijeeth Singam, Nidhi Goyal, Ponnurangam Kumaraguru, Ulrik Brandes:
Tight Sampling in Unbounded Networks. ICWSM 2024: 704-716 - 2021
- [c4]Meher Chaitanya, Ulrik Brandes:
Hardness Results for Seeding Complex Contagion with Neighborhoods. COMPLEX NETWORKS 2021: 207-216 - 2017
- [c3]Debarshi Dutta, Meher Chaitanya, Kishore Kothapalli, Debajyoti Bera:
Applications of Ear Decomposition to Efficient Heterogeneous Algorithms for Shortest Path/Cycle Problems. IPDPS Workshops 2017: 864-873 - 2016
- [c2]Charudatt Pachorkar, Meher Chaitanya, Kishore Kothapalli, Debajyoti Bera:
Efficient Parallel Ear Decomposition of Graphs with Application to Betweenness-Centrality. HiPC 2016: 301-310 - 2015
- [c1]Meher Chaitanya, Kishore Kothapalli:
A Simple Parallel Algorithm for Biconnected Components in Sparse Graphs. IPDPS Workshops 2015: 395-404
Informal and Other Publications
- 2023
- [i1]Kshitijaa Jaglan, Meher Chaitanya, Triansh Sharma, Abhijeeth Singam, Nidhi Goyal, Ponnurangam Kumaraguru, Ulrik Brandes:
Tight Sampling in Unbounded Networks. CoRR abs/2310.02859 (2023)
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 2025-06-21 01:26 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:
