Papers, Talks

Here you can find a list of the papers I co-authored. Last update: June 2017.

2016
107. "The Hardness of Solving Simple Word Equations", (co-authors: J. Day, D. Nowotka), to appear in MFCS 2017, LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
106. "Equations Enforcing Repetitions under Permutations", (co-authors: J. Day, P. Fleischmann, D. Nowotka), to appear in WORDS 2017, Lecture Notes in Computer Science, Springer.
105. "Longest Gapped Repeats and Palindromes", (co-authors: M. Dumitran, P. Gawrychowski), to appear in Discrete Mathematics & Theoretical Computer Science.
104. "Tighter Bounds and Optimal Algorithms for all Maximal α-gapped Repeats and Palindromes", (co-authors: P. Gawrychowski, T. I, S. Inenaga, D. Köppl), to appear in Theory of Computing Systems, Springer.
103. "The extended equation of Lyndon and Schützenberger", (co-authors: M. Müller, D. Nowotka, S. Seki), Journal of Computer and System Sciences, vol. 85, pg. 132--167, Elsevier.
102. "Revisiting Shinohara's Algorithm for Computing Descriptive Patterns", (co-authors: H. Fernau, R. Mercas, M. L. Schmid), to appear in Theoretical Computer Science, Elsevier.

2016
101. "On the Solvability Problem for Restricted Classes of Word Equations", (co-authors: D. Nowotka, M. L. Schmid), DLT 2016, Lecture Notes in Computer Science 9840, pg. 306--318, Springer.
100. "Factorizing a string into squares in linear time", (co-authors: Y. Matsuoka, S. Inenaga, H. Bannai, M. Takeda), CPM 2016, LIPIcs 54, pg. 27:1--27:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
99. "Efficiently Finding All Maximal α-gapped Repeats", (co-authors: P. Gawrychowski, T. I, S. Inenaga, D. Köppl), STACS 2016, LIPIcs 47, pg. 39:1--39:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

2015
98. "Longest Gapped Repeats and Palindromes", (co-author: M. Dumitran), MFCS 2015, Lecture Notes in Computer Science 9234, pg. 205--217, Springer.
97. "Longest α-gapped Repeat and Palindrome", (co-author: P. Gawrychowski), FCT 2015, Lecture Notes in Computer Science 9210, pg. 27--40, Springer.
96. "On Prefix/Suffix-Square Free Words", (co-authors: M. Dumitran, D. Nowotka), SPIRE 2015, Lecture Notes in Computer Science 9309, pg. 54--66, Springer.
95. "Square-density Increasing Mappings", (co-author: S. Seki), WORDS 2015, Lecture Notes in Computer Science 9304, pg. 147--159, Springer.
94. "Prefix-Suffix Square Completion", (co-author: M. Dumitran), WORDS 2015, Lecture Notes in Computer Science 9304, pg. 160--169, Springer.
93. "Unary Patterns under Permutations", (co-authors: J. Currie, D. Nowotka), DLT 2015, Lecture Notes in Computer Science 9168, pg. 191--202, Springer.
92. "Pattern Matching with Variables: Fast Algorithms and New Hardness Results", (co-authors: H. Fernau, R. Mercas, M. L. Schmid), STACS 2015, LIPIcs 30, pg. 302--315, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
91. "Bounded Duplication Languages: Language Theoretic and Algorithmic Results", (co-authors: M. Dumitran, J. Gil, V. Mitrana), International Journal of Foundations of Computer Science, vol. 26, no. 7, pg. 933-952, World Scientific.
90. "Cubic Patterns with Permutations", (co-authors: M. Müller, D. Nowotka), Journal of Computer and System Sciences, vol. 81, pg. 1298--1310, Elsevier.
89. "k-Abelian Pattern Matching", (co-authors: T. Ehlers, R. Mercas, D. Nowotka), Journal of Discrete Algorithms, vol. 34, pg. 37--48, Elsevier.
88. "On the Power of Accepting Networks of Evolutionary Processors with Special Topologies and Random Context Filters", (co-authors: J. Dassow, B. Turthe), Fundamenta Informaticae, vol. 136, no. 1-2, pg. 1--35, IOS Press.
87. "Hairpin Lengthening: Language Theoretic and Algorithmic Results", (co-authors: C. Martin-Vide, V. Mitrana), Journal of Logic and Computation, vol. 25(4), pg. 987-1009, Oxford University Press.

