bild
School of
Computer Science
and Communication

Viggo Kann's recent publications

Language engineering

Pedagogy

Approximability

Complexity and Approximation - Combinatorial optimization problems and their approximability properties
G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi
Springer Verlag, 1999, ISBN 3-540-65431-3.
Link to the web page of the book.
A compendium of NP optimization problems
P. Crescenzi and V. Kann
Technical report SI/RR-95/02, Dipartimento di Scienze dell'Informazione, Universitā di Roma "La Sapienza", 1995.
A list of NP complete optimization problems and their approximability.
On-line list.
How to find the best approximation results - a follow-up to Garey and Johnson
P. Crescenzi and V. Kann
ACM SIGACT News, volume 29, number 4, December 1998, pages 90-97
HTML.
On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
E. Amaldi, V. Kann
Theoretical Computer Science 209:237-260, 1998.
Postscript.
Hardness of approximating problems on cubic graphs
P. Alimonti, V. Kann
CIAC 97, 288-298, LNCS 1203, 1997.
ASHCOMP-96, 1996.
Theoretical Computer Science, 237:123-134, 2000.
Postscript.
Hardness of approximation
V. Kann, A. Panconesi
Chapter 2 in Dell'Amico, Maffioli, Martello (editors), Annotated Bibliographies in Combinatorial Optimization, Wiley, 13­30, 1997.
Postscript.
Approximate Max k-cut with subgraph guarantee
V. Kann, J. Lagergren, A. Panconesi
IPL, 65:145-150, 1998.
ASHCOMP-96, 1996.
Postscript.
On the hardness of approximating MAX k-CUT and its dual
S. Khanna, V. Kann, J. Lagergren, A. Panconesi
Chicago J. Theoretical Computer Science, number 1997:2, June 1997.
ISTCS-96, 61-67, 1996.
NADA report TRITA-NA-9505, 1995.
Postscript.
Approximability of maximum splitting of k-sets and some other APX-complete problems
V. Kann, J. Lagergren, A. Panconesi
IPL, 58:105-110, 1996.
NADA report TRITA-NA-9512, 1995.
Postscript.
Strong lower bounds on the approximability of some NPO PB-complete maximization problem
V. Kann
MFCS 95, 227-236, LNCS 969, 1995.
NADA report TRITA-NA-9501, 1995.
Postscript.
Structure in approximation classes
P. Crescenzi, V. Kann, R. Silvestri, L. Trevisan
SIAM J. Computing 28:1759-1782, 1999.
COCOON 95, 539-548, LNCS 959, 1995.
Postscript.
Polynomially bounded minimization problems that are hard to approximate
V. Kann
Nordic Journal of Computing 1:317-331, 1994.
ICALP 93, LNCS 700, 1993.
Postscript.
The complexity and approximability of finding maximum feasible subsystems of linear relations
E. Amaldi, V. Kann
Theoretical Computer Science 147:181-210, 1995.
STACS 94, LNCS 775, 1994.
NADA report TRITA-NA-9313, 1993.
Postscript.
On the approximability of the maximum common subgraph problem
V. Kann
STACS-92, 377-388, 1992.
PDF.
On the approximability of some NP-hard minimization problems for linear systems
E. Amaldi, V. Kann
ECCC report TR96-015, 1996
International Symposium on Mathematical Programming, Ann Arbor, 1996
Tech. report 95-7, Cornell Computational Optimization Project, Cornell University, Ithaca, NY, 1995.
HTML, Postscript.
Maximum bounded 3-dimensional matching is MAX SNP-complete
V. Kann
IPL, 37:27-35, 1991.
Postscript PDF.
Maximum bounded H-matching is MAX SNP-complete
V. Kann
IPL, 49:309-318, 1994.
On the Approximability of NP-complete Optimization Problems
V. Kann
Ph.D. Thesis, NADA report TRITA-NA-9206, 1992.
PDF.

