Viggo Kann

According to our database, Viggo Kann authored at least 45 papers between 1991 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Students' Understanding of Programming Fluency.

Camilla Björn, Viggo Kann

Proceedings of the 2024 on Innovation and Technology in Computer Science Education V. 2, 2024

2023

Variables Affecting Students' Success in CS2.

Camilla Björn, Viggo Kann

Proceedings of the 2023 Conference on Innovation and Technology in Computer Science Education V. 1, 2023

2022

Training Teaching Assistants by Offering an Introductory Course.

Emma Riese, Viggo Kann

Proceedings of the SIGCSE 2022: The 53rd ACM Technical Symposium on Computer Science Education, 2022

2021

Computer Science Majors' Experiences of Their Distance Education Caused by the COVID-19 Pandemic.

Emma Riese, Viggo Kann

Proceedings of the IEEE Global Engineering Education Conference, 2021

2020

Teaching Assistants' Experiences of Tutoring and Assessing in Computer Science Education.

Emma Riese, Viggo Kann

Proceedings of the IEEE Frontiers in Education Conference, 2020

Looking from the inside: Peer-exploration of teaching and learning experiences and attitudes among faculty at a technical university.

Björn Kjellgren, Hans Havtun, Magnus Andersson, Viggo Kann

Proceedings of the IEEE Frontiers in Education Conference, 2020

Leadership and Pedagogical Skills in Computer Science Engineering by Combining a Degree in Engineering with a Degree in Education.

Mikael Cronhjort, Samuel Bengmark, Linda Kann, Viggo Kann

Proceedings of the IEEE Frontiers in Education Conference, 2020

2019

Programme Integrating Courses Fighting to Get Engineers to Reflect on Non-technical Topics.

Emma Riese, Olle Bälter, Björn Hedin, Viggo Kann

Proceedings of the 2019 ACM Conference on Innovation and Technology in Computer Science Education, 2019

2018

Student based program development.

Viggo Kann, Örjan Ekeberg

Proceedings of the 23rd Annual ACM Conference on Innovation and Technology in Computer Science Education, 2018

Modeling global competencies for computing education.

Stephen Frezza, Arnold Pears, Mats Daniels, Viggo Kann, Amanpreet Kapoor, Roger McDermott, Anne-Kathrin Peters, Charles Wallace, Mihaela Sabin, Åsa Cajander

Proceedings of the 23rd Annual ACM Conference on Innovation and Technology in Computer Science Education, 2018

Modelling competencies for computing education beyond 2020: a research based approach to defining competencies in the computing disciplines.

Stephen Frezza, Mats Daniels, Arnold Pears, Åsa Cajander, Viggo Kann, Amanpreet Kapoor, Roger McDermott, Anne-Kathrin Peters, Mihaela Sabin, Charles Wallace

Proceedings of the Proceedings Companion of the 23rd Annual ACM Conference on Innovation and Technology in Computer Science Education, 2018

2017

Iteratively Intervening with the "Most Difficult" Topics of an Algorithms and Complexity Course.

Emma Enström, Viggo Kann

ACM Trans. Comput. Educ., 2017

2016

Improving Study Skills using Program Integrating Reflection Seminars.

Björn Hedin, Viggo Kann

CoRR, 2016

Effects of a Program Integrating Course for Students of Computer Science and Engineering.

Viggo Kann, Anna-Karin Högfeldt

Proceedings of the 47th ACM Technical Symposium on Computing Science Education, 2016

2014

Using reflections in a program integrating course.

Viggo Kann

Proceedings of the Innovation and Technology in Computer Science Education Conference 2014, 2014

2013

From theory to practice: NP-completeness for every CS student.

Pierluigi Crescenzi, Emma Enström, Viggo Kann

Proceedings of the Innovation and Technology in Computer Science Education conference 2013, 2013

2011

Five years with kattis - Using an automated assessment system in teaching.

Emma Enström, Gunnar Kreitz, Fredrik Niemelä, Pehr Söderman, Viggo Kann

Proceedings of the 2011 Frontiers in Education Conference, 2011

2010

Computer lab work on theory.

Emma Enström, Viggo Kann

Proceedings of the 15th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2010

2009

Global Evaluation of Random Indexing through Swedish Word Clustering Compared to the People's Dictionary of Synonyms.

Magnus Rosell, Martin Hassel, Viggo Kann

