Recognizing Union-Find Trees Built Up Using Union-By-Rank Strategy is NP-Complete. - Kitti Gelle; Szabolcs Iván (DCFS, 2017)

Regular Expressions for Muller Context-Free Languages. - Kitti Gelle; Szabolcs Iván (Acta Cybern., 2017)

Basin Hopping Networks of continuous global optimization problems. - Tamás Vinkó; Kitti Gelle (Central Eur. J. Oper. Res., 2017)

Reversible languages having finitely many reduced automata. - Kitti Gelle; Szabolcs Iván (AFL, 2017)

DFS is Unsparsable and Lookahead Can Help in Maximal Matching. - Kitti Gelle; Szabolcs Iván (Acta Cybern., 2018)

Maintaning maximal matching with lookahead. - Kitti Gelle; Szabolcs Iván (CoRR, 2018)

Recognizing Union-Find trees is NP-complete. - Kitti Gelle; Szabolcs Iván (Inf. Process. Lett., 2018)

The Syntactic Complexity of Semi-flower Languages. - Kitti Gelle; Szabolcs Iván (DCFS, 2019)

On the Order Type of Scattered Context-Free Orderings. - Kitti Gelle; Szabolcs Iván (GandALF, 2019)

Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info. - Kitti Gelle; Szabolcs Iván (Int. J. Found. Comput. Sci., 2019)

The ordinal generated by an ordinal grammar is computable. - Kitti Gelle; Szabolcs Iván (Theor. Comput. Sci., 2019)

The Order Type of Scattered Context-Free Orderings of Rank One Is Computable. - Kitti Gelle; Szabolcs Iván (SOFSEM, 2020)

Scattered one-counter languges have rank less than ω2. - Kitti Gelle; Szabolcs Iván (CoRR, 2020)

Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata. - Kitti Gelle; Szabolcs Iván (Int. J. Found. Comput. Sci., 2022)