default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNedialko B. Dimitrov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j16]Samuel V. Scarpino, James G. Scott, Rosalind M. Eggo
, Bruce Clements, Nedialko B. Dimitrov, Lauren Ancel Meyers:
Socioeconomic bias in influenza surveillance. PLoS Comput. Biol. 16(7) (2020)
2010 – 2019
- 2019
- [j15]Min Lwin, Jia Guo, Nedialko B. Dimitrov, Surya Santoso:
Stochastic Optimization for Discrete Overcurrent Relay Tripping Characteristics and Coordination. IEEE Trans. Smart Grid 10(1): 732-740 (2019) - 2017
- [j14]Nedialko B. Dimitrov, Daniel Solow, Joseph G. Szmerekovsky, Jia Guo:
Emergency relocation of items using single trips: Special cases of the Multiple Knapsack Assignment Problem. Eur. J. Oper. Res. 258(3): 938-942 (2017) - 2016
- [j13]Nedialko B. Dimitrov, Moshe Kress, Yuval Nevo:
Finding the needles in the haystack: efficient intelligence processing. J. Oper. Res. Soc. 67(6): 801-812 (2016) - 2014
- [j12]Nedialko B. Dimitrov, Stanko Dimitrov, Stefanka S. Chukova:
Robust decomposable Markov decision processes motivated by allocating school budgets. Eur. J. Oper. Res. 239(1): 199-213 (2014) - [j11]Constantine Caramanis, Nedialko B. Dimitrov, David P. Morton:
Efficient Algorithms for Budget-Constrained Markov Decision Processes. IEEE Trans. Autom. Control. 59(10): 2813-2817 (2014) - 2013
- [j10]Nedialko B. Dimitrov, Alexander Moffett, David P. Morton, Sahotra Sarkar:
Selecting malaria interventions: A top-down approach. Comput. Oper. Res. 40(9): 2229-2240 (2013) - [j9]Tara Rengarajan, Nedialko B. Dimitrov, David P. Morton:
Convex Approximations of a Probabilistic Bicriteria Model with Disruptions. INFORMS J. Comput. 25(1): 147-160 (2013) - [j8]Nedialko B. Dimitrov, Gerald G. Brown, W. Matthew Carlyle:
A Real-World Network Modeling Project. INFORMS Trans. Educ. 14(1): 4-12 (2013) - [j7]Nedialko B. Dimitrov, C. Greg Plaxton:
Optimal cover time for a graph-based coupon collector process. J. Discrete Algorithms 19: 39-51 (2013) - 2012
- [j6]Nedialko B. Dimitrov, C. Greg Plaxton:
Competitive Weighted Matching in Transversal Matroids. Algorithmica 62(1-2): 333-348 (2012) - [j5]Samuel V. Scarpino, Nedialko B. Dimitrov, Lauren Ancel Meyers:
Optimizing Provider Recruitment for Influenza Surveillance Networks. PLoS Comput. Biol. 8(4) (2012) - [j4]Harish Ganapathy, Siddhartha Banerjee, Nedialko B. Dimitrov, Constantine Caramanis:
Feedback Allocation for OFDMA Systems With Slow Frequency-Domain Scheduling. IEEE Trans. Signal Process. 60(12): 6630-6640 (2012) - [i1]Harish Ganapathy, Siddhartha Banerjee, Nedialko B. Dimitrov, Constantine Caramanis:
Feedback Allocation For OFDMA Systems With Slow Frequency-domain Scheduling. CoRR abs/1210.7539 (2012) - 2011
- [j3]Nedialko B. Dimitrov, Dennis P. Michalopoulos, David P. Morton, Michael V. Nehme, Feng Pan, Elmira Popova, Erich A. Schneider, Gregory G. Thoreson:
Network deployment of radiation detectors with physics-based detection probability calculations. Ann. Oper. Res. 187(1): 207-228 (2011) - [j2]Nedialko B. Dimitrov, C. Greg Plaxton:
Buyer-supplier games: Optimization over the core. Theor. Comput. Sci. 412(7): 614-625 (2011)
2000 – 2009
- 2009
- [j1]Nedialko B. Dimitrov, Stefanka S. Chukova:
Warranty Optimization in a Dynamic Environment. Adv. Decis. Sci. 2009: 414507:1-414507:14 (2009) - [c5]Harish Ganapathy, Siddhartha Banerjee, Nedialko B. Dimitrov, Constantine Caramanis:
Optimal feedback allocation algorithms for multi-user uplink. Allerton 2009: 947-954 - 2008
- [c4]Nedialko B. Dimitrov, C. Greg Plaxton:
Competitive Weighted Matching in Transversal Matroids. ICALP (1) 2008: 397-408 - [c3]Nedialko B. Dimitrov, Indrajit Roy:
A primal-dual resource augmentation analysis of a constant approximate algorithm for stable coalitions in a cluster. SPAA 2008: 236-245 - 2007
- [c2]Nedialko B. Dimitrov, C. Greg Plaxton:
Buyer-Supplier Games: Optimization over the Core. WAOA 2007: 27-40 - 2005
- [c1]Nedialko B. Dimitrov, C. Greg Plaxton:
Optimal Cover Time for a Graph-Based Coupon Collector Process. ICALP 2005: 702-716
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-04-25 05:47 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:
