|
|
| |
| University of Bonn -> Department of Computer Science -> Chair V | ||
| CS-APX-Reports 2014 |
Copyright
2014
University of Bonn, Department of Computer Science, Chair V
|
|
| 89153 |
Approximate Counting of Matchings in (3,3)-Hypergraphs
Andrzej Dudek, Marek Karpinski, Andrzej Rucinski and Edyta Szymanska [Download PostScript] [Download PDF] [Abstract] |
|
| 89154 |
Limits of CSP Problems and Efficient Parameter Testing
Marek Karpinski and Roland Marko [Download PostScript] [Download PDF] [Abstract] |
|
| 89155 |
Complexity of Nondeterministic Graph Parameter Testing
Marek Karpinski and Roland Marko [Download PostScript] [Download PDF] [Abstract] |
|
| 89156 |
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] |
|
| 89157 |
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
|
University of Bonn -> Department of Computer Science -> Chair V | |