2014
86. "Generalised Lyndon-Schützenberger Equations", (co-authors: M. Müller, D. Nowotka, S. Seki), MFCS 2014, Lecture Notes in Computer Science 8634 (ARCoSS subline), pg. 402--413, Springer.
85. "k-Abelian Pattern Matching", (co-authors: T. Ehlers, R. Mercas, D. Nowotka), DLT 2014, Lecture Notes in Computer Science 8633, pg. 178--190, Springer.
84. "Bounded Duplication Languages", (co-authors: M. Dumitran, J. Gil, V. Mitrana), CIAA 2014, Lecture Notes in Computer Science 8587, pg. 176--187, Springer.
83. "Testing Generalised Freeness of Words", (co-authors: P. Gawrychowski, D. Nowotka), STACS 2014, LIPIcs 25, pg. 337--349, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
82. "Stronger Square Conjecture on Binary Words", (co-authors: N. Jonoska, S. Seki), SOFSEM 2014, Lecture Notes in Computer Science 8327, pg. 339--350, Springer.
81. "Inner Palindromic Closure", (co-authors: J. Dassow, R. Mercas, M. Müller), International Journal of Foundations of Computer Science, vol. 25(8), pg. 1049--1064, World Scientific.
80. "Two Variants of Synchronized Shuffle on Backbones" (co-authors: H. Bordihn, V. Mitrana, D. C. Voinescu) Discrete Mathematics and Computer Science 2014: In Memoriam Alexandru Mateescu, pg. 77-87, The Publishing House of the Romanian Academy.
79. "An Algorithmic Toolbox for Periodic Partial Words", (co-authors: R. Mercas, C. Tiseanu), Discrete Applied Mathematics, vol. 179, pg. 174--192, Elsevier.
78. "The Pseudopalindromic Completion of Regular Languages", (co-authors: S. Fazekas, R. Mercas, K. Shikishima-Tsuji), Information and Computation, vol. 239, pg. 222--236, Elsevier.
77. "Prefix-Suffix Duplication", (co-authors: J. García López, V. Mitrana), Journal of Computer and System Sciences, vol. 80, no. 7, pg. 1254--1265, Elsevier.
76. "Accepting Networks of Evolutionary Processors with Subregular Filters", (co-author: B. Turthe), Theory of Computing Systems, vol. 55, no. 1, pg. 84--109, Springer.
75. "Regular Languages of Partial Words", (co-authors: J. Dassow, R. Mercas), Information Sciences, vol. 268, pg. 290--304, Elsevier.
74. "Syllabic languages and go-through automata", (co-authors: L.P. Dinu, R. Gramatovici), Fundamenta Informaticae, vol. 131, no. 3-4, pg. 409--424, IOS Press.

2013
73. "On the Pseudoperiodic Extension of ul = vmwn (Extended Abstract)", (co-authors: M. Müller, D. Nowotka), FSTTCS 2013, LIPIcs 24, pg. 475--486, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
72. "Discovering Hidden Repetitions in Words", (co-authors: P. Gawrychowski, D. Nowotka), CiE 2013, Lecture Notes in Computer Science 7921, pg. 210--219, Springer.
71. "Inner Palindromic Closure", (co-authors: J. Dassow, R. Mercas, M. Müller), DLT 2013, Lecture Notes in Computer Science 7907, pg. 155--166, Springer.
70. "Finding pseudo-repetitions", (co-authors: P. Gawrychowski, R. Mercas, D. Nowotka, C. Tiseanu), STACS 2013, LIPIcs 20, pg. 257--268, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
69. "The Hardness of Counting Full Words Compatible with Partial Words", (co-author: C. Tiseanu), Journal of Computer and System Sciences, vol. 79, pg. 7--22, Elsevier.
68. "Networks of evolutionary processors - The power of subregular filters", (co-authors: J. Dassow, B. Truthe), Acta Informatica, vol. 50, no. 1, pg. 41--75, Springer.

