Publications
Publications
Referenzen
97.
Gunter Blache, Marek Karpinski und Juergen Wirtgen
On Approximation Intractability of the Bandwidth Problem
Electronic Colloquium on Computational Complexity (ECCC), 5(14)
1998
96.
Piotr Berman und Marek Karpinski
On Some Tighter Inapproximability Results, Further Improvements
Electronic Colloquium on Computational Complexity (ECCC), 5(65)
1998
95.
Mikael Goldmann und Marek Karpinski
Simulating threshold circuits by majority circuits
SIAM J. Comput., 27(1):230--246
1998
94.
Marek Karpinski und Wojciech Rytter
Fast parallel algorithms for graph matching problems
Band 9 aus Oxford Lecture Series in Mathematics and its Applications
Herausgeber: The Clarendon Press, Oxford University Press, New York,
1998
ISBN: 0-19-850162-5
93.
Marek Karpinski und Alexander Zelikovsky
Approximating dense cases of covering problems
Network design: connectivity and facilities location (Princeton, NJ, 1997) Band 40 aus DIMACS Ser. Discrete Math. Theoret. Comput. Sci.
Seite 169--178.
Herausgeber: Amer. Math. Soc., Providence, RI,
1998
92.
Farid Ablayev, Marek Karpinski und Rustam Mubarakzjanov
On BPP versus NPâ?ª coNP for ordered read-once branching programs
Randomized algorithms (Brno, 1998) aus Lect. Notes Ser. ECCC
Seite 10.
Herausgeber: Electron. Colloq. Comput. Complex., Trier,
1998
91.
Marek Karpinski
On the computation power of randomized branching programs
Randomized algorithms (Brno, 1998) aus Lect. Notes Ser. ECCC
Seite 12.
Herausgeber: Electron. Colloq. Comput. Complex., Trier,
1998
90.
Marek Karpinski, Juergen Wirtgen und Alexander Zelikovsky
An Approximation Algorithm for the Bandwidth Problem on Dense Graphs
Electronic Colloquium on Computational Complexity (ECCC), 4(17)
1997
89.
Marek Karpinski, Wojciech Rytter und Ayumi Shinohara
An efficient pattern-matching algorithm for strings with short descriptions
Nordic J. Comput., 4(2):172--186
1997
88.
Marek Karpinski, Lawrence L. Larmore und Wojciech Rytter
Correctness of constructing optimal alphabetic trees revisited
Theoret. Comput. Sci., 180(1-2):309--324
1997
87.
D. Grigoriev, M. Karpinski und N. Vorobjov
Lower bound on testing membership to a polyhedron by algebraic decision and computation trees
Discrete Comput. Geom., 17(2):191--215
1997
86.
Marek Karpinski und Alexander Zelikovsky
New approximation algorithms for the Steiner tree problems
J. Comb. Optim., 1(1):47--65
1997
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