Publications

_________________________________________________________

Conference papers

2023

• Joel D. Day, Vijay Ganesh, Nathan Grewal, Florin Manea (2023): On the Expressive Power of String Constraints, Proc. ACM Program. Lang., vol. 7(POPL), pg. 278-308


• Duncan Adamson, Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer (2023): Longest Common Subsequence with Gap Constraints, WORDS 2023, pg. 60-76


• Duncan Adamson, Pamela Fleischmann, Annika Huch, Tore Koß, Florin Manea, Dirk Nowotka (2023): k-Universality of Regular Languages, ISAAC 2023, pg. 4:1-4:21


• Pamela Fleischmann, Sungmin Kim, Tore Koß, Florin Manea, Dirk Nowotka, Stefan Siemer, Max Wiedenhöft (2023): Matching Patterns with Variables Under Simon's Congruence, RP 2023, pg. 155-170


• Pawel Gawrychowski, Maria Kosche, Florin Manea (2023): On the Number of Factors in the LZ-End Factorization, SPIRE 2023, pg. 253-259

2022

• Joel D. Day, Maria Kosche, Florin Manea, Markus L. Schmid (2022): Subsequences with Gap Constraints: Complexity Bounds for Matching and Analysis Problems, ISAAC 2022, pg. 64:1-64:18


• Maria Kosche, Tore Koß, Florin Manea, Viktoriya Pak (2022): Subsequences in Bounded Ranges: Matching and Analysis Problems, RP 2022, pg. 140-159


• Pawel Gawrychowski, Florin Manea, Stefan Siemer (2022): Matching Patterns with Variables Under Edit Distance, SPIRE 2022, pg. 275-289


• Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer (2022): Combinatorial Algorithms for Subsequence Matching: A Survey, NCMA 2022, pg. 11-27

2021

• M. Kosche, T. Koß, F. Manea, S. Siemer (2021): Absent Subsequences in Words, Proc. RP 2021, LNCS.


• P. Gawrychowski, F. Manea, S. Siemer (2021): Matching Patterns with Variables under Hamming Distance, Proc. MFCS 2021, LIPIcs.


• Murphy Berzish, Mitja Kulczynski, Federico Mora, Florin Manea, Joel Day, Dirk Nowotka and Vijay Ganesh (2021): An SMT Solver for Regular Expressions and Linear Arithmetic over String Length, Proc. CAV 2021, LNCS.


• Murphy Berzish, Mitja Kulczynski, Federico Mora, Florin Manea, Joel Day, Dirk Nowotka and Vijay Ganesh (2021): String Theories involving Regular Membership Predicates: From Practice to Theory and Back, Proc. WORDS 2021, LNCS.


• Sebastian Berndt, Kilian Grage, Klaus Jansen, Lukas Johannsen and Maria Kosche (2021): Robust Online Algorithms for Dynamic Choosing Problems, Proc. CiE 2021, LNCS.


• J. Day, P. Fleischmann, M. Kosche, T. Koß, F. Manea, S. Siemer (2021): The Edit Distance to k-Subsequence Universality, Proc. STACS 2021, LIPIcs.


• P. Gawrychowski, M. Kosche, T. Koß, F. Manea, S. Siemer (2021): Efficiently Testing Simon's Congruence, Proc. STACS 2021, LIPIcs.


• P. Fleischmann, L. Haschke, F. Manea, D. Nowotka, C. Tsatia Tsida, J. Wiedenbeck (2021): Blocksequences of k-local Words, Proc. SOFSEM 2021 - Track Foundations of Computer Science, LNCS.

2020

• J. Day, F. Manea (2020): On the structure of solution sets to regular word equations, Proc. ICALP 2020 - Track B, LIPIcs.


• M. Kulczynski, F. Manea, D. Nowotka, D. B. Poulsen (2020): The Power of String Solving: Simplicity of Comparison, Proc. AST@ICSE 2020.


• J. Day, M. Kulczynski, F. Manea, D. Nowotka, D. B. Poulsen (2020): Rule-based Word Equation Solving, Proc. FORMALISE@ICSE 2020.


• P. Fleischmann, M. Lejeune, F. Manea, D. Nowotka, M. Rigo (2020): Reconstructing Words from Right-Bounded-Block Words, Proc. DLT 2020, Lecture Notes in Computer Science.


• L. Barker, P. Fleischmann, K. Harwardt, F. Manea, D. Nowotka (2020): Scattered Factor-Universality of Words, Proc. DLT 2020, Lecture Notes in Computer Science.

Journal papers

2023

• Joel D. Day, Vijay Ganesh, Florin Manea (2023): Formal Languages via Theories over Strings: An Overview of Some Recent Results, J Bull. EATCS, vol. 140(4)


• Mitja Kulczynski, Florin Manea, Dirk Nowotka, Danny Bøgsted Poulsen (2023): ZaligVinder: A generic test framework for string solvers, J. Softw. Evol. Process., vol. 35(4)


• Murphy Berzish, Joel D. Day, Vijay Ganesh, Mitja Kulczynski, Florin Manea, Federico Mora, Dirk Nowotka (2023): Towards more efficient methods for solving regular-expression heavy string constraints, Theor. Comput. Sci. 943, pg. 50-72

2022

• Pawel Gawrychowski, Florin Manea, Radoslaw Serafin (2022): Fast and Longest Rollercoasters, Algorithmica, vol. 84(4), pg. 1081-1106


• Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer (2022): Absent Subsequences in Words, Fundam. Informaticae, vol 189(3-4), pg. 199-240

2021

• Florin Manea (2021): On Turing Machines Deciding According to the Shortest Computations, Axioms, vol. 10( 4), pg. 304


• P. Gawrychowski, F. Manea, R. Serafin (2021): Fast and Longest Rollercoasters, Algorithmica, to appear.


• M. Kulczynski, F. Manea, D. Nowotka, D. B. Poulsen (2021): ZaligVinder: A Generic Test Framework for String Solvers, Journal of Software: Evolution and Process, to appear.


• J. Day, F. Manea (2021): On the Structure of Solution-Sets to Regular Word Equations, Theory of Computing Systems, to appear.


• P. Fleischmann, M. Lejeune, F. Manea, D. Nowotka, M. Rigo (2021): Reconstructing Words from Right-Bounded-Block Words, International Journal of Foundations of Computer Science, vol. 32 (6), pg. 619–640, World Scientific.

2020

• J. D. Day, P. Fleischmann, F. Manea, D. Nowotka (2020): Equations Enforcing Repetitions under Permutations, Discrete Applied Mathematics, vol. 285, pg. 61-78, Elsevier.


• H. Fernau, F. Manea, R. Mercas, M.Schmid (2020): Pattern Matching with Variables: Efficient Algorithms and Complexity Results, ACM Transactions on Computation Theory, vol. 12 (1), pg. 1-37, ACM.