2012
67. "Fine and Wilf Theorem and Pseudo-repetitions", (co-authors: R. Mercas, D. Nowotka), MFCS 2012, Lecture Notes in Computer Science 7464 (ARCoSS subline), pg. 668--680, Springer.
66. "String Matching with Involutions", (co-authors: C. Grozea, M. Müller, D. Nowotka), UCNC 2012, Lecture Notes in Computer Science 7445, pg. 108 -- 119, Springer.
65. "On Internal Contextual Grammars with Subregular Selection Languages", (co-author: B. Truthe), DCFS 2012, Lecture Notes in Computer Science 7386, pg. 222--235, Springer.
64. "The Avoidability of Cubes under Permutations", (co-authors: M. Müller, D. Nowotka), DLT 2012, Lecture Notes in Computer Science 7410, pg. 416--427, Springer.
63. "Connecting Partial Words and Regular Languages", (co-authors: J. Dassow, R. Mercas), CiE 2012, Lecture Notes in Computer Science 7318, pg. 151--161, Springer.
62. "Hairpin Lengthening and Shortening of Regular Languages", (co-authors: R. Mercas, V. Mitrana), Dassow Festschrift, Lecture Notes in Computer Science 7300, pg. 145--159, Springer.
61. "Networks of Evolutionary Processors: Computationally Complete Normal Forms", (co-authors: J. Dassow, B. Truthe), Natural Computing, vol. 11, no. 4, pg. 595--607, Springer.
60. "Generating networks of splicing processors", (co-authors: J. Dassow, B. Truthe), RAIRO - Theoretical Informatics and Applications, vol. 46, no. 4, pg. 547--572, Cambridge University Press.
59. "Complexity Results for Deciding Networks of Evolutionary Processors", Theoretical Computer Science, vol. 456, pg. 65--79, Elsevier.
58. "On Contextual Grammars with Subregular Selection Languages", (co-authors: J. Dassow, B. Truthe), Theoretical Computer Science, vol. 449, pg. 64--73, Elsevier.
57. "Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity", (co-authors: S. Turaev, J. Dassow, M.H. Selamat), Theoretical Computer Science, vol. 449, pg. 134--144, Elsevier.
56. "On Subregular Selection Languages in Internal Contextual Grammars", (co-authors: J. Dassow, B. Truthe), Journal of Automata, Languages and Combinatorics, vol. 17, no. 2--4, pg. 145--164, Otto-von-Guericke Universitaet Magdeburg.

2011
55. "Periodicity Algorithms for Partial Words", (co-authors: R. Mercas, C. Tiseanu), MFCS 2011, Lecture Notes in Computer Science 6907 (ARCoSS subline), pg. 472--484, Springer.
54. "Deciding Networks of Evolutionary Processors", DLT 2011, Lecture Notes in Computer Science 6795, pg.337--349, Springer.
53. "Deciding according to the shortest computations", CiE 2011, Lecture Notes in Computer Science 6735, pg. 191--200, Springer.
52. "On Normal Forms for Networks of Evolutionary Processors", (co-authors: J. Dassow, B. Truthe), UC 2011, Lecture Notes in Computer Science 6714, pg. 89--100, Springer.
51. "On Contextual Grammars with Subregular Selection Languages", (co-authors: J. Dassow, B. Truthe), DCFS 2011, Lecture Notes in Computer Science 6808, pg. 135--146, Springer.
50. "k-Local Internal Contextual Grammars", (co-authors: R. Gramatovici), DCFS 2011, Lecture Notes in Computer Science 6808, pg. 172--183, Springer.
49. "Networks of Evolutionary Processors with Subregular Filters", (co-authors: J. Dassow, B. Truthe), LATA 2011, Lecture Notes in Computer Science 6638, pg. 262--273, Springer.
48. "Generating Networks of Splicing Processors", (co-authors: J. Dassow, B. Truthe), NCMA 2011, book@ocg.at series 282, pg. 121--136, Österreichische Computer Gesellschaft.
47. "Accepting Networks of Evolutionary Processors with Subregular Filters", (co-author: B. Truthe), Proc. AFL 2011, pg. 300--314, Institute of Mathematics and Informatics of Nyíregyháza College, Debrecen, Hungary.
46. "Context Insertions", (co-authors: P. Bottoni, R. Gramatovici, A. Labella, V. Mitrana), Paun Festschrift, Lecture Notes in Computer Science 6610, pg. 24--34, Springer.
45. "Bounded Hairpin Completion", (co-authors: M. Ito, P. Leupold, V. Mitrana), Information and Computation, vol. 209, no. 3, pg. 471--485, Elsevier.
44. "Complexity-Preserving Simulations Among Three Variants of Accepting Networks of Evolutionary Processors", (co-authors: P. Bottoni, A. Labella, V. Mitrana, I. Petre, J.M. Sempere), Natural Computing, vol. 10, no. 1, pg. 429--445, Springer.

