default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDR. N. Uma
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c16]John Bartucz
, Ana Smaranda Sandu, Laney Strange, R. N. Uma:
Advancing Social Justice through Data Science. SIGCSE (2) 2024: 1865-1866- 2020
- [j10]Donghyun Kim, My T. Thai, R. N. Uma:
Guest Editorial Introduction to the Special Section on Scalability and Privacy in Social Networks. IEEE Trans. Netw. Sci. Eng. 7(2): 843-844 (2020) - [e2]Donghyun Kim, R. N. Uma, Zhipeng Cai, Dong Hoon Lee:
Computing and Combinatorics - 26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29-31, 2020, Proceedings. Lecture Notes in Computer Science 12273, Springer 2020, ISBN 978-3-030-58149-7 [contents]
2010 – 2019
- 2019
- [j9]S. Eman Mahmoodi, R. N. Uma, K. P. Subbalakshmi:
Optimal Joint Scheduling and Cloud Offloading for Mobile Applications. IEEE Trans. Cloud Comput. 7(2): 301-313 (2019) - 2018
- [e1]Donghyun Kim, R. N. Uma, Alexander Zelikovsky:
Combinatorial Optimization and Applications - 12th International Conference, COCOA 2018, Atlanta, GA, USA, December 15-17, 2018, Proceedings. Lecture Notes in Computer Science 11346, Springer 2018, ISBN 978-3-030-04650-7 [contents] - 2017
- [j8]Donghyun Kim, Yesenia Velasco, Wei Wang, R. N. Uma, Rasheed Hussain, Sejin Lee:
A New Comprehensive RSU Installation Strategy for Cost-Efficient VANET Deployment. IEEE Trans. Veh. Technol. 66(5): 4200-4211 (2017) - 2016
- [c15]Donghyun Kim, Yesenia Velasco, Zishen Yang, Wei Wang, Rasheed Hussain, R. N. Uma:
Cost effective mobile and static road side unit deployment for vehicular adhoc networks. ICNC 2016: 1-5 - [c14]S. Eman Mahmoodi, K. P. Subbalakshmi, R. N. Uma:
Harnessing spectrum awareness to enhance mobile computing: poster. MobiCom 2016: 460-461 - 2014
- [j7]Donghyun Kim, R. N. Uma, Baraki H. Abay, Weili Wu, Wei Wang, Alade O. Tokuta:
Minimum Latency Multiple Data MULETrajectory Planning in Wireless Sensor Networks. IEEE Trans. Mob. Comput. 13(4): 838-851 (2014) - 2012
- [c13]Donovan Bradley, R. N. Uma:
Energy-efficient routing through Weighted Load Balancing. GLOBECOM 2012: 31-37 - [c12]Donghyun Kim, Baraki H. Abay, R. N. Uma, Weili Wu, Wei Wang, Alade O. Tokuta:
Minimizing data collection latency in wireless sensor network with multiple mobile elements. INFOCOM 2012: 504-512
2000 – 2009
- 2006
- [j6]R. N. Uma, Joel Wein, David P. Williamson:
On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems. Theor. Comput. Sci. 361(2-3): 241-256 (2006) - [j5]Rajarathnam Chandramouli, Satish Bapatla, K. P. Subbalakshmi, R. N. Uma:
Battery power-aware encryption. ACM Trans. Inf. Syst. Secur. 9(2): 162-180 (2006) - 2005
- [j4]Martin W. P. Savelsbergh, R. N. Uma, Joel Wein:
An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems. INFORMS J. Comput. 17(1): 123-136 (2005) - 2004
- [c11]Rajarathnam Chandramouli, S. Sri Ganesh Veera Kumar, R. N. Uma:
Energy-aware on-line algorithms for image transmission over wireless LAN. ICC 2004: 1350-1354 - [c10]Siva Somasundaram, Koduvayur P. Subbalakshmi, R. N. Uma:
MDC and path diversity in video streaming. ICIP 2004: 3153-3156 - [c9]Rajarathnam Chandramouli, Shalin P. Trivedi, R. N. Uma:
On the complexity and hardness of the steganography embedding problem. Security, Steganography, and Watermarking of Multimedia Contents 2004: 496-500 - 2003
- [j3]Je-Ho Park, Vinay Kanitkar, R. N. Uma, Alex Delis:
Clustering of Client-Sites in Three-Tier Database Architectures. Int. J. Cooperative Inf. Syst. 12(1): 91-134 (2003) - [j2]Daniel W. Engels, David R. Karger, Stavros G. Kolliopoulos, Sudipta Sengupta, R. N. Uma, Joel Wein:
Techniques for scheduling with rejection. J. Algorithms 49(1): 175-191 (2003) - [j1]Jianping Wang, Biao Chen, R. N. Uma:
Dynamic wavelength assignment for multicast in all-optical WDM networks to maximize the network capacity. IEEE J. Sel. Areas Commun. 21(8): 1274-1284 (2003) - [c8]Ovidiu Daescu, Derek Soeder, R. N. Uma:
Task planning with transportation constraints: approximation bounds, implementation and experiments. ICRA 2003: 3542-3547 - [c7]Rajarathnam Chandramouli, R. N. Uma:
To transmit or not to transmit: an investigation using competitive analysis. WCNC 2003: 872-876 - 2000
- [c6]Cynthia A. Phillips, R. N. Uma, Joel Wein:
Off-line admission control for general scheduling problems. SODA 2000: 879-888
1990 – 1999
- 1999
- [c5]Je-Ho Park, Vinay Kanitkar, Alex Delis, R. N. Uma:
On the Use of Genetic Algorithms in Database Client Clustering. ICTAI 1999: 339-342 - 1998
- [c4]Daniel W. Engels, David R. Karger, Stavros G. Kolliopoulos, Sudipta Sengupta, R. N. Uma, Joel Wein:
Techniques for Scheduling with Rejection. ESA 1998: 490-501 - [c3]R. N. Uma, Joel Wein:
On the Relationship Between Combinatorial and LP-Based Approaches to NP-Hard Scheduling Problems. IPCO 1998: 394-408 - [c2]Martin W. P. Savelsbergh, R. N. Uma, Joel Wein:
An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems. SODA 1998: 453-462 - 1996
- [c1]Susan Flynn Hummel, Jeanette P. Schmidt, R. N. Uma, Joel Wein:
Load-Sharing in Heterogeneous Systems via Weighted Factoring. SPAA 1996: 318-328
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-01-20 23:01 CET 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:
