Your search returned the following 5 documents:

5. Approximation of smallest linear tree grammar
   Artur Jez and Markus Lohrey
   In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), Lyon, France, 2014, 445-457
   
   
4. Testing Generalised Freeness of Words
   Pawel Gawrychowski, Florin Manea, and Dirk Nowotka
   In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), Lyon, France, 2014, 337-349
   
3. 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
   
2. 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
   
1. 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]