2010
43. "Small Universal Accepting Networks of Evolutionary Processors with Filtered Connections", (co-authors: R. Loos, V. Mitrana), Journal of Automata, Languages and Combinatorics, vol. 15, no. 1-2, pg. 155--174, Otto-von-Guericke Universitaet Magdeburg.
42. "Accepting Networks of Evolutionary Word and Picture Processors: A Survey", (co-authors: C. Martin-Vide, V. Mitrana), chapter in Carlos Martin-Vide (ed.) "Scientific Applications of Language Methods", pg. 523--560, Imperial College Press.
41. "Accepting Hybrid Networks of Evolutionary Processors with Special Topologies and Small Communication", (co-author: J. Dassow), DCFS 2010, Electronic Proceedings in Theoretical Computer Science 31, pg. 68--77.
40. "Hairpin Lengthening", (co-author: C. Martin-Vide, V. Mitrana), CiE 2010, Lecture Notes in Computer Science 6158, pg. 296--306, Springer.
39. "Hard Counting Problems for Partial Words", (co-author: C. Tiseanu), LATA 2010, Lecture Notes in Computer Science 6031, pg. 426--438, Springer.
38. "A Series of Algorithmic Results Related to the Iterated Hairpin Completion", Theoretical Computer Science, vol. 411, no. 48, pg. 4162 –- 4178, Elsevier.
37. "Some Remarks on the Hairpin Completion", (co-authors: V. Mitrana, T. Yokomori), International Journal of Foundations of Computer Science, vol. 21, no. 5, pg. 859--872, World Scientific.
36. "A New Characterization of NP, P, and PSPACE With Accepting Hybrid Networks of Evolutionary Processors", (co-authors: M. Margenstern, V. Mitrana, M.J. Perez-Jimenez), Theory of Computing Systems, vol. 46, no. 2, pg. 174 -- 192, Springer.
35. "Small Universal Accepting Networks of Evolutionary Processors", (co-authors: R. Loos, V. Mitrana), Acta Informatica, vol. 47, no. 2, pg. 133 -- 146, Springer.

2009
34. "Combinatorial Queries and Updates on Partial Words", (co-authors: A. Diaconu, C. Tiseanu), FCT 2009, Lecture Notes in Computer Science 5699, pg. 96--108, Springer.
33. "Networks of Evolutionary Picture Processors With Filtered Connections", (co-authors: P. Bottoni, A. Labella, V. Mitrana, J. Sempere), UC 2009, Lecture Notes in Computer Science 5715, pg. 70--84, Springer.
32. "Filter Position in Networks of Evolutionary Processors Does Not Matter: A Direct Proof", (co-authors: P. Bottoni, A. Labella, V. Mitrana, J. Sempere), DNA 2009, Lecture Notes in Computer Science 5877, pg. 1--11, Springer.
31. "Some Remarks on Superposition Based on Watson-Crick-like Complementarity", (co-authors: V. Mitrana, J. Sempere), DLT 2009, Lecture Notes in Computer Science 5583, pg. 372--383, Springer.
30. "Small Universal Accepting Networks of Evolutionary Processors with Filtered Connections", (co-authors: R. Loos, V. Mitrana), DCFS 2009, Electronic Proceedings in Theoretical Computer Science 3, pg. 173--182.
29. "Accepting Networks of Evolutionary Processors: Complexity Aspects. Recent Results and New Challenges", (co-author: V. Mitrana), Proc. ICAART 2009, pg. 597 -- 604, INSTICC Press.
28. "Two complementary Operations Inspired by the DNA Hairpin Formation: Completion and Reduction", (co-authors: V. Mitrana, T. Yokomori), Theoretical Computer Science, vol. 410, no. 4-5, pg. 417 –- 425, Elsevier.
27. "On Small, Reduced and Fast Accepting Networks of Splicing Processors", (co-authors: R. Loos, V. Mitrana), Theoretical Computer Science, vol. 410, no. 4-5, pg. 406 –- 416, Elsevier.
26. "Complexity Aspects of the Recognition of Regular and Context-Free Languages by Accepting Hybrid Networks of Evolutionary Processors", (co-authors: P. Leupold, R. Loos), Romanian Journal of Information Science and Technology, Vol. 12, no. 2, pg. 219 -- 233, Romanian Academy Publishing House.
25. "On Some Algorithmic Problems Regarding the Hairpin Completion", (co-authors: C. Martin-Vide, V. Mitrana), Discrete Applied Mathematics, vol. 157, no. 9, pg. 2143 –- 2152, Elsevier.

