default search action
Eric Rosenberg
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j22]Brendan Ruskey, Eric Rosenberg:
Minimizing risk in Bayesian supply chain networks. Comput. Ind. Eng. 169: 108134 (2022) - [j21]Alina Gorbunova, Eric Rosenberg, Angelina Cheng:
Colour averaging techniques and trends explored through artwork. Int. J. Arts Technol. 14(2): 113-127 (2022) - [c2]Weihong (Grace) Guo, Paul B. Kantor, Elsayed A. Elsayed, Eric Rosenberg, Rong Lei, Sachin Patel, Brendan Ruskey, Fred S. Roberts:
Supply Chain Threats and Countermeasures: From Elicitation through Optimization. HICSS 2022: 1-10 - 2020
- [b3]Eric Rosenberg:
Fractal Dimensions of Networks, New. Springer 2020, ISBN 978-3-030-43168-6, pp. 1-524
2010 – 2019
- 2018
- [b2]Eric Rosenberg:
A Survey of Fractal Dimensions of Networks. Springer Briefs in Computer Science, Springer 2018, ISBN 978-3-319-90046-9, pp. 1-79 - 2017
- [j20]H. T. Banks, Shuhua Hu, Eric Rosenberg:
A dynamical modeling approach for analysis of longitudinal clinical trials in the presence of missing endpoints. Appl. Math. Lett. 63: 109-117 (2017) - 2016
- [j19]Eric Rosenberg:
The Correlation Dimension of a Rectilinear Grid. J. Interconnect. Networks 16(1): 1550010:1-1550010:19 (2016) - 2013
- [j18]Eric Rosenberg, James Uttaro:
A Fast Re-Route Method. IEEE Commun. Lett. 17(8): 1656-1659 (2013) - [j17]Eric Rosenberg:
Calculating Bandwidth Overbooking for Statistically Multiplexed Traffic. J. Interconnect. Networks 14(1) (2013) - [j16]Eric Rosenberg:
Lower Bounds on Box Counting for Complex Networks. J. Interconnect. Networks 14(4) (2013) - 2012
- [b1]Eric Rosenberg:
A Primer of Multicast Routing. Springer Briefs in Computer Science, Springer 2012, ISBN 978-1-4614-1872-6, pp. i-x, 1-117
2000 – 2009
- 2009
- [j15]Eric Rosenberg:
Minimizing hierarchical routing error. Comput. Networks 53(11): 1926-1938 (2009) - 2005
- [j14]Eric Rosenberg:
Hierarchical topological network design. IEEE/ACM Trans. Netw. 13(6): 1402-1409 (2005) - 2004
- [j13]Eric Rosenberg:
The expected length of a random line segment in a rectangle. Oper. Res. Lett. 32(2): 99-102 (2004) - 2002
- [j12]Eric Rosenberg:
Capacity Requirements for Node and Arc Survivable Networks. Telecommun. Syst. 20(1-2): 107-131 (2002) - 2001
- [j11]Eric Rosenberg:
Dual Ascent for Uncapacitated Telecommunications Network Design with Access, Backbone, and Switch Costs. Telecommun. Syst. 16(3-4): 423-435 (2001) - 2000
- [j10]Eric Rosenberg:
Telecommunications Network Case Study: Selecting a Data Network Architecture. J. Heuristics 6(1): 9-20 (2000)
1990 – 1999
- 1994
- [j9]Eric Rosenberg, Alan Gleit:
Quantitative Methods in Credit Management: A Survey. Oper. Res. 42(4): 589-613 (1994) - [j8]Eric Rosenberg:
Designing multi-hour hierarchical communications networks with fixed charge and piecewise linear costs. Telecommun. Syst. 3(2): 109-128 (1994)
1980 – 1989
- 1989
- [j7]Eric Rosenberg:
Optimal module sizing in VLSI floorplanning by nonlinear programming. ZOR Methods Model. Oper. Res. 33(2): 131-143 (1989) - 1988
- [j6]Eric Rosenberg:
A Geometrically Convergent Subgradient Optimization Method for Nonlinearly Constrained Convex Programs. Math. Oper. Res. 13(3): 512-523 (1988) - 1987
- [j5]Eric Rosenberg:
A Nonlinear Programming Heuristic for Computing Optimal Link Capacities in a Multi-Hour Alternate Routing Communications Network. Oper. Res. 35(3): 354-364 (1987) - [c1]Eric Rosenberg:
A New Interactive Supply/Demand Router with Rip-Up Capability for Printed Circuit Boards. DAC 1987: 721-726 - 1984
- [j4]Eric Rosenberg:
Exact penalty functions and stability in locally Lipschitz programming. Math. Program. 30(3): 340-356 (1984) - 1982
- [j3]Eric Rosenberg:
Optimization: Theory and applications, by S . S . Rao, Wiley Eastern Limited, New Delhi, 1979, 711 pp. Price: $21.95. Networks 12(3): 352-353 (1982) - 1981
- [j2]Eric Rosenberg:
Globally Convergent Algorithms for Convex Programming. Math. Oper. Res. 6(3): 437-444 (1981) - [j1]Eric Rosenberg:
On solving a primal geometric program by partial dual optimization. Math. Program. 21(1): 319-330 (1981)
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-24 22:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint