Publications
Publications
Referenzen
217.
Piotr Berman, Bhaskar DasGupta, Lakshmi Kaligounder und Marek Karpinski
On the computational complexity of measuring global stability of banking networks
Algorithmica, 70(4):595--647
2014
216.
Andrzej Dudek, Marek Karpinski, Andrzej Ruciński und Edyta Szymańska
Approximate counting of matchings in (3,3)-hypergraphs
Algorithm theory---SWAT 2014 Band 8503 aus Lecture Notes in Comput. Sci.
Seite 380--391.
Herausgeber: Springer, Cham,
2014
215.
Gábor Ivanyos, Marek Karpinski, Youming Qiao und Miklos Santha
Generalized Wong sequences and their applications to Edmonds' problems
31st International Symposium on Theoretical Aspects of Computer Science Band 25 aus LIPIcs. Leibniz Int. Proc. Inform.
Seite 397--408.
Herausgeber: Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern,
2014
214.
Gábor Ivanyos, Marek Karpinski, Youming Qiao und Miklos Santha
Generalized Wong Sequences and Their Applications to Edmonds' Problems
Proceedings of the 31th Symposium on Theoretical Aspects of Computer Science (STACS) , Seite 397-408.
2014
213.
Marek Karpinski, Andrzej Lingas und Dzmitry Sledneu
Optimal cuts and partitions in tree metrics in polynomial time
Inform. Process. Lett., 113(12):447--451
2013
212.
Marek Karpiński, Andrzej Ruciński und Edyta Szymańska
Approximate counting of matchings in sparse uniform hypergraphs
ANALCO13---Meeting on Analytic Algorithmics and Combinatorics
Seite 72--79.
Herausgeber: SIAM, Philadelphia, PA,
2013
211.
Marek Karpinski, Michael Lampis und Richard Schmied
New inapproximability bounds for TSP
Algorithms and computation Band 8283 aus Lecture Notes in Comput. Sci.
Seite 568--578.
Herausgeber: Springer, Heidelberg,
2013
210.
Marek Karpinski, Andrzej Rucinski und Edyta Szymanska
Approximate Counting of Matchings in Sparse Uniform Hypergraphs
Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics (ANALCO) , Seite 72-79.
2013
209.
Marek Karpinski und Richard Schmied
Improved Inapproximability Results for the Shortest Superstring and Related Problems
Proceedings of the 19th Computing Australasian Theory Symposium (CATS) , Seite 27-36.
2013
208.
Marek Karpinski, Andrzej Rucinski und Edyta Szymanska
Approximate Counting of Matchings in Sparse Hypergraphs
CoRR, abs/1202.5885
2012
207.
Jean Cardinal, Marek Karpinski, Richard Schmied und Claus Viehmann
Approximating vertex cover in dense hypergraphs
J. Discrete Algorithms, 13:67--77
2012
206.
Piotr Berman, Marek Karpinski und Andrzej Lingas
Exact and approximation algorithms for geometric and capacitated set cover problems
Algorithmica, 64(2):295--310
2012
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