Publications
Publications
Referenzen
229.
Mikael Gast, Mathias Hauptmann und Marek Karpinski
Inapproximability of dominating set on power law graphs
Theoretical Computer Science, 562:436-452
2015
228.
Mikael Gast, Mathias Hauptmann und Marek Karpinski
Inapproximability of dominating set on power law graphs
Theoret. Comput. Sci., 562:436--452
2015
227.
Marek Karpinski, Richard Schmied und Claus Viehmann
Nearly tight approximation bounds for vertex cover on dense k-uniform k-partite hypergraphs
J. Discrete Algorithms, 33:49--57
2015
226.
Marek Karpinski, Michael Lampis und Richard Schmied
New inapproximability bounds for TSP
J. Comput. System Sci., 81(8):1665--1677
2015
225.
Mathias Hauptmann und Marek Karpinski
On the Approximability of Independent Set Problem on Power Law Graphs
CoRR, abs/1503.02880
2015
224.
Roland Marko und Marek Karpinski
On the Complexity of Nondeterministically Testable Hypergraph Parameters
CoRR, abs/1503.07093
2015
223.
Marek Karpinski, Andrzej Lingas und Dzmitry Sledneu
A QPTAS for the base of the number of crossing-free structures on a planar point set
Automata, languages, and programming. Part I Band 9134 aus Lecture Notes in Comput. Sci.
Seite 785--796.
Herausgeber: Springer, Heidelberg,
2015
222.
Marek Karpinski
Towards better inapproximability bounds for TSP: a challenge of global dependencies
Fundamentals of computation theory Band 9210 aus Lecture Notes in Comput. Sci.
Seite 3--11.
Herausgeber: Springer, Cham,
2015
221.
Marek Karpinski, Andrzej Lingas und Dzmitry Sledneu
A QPTAS for the Base of the Number of Triangulations of a Planar Point Set
CoRR, abs/1411.0544
2014
220.
Marek Karpinski und Roland Marko
Complexity of Nondeterministic Graph Parameter Testing
CoRR, abs/1408.3590
2014
219.
Manuel Arora, Marek Karpinski und Nitin Saxena
Deterministic polynomial factoring and association schemes
LMS J. Comput. Math., 17(1):123--140
2014
218.
Marek Karpinski und Roland Marko
Limits of CSP Problems and Efficient Parameter Testing
CoRR, abs/1406.3514
2014
Seite:  
Previous | Publications, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19 | Next
Export als:
BibTeX, XML