default search action
Viggo Kann
Person information
- affiliation: Royal Institute of Technology, Stockholm, Sweden
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c29]Camilla Björn, Viggo Kann:
Students' Understanding of Programming Fluency. ITiCSE (2) 2024 - 2023
- [c28]Camilla Björn, Viggo Kann:
Variables Affecting Students' Success in CS2. ITiCSE (1) 2023: 257-263 - 2022
- [c27]Emma Riese, Viggo Kann:
Training Teaching Assistants by Offering an Introductory Course. SIGCSE (1) 2022: 745-751 - 2021
- [c26]Emma Riese, Viggo Kann:
Computer Science Majors' Experiences of Their Distance Education Caused by the COVID-19 Pandemic. EDUCON 2021: 393-397 - 2020
- [c25]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: 1-9 - [c24]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: 1-8 - [c23]Emma Riese, Viggo Kann:
Teaching Assistants' Experiences of Tutoring and Assessing in Computer Science Education. FIE 2020: 1-9
2010 – 2019
- 2019
- [c22]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: 133-139 - 2018
- [c21]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: 148-174 - [c20]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: 348-349 - [c19]Viggo Kann, Örjan Ekeberg:
Student based program development. ITiCSE 2018: 379 - 2017
- [j14]Emma Enström, Viggo Kann:
Iteratively Intervening with the "Most Difficult" Topics of an Algorithms and Complexity Course. ACM Trans. Comput. Educ. 17(1): 4:1-4:38 (2017) - 2016
- [c18]Viggo Kann, Anna-Karin Högfeldt:
Effects of a Program Integrating Course for Students of Computer Science and Engineering. SIGCSE 2016: 510-515 - [i3]Björn Hedin, Viggo Kann:
Improving Study Skills using Program Integrating Reflection Seminars. CoRR abs/1608.00633 (2016) - 2014
- [c17]Viggo Kann:
Using reflections in a program integrating course. ITiCSE 2014: 350 - 2013
- [c16]Pierluigi Crescenzi, Emma Enström, Viggo Kann:
From theory to practice: NP-completeness for every CS student. ITiCSE 2013: 16-21 - 2011
- [c15]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: 3 - 2010
- [c14]Emma Enström, Viggo Kann:
Computer lab work on theory. ITiCSE 2010: 93-97
2000 – 2009
- 2009
- [c13]Hercules Dalianis, Martin Rimka, Viggo Kann:
Using Uplug and SiteSeeker to construct a cross language search engine for Scandinavian languages. NODALIDA 2009: 26-33 - [c12]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: 376-380 - 2005
- [c11]Viggo Kann, Magnus Rosell:
Free construction of a free Swedish dictionary of synonyms. NODALIDA 2005: 105-110 - 2004
- [c10]Jonas Sjöbergh, Viggo Kann:
Finding the Correct Interpretation of Swedish Compounds, a Statistical Approach. LREC 2004 - 2000
- [j13]Paola Alimonti, Viggo Kann:
Some APX-completeness results for cubic graphs. Theor. Comput. Sci. 237(1-2): 123-134 (2000)
1990 – 1999
- 1999
- [b1]Giorgio Ausiello, Alberto Marchetti-Spaccamela, Pierluigi Crescenzi, Giorgio Gambosi, Marco Protasi, Viggo Kann:
Complexity and approximation: combinatorial optimization problems and their approximability properties. Springer 1999, ISBN 3540654313, pp. I-XIX, 1-524 - [j12]Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan:
Structure in Approximation Classes. SIAM J. Comput. 28(5): 1759-1782 (1999) - [j11]Johan Carlberger, Viggo Kann:
Implementing an Efficient Part-Of-Speech Tagger. Softw. Pract. Exp. 29(9): 815-832 (1999) - [c9]Rickard Domeij, Ola Knutsson, Johan Carlberger, Viggo Kann:
Granska-an efficient hybrid system for Swedish grammar checking. NODALIDA 1999: 49-56 - 1998
- [j10]Viggo Kann, Jens Lagergren, Alessandro Panconesi:
Approximate Max k-Cut with Subgraph Guarantee. Inf. Process. Lett. 65(3): 145-150 (1998) - [j9]Pierluigi Crescenzi, Viggo Kann:
How to find the best approximation results. SIGACT News 29(4): 90-97 (1998) - [j8]Edoardo Amaldi, Viggo Kann:
On the Approximability of Minimizing Nonzero Variables or Unsatisfied Relations in Linear Systems. Theor. Comput. Sci. 209(1-2): 237-260 (1998) - 1997
- [j7]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) - [c8]Paola Alimonti, Viggo Kann:
Hardness of Approximating Problems on Cubic Graphs. CIAC 1997: 288-298 - [c7]Pierluigi Crescenzi, Viggo Kann:
Approximation on the Web: A Compendium of NP Optimization Problems. RANDOM 1997: 111-118 - 1996
- [j6]Viggo Kann, Jens Lagergren, Alessandro Panconesi:
Approximability of Maximum Splitting of k-Sets and Some Other Apx-Complete Problems. Inf. Process. Lett. 58(3): 105-110 (1996) - [c6]Viggo Kann, Sanjeev Khanna, Jens Lagergren, Alessandro Panconesi:
On the Hardness of Approximating Max k-Cut and Its Dual. ISTCS 1996: 61-67 - [i2]Edoardo Amaldi, Viggo Kann:
On the approximability of some NP-hard minimization problems for linear systems. Electron. Colloquium Comput. Complex. TR96 (1996) - [i1]Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan:
Structure in Approximation Classes. Electron. Colloquium Comput. Complex. TR96 (1996) - 1995
- [j5]Edoardo Amaldi, Viggo Kann:
The Complexity and Approximability of Finding Maximum Feasible Subsystems of Linear Relations. Theor. Comput. Sci. 147(1&2): 181-210 (1995) - [c5]Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan:
Structure in Approximation Classes (Extended Abstract). COCOON 1995: 539-548 - [c4]Viggo Kann:
Strong Lower Bounds on the Approximability of some NPO PB-Complete Maximization Problems. MFCS 1995: 227-236 - 1994
- [j4]Viggo Kann:
Maximum Bounded H-Matching is MAX SNP-Complete. Inf. Process. Lett. 49(6): 309-318 (1994) - [j3]Rickard Domeij, Joachim Hollman, Viggo Kann:
Detection of Spelling Errors in Swedish Not Using a Word List En Clair. J. Quant. Linguistics 1(3): 195-201 (1994) - [j2]Viggo Kann:
Polynomially Bounded Minimization Problems That Are Hard to Approximate. Nord. J. Comput. 1(3): 317-331 (1994) - [c3]Edoardo Amaldi, Viggo Kann:
On the Approximability of Finding Maximum Feasible Subsystems of Linear Systems. STACS 1994: 521-532 - 1993
- [c2]Viggo Kann:
Polynomially Bounded Minimization Problems which are Hard to Approximate. ICALP 1993: 52-63 - 1992
- [c1]Viggo Kann:
On the Approximability of the Maximum Common Subgraph Problem. STACS 1992: 377-388 - 1991
- [j1]Viggo Kann:
Maximum Bounded 3-Dimensional Matching is MAX SNP-Complete. Inf. Process. Lett. 37(1): 27-35 (1991)
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 2024-07-20 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint