default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRadhika Ramamurthi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2019
[j13]Radhika Ramamurthi, Gina Sanders:
Star coloring outerplanar bipartite graphs. Discuss. Math. Graph Theory 39(4): 899-916 (2019)- 2015
- [j12]André Kündgen
, Michael J. Pelsmajer, Radhika Ramamurthi:
Finding Minors in Graphs with a Given Path Structure. J. Graph Theory 79(1): 30-47 (2015) - 2010
- [j11]André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi:
k-Robust Single-Message Transmission. SIAM J. Discret. Math. 24(1): 301-321 (2010) - 2005
- [j10]Radhika Ramamurthi, Douglas B. West:
Hypergraph Extension Of The Alon-Tarsi List Coloring Theorem. Comb. 25(3): 355-366 (2005) - [j9]Faith Ellen Fich, André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi:
Graph Minors and Reliable Single Message Transmission. SIAM J. Discret. Math. 19(4): 815-847 (2005) - 2004
- [j8]Michael O. Albertson, Glenn G. Chappell, Henry A. Kierstead, André Kündgen, Radhika Ramamurthi:
Coloring with no 2-Colored P4's. Electron. J. Comb. 11(1) (2004) - [j7]Radhika Ramamurthi, Douglas B. West:
Maximum face-constrained coloring of plane graphs. Discret. Math. 274(1-3): 233-240 (2004) - 2003
- [j6]André Kündgen, Radhika Ramamurthi, Reiner Martin:
Maximal Paths in Bipartite Graphs: 10920. Am. Math. Mon. 110(8): 747 (2003) - 2002
- [j5]Radhika Ramamurthi, Douglas B. West:
Maximum Face-Constrained Coloring of Plane Graphs. Electron. Notes Discret. Math. 11: 542-549 (2002) - [j4]André Kündgen, Radhika Ramamurthi:
Coloring Face-Hypergraphs of Graphs on Surfaces. J. Comb. Theory B 85(2): 307-337 (2002) - [j3]Zoltán Füredi, Radhika Ramamurthi:
On splittable colorings of graphs and hypergraphs. J. Graph Theory 40(4): 226-237 (2002) - [j2]André Kündgen, Radhika Ramamurthi:
Problem 10920. Am. Math. Mon. 109(1): 78 (2002) - 2001
- [j1]Fred Galvin, Radhika Ramamurthi:
An Extremal Problem for Independent Sets in Graphs: 10761. Am. Math. Mon. 108(8): 773-774 (2001)
Conference and Workshop Papers
- 2004
- [c1]André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi:
k-Robust Single-Message Transmission. CAAN 2004: 90-101
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-06-10 21:20 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:
