HCM: Publications

Karpinski, Marek

Referenzen

241.	Marek Karpinski, Andrzej Lingas und Dzmitry Sledneu A QPTAS for the base of the number of crossing-free structures on a planar point set Theor. Comput. Sci., 711:56--65 2018 DOI: 10.1016/j.tcs.2017.11.003
240.	Marek Karpinski, Andrzej Lingas und Dzmitry Sledneu A QPTAS for the base of the number of crossing-free structures on a planar point set Theoret. Comput. Sci., 711:56--65 2018 DOI: 10.1016/j.tcs.2017.11.003
239.	Bhaskar Das Gupta, Marek Karpinski, Nasim Mobasheri und Farzane Yahyanejad Effect of Gromov-hyperbolicity parameter on cuts and expansions in graphs and some algorithmic implications Algorithmica, 80(2):772--800 2018 DOI: 10.1007/s00453-017-0291-7
238.	Marek Karpinski, LÃ¡szlÃ³ MÃ©rai und Igor E. Shparlinski Identity testing and interpolation from high powers of polynomials of large degree over finite fields J. Complexity, 49:74--84 2018 DOI: 10.1016/j.jco.2018.07.006
237.	Gábor Ivanyos, Marek Karpinski, Miklos Santha, Nitin Saxena und Igor E. Shparlinski Polynomial interpolation and identity testing from high powers over finite fields Algorithmica, 80(2):560--575 2018 DOI: 10.1007/s00453-016-0273-1
236.	J.-A. AnglÃ¨s d'Auriac, Cs. BujtÃ¡s, A. El Maftouhi, M. Karpinski, Y. Manoussakis, L. Montero, N. Narayanan, L. Rosaz, J. Thapper und Zs. Tuza Tropical dominating sets in vertex-coloured graphs J. Discrete Algorithms, 48:27--41 2018 DOI: 10.1016/j.jda.2018.03.001
235.	Gábor Ivanyos, Marek Karpinski, Miklos Santha, Nitin Saxena und Igor E. Shparlinski Polynomial Interpolation and Identity Testing from High Powers Over Finite Fields Algorithmica, 2017 DOI: 10.1007/s00453-016-0273-1
234.	Mikael Gast, Mathias Hauptmann und Marek Karpinski Approximation Complexity of Max-Cut on Power Law Graphs CoRR, abs/1602.08369 2016
233.	Jean-Alexandre AnglÃ¨s d'Auriac, Csilia BujtÃ¡s, Hakim El Maftouhi, Marek Karpinski, Yannis Manoussakis, Leandro Montero, Narayanan Narayanan, Laurent Rosaz, Johan Thapper und Zsolt Tuza Tropical dominating sets in vertex-coloured graphs WALCOM: algorithms and computation Band 9627 aus Lecture Notes in Comput. Sci. Seite 17--27. Herausgeber: Springer, [Cham], 2016 DOI: 10.1007/978-3-319-30139-6_2
232.	Marek Karpinski und Richard Schmied Approximation hardness of graphic TSP on cubic graphs RAIRO Oper. Res., 49(4):651--668 2015 DOI: 10.1051/ro/2014062
231.	Marek Karpinski und Marko Roland Explicit Bounds for Nondeterministically Testable Hypergraph Parameters CoRR, abs/1509.03046 2015
230.	Gábor Ivanyos, Marek Karpinski, Youming Qiao und Miklos Santha Generalized Wong sequences and their applications to Edmonds' problems J. Comput. System Sci., 81(7):1373--1386 2015 DOI: 10.1016/j.jcss.2015.04.006

Seite:

Previous | 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19 | Next

Export als: