| Explainable and Local Correction of Classification Models Using Decision Trees. | 0 | 0.34 | 2022 |
| Counterfactual Explanation Trees: Transparent and Consistent Actionable Recourse with Decision Trees | 0 | 0.34 | 2022 |
| Ordered Counterfactual Explanation By Mixed-Integer Linear Optimization | 0 | 0.34 | 2021 |
| DACE: Distribution-Aware Counterfactual Explanation by Mixed-Integer Linear Optimization | 1 | 0.36 | 2020 |
| Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction for Multiple Texts | 0 | 0.34 | 2020 |
| Practical Grammar Compression Based on Maximal Repeats. | 0 | 0.34 | 2020 |
| Requirements for Explainable Smart Systems in the Enterprises from Users and Society Based on FAT. | 0 | 0.34 | 2019 |
| Mr-Repair: Grammar Compression Based On Maximal Repeats | 0 | 0.34 | 2019 |
| On the size of the smallest alphabet for Lyndon trees | 0 | 0.34 | 2019 |
| On the size of the smallest alphabet for Lyndon trees | 0 | 0.34 | 2019 |
| Online Algorithms for Constructing Linear-size Suffix Trie. | 0 | 0.34 | 2019 |
| Multi Instance Learning For Unbalanced Data. | 0 | 0.34 | 2018 |
| Truncated DAWGs and Their Application to Minimal Absent Word Problem. | 0 | 0.34 | 2018 |
| Packed Compact Tries: A Fast And Efficient Data Structure For Online String Processing | 1 | 0.36 | 2017 |
| On Reverse Engineering the Lyndon Tree. | 2 | 0.38 | 2017 |
| Linear-size CDAWG: new repetition-aware indexing and grammar compression. | 5 | 0.44 | 2017 |
| Packed Compact Tries: A Fast And Efficient Data Structure For Online String Processing | 1 | 0.35 | 2016 |
| Fully-online Construction of Suffix Trees for Multiple Texts. | 0 | 0.34 | 2016 |
| Fully-online construction of suffix trees and DAWGs for multiple texts | 0 | 0.34 | 2015 |
| Enumeration of complete set of flock patterns in trajectories | 1 | 0.35 | 2014 |
