Publications
Publications
Referenzen
193.
Marek Karpinski, Ian Munro und Yakov Nekrich
Range Reporting for Moving Points on a Grid
CoRR, abs/1002.3511
2010
192.
Leslie Ann Goldberg, Mark Jerrum und Marek Karpinski
The mixing time of Glauber dynamics for coloring regular trees
Random Structures Algorithms, 36(4):464--476
2010
191.
Piotr Berman, Marek Karpinski und Alexander Zelikovsky
A 3/2-approximation algorithm for generalized Steiner trees in complete graphs with edge lengths 1 and 2
Algorithms and computation. Part I Band 6506 aus Lecture Notes in Comput. Sci.
Seite 15--24.
Herausgeber: Springer, Berlin,
2010
190.
Marek Karpiński, Andrzej Ruciński und Edyta Szymańska
Computational complexity of the Hamiltonian cycle problem in dense hypergraphs
LATIN 2010: theoretical informatics Band 6034 aus Lecture Notes in Comput. Sci.
Seite 662--673.
Herausgeber: Springer, Berlin,
2010
189.
Piotr Berman, Marek Karpinski und Andrzej Lingas
Exact and approximation algorithms for geometric and capacitated set cover problems
Computing and combinatorics Band 6196 aus Lecture Notes in Comput. Sci.
Seite 226--234.
Herausgeber: Springer, Berlin,
2010
188.
Marek Karpinski und Warren Schudy
Faster algorithms for feedback arc set tournament, Kemeny rank aggregation and betweenness tournament
Algorithms and computation. Part I Band 6506 aus Lecture Notes in Comput. Sci.
Seite 3--14.
Herausgeber: Springer, Berlin,
2010
187.
Marek Karpinski und Yakov Nekrich
A fast algorithm for adaptive prefix coding
Algorithmica, 55(1):29--41
2009
186.
Piotr Berman, Marek Karpinski und Alexander Zelikovsky
1.25-approximation algorithm for Steiner tree problem with distances 1 and 2
Algorithms and data structures Band 5664 aus Lecture Notes in Comput. Sci.
Seite 86--97.
Herausgeber: Springer, Berlin,
2009
185.
Piotr Berman, Bhaskar DasGupta und Marek Karpinski
Approximating transitive reductions for directed networks
Algorithms and data structures Band 5664 aus Lecture Notes in Comput. Sci.
Seite 74--85.
Herausgeber: Springer, Berlin,
2009
184.
Marek Karpinski und Yakov Nekrich
Space efficient multi-dimensional range reporting
Computing and combinatorics Band 5609 aus Lecture Notes in Comput. Sci.
Seite 215--224.
Herausgeber: Springer, Berlin,
2009
183.
Marek Karpiński, Andrzej Ruciński und Edyta Szymańska
The complexity of perfect matching problems on dense hypergraphs
Algorithms and computation Band 5878 aus Lecture Notes in Comput. Sci.
Seite 626--636.
Herausgeber: Springer, Berlin,
2009
182.
Marek Karpinski und Warren Schudy
Linear time approximating schemes for the Gale-Berlekamp game and related minimization problems
STOC'09---Proceedings of the 2009 ACM International Symposium on Theory of Computing , Seite 313--322.
Herausgeber: ACM, New York,
2009
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