2008
24. "Some Remarks on the Hairpin Completion", (co-authors: V. Mitrana, T. Yokomori), Proc. AFL 2008, pg. 302 -- 313, Computer and Automation Research Institute of the Hungarian Academy of Sciences, Hungary.
23. "On the Descriptional Complexity of Accepting Networks of Evolutionary Processors With Filtered Connections", (co-author: C. Dragoi), International Journal of Foundations of Computer Science, vol. 19, no. 5, pg. 1113--1132, World Scientific.

2007
22. "Accepting Networks of Evolutionary Processors With Filtered Connections", (co-authors: C. Dragoi, V. Mitrana), Journal of Universal Computer Science, vol. 13, no. 11, pg. 1598 -- 1614, Springer.
21. "Freeness of partial words", (co-author: R. Mercas), Theoretical Computer Science, Vol. 389, no.1-2, pg. 265 -- 277, Elsevier.
20. "Accepting Network of Splicing Processors: Complexity Results", (co-authors: C. Martin-Vide, V. Mitrana), Theoretical Computer Science, Vol. 371, no. 1-2, pg. 72 -- 82, Elsevier. Erratum: Theoretical Computer Science Vol. 378, no.1, pg. 131.
19. "On the Size Complexity of Universal Accepting Hybrid Networks of Evolutionary Processors", (co-authors: C. Martin-Vide, V. Mitrana), Mathematical Structures in Computer Science, Volume 17, no. 4, pg. 753 -- 771, Cambridge University Press.
18. "On the syllabification of words via go-through automata”, (co-authors: L.P. Dinu, R. Gramatovici), Proc. LATA 2007, pg. 223 -- 235, Univ. Rovira i Virgili, Tarragona, Spain.
17. "On the Recognition of Context-Free Languages Using Accepting Hybrid Networks of Evolutionary Processors", International Journal of Computer Mathematics, Vol. 84, no. 3, pg. 273 -- 285, Taylor and Francis.
16. "All NP-problems can be solved in Polynomial Time by Accepting Hybrid Networks of Evolutionary Processors of constant size " (co-author: V. Mitrana), Information Processing Letters, Vol. 103, nr. 3, pg. 112 -- 118, Elsevier.
15. "A generalization of the Assignment Problem, and its application to the Rank Aggregation Problem" (co-author: C. Ploscaru), Fundamenta Informaticae, Vol. 81, nr. 4, pg. 459 -- 471, IOS Press.
14. "Hairpin Completion Versus Hairpin Reduction" (co-author: V. Mitrana), CiE 2007, Lecture Notes in Computer Science 4497, pg. 532 -- 541, Springer.
13. "Accepting Networks of Splicing Processors With Filtered Connections" (co-authors: J. Castellanos, L. F. de Mingo Lopez, Victor Mitrana), MCU 2007, Lecture Notes in Computer Science 4664, pg. 218 -- 229, Springer.