Proceedings of the Recent Advances in Natural Language Processing, 2009

Using Uplug and SiteSeeker to construct a cross language search engine for Scandinavian languages.

Hercules Dalianis, Martin Rimka, Viggo Kann

Proceedings of the 17th Nordic Conference of Computational Linguistics, 2009

2005

Free construction of a free Swedish dictionary of synonyms.

Viggo Kann, Magnus Rosell

Proceedings of the 15th Nordic Conference of Computational Linguistics, 2005

2004

Finding the Correct Interpretation of Swedish Compounds, a Statistical Approach.

Jonas Sjöbergh, Viggo Kann

Proceedings of the Fourth International Conference on Language Resources and Evaluation, 2004

2000

Some APX-completeness results for cubic graphs.

Paola Alimonti, Viggo Kann

Theor. Comput. Sci., 2000

1999

Implementing an Efficient Part-Of-Speech Tagger.

Johan Carlberger, Viggo Kann

Softw. Pract. Exp., 1999

Structure in Approximation Classes.

Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan

SIAM J. Comput., 1999

Granska-an efficient hybrid system for Swedish grammar checking.

Rickard Domeij, Ola Knutsson, Johan Carlberger, Viggo Kann

Proceedings of the 12th Nordic Conference of Computational Linguistics, 1999

Complexity and approximation: combinatorial optimization problems and their approximability properties.

Giorgio Ausiello, Alberto Marchetti-Spaccamela, Pierluigi Crescenzi, Giorgio Gambosi, Marco Protasi, Viggo Kann

Springer, ISBN: 3540654313, 1999

1998

On the Approximability of Minimizing Nonzero Variables or Unsatisfied Relations in Linear Systems.

Edoardo Amaldi, Viggo Kann

Theor. Comput. Sci., 1998

How to find the best approximation results.

Pierluigi Crescenzi, Viggo Kann

SIGACT News, 1998

Approximate Max <i>k</i>-Cut with Subgraph Guarantee.

Viggo Kann, Jens Lagergren, Alessandro Panconesi

Inf. Process. Lett., 1998

1997

On the Hardness of Approximating Max k-Cut and its Dual.

Viggo Kann, Sanjeev Khanna, Jens Lagergren, Alessandro Panconesi

Chic. J. Theor. Comput. Sci., 1997

Approximation on the Web: A Compendium of NP Optimization Problems.

Pierluigi Crescenzi, Viggo Kann

Proceedings of the Randomization and Approximation Techniques in Computer Science, 1997

Hardness of Approximating Problems on Cubic Graphs.

Paola Alimonti, Viggo Kann

Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

1996

Approximability of Maximum Splitting of k-Sets and Some Other Apx-Complete Problems.

Viggo Kann, Jens Lagergren, Alessandro Panconesi

Inf. Process. Lett., 1996

On the approximability of some NP-hard minimization problems for linear systems

Edoardo Amaldi, Viggo Kann

Electron. Colloquium Comput. Complex., 1996

1995

The Complexity and Approximability of Finding Maximum Feasible Subsystems of Linear Relations.

Edoardo Amaldi, Viggo Kann

Theor. Comput. Sci., 1995

Strong Lower Bounds on the Approximability of some NPO PB-Complete Maximization Problems.

Viggo Kann

Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

Structure in Approximation Classes (Extended Abstract).

Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994

Polynomially Bounded Minimization Problems That Are Hard to Approximate.

Viggo Kann

Nord. J. Comput., 1994

Detection of Spelling Errors in Swedish Not Using a Word List En Clair.

Rickard Domeij, Joachim Hollman, Viggo Kann

J. Quant. Linguistics, 1994

Maximum Bounded H-Matching is MAX SNP-Complete.

Viggo Kann

Inf. Process. Lett., 1994

On the Approximability of Finding Maximum Feasible Subsystems of Linear Systems.

Edoardo Amaldi, Viggo Kann

Proceedings of the STACS 94, 1994

1993

Polynomially Bounded Minimization Problems which are Hard to Approximate.

Viggo Kann

Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1992

On the Approximability of the Maximum Common Subgraph Problem.

Viggo Kann

Proceedings of the STACS 92, 1992

1991

Maximum Bounded 3-Dimensional Matching is MAX SNP-Complete.

Viggo Kann

Inf. Process. Lett., 1991