| 2000 |
|---|
| 22 | EE | Paola Alimonti,
Viggo Kann:
Some APX-completeness results for cubic graphs.
Theor. Comput. Sci. 237(1-2): 123-134 (2000) |
| 1999 |
|---|
| 21 | | Pierluigi Crescenzi,
Viggo Kann,
Riccardo Silvestri,
Luca Trevisan:
Structure in Approximation Classes.
SIAM J. Comput. 28(5): 1759-1782 (1999) |
| 20 | | Johan Carlberger,
Viggo Kann:
Implementing an Efficient Part-Of-Speech Tagger.
Softw., Pract. Exper. 29(9): 815-832 (1999) |
| 1998 |
|---|
| 19 | EE | Viggo Kann,
Jens Lagergren,
Alessandro Panconesi:
Approximate Max k-Cut with Subgraph Guarantee.
Inf. Process. Lett. 65(3): 145-150 (1998) |
| 18 | EE | 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 |
|---|
| 17 | | Paola Alimonti,
Viggo Kann:
Hardness of Approximating Problems on Cubic Graphs.
CIAC 1997: 288-298 |
| 16 | | Pierluigi Crescenzi,
Viggo Kann:
Approximation on the Web: A Compendium of NP Optimization Problems.
RANDOM 1997: 111-118 |
| 15 | EE | Viggo Kann,
Sanjeev Khanna,
Jens Lagergren,
Alessandro Panconesi:
On the Hardness of Approximating Max k-Cut and its Dual.
Chicago J. Theor. Comput. Sci. 1997: (1997) |
| 1996 |
|---|
| 14 | | Viggo Kann,
Sanjeev Khanna,
Jens Lagergren,
Alessandro Panconesi:
On the Hardness of Approximating Max k-Cut and Its Dual.
ISTCS 1996: 61-67 |
| 13 | EE | Edoardo Amaldi,
Viggo Kann:
On the approximability of some NP-hard minimization problems for linear systems
Electronic Colloquium on Computational Complexity (ECCC) 3(15): (1996) |
| 12 | EE | Pierluigi Crescenzi,
Viggo Kann,
Riccardo Silvestri,
Luca Trevisan:
Structure in Approximation Classes
Electronic Colloquium on Computational Complexity (ECCC) 3(66): (1996) |
| 11 | EE | 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) |
| 1995 |
|---|
| 10 | | Pierluigi Crescenzi,
Viggo Kann,
Riccardo Silvestri,
Luca Trevisan:
Structure in Approximation Classes (Extended Abstract).
COCOON 1995: 539-548 |
| 9 | | Viggo Kann:
Strong Lower Bounds on the Approximability of some NPO PB-Complete Maximization Problems.
MFCS 1995: 227-236 |
| 8 | EE | 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) |
| 1994 |
|---|
| 7 | | Edoardo Amaldi,
Viggo Kann:
On the Approximability of Finding Maximum Feasible Subsystems of Linear Systems.
STACS 1994: 521-532 |
| 6 | | Viggo Kann:
Maximum Bounded H-Matching is MAX SNP-Complete.
Inf. Process. Lett. 49(6): 309-318 (1994) |
| 5 | | Rickard Domeij,
Joachim Hollman,
Viggo Kann:
Detection of Spelling Errors in Swedish Not Using a Word List En Clair.
Journal of Quantitative Linguistics 1(3): 195-201 (1994) |
| 4 | | Viggo Kann:
Polynomially Bounded Minimization Problems That Are Hard to Approximate.
Nord. J. Comput. 1(3): 317-331 (1994) |
| 1993 |
|---|
| 3 | | Viggo Kann:
Polynomially Bounded Minimization Problems which are Hard to Approximate.
ICALP 1993: 52-63 |
| 1992 |
|---|
| 2 | | Viggo Kann:
On the Approximability of the Maximum Common Subgraph Problem.
STACS 1992: 377-388 |
| 1991 |
|---|
| 1 | | Viggo Kann:
Maximum Bounded 3-Dimensional Matching in MAX SNP-Complete.
Inf. Process. Lett. 37(1): 27-35 (1991) |