2006
12. "All NP-Problems Can Be Solved in Polynomial Time by ANSP of Constant Size", (co-authors: C. Martin-Vide, V. Mitrana), DNA 2006, Lecture Notes in Computer Science 4287, pg. 47 -- 57, Springer.
11. "An efficient approach for the rank aggregation problem", (co-author: L.P. Dinu), Theoretical Computer Science, Vol. 359, no. 1-3, pg. 455 -- 461, Elsevier.
10. "A universal AHNEP", (co-authors: C. Martin-Vide, V. Mitrana), DCM 2006 - Workshop of ICALP, Electronic Notes in Theoretical Computer Science Vol. 135, no. 3, pg. 95 -- 105 , Elsevier.
9. "Synchronized shuffle on backbones" (co-authors: V. Mitrana, D.C. Voinescu), Fundamenta Informaticae, Vol. 73, no. 1-2, pg. 191 -- 202 , IOS Press.
8. "On Some Algorithmic Problems Regarding the Hairpin Completion (abstract)", (co-authors: C. Martin-Vide, V. Mitrana), ODSA 2006, Electronic Notes in Discrete Mathematics, Vol. 127, pg. 71 -- 72, Elsevier.

2005
7. "Accepting Networks of Splicing Processors", (co-authors: C. Martin-Vide, V. Mitrana) , CiE 2005, Lecture Notes in Computer Science 3526, pg. 300 -- 309, Springer.
6. "Timed Accepting Hybrid Networks of Evolutionary Processors", IWINAC 2005, Lecture Notes in Computer Science 3562, pg. 122 -- 132, Springer.
5. "Parsing Local Internal Contextual Languages with Context-Free Choice" (co-author: R. Gramatovici), Fundamenta Informaticae, Vol. 64, no. 1-4, pg. 171 -- 183, IOS Press.
4. "Solving a Combinatorial Problem with Network Flows" (co-author: C. Ploscaru), Journal of Applied Mathematics and Computing, Vol. 17, no. 1-2, pg. 391 -- 399, Ed. The Korean Society for Computational and Applied Mathematics/Springer.
3. "A CYK-based parser for Local Internal Contextual Grammars with Context-Free choice", (co-author: R. Gramatovici), Proc. AFL 2005, 122 -- 130, Institute of Informatics, University of Szeged, Hungary.
2. "Solving 3CNF-SAT and HPP in Linear Time Using WWW" (co-authors: C. Martin-Vide, V. Mitrana), MCU 2004, Lecture Notes in Computer Science 3354, pg. 269 -- 280, Springer.

2003
1. "Contextual Grammars and Go Through Automata", Proc. ESSLLI 2003 Student Session, Balder ten Cate, ed., Vienna, Austria, 2003, pg. 159 -- 168, Technical University Vienna.


Other articles/contributions/talks:

