default search action
Prachi Goyal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j5]Prachi Goyal, Vinay Rishiwal, Ashish Negi:
Pre-emptive Priority Queueing Based Multipath Routing (PPQM) to Enhance the QoS for Video Transmission in H-MANETs. Wirel. Pers. Commun. 138(2): 1155-1191 (2024) - [c7]Nazreen Shah, Prachi Goyal, Ranjitha Prasad:
Importance Sampling Based Federated Unsupervised Representation Learning. ICASSP 2024: 7565-7569 - 2023
- [j4]Prachi Goyal
, Vinay Rishiwal, Ashish Negi:
A comprehensive survey on QoS for video transmission in heterogeneous mobile ad hoc network. Trans. Emerg. Telecommun. Technol. 34(7) (2023) - 2020
- [j3]Deeparnab Chakrabarty, Prachi Goyal, Ravishankar Krishnaswamy:
The Non-Uniform k-Center Problem. ACM Trans. Algorithms 16(4): 46:1-46:19 (2020)
2010 – 2019
- 2018
- [j2]Prachi Goyal, Pranabendu Misra, Fahad Panolan
Finding even subgraphs even faster. J. Comput. Syst. Sci. 97: 1-13 (2018) - 2016
- [c6]Prachi Goyal, Manju Nanda, J. Jayanthi:
Mutation Analysis of Stateflow to Improve the Modelling Analysis. ICACDS 2016: 173-182 - [c5]Deeparnab Chakrabarty, Prachi Goyal, Ravishankar Krishnaswamy:
The Non-Uniform k-Center Problem. ICALP 2016: 67:1-67:15 - [i3]Deeparnab Chakrabarty, Prachi Goyal, Ravishankar Krishnaswamy:
The Non-Uniform k-Center Problem. CoRR abs/1605.03692 (2016) - 2015
- [j1]Prachi Goyal, Neeldhara Misra, Fahad Panolan
Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets. SIAM J. Discret. Math. 29(4): 1815-1836 (2015) - [c4]Prachi Goyal, Pranabendu Misra, Fahad Panolan
Finding Even Subgraphs Even Faster. FSTTCS 2015: 434-447 - 2014
- [c3]Palash Dey, Prachi Goyal, Neeldhara Misra:
UNO Gets Easier for a Single Player. FUN 2014: 147-157 - [i2]Prachi Goyal, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh:
Finding Even Subgraphs Even Faster. CoRR abs/1409.4935 (2014) - 2013
- [c2]Prachi Goyal, Neeldhara Misra, Fahad Panolan
Faster Deterministic Algorithms for r-Dimensional Matching Using Representative Sets. FSTTCS 2013: 237-248 - [c1]Prachi Goyal, Vikram Kamat, Neeldhara Misra:
On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem. MFCS 2013: 492-503 - [i1]Prachi Goyal, Vikram Kamat, Neeldhara Misra:
On the Parameterized Complexity of the Maximum Edge Coloring Problem. CoRR abs/1306.2931 (2013)
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-10-14 23:30 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: