The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Viggo Kann: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  21. Computer lab work on theory. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002