Your search returned the following 2 documents:

2. Faster Algorithms for Computing Longest Common Increasing Subsequences
   Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel, and Martin Kutz
   In: Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, Barcelona, Spain, 2006, 330-341
   
1. Minimal Discriminating Words Problem Revisited
   Pawel Gawrychowski, Gregory Kucherov, Yakov Nekrich, and Tatiana Starikovskaya
   In: String Processing and Information Retrieval - 20th International Symposium (SPIRE 2013), Jerusalem, Israel, 2013