| 2015 | FedCSIS | A new algorithm for the determinisation of visibly pushdown automata. | Radomr Polch, Jan Travnicek, Jan Janousek, Borivoj Melichar |
| 2015 | LATA | Backward Linearised Tree Pattern Matching. | Jan Trvncek, Jan Janousek, Borivoj Melichar, Loek G. Cleophas |
| 2011 | FedCSIS | Tree Indexing by Pushdown Automata and Repeats of Subtrees. | Toms Flouri, Jan Janousek, Borivoj Melichar, Costas S. Iliopoulos, Solon P. Pissis |
| 2011 | FedCSIS | Subtree Oracle Pushdown Automata for Ranked and Unranked Ordered Trees. | Martin Plicka, Jan Janousek, Borivoj Melichar |
| 2011 | FedCSIS | Nonlinear Tree Pattern Pushdown Automata. | Jan Travnicek, Jan Janousek, Borivoj Melichar |
| 2011 | SPIRE | Computing All Subtree Repeats in Ordered Ranked Trees. | Michalis Christou, Maxime Crochemore, Toms Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis |
| 2010 | LATA | Arbology: Trees and Pushdown Automata. | Borivoj Melichar |
| 2010 | SAC | Aho-Corasick like multiple subtree matching by pushdown automata. | Toms Flouri, Borivoj Melichar, Jan Janousek |
| 2007 | LATA | Weighted Degenerated Approximate Pattern Matching. | Costas S. Iliopoulos, Inuka Jayasekera, Borivoj Melichar, Jan Supol |
| 2007 | SOFSEM | Formal Translation Directed by Parallel | Ladislav Vagner, Borivoj Melichar |
| 2006 | ICTAC | A New Approach to Determinisation Using Bit-Parallelism. | Jan Supol, Borivoj Melichar |
| 1997 | SOFSEM | The Output-Store Formal Translator Directed by LR Parsing. | Jan Janousek, Borivoj Melichar |
| 1996 | ICPR | String matching with k differences by finite automata. | Borivoj Melichar |
| 1995 | CAIP | Approximate String Matching by Finite Automata. | Borivoj Melichar |
| 1992 | CC | Syntax Directed Translation with LR Parsing. | Borivoj Melichar |