Rheinische Friedrich-Wilhelms-Universität Bonn Institut für Informatik
 
Abteilung V

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

85352 Inapproximability of Dominating Set on Power Law Graphs
(Revised Version)

Mikael Gast, Mathias Hauptmann and Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
85353 Polynomial Interpolation and Identity Testing from High Powers over Finite Fields
Gabor Ivanyos, Marek Karpinski, Miklos Santha, Nitin Saxena and Igor E. Shparlinski
[Download PostScript] [Download PDF] [Abstract]
85354 A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set
Marek Karpinski, Andrzej Lingas and Dzmitry Sledneu
[Download PostScript] [Download PDF] [Abstract]
85355 On the Approximability of Independent Set Problem on Power Law Graphs
Mathias Hauptmann and Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
85356 On the Complexity of Nondeterministically Testable Hypergraph Parameters
Marek Karpinski and Roland Marko
[Download PostScript] [Download PDF] [Abstract]
85357 Towards Better Inapproximability Bounds for TSP: A Challenge of Global Dependencies
Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
85358 Explicit Bounds for Nondeterministically Testable Hypergraph Parameters
Marek Karpinski and Roland Marko
[Download PostScript] [Download PDF] [Abstract]
85359 Approximability of TSP on Power Law Graphs
Mikael Gast, Mathias Hauptmann and Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
85360 Node Expansions and Cuts in Gromov-Hyperbolic Graphs
Bhaskar DasGupta, Marek Karpinski, Nasim Mobasheri, Farzaneh Yahyanejad
[Download PostScript] [Download PDF] [Abstract]
Last Change: 10/30/15 at 11:00:56
 English
Universität Bonn -> Institut für Informatik -> Abteilung V

Powered by Zope