( en | de | ru )

 

Disambiguation of "Karpinski, Marek"

Author of the publication

copydeleteadd this publication to your clipboard
1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two.

, , and . Electron. Colloquium Comput. Complex., (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Peter Karpinski

Hannelore Karpinski

Kurt Karpinski

Peter Karpinski

Werner Karpinski

 

Other publications of authors with the same name

Polynomial Interpolation and Identity Testing from High Powers Over Finite Fields., , , , and . Algorithmica, 80 (2): 560-575 (2018)An Efficient Pattern-Matching Algorithm for Strings with Short Descriptions., , and . Nord. J. Comput., 4 (2): 172-186 (1997)Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems., , and . SODA, page 74-83. ACM/SIAM, (2002)Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields., , and . SIAM J. Comput., 19 (6): 1059-1063 (1990)An Efficient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3., , and . Inf. Process. Lett., 42 (6): 309-313 (1992)On the Computational Complexity of Measuring Global Stability of Banking Networks., , , and . Algorithmica, 70 (4): 595-647 (2014)Effect of Gromov-Hyperbolicity Parameter on Cuts and Expansions in Graphs and Some Algorithmic Implications., , , and . Algorithmica, 80 (2): 772-800 (2018)On the Approximability of Independent Set Problem on Power Law Graphs., and . CoRR, (2015)Polynomial time approximation schemes for dense instances of NP-hard problems., , and . STOC, page 284-293. ACM, (1995)On real Turing machines that toss coins., , , , and . STOC, page 335-342. ACM, (1995)