Viggo Kann

Publication Activity (10 Years)

Years Active: 1991-2024
Publications (10 Years): 14

Top Topics

Learning Computer Programming

Computer Science

Distance Education

Learning Experience

Top Venues

Publications

Camilla Björn, Viggo Kann
Students' Understanding of Programming Fluency. ITiCSE (2) (2024)
Camilla Björn, Viggo Kann
Variables Affecting Students' Success in CS2. ITiCSE (1) (2023)
Emma Riese, Viggo Kann
Training Teaching Assistants by Offering an Introductory Course. SIGCSE (1) (2022)
Emma Riese, Viggo Kann
Computer Science Majors' Experiences of Their Distance Education Caused by the COVID-19 Pandemic. EDUCON (2021)
Björn Kjellgren, Hans Havtun, Magnus Andersson, Viggo Kann
Looking from the inside: Peer-exploration of teaching and learning experiences and attitudes among faculty at a technical university. FIE (2020)
Mikael Cronhjort, Samuel Bengmark, Linda Kann, Viggo Kann
Leadership and Pedagogical Skills in Computer Science Engineering by Combining a Degree in Engineering with a Degree in Education. FIE (2020)
Emma Riese, Viggo Kann
Teaching Assistants' Experiences of Tutoring and Assessing in Computer Science Education. FIE (2020)
Emma Riese, Olle Bälter, Björn Hedin, Viggo Kann
Programme Integrating Courses Fighting to Get Engineers to Reflect on Non-technical Topics. ITiCSE (2019)
Viggo Kann, Örjan Ekeberg
Student based program development. ITiCSE (2018)
Stephen Frezza, Mats Daniels, Arnold Pears, Åsa Cajander, Viggo Kann, Amanpreet Kapoor, Roger McDermott, Anne-Kathrin Peters, Mihaela Sabin, Charles Wallace
Modelling competencies for computing education beyond 2020: a research based approach to defining competencies in the computing disciplines. ITiCSE (Companion) (2018)
Stephen Frezza, Arnold Pears, Mats Daniels, Viggo Kann, Amanpreet Kapoor, Roger McDermott, Anne-Kathrin Peters, Charles Wallace, Mihaela Sabin, Åsa Cajander
Modeling global competencies for computing education. ITiCSE (2018)
Emma Enström, Viggo Kann
Iteratively Intervening with the "Most Difficult" Topics of an Algorithms and Complexity Course. ACM Trans. Comput. Educ. 17 (1) (2017)
Björn Hedin, Viggo Kann
Improving Study Skills using Program Integrating Reflection Seminars. CoRR (2016)
Viggo Kann, Anna-Karin Högfeldt
Effects of a Program Integrating Course for Students of Computer Science and Engineering. SIGCSE (2016)
Viggo Kann
Using reflections in a program integrating course. ITiCSE (2014)
Pierluigi Crescenzi, Emma Enström, Viggo Kann
From theory to practice: NP-completeness for every CS student. ITiCSE (2013)
Emma Enström, Gunnar Kreitz, Fredrik Niemelä, Pehr Söderman, Viggo Kann
Five years with kattis - Using an automated assessment system in teaching. FIE (2011)
Emma Enström, Viggo Kann
Computer lab work on theory. ITiCSE (2010)
Magnus Rosell, Martin Hassel, Viggo Kann
Global Evaluation of Random Indexing through Swedish Word Clustering Compared to the People's Dictionary of Synonyms. RANLP (2009)
Hercules Dalianis, Martin Rimka, Viggo Kann
Using Uplug and SiteSeeker to construct a cross language search engine for Scandinavian languages. NODALIDA (2009)
Viggo Kann, Magnus Rosell
Free construction of a free Swedish dictionary of synonyms. NODALIDA (2005)
Jonas Sjöbergh, Viggo Kann
Finding the Correct Interpretation of Swedish Compounds, a Statistical Approach. LREC (2004)
Paola Alimonti, Viggo Kann
Some APX-completeness results for cubic graphs. Theor. Comput. Sci. 237 (1-2) (2000)
Rickard Domeij, Ola Knutsson, Johan Carlberger, Viggo Kann
Granska-an efficient hybrid system for Swedish grammar checking. NODALIDA (1999)
Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan
Structure in Approximation Classes. SIAM J. Comput. 28 (5) (1999)
Johan Carlberger, Viggo Kann
Implementing an Efficient Part-Of-Speech Tagger. Softw. Pract. Exp. 29 (9) (1999)
Edoardo Amaldi, Viggo Kann
On the Approximability of Minimizing Nonzero Variables or Unsatisfied Relations in Linear Systems. Theor. Comput. Sci. 209 (1-2) (1998)
Pierluigi Crescenzi, Viggo Kann
How to find the best approximation results. SIGACT News 29 (4) (1998)
Viggo Kann, Jens Lagergren, Alessandro Panconesi
-Cut with Subgraph Guarantee. Inf. Process. Lett. 65 (3) (1998)
Viggo Kann, Sanjeev Khanna, Jens Lagergren, Alessandro Panconesi
On the Hardness of Approximating Max k-Cut and its Dual. Chic. J. Theor. Comput. Sci. 1997 (1997)
Pierluigi Crescenzi, Viggo Kann
Approximation on the Web: A Compendium of NP Optimization Problems. RANDOM (1997)
Paola Alimonti, Viggo Kann
Hardness of Approximating Problems on Cubic Graphs. CIAC (1997)
Viggo Kann, Sanjeev Khanna, Jens Lagergren, Alessandro Panconesi
On the Hardness of Approximating Max k-Cut and Its Dual. ISTCS (1996)
Viggo Kann, Jens Lagergren, Alessandro Panconesi
Approximability of Maximum Splitting of k-Sets and Some Other Apx-Complete Problems. Inf. Process. Lett. 58 (3) (1996)
Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan
Structure in Approximation Classes Electron. Colloquium Comput. Complex. 3 (66) (1996)
Edoardo Amaldi, Viggo Kann
On the approximability of some NP-hard minimization problems for linear systems Electron. Colloquium Comput. Complex. 3 (15) (1996)
Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan
Structure in Approximation Classes (Extended Abstract). COCOON (1995)
Viggo Kann
Strong Lower Bounds on the Approximability of some NPO PB-Complete Maximization Problems. MFCS (1995)
Edoardo Amaldi, Viggo Kann
The Complexity and Approximability of Finding Maximum Feasible Subsystems of Linear Relations. Theor. Comput. Sci. 147 (1&2) (1995)
Viggo Kann
Maximum Bounded H-Matching is MAX SNP-Complete. Inf. Process. Lett. 49 (6) (1994)
Rickard Domeij, Joachim Hollman, Viggo Kann
Detection of Spelling Errors in Swedish Not Using a Word List En Clair. J. Quant. Linguistics 1 (3) (1994)
Edoardo Amaldi, Viggo Kann
On the Approximability of Finding Maximum Feasible Subsystems of Linear Systems. STACS (1994)
Viggo Kann
Polynomially Bounded Minimization Problems That Are Hard to Approximate. Nord. J. Comput. 1 (3) (1994)
Viggo Kann
Polynomially Bounded Minimization Problems which are Hard to Approximate. ICALP (1993)
Viggo Kann
On the Approximability of the Maximum Common Subgraph Problem. STACS (1992)
Viggo Kann
Maximum Bounded 3-Dimensional Matching is MAX SNP-Complete. Inf. Process. Lett. 37 (1) (1991)