Gunnar Andersson

According to our database1, Gunnar Andersson authored at least 15 papers between 1997 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Understanding sustainable, green and circular business model definitions and configurations: Exploring the fuzziness of sustainable, green, and circular business models.
Proceedings of the 25th International Symposium on Wireless Personal Multimedia Communications, 2022

2019
Clustering Ambiguities: How Companies and Public Bodies Develop a Cluster.
Int. J. Adv. Corp. Learn., 2019

Understanding Differences in Student Learning Outcomes Between the U.S. and Norwegian Educational Systems.
Proceedings of the IEEE Frontiers in Education Conference, 2019

2015
Resisting Organizational Change.
Int. J. Adv. Corp. Learn., 2015

2014
Missing Actions in Cluster Innovation.
Int. J. Adv. Corp. Learn., 2014

2013
Establishing sustainable and reliable smart grids.
Proceedings of the IEEE International Workshop on Applied Measurements for Power Systems, 2013

2003
Design automation with mixtures of proof strategies for propositional logic.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2003

2002
Property testers for dense constraint satisfaction programs on finite domains.
Random Struct. Algorithms, 2002

A proof engine approach to solving combinational design automation problems.
Proceedings of the 39th Design Automation Conference, 2002

2001
A New Way of Using Semidefinite Programming with Applications to Linear Equations mod p.
J. Algorithms, 2001

1999
An Approximation Algorithm for Max p-Section.
Proceedings of the STACS 99, 1999

A New Way to Use Semidefinite Programming with Applications to Linear Equations mod <i>p</i>.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998
Better Approximation Algorithms for SET SPLITTING and NOT-ALL-EQUAL SAT.
Inf. Process. Lett., 1998

Sampling Methods Applied to Dense Instances of Non-Boolean Optimization Problems.
Proceedings of the Randomization and Approximation Techniques in Computer Science, 1998

1997
Better Approximation Algorithms and Tighter Analysis for Set Splitting and Not-All-Equal Sat
Electron. Colloquium Comput. Complex., 1997


  Loading...