Concepedia

Viggo Kann

VK

33

Publications

2.5K

Citations

21

H-Index

1991

Active since

Affiliations

KTH Royal Institute of Technology(Current)

Sapienza University of Rome

Gannon University

University of New Hampshire

Robert Gordon University

Viggo Kann is an author at KTH Royal Institute of Technology specializing in engineering, computer science, and education.

Top concepts

EngineeringComputer ScienceEducationCombinatorial OptimizationLearning AnalyticsComputational ComplexityMathematical ProgrammingLanguageLinguisticsDiscrete Mathematics

Publications per year

1991–2023

33

Publications

33

On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems

E. Amaldi, Viggo Kann · Theoretical Computer Science · 1998 · 759 citations · Full text

Mathematical Programming, Computational Complexity Theory, Engineering +18

Some APX-completeness results for cubic graphs

Paola Alimonti, Viggo Kann · Theoretical Computer Science · 2000 · 359 citations

Graph Theory, Algebraic Graph Theory, Topological Graph Theory +4

Maximum bounded 3-dimensional matching is MAX SNP-complete

Viggo Kann · Information Processing Letters · 1991 · 277 citations

Mathematical Programming, 3-Dimensional Matching, Machine Vision +8

The complexity and approximability of finding maximum feasible subsystems of linear relations

E. Amaldi, Viggo Kann · Theoretical Computer Science · 1995 · 201 citations

Mathematical Programming, Maximum Feasible Subsystems, Constraint Solving +11

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

Stephen Frezza, Mats Daniels, Arnold Pears et al. · 2018 · 95 citations · Full text

Engineering, Computational Literacy, Educational Informatics +17

Rows per page

1–5 of 33