Your search returned the following 3 documents:

3. Approximability of Dense and Sparse Instances of Minimum 2-Connectivity, TSP and Path Problems
   Bela Csaba, Piotr Krysta, and Marek Karpinski
   In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02), San Francisco, CA, USA, 2002, 74-83
   
2. Efficient Algorithms for Lempel-Ziv Encoding
   Leszek Gasieniec, Marek Karpinski, Wojciech Plandowski, and Wojciech Rytter
   In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, Reykjavik, Iceland, July, 3-5, 1996, 392-403
   
1. Randomized Efficient Algorithms for Compressed Strings: the Finger-Print Approach
   Leszek Gasieniec, Marek Karpinski, Wojciech Plandowski, and Wojciech Rytter
   In: Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96), Laguna Beach, CA, USA, June, 10-12, 1996, 39-49