Institut für Informatik
 
Abteilung V

 
Universität Bonn -> Institut für Informatik -> Abteilung V
CS-Reports 2014 Copyright 2014 Universität Bonn, Institut für Informatik, Abteilung V

85346 Approximate Counting of Matchings in (3,3)-Hypergraphs
Andrzej Dudek, Marek Karpinski, Andrzej Rucinski and Edyta Szymanska
[Download PostScript] [Download PDF] [Abstract]
85347 Generalized Wong Sequences and Their Applications to Edmonds' Problems
(Revised Version)

Gabor Ivanyos, Marek Karpinski, Youming Qiao and Miklos Santha
[Download PostScript] [Download PDF] [Abstract]
85348 Limits of CSP Problems and Efficient Parameter Testing
Marek Karpinski and Roland Marko
[Download PostScript] [Download PDF] [Abstract]
85349 Complexity of Nondeterministic Graph Parameter Testing
Marek Karpinski and Roland Marko
[Download PostScript] [Download PDF] [Abstract]
85350 A QPTAS for the Base of the Number of Triangulations of a Planar Point Set
Marek Karpinski, Andrzej Lingas and Dzmitry Sledneu
[Download PostScript] [Download PDF] [Abstract]
85351 Approximation Hardness of Graphic TSP on Cubic Graphs
(Revised Version)

Marek Karpinski and Richard Schmied
[Download PostScript] [Download PDF] [Abstract]
Last Change: 11/03/14 at 09:53:29
 English
Universität Bonn -> Institut für Informatik -> Abteilung V