Language engineering
Morphological and lexicographical tools and resources from KTH
V. Kann
Presentation given at Leksikografi og sprogteknologi i Norden, Nordiska föreningen för lexikografi, Schäffergården, Denmark, January 2010.
abstract
presentation (in Swedish)
Så lika är orden
V. Kann
Språktidningen 4/2008:32-33.
web
Folkets synonymlexikon och sen?
V. Kann
Seminar given at Internetdagarna, October 21, 2008.
Folkets synonymlexikon och Folkets engelsk-svenska lexikon
V. Kann
Seminar given at Göteborg University, October 2008.
Powerpoint
Free Swedish Word Lists or Hackers' BLARK
V. Kann
Talk given at the GSLT retreat, January 2008.
Powerpoint
Tvärslå - defining an XML exchange format and then building an on-line Nordic dictionary
V. Kann, J. Hollman,
Workshop: The Automatic Treatment of Multilinguality in Retrieval, Search and Lexicography, Copenhagen, April 2007.
PDF
Using Uplug and SiteSeeker to construct a cross language search engine for Scandinavian
H. Dalianis, M. Rimka, V. Kann.
Nodalida 2009, Odense, 2009.
Workshop: The Automatic Treatment of Multilinguality in Retrieval, Search and Lexicography, Copenhagen, April 2007.
PDF
Vad kan statistik avslöja om svenska sammansättningar?
J. Sjöbergh, V. Kann,
Språk och stil, 16:199-214, 2006.
PDF
Grammar checking for Swedish second language learners
J. Bigert, V. Kann, O. Knutsson, J. Sjöbergh
Chapter in CALL for the Nordic Languages, 33-47 Copenhagen Studies in Language 30, Copenhagen Business School. Samfundslitteratur. 2005.
PDF
Free construction of a Swedish dictionary of synonyms
V. Kann, M. Rosell,
NoDaLiDa 2005, Joensuu, 2005.
PDF
Abstract
Presentation, Amherst College, November 2006 (PowerPoint)
Folkets användning av Lexin - en resurs
V. Kann
Lexinkonferens 2004, Stockholm, 2004.
PDF
Comparing Comparisons: Document Clustering Evaluation Using Two Manual Classifications
M. Rosell, V. Kann, J-E. Litton
ICON 2004, India.
PDF
The development and performance of a grammar checker for Swedish: A language engineering perspective
J. Carlberger, R. Domeij, V. Kann, O. Knutsson
submitted 2004
PDF.
Finding the correct interpretation of Swedish compounds, a statistical approach
J. Sjöbergh, V. Kann
LREC 2004 (4th Int. Conf. Language Resources and Evaluation), Lissabon, Portugal, 2004.
PDF
A robust shallow parser for Swedish
O. Knutsson, J. Bigert, V. Kann
NoDaLiDa 03, Reykjavik, Island, May 2003.
Presentation in PowerPoint, PDF.
Annotated clauses and flat phrase structures for Swedish
J. Bigert, O. Knutsson, V. Kann, J. Sjöbergh
Swedish Treebank Symposium, Växjö, November 2002. PDF
An object-oriented rule language for high level text processing
O. Knutsson, J. Carlberger, V. Kann
NoDaLiDa 01, May 2001.
PDF
Granska - an efficient hybrid system for Swedish grammar checking
R. Domeij, O. Knutsson, J. Carlberger, V. Kann
NoDaLiDa 99, 49-56, December 1999.
Word format.
Some applications of a statistical tagger for Swedish
J. Carlberger, V. Kann
Proc. 4:th conference of the International Quantitative Linguistics Association (Qualico-2000), 51-52, August 2000.
Postscript, PDF.
Implementing an efficient part-of-speech tagger
J. Carlberger, V. Kann
Software Practice and Experience, 29, 815-832, 1999.
Postscript. PDF.
Implementation aspects and applications of a spelling correction algorithm.
V. Kann, R. Domeij, J. Hollman, M. Tillenius
L. Uhlirova, G. Wimmer, G. Altmann, R. Koehler: Text as a Linguistic Paradigm: Levels, Constituents, Constructs. Festschrift in honour of Ludek Hrebicek, Quantitative Linguistics, vol. 60, WVT, 2001.
NADA report TRITA-NA-9813, 1998.
Postscript, PDF.
Detection of spelling errors in Swedish not using a word list en clair
R. Domeij, J. Hollman, V. Kann
J. of Quantitative Linguistics 1:195-201, 1994.
QUALICO-94, 71-76, 1994.
Postscript, PDF.
En metod för svensk rättstavning baserad på bloomfilter (A method for Swedish spelling based on Bloom filters), in Swedish.
J. Hollman, V. Kann
NADA report TRITA-NA-P9213, 1992.
Postscript, PDF.

Pedagogy
Lärarbemanning för kvalitet (in Swedish)
V. Kann
Presentation at Kvalitetskonferensen 2009 (HSV), May 14.
Abstract.
Powerpoint.
Effektiv, formativ och målrelaterad sluttenta (Efficient, formative and criterion-referenced final exam, in Swedish)
V. Kann
Utvecklingskonferensen 2008 (KTH), November 26-27, 2008.
PDF.
Målrelaterade betygskriterier kräver modifierad examination - examination efter betygskriterier i en algoritmkurs på KTH (in Swedish)
V. Kann
Presentation at Kvalitetskonferensen 2007 (HSV), October 11.
Abstract.
Handouts.
Powerpoint.
Erfarenheter från Amherst College (in Swedish)
V. Kann
Presentation at KTH Learning Lab, September 10, 2007.
Powerpoint.
Report from my visit at Amherst College August-December 2006
V. Kann
Technical report, 2007.
HTML.

^ Up to home page.

Published by: Viggo Kann <viggo@nada.kth.se>
Updated 2010-03-20