default search action
Gunnar Andersson
Person information
Other persons with a similar name
SPARQL queries
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j8]Gunnar Andersson, Frode Ramstad Johansen, Bjorn Gitle Hauge, Mirielle Torgersen, Lars Gunnar Furelid Tellnes, Per Valter:
Co-Creating a Learning Community: Teaching Sustainability in Higher Education. Int. J. Adv. Corp. Learn. 17(1): 61-73 (2024) - 2022
- [c7]Mirielle Torgersen, Per Valter, Peter Lindgren, Gunnar Andersson:
Understanding sustainable, green and circular business model definitions and configurations: Exploring the fuzziness of sustainable, green, and circular business models. WPMC 2022: 424-429
2010 – 2019
- 2019
- [j7]Gunnar Andersson, Frode Ramstad Johansen, Synnøve Rubach:
Clustering Ambiguities: How Companies and Public Bodies Develop a Cluster. Int. J. Adv. Corp. Learn. 12(1): 17-28 (2019) - [c6]Awat Safari, Gunnar Andersson, Stuart Kellogg:
Understanding Differences in Student Learning Outcomes Between the U.S. and Norwegian Educational Systems. FIE 2019: 1-5 - 2015
- [j6]Gunnar Andersson:
Resisting Organizational Change. Int. J. Adv. Corp. Learn. 8(1): 48-51 (2015) - 2014
- [j5]Synnøve Rubach, Frode Ramstad Johansen, Gunnar Andersson:
Missing Actions in Cluster Innovation. Int. J. Adv. Corp. Learn. 7(1): 17-23 (2014) - 2013
- [c5]Gunnar Andersson, Kamil Dursun, Bjorn Gitle Hauge, Bernt A. Bremdal, Ghavameddin Nourbakhsh:
Establishing sustainable and reliable smart grids. AMPS 2013: 138-143
2000 – 2009
- 2003
- [j4]Gunnar Andersson, Per Bjesse, Byron Cook, Ziyad Hanna:
Design automation with mixtures of proof strategies for propositional logic. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 22(8): 1042-1048 (2003) - 2002
- [j3]Gunnar Andersson, Lars Engebretsen:
Property testers for dense constraint satisfaction programs on finite domains. Random Struct. Algorithms 21(1): 14-32 (2002) - [c4]Gunnar Andersson, Per Bjesse, Byron Cook, Ziyad Hanna:
A proof engine approach to solving combinational design automation problems. DAC 2002: 725-730 - 2001
- [j2]Gunnar Andersson, Lars Engebretsen, Johan Håstad:
A New Way of Using Semidefinite Programming with Applications to Linear Equations mod p. J. Algorithms 39(2): 162-204 (2001)
1990 – 1999
- 1999
- [c3]Gunnar Andersson, Lars Engebretsen, Johan Håstad:
A New Way to Use Semidefinite Programming with Applications to Linear Equations mod p. SODA 1999: 41-50 - [c2]Gunnar Andersson:
An Approximation Algorithm for Max p-Section. STACS 1999: 237-247 - 1998
- [j1]Gunnar Andersson, Lars Engebretsen:
Better Approximation Algorithms for SET SPLITTING and NOT-ALL-EQUAL SAT. Inf. Process. Lett. 65(6): 305-311 (1998) - [c1]Gunnar Andersson, Lars Engebretsen:
Sampling Methods Applied to Dense Instances of Non-Boolean Optimization Problems. RANDOM 1998: 357-368 - 1997
- [i1]Gunnar Andersson, Lars Engebretsen:
Better Approximation Algorithms and Tighter Analysis for Set Splitting and Not-All-Equal Sat. Electron. Colloquium Comput. Complex. TR97 (1997)
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-09 12:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint