default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDErik Rolland
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j22]M. Lisa Yeo
, Erik Rolland, Jacquelyn Rees Ulmer, Raymond A. Patterson:
How Customer Demand Reactions Impact Technology Innovation and Security. ACM Trans. Manag. Inf. Syst. 13(3): 32:1-32:17 (2022)- 2020
- [j21]Ram D. Gopal, Hooman Hidaji, Sule Nur Kutlu, Raymond A. Patterson, Erik Rolland, Dmitry Zhdanov:
Real or Not?: Identifying Untrustworthy News Websites Using Third-party Partnerships. ACM Trans. Manag. Inf. Syst. 11(3): 10:1-10:20 (2020)
2010 – 2019
- 2018
- [j20]Ram D. Gopal, Hooman Hidaji, Raymond A. Patterson, Erik Rolland, Dmitry Zhdanov:
How Much to Share with Third Parties? User Privacy Concerns and Website Dilemmas. MIS Q. 42(1) (2018) - 2016
- [j19]Mohsen Farhadloo, Raymond A. Patterson, Erik Rolland:
Modeling customer satisfaction from unstructured data using a Bayesian approach. Decis. Support Syst. 90: 1-11 (2016) - [p2]Mohsen Farhadloo, Erik Rolland:
Fundamentals of Sentiment Analysis and Its Applications. Sentiment Analysis and Ontology Engineering 2016: 1-24 - 2015
- [j18]Cheolho Yoon, Changyun Jeong, Erik Rolland:
Understanding individual adoption of mobile instant messaging: a multiple perspectives approach. Inf. Technol. Manag. 16(2): 139-151 (2015) - [j17]Cheolho Yoon, Erik Rolland:
Understanding Continuance Use in Social Networking Services. J. Comput. Inf. Syst. 55(2): 1-8 (2015) - 2014
- [j16]M. Lisa Yeo, Erik Rolland, Jackie Rees Ulmer, Raymond A. Patterson:
Risk Mitigation Decisions for IT Security. ACM Trans. Manag. Inf. Syst. 5(1): 5:1-5:21 (2014) - 2013
- [c1]Mohsen Farhadloo, Erik Rolland:
Multi-Class Sentiment Analysis with Clustering and Score Representation. ICDM Workshops 2013: 904-912 - 2012
- [j15]Cheolho Yoon, Erik Rolland:
Knowledge-sharing in virtual communities: familiarity, anonymity and self-determination theory. Behav. Inf. Technol. 31(11): 1133-1143 (2012)
2000 – 2009
- 2007
- [j14]L. C. Burr, Raymond A. Patterson, Erik Rolland, K. F. Ward:
Integration of E-CRM in Healthcare Services: A Framework for Analysis. Int. J. E Bus. Res. 3(2): 1-12 (2007) - 2005
- [j13]Reza Barkhi, Erik Rolland, John Butler, Weiguo Fan:
Decision Support System induced guidance for model formulation and solution. Decis. Support Syst. 40(2): 269-281 (2005) - 2003
- [j12]Raymond A. Patterson, Erik Rolland:
The cardinality constrained covering traveling salesman problem. Comput. Oper. Res. 30(1): 97-116 (2003) - [j11]Vaidyanathan Jayaraman, Raymond A. Patterson, Erik Rolland:
The design of reverse distribution networks: Models and solution procedures. Eur. J. Oper. Res. 150(1): 128-149 (2003) - [j10]H. Wang, V. Jacob, Erik Rolland:
Design of efficient hybrid neural networks for flexible flow shop scheduling. Expert Syst. J. Knowl. Eng. 20(4): 208-231 (2003) - 2002
- [j9]Raymond A. Patterson, Erik Rolland:
Hybrid Fiber Coaxial Network Design. Oper. Res. 50(3): 538-551 (2002) - 2000
- [j8]Carlton H. Scott, O. G. Skelton, Erik Rolland:
Tactical and strategic models for satellite customer assignment. J. Oper. Res. Soc. 51(1): 61-71 (2000)
1990 – 1999
- 1999
- [j7]Erik Rolland, Ali Amiri, Reza Barkhi:
Queueing delay guarantees in bandwidth packing. Comput. Oper. Res. 26(9): 921-935 (1999) - [j6]Hasan Pirkul, Rakesh Gupta, Erik Rolland:
VisOpt: a visual interactive optimization tool for P-median problems. Decis. Support Syst. 26(3): 209-223 (1999) - [j5]Ali Amiri, Erik Rolland, Reza Barkhi:
Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures. Eur. J. Oper. Res. 112(3): 635-645 (1999) - [j4]Raymond A. Patterson, Hasan Pirkul, Erik Rolland:
A Memory Adaptive Reasoning Technique for Solving the Capacitated Minimum Spanning Tree Problem. J. Heuristics 5(2): 159-180 (1999) - 1996
- [j3]Erik Rolland, Hasan Pirkul, Fred W. Glover:
Tabu search for graph partitioning. Ann. Oper. Res. 63(2): 209-232 (1996) - 1994
- [j2]Hasan Pirkul, Erik Rolland:
New heuristic solution procedures for the uniform graph partitioning problem: Extensions and evaluation. Comput. Oper. Res. 21(8): 895-907 (1994) - [j1]John R. Current, Hasan Pirkul, Erik Rolland:
Efficient Algorithms for Solving the Shortest Covering Path Problem. Transp. Sci. 28(4): 317-327 (1994) - 1992
- [p1]Erik Rolland, Hasan Pirkul:
Heuristic solution Procedures for the Graph Partitioning Problem. Computer Science and Operations Research 1992: 475-490
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 23:14 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:
