Publications
Publications
Referenzen
205.
Mikael Gast, Mathias Hauptmann und Marek Karpinski
Improved Approximation Lower Bounds for Vertex Cover on Power Law Graphs and Some Generalizations
CoRR, abs/1210.2698
2012
204.
Marek Karpinski und Richard Schmied
On Approximation Lower Bounds for TSP with Bounded Metrics
CoRR, abs/1201.5821
2012
203.
Marek Karpinski, Andrzej Lingas und Dzmitry Sledneu
Optimal Cuts and Bisections on the Real Line in Polynomial Time
CoRR, abs/1207.0933
2012
202.
Gábor Ivanyos, Marek Karpinski, Lajos Rónyai und Nitin Saxena
Trading GRH for algebra: algorithms for factoring polynomials and related structures
Math. Comp., 81(277):493--531
2012
201.
Martin Dyer, Uriel Feige, Alan Frieze und Marek Karpinski
Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241)
Dagstuhl Reports, 1(6):24--53
2011
200.
Marek Karpinski und Richard Schmied
Improved Lower Bounds for the Shortest Superstring and Related Problems
CoRR, abs/1111.5442
2011
199.
Jean Cardinal, Marek Karpinski, Richard Schmied und Claus Viehmann
Approximating subdense instances of covering problems
LAGOS'11---VI Latin-American Algorithms, Graphs and Optimization Symposium Band 37 aus Electron. Notes Discrete Math.
Seite 297--302.
Herausgeber: Elsevier Sci. B. V., Amsterdam,
2011
198.
Marek Karpinski und Warren Schudy
Approximation schemes for the betweenness problem in tournaments and related ranking problems
Approximation, randomization, and combinatorial optimization Band 6845 aus Lecture Notes in Comput. Sci.
Seite 277--288.
Herausgeber: Springer, Heidelberg,
2011
197.
Marek Karpinski und Yakov Nekrich
Top-K color queries for document retrieval
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms , Seite 401--411.
Herausgeber: SIAM, Philadelphia, PA,
2011
196.
Marek Karpiński, Andrzej Ruciński und Edyta Szymańska
Computational complexity of the perfect matching problem in hypergraphs with subcritical density
Internat. J. Found. Comput. Sci., 21(6):905--924
2010
195.
A. Abouelaoualim, K. Ch. Das, W. Fernandez de la Vega, M. Karpinski, Y. Manoussakis, C. A. Martinhon und R. Saad
Cycles and paths in edge-colored graphs with given degrees
J. Graph Theory, 64(1):63--86
2010
194.
Gábor Ivanyos, Marek Karpinski und Nitin Saxena
Deterministic polynomial time algorithms for matrix completion problems
SIAM J. Comput., 39(8):3736--3751
2010
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