2015
23. "Longest Gapped Repeats and Palindromes", (Informal talk, co-author: M. Dumitran), CiE 2015.
22. "Pattern Matching with Variables: Fast Algorithms and New Hardness Results", (Informal talk, co-authors: H. Fernau, R. Mercas, M. L. Schmid), CiE 2015.
2014
21. "Finding generalised periodicities in words", (Invited talk, extension of 19 and 20), Logic Seminar, Institute of Mathematics of the Romanian Academy, Bucharest.
20. "Finding generalised periodicities in words", (Contributed talk), 67. Workshop über Algorithmen und Komplexität, Christian-Albrechts-Universität, Kiel.
19. "Pseudo-repetitions: combinatorics and stringology results", (Contributed talk), 2. Workshop "Representing Streams", Lorentz Center, Leiden.
2013
18. "Discovering hidden repetitions in words", (Contributed talk, co-authors: P. Gawrychowschi, D. Nowotka, extension of 15), Proc. 23. Theorietag der Fachgruppe "Automaten und Formale Sprachen", pg. 65--67, Technische Universität, Ilmenau.
17. "Inner palindromic closure", (Contributed talk, co-authors: J. Dassow, R. Mercas, M. Müller), Proc. 23. Theorietag der Fachgruppe "Automaten und Formale Sprachen", pg. 62--64, Technische Universität, Ilmenau.
16. "Hidden structures in words", (Invited talk), Anniversary Conference: Faculty of Sciences 150 years, University of Bucharest.
15. "Discovering hidden repetitions in words", (Contributed talk, co-authors: P. Gawrychowschi, D. Nowotka), Workshop on Challenges in Combinatorics on Words, Fields Institute, Toronto.
2012
14. "Connecting Partial Words and Regular Languages", (Abstract, contributed talk, co-authors: J. Dassow, R. Mercas), Proc. 22. Theorietag der Fachgruppe "Automaten und Formale Sprachen", pg. 45--50, Matfyz Press, Prague.
13. "Finding Pseudo-repetition", (Abstract, contributed talk, co-authors: P. Gawrychowschi, R. Mercas, D. Nowotka, C. Tiseanu), Proc. 22. Theorietag der Fachgruppe "Automaten und Formale Sprachen", pg. 57--60, Matfyz Press, Prague.
12. "Avoidability of Cubes under Morphic Permutations", (Abstract, contributed talk, co-authors: M. Müller, D. Nowotka), Proc. 22. Theorietag der Fachgruppe "Automaten und Formale Sprachen", pg. 97--102, Matfyz Press, Prague.
11. "On Internal Contextual Grammars with Subregular Selection Languages", (Abstract, contributed talk, co-author: B. Truthe), Proc. 22. Theorietag der Fachgruppe "Automaten und Formale Sprachen", pg. 103--108, Matfyz Press, Prague.
2011
10. "Turing Machines Deciding According to the Shortest Computations and Deciding Networks of Evolutionary Processors", (Abstract, invited talk), Proc. 21. Theorietag der Fachgruppe "Automaten und Formale Sprachen", pg. 11--14, Otto-von-Guericke-Universität Magdeburg.
9. "Algorithms and Pseudo-Periodicity in Words", (Abstract, contributed talk, co-authors: R. Mercas, C. Tiseanu), Proc. 21. Theorietag der Fachgruppe "Automaten und Formale Sprachen", pg. 81--84, Otto-von-Guericke-Universität Magdeburg.
8. "On Periodic Partial Words", (Abstract, contributed talk, co-authors: R. Mercas, C. Tiseanu), Proc. 21. Theorietag der Fachgruppe "Automaten und Formale Sprachen", pg. 85--88, Otto-von-Guericke-Universität Magdeburg.
7. "Netze evolutionärer Prozessoren mit subregulären Filtern", (Abstract, contributed talk, co-authors: J. Dassow, B. Truthe), Proc. 21. Theorietag der Fachgruppe "Automaten und Formale Sprachen", pg. 29--32, Otto-von-Guericke-Universität Magdeburg.
2010
6. "Algorithmic Results on Hairpin Completion and Lengthening", (Abstract, contributed talk), Proc. 20. Theorietag der Fachgruppe "Automaten und Formale Sprachen", 108--114, Universität Kassel.
5. "Two ways to construct partial words, seen from a combinatorics-on-words-perspective", (Abstract, contributed talk, co-author: Catalin Tiseanu), ODSA 2010.
2009
4. "Language-Theoretic Models of Distributed Computing A Collection of Papers in Honour of the 50th Birthday of Victor Mitrana" (co-author Gheorghe Stefanescu), Romanian Journal of Information Science and Technology, Vol. 12, No. 2, pg. 121--125, Romanian Academy Publishing House.
2008
3. "PhD Abstract: Networks of Bio-Processors", Bulletin of the EATCS, 95, pg. 293 -- 295.
2007
2. "The starting point of a journey in the world of algorithms", in "Grigore C. Moisil and His Followers in the Field of Theoretical Computer Science" (Ed. Academiei, 2007, editors Afrodita Iorgulescu, Solomon Marcus, Sergiu Rudeanu and Dragos Vaida), pg. 419--422.
2004
1. "Using AHNEPs in the Recognition of Context Free Languages", in Proceedings of "ECAI-2004 Workshop on Symbolic Networks", W05 at ECAI-2004.

Invited Speaker at workshops / conferences:

- 21. Theorietag der Fachgruppe "Automaten und Formale Sprachen", 2011.
- University of Bucharest, Anniversary Conference: Faculty of Sciences 150 years, 2013.