Your search returned the following 7 documents:

7. Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem
   Magnus Wahlström
   In: 29th International Symposium on Theoretical Aspects of Computer Science (STACS-13), Kiel, Germany, 2013
   
6. Finding Pseudo-repetitions
   Pawel Gawrychowski, Florin Manea, Robert Mercas, Dirk Nowotka, and Catalin Tiseanu
   In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), Kiel, Germany, 2013, 257-268
   
5. Recompression: a simple and powerful technique for word equations
   Artur Jez
   In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), Kiel, Germany, 2013, 233-244
   [PDF: Download: 25.pdf]
   
4. Low Randomness Rumor Spreading via Hashing
   George Giakkoupis, Thomas Sauerwald, He Sun, and Philipp Woelfel
   In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, Paris, France, 2012, 314-325
   
3. Playing Mastermind with Constant-Size Memory
   Benjamin Doerr and Carola Winzen
   In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, Paris, France, 2012, 441-452
   
2. Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem
   Khaled Elbassioni, Katarzyna Paluch, and Anke van Zuylen
   In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, Paris, France, 2012, 501-506
   
1. Tying up the loose ends in fully LZW-compressed pattern matching
   Pawel Gawrychowski
   In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, Paris, France, 2012, 624-635