Viggo Kann

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