Solving 3CNF-SAT and HPP in Linear Time Using WWW. - Florin Manea; Carlos Martín-Vide; Victor Mitrana (MCU, 2004)

Accepting Networks of Splicing Processors. - Florin Manea; Carlos Martín-Vide; Victor Mitrana (CiE, 2005)

Timed Accepting Hybrid Networks of Evolutionary Processors. - Florin Manea (IWINAC (2), 2005)

A Universal Accepting Hybrid Network of Evolutionary Processors. - Florin Manea; Carlos Martín-Vide; Victor Mitrana (DCM@ICALP, 2005)

Parsing Local Internal Contextual Languages with Context-Free Choice. - Radu Gramatovici; Florin Manea (Fundam. Informaticae, 2005)

All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size. - Florin Manea; Carlos Martín-Vide; Victor Mitrana (DNA, 2006)

Synchronized Shuffle on Backbones. - Florin Manea; Victor Mitrana; Daniel-Claudian Voinescu (Fundam. Informaticae, 2006)

An efficient approach for the rank aggregation problem. - Liviu Petrisor Dinu; Florin Manea (Theor. Comput. Sci., 2006)

Hairpin Completion Versus Hairpin Reduction. - Florin Manea; Victor Mitrana (CiE, 2007)

On the syllabification of words via go-through automata. - Liviu Petrisor Dinu; Radu Gramatovici; Florin Manea (LATA, 2007)

Accepting Networks of Splicing Processors with Filtered Connections. - Juan Castellanos; Florin Manea; Luis Fernando de Mingo López; Victor Mitrana (MCU, 2007)

A Generalization of the Assignment Problem, and its Application to the Rank Aggregation Problem. - Florin Manea; Calina Ploscaru (Fundam. Informaticae, 2007)

On the recognition of context-free languages using accepting hybrid networks of evolutionary processors. - Florin Manea (Int. J. Comput. Math., 2007)

All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size. - Florin Manea; Victor Mitrana (Inf. Process. Lett., 2007)

Accepting Networks of Evolutionary Processors with Filtered Connections. - Cezara Dragoi; Florin Manea; Victor Mitrana (J. Univers. Comput. Sci., 2007)

On the size complexity of universal accepting hybrid networks of evolutionary processors. - Florin Manea; Carlos Martín-Vide; Victor Mitrana (Math. Struct. Comput. Sci., 2007)

Freeness of partial words. - Florin Manea; Robert Mercas (Theor. Comput. Sci., 2007)

Accepting networks of splicing processors: Complexity results. - Florin Manea; Carlos Martín-Vide; Victor Mitrana (Theor. Comput. Sci., 2007)

Erratum to: "Accepting networks of splicing processors: Complexity results" [Theoret. Comput. Sci. 371(2007) 72-82]. - Florin Manea; Carlos Martín-Vide; Victor Mitrana (Theor. Comput. Sci., 2007)

On the Descriptional Complexity of Accepting Networks of Evolutionary Processors with Filtered Connections. - Cezara Dragoi; Florin Manea (Int. J. Found. Comput. Sci., 2008)

Some Remarks on Superposition Based on Watson-Crick-Like Complementarity. - Florin Manea; Victor Mitrana; José M. Sempere (Developments in Language Theory, 2009)

Filter Position in Networks of Evolutionary Processors Does Not Matter: A Direct Proof. - Paolo Bottoni; Anna Labella; Florin Manea; Victor Mitrana; José M. Sempere (DNA, 2009)

Combinatorial Queries and Updates on Partial Words. - Adrian Diaconu; Florin Manea; Catalin Tiseanu (FCT, 2009)

Accepting Networks of Evolutionary Processors: Complexity Aspects - Recent Results and New Challenges. - Florin Manea; Victor Mitrana (ICAART, 2009)

Networks of Evolutionary Picture Processors with Filtered Connections. - Paolo Bottoni; Anna Labella; Florin Manea; Victor Mitrana; José M. Sempere (UC, 2009)

Small Universal Accepting Networks of Evolutionary Processors with Filtered Connections - Remco Loos; Florin Manea; Victor Mitrana (DCFS, 2009)

On some algorithmic problems regarding the hairpin completion. - Florin Manea; Carlos Martín-Vide; Victor Mitrana (Discret. Appl. Math., 2009)

On small, reduced, and fast universal accepting networks of splicing processors. - Remco Loos; Florin Manea; Victor Mitrana (Theor. Comput. Sci., 2009)

Two complementary operations inspired by the DNA hairpin formation: Completion and reduction. - Florin Manea; Victor Mitrana; Takashi Yokomori (Theor. Comput. Sci., 2009)

Accepting Networks of Evolutionary Word and Picture Processors: A Survey. - Florin Manea; Carlos Martín-Vide; Victor Mitrana (Scientific Applications of Language Methods, 2010)

Hairpin Lengthening. - Florin Manea; Carlos Martín-Vide; Victor Mitrana (CiE, 2010)

Hard Counting Problems for Partial Words. - Florin Manea; Catalin Tiseanu (LATA, 2010)

Small universal accepting hybrid networks of evolutionary processors. - Remco Loos; Florin Manea; Victor Mitrana (Acta Informatica, 2010)

Accepting Hybrid Networks of Evolutionary Processors with Special Topologies and Small Communication - Jürgen Dassow; Florin Manea (DCFS, 2010)

Some Remarks on the Hairpin Completion. - Florin Manea; Victor Mitrana; Takashi Yokomori (Int. J. Found. Comput. Sci., 2010)

A New Characterization of NP, P, and PSPACE with Accepting Hybrid Networks of Evolutionary Processors. - Florin Manea; Maurice Margenstern; Victor Mitrana; Mario J. Pérez-Jiménez (Theory Comput. Syst., 2010)

A series of algorithmic results related to the iterated hairpin completion. - Florin Manea (Theor. Comput. Sci., 2010)

Context Insertions. - Paolo Bottoni; Radu Gramatovici; Anna Labella; Florin Manea; Victor Mitrana (Computation, Cooperation, and Life, 2011)

Deciding According to the Shortest Computations. - Florin Manea (CiE, 2011)

On Contextual Grammars with Subregular Selection Languages. - Jürgen Dassow; Florin Manea; Bianca Truthe (DCFS, 2011)

k-Local Internal Contextual Grammars. - Radu Gramatovici; Florin Manea (DCFS, 2011)

Deciding Networks of Evolutionary Processors. - Florin Manea (Developments in Language Theory, 2011)

Networks of Evolutionary Processors with Subregular Filters. - Jürgen Dassow; Florin Manea; Bianca Truthe (LATA, 2011)

Periodicity Algorithms for Partial Words. - Florin Manea; Robert Mercas; Catalin Tiseanu (MFCS, 2011)

On Normal Forms for Networks of Evolutionary Processors. - Jürgen Dassow; Florin Manea; Bianca Truthe (UC, 2011)

Bounded hairpin completion. - Masami Ito; Peter Leupold; Florin Manea; Victor Mitrana (Inf. Comput., 2011)

Complexity-preserving simulations among three variants of accepting networks of evolutionary processors. - Paolo Bottoni; Anna Labella; Florin Manea; Victor Mitrana; Ion Petre; José M. Sempere (Nat. Comput., 2011)

Hairpin Lengthening and Shortening of Regular Languages. - Florin Manea; Robert Mercas; Victor Mitrana (Languages Alive, 2012)

Connecting Partial Words and Regular Languages. - Jürgen Dassow; Florin Manea; Robert Mercas (CiE, 2012)

On Internal Contextual Grammars with Subregular Selection Languages. - Florin Manea; Bianca Truthe (DCFS, 2012)

The Avoidability of Cubes under Permutations. - Florin Manea; Mike Müller; Dirk Nowotka (Developments in Language Theory, 2012)

Fine and Wilf's Theorem and Pseudo-repetitions. - Florin Manea; Robert Mercas; Dirk Nowotka (MFCS, 2012)

String Matching with Involutions. - Cristian Grozea; Florin Manea; Mike Müller; Dirk Nowotka (UCNC, 2012)

Generating Networks of Splicing Processors. - Jürgen Dassow; Florin Manea; Bianca Truthe (RAIRO Theor. Informatics Appl., 2012)

On Subregular Selection Languages in Internal Contextual Grammars. - Jürgen Dassow; Florin Manea; Bianca Truthe (J. Autom. Lang. Comb., 2012)

Networks of evolutionary processors: computationally complete normal forms. - Jürgen Dassow; Florin Manea; Bianca Truthe (Nat. Comput., 2012)

On external contextual grammars with subregular selection languages. - Jürgen Dassow; Florin Manea; Bianca Truthe (Theor. Comput. Sci., 2012)

Complexity results for deciding Networks of Evolutionary Processors. - Florin Manea (Theor. Comput. Sci., 2012)

Language classes generated by tree controlled grammars with bounded nonterminal complexity. - Sherzod Turaev; Jürgen Dassow; Florin Manea; Mohd Hasan Selamat (Theor. Comput. Sci., 2012)

Discovering Hidden Repetitions in Words. - Pawel Gawrychowski; Florin Manea; Dirk Nowotka (CiE, 2013)

On the Pseudoperiodic Extension of u^l = v^m w^n. - Florin Manea; Mike Müller; Dirk Nowotka (FSTTCS, 2013)

Finding Pseudo-repetitions. - Pawel Gawrychowski; Florin Manea; Robert Mercas; Dirk Nowotka; Catalin Tiseanu (STACS, 2013)

Networks of evolutionary processors: the power of subregular filters. - Jürgen Dassow; Florin Manea; Bianca Truthe (Acta Informatica, 2013)

The hardness of counting full words compatible with partial words. - Florin Manea; Catalin Tiseanu (J. Comput. Syst. Sci., 2013)

Two Variants of Synchronized Shuffle on Backbones. - Henning Bordihn; Florin Manea; Victor Mitrana; Daniel-Claudian Voinescu (Discrete Mathematics and Computer Science, 2014)

Generalised Lyndon-Schützenberger Equations. - Florin Manea; Mike Müller; Dirk Nowotka; Shinnosuke Seki 001 (MFCS (1), 2014)

A Stronger Square Conjecture on Binary Words. - Natasa Jonoska; Florin Manea; Shinnosuke Seki 001 (SOFSEM, 2014)

Testing Generalised Freeness of Words. - Pawel Gawrychowski; Florin Manea; Dirk Nowotka (STACS, 2014)

Bounded Prefix-Suffix Duplication. - Marius Dumitran; Javier Gil; Florin Manea; Victor Mitrana (CIAA, 2014)

An algorithmic toolbox for periodic partial words. - Florin Manea; Robert Mercas; Catalin Tiseanu (Discret. Appl. Math., 2014)

Syllabic Languages and Go-through Automata. - Liviu P. Dinu; Radu Gramatovici; Florin Manea (Fundam. Informaticae, 2014)

The pseudopalindromic completion of regular languages. - Szilárd Zsolt Fazekas; Florin Manea; Robert Mercas; Kayoko Shikishima-Tsuji (Inf. Comput., 2014)

Inner Palindromic Closure. - Jürgen Dassow; Florin Manea; Robert Mercas; Mike Müller (Int. J. Found. Comput. Sci., 2014)

Regular languages of partial words. - Jürgen Dassow; Florin Manea; Robert Mercas (Inf. Sci., 2014)

Prefix-suffix duplication. - Jesús García-López; Florin Manea; Victor Mitrana (J. Comput. Syst. Sci., 2014)

Accepting Networks of Evolutionary Processors with Subregular Filters. - Florin Manea; Bianca Truthe (Theory Comput. Syst., 2014)

Prefix-Suffix Square Completion. - Marius Dumitran; Florin Manea (WORDS, 2015)

Square-Density Increasing Mappings. - Florin Manea; Shinnosuke Seki 001 (WORDS, 2015)

Unary Patterns with Permutations. - James D. Currie; Florin Manea; Dirk Nowotka (DLT, 2015)

Longest α-Gapped Repeat and Palindrome. - Pawel Gawrychowski; Florin Manea (FCT, 2015)

Longest Gapped Repeats and Palindromes. - Marius Dumitran; Florin Manea (MFCS (1), 2015)

On Prefix/Suffix-Square Free Words. - Marius Dumitran; Florin Manea; Dirk Nowotka (SPIRE, 2015)

Pattern Matching with Variables: Fast Algorithms and New Hardness Results. - Henning Fernau; Florin Manea; Robert Mercas; Markus L. Schmid (STACS, 2015)

Testing k-binomial equivalence. - Dominik D. Freydenberger; Pawel Gawrychowski; Juhani Karhumäki; Florin Manea; Wojciech Rytter (CoRR, 2015)

Efficiently Finding All Maximal $α$-gapped Repeats. - Pawel Gawrychowski; Tomohiro I; Shunsuke Inenaga; Dominik Köppl; Florin Manea (CoRR, 2015)

On the Power of Accepting Networks of Evolutionary Processors with Special Topologies and Random Context Filters. - Jürgen Dassow; Florin Manea; Bianca Truthe (Fundam. Informaticae, 2015)

Bounded Prefix-Suffix Duplication: Language Theoretic and Algorithmic Results. - Marius Dumitran; Javier Gil; Florin Manea; Victor Mitrana (Int. J. Found. Comput. Sci., 2015)

Cubic patterns with permutations. - Florin Manea; Mike Müller; Dirk Nowotka (J. Comput. Syst. Sci., 2015)

k-Abelian pattern matching. - Thorsten Ehlers; Florin Manea; Robert Mercas; Dirk Nowotka (J. Discrete Algorithms, 2015)

Hairpin lengthening: language theoretic and algorithmic results. - Florin Manea; Carlos Martín-Vide; Victor Mitrana (J. Log. Comput., 2015)

Factorizing a String into Squares in Linear Time. - Yoshiaki Matsuoka; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda; Florin Manea (CPM, 2016)

On the Solvability Problem for Restricted Classes of Word Equations. - Florin Manea; Dirk Nowotka; Markus L. Schmid (DLT, 2016)

Efficiently Finding All Maximal alpha-gapped Repeats. - Pawel Gawrychowski; Tomohiro I; Shunsuke Inenaga; Dominik Köppl; Florin Manea (STACS, 2016)

Detecting Unary Patterns. - Dmitry Kosolobov; Florin Manea; Dirk Nowotka (CoRR, 2016)

Local Patterns. - Joel D. Day; Pamela Fleischmann; Florin Manea; Dirk Nowotka (FSTTCS, 2017)

The Hardness of Solving Simple Word Equations. - Joel D. Day; Florin Manea; Dirk Nowotka (MFCS, 2017)

Detecting One-Variable Patterns. - Dmitry Kosolobov; Florin Manea; Dirk Nowotka (SPIRE, 2017)

Longest Gapped Repeats and Palindromes. - Marius Dumitran; Pawel Gawrychowski; Florin Manea (Discret. Math. Theor. Comput. Sci., 2017)

Preface. - Cezar Câmpeanu; Florin Manea; Giovanni Pighizzini; Jeffrey O. Shallit (J. Autom. Lang. Comb., 2017)

The extended equation of Lyndon and Schützenberger. - Florin Manea; Mike Müller; Dirk Nowotka; Shinnosuke Seki 001 (J. Comput. Syst. Sci., 2017)

TCS Special Issue: Combinatorics on Words - WORDS 2015. - Florin Manea; Dirk Nowotka (Theor. Comput. Sci., 2017)

TCS Special Issue on Languages and Combinatorics in Theory and Nature. - Florin Manea; Bianca Truthe; György Vaszil (Theor. Comput. Sci., 2017)

On Matching Generalised Repetitive Patterns. - Joel D. Day; Pamela Fleischmann; Florin Manea; Dirk Nowotka; Markus L. Schmid (DLT, 2018)

Rollercoasters and Caterpillars. - Therese Biedl; Ahmad Biniaz; Robert Cummings; Anna Lubiw; Florin Manea; Dirk Nowotka; Jeffrey O. Shallit (ICALP, 2018)

The Satisfiability of Word Equations: Decidable and Undecidable Theories. - Joel D. Day; Vijay Ganesh 001; Paul He; Florin Manea; Dirk Nowotka (RP, 2018)

The Satisfiability of Extended Word Equations: The Boundary Between Decidability and Undecidability. - Joel D. Day; Vijay Ganesh 001; Paul He; Florin Manea; Dirk Nowotka (CoRR, 2018)

On the Complexity of Solving Restricted Word Equations. - Florin Manea; Dirk Nowotka; Markus L. Schmid (Int. J. Found. Comput. Sci., 2018)

Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes - Finding All Maximal α-gapped Repeats and Palindromes in Optimal Worst Case Time on Integer Alphabets. - Pawel Gawrychowski; Tomohiro I; Shunsuke Inenaga; Dominik Köppl; Florin Manea (Theory Comput. Syst., 2018)

Unary patterns under permutations. - James D. Currie; Florin Manea; Dirk Nowotka; Kamellia Reshadi (Theor. Comput. Sci., 2018)

Revisiting Shinohara's algorithm for computing descriptive patterns. - Henning Fernau; Florin Manea; Robert Mercas; Markus L. Schmid (Theor. Comput. Sci., 2018)

Matching Patterns with Variables. - Florin Manea; Markus L. Schmid (WORDS, 2019)

k-Spectra of Weakly-c-Balanced Words. - Joel D. Day; Pamela Fleischmann; Florin Manea; Dirk Nowotka (DLT, 2019)

Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number. - Katrin Casel; Joel D. Day; Pamela Fleischmann; Tomasz Kociumaka; Florin Manea; Markus L. Schmid (ICALP, 2019)

Upper Bounds on the Length of Minimal Solutions to Certain Quadratic Word Equations. - Joel D. Day; Florin Manea; Dirk Nowotka (MFCS, 2019)

On Solving Word Equations Using SAT. - Joel D. Day; Thorsten Ehlers; Mitja Kulczynski; Florin Manea; Dirk Nowotka; Danny Bøgsted Poulsen (RP, 2019)

k-Spectra of c-Balanced Words. - Joel D. Day; Pamela Fleischmann; Florin Manea; Dirk Nowotka (CoRR, 2019)

On Modelling the Avoidability of Patterns as CSP. - Thorsten Ehlers; Florin Manea; Dirk Nowotka; Kamellia Reshadi (CoRR, 2019)

Hide and seek with repetitions. - Pawel Gawrychowski; Florin Manea; Robert Mercas; Dirk Nowotka (J. Comput. Syst. Sci., 2019)

Rollercoasters: Long Sequences without Short Runs. - Therese Biedl; Ahmad Biniaz; Robert Cummings; Anna Lubiw; Florin Manea; Dirk Nowotka; Jeffrey O. Shallit (SIAM J. Discret. Math., 2019)

Scattered Factor-Universality of Words. - Laura Barker; Pamela Fleischmann; Katharina Harwardt; Florin Manea; Dirk Nowotka (DLT, 2020)

Rule-based Word Equation Solving. - Joel D. Day; Mitja Kulczynski; Florin Manea; Dirk Nowotka; Danny Bøgsted Poulsen (FormaliSE@ICSE, 2020)

The Power of String Solving: Simplicity of Comparison. - Mitja Kulczynski; Florin Manea; Dirk Nowotka; Danny Bøgsted Poulsen (AST@ICSE, 2020)

The Edit Distance to k-Subsequence Universality. - Pamela Fleischmann; Maria Kosche; Tore Koß; Florin Manea; Stefan Siemer (CoRR, 2020)

A Length-aware Regular Expression SMT Solver. - Murphy Berzish; Mitja Kulczynski; Federico Mora 002; Florin Manea; Joel D. Day; Dirk Nowotka; Vijay Ganesh 001 (CoRR, 2020)

Equations enforcing repetitions under permutations. - Joel D. Day; Pamela Fleischmann; Florin Manea; Dirk Nowotka (Discret. Appl. Math., 2020)

Preface - Special Issue: A Collection of Papers in Honour of the 60th Birthday of Victor Mitrana. - Erzsébet Csuhaj-Varjú; Florin Manea (Int. J. Found. Comput. Sci., 2020)

Pattern Matching with Variables: Efficient Algorithms and Complexity Results. - Henning Fernau; Florin Manea; Robert Mercas; Markus L. Schmid (ACM Trans. Comput. Theory, 2020)

An SMT Solver for Regular Expressions and Linear Arithmetic over String Length. - Murphy Berzish; Mitja Kulczynski; Federico Mora 002; Florin Manea; Joel D. Day; Dirk Nowotka; Vijay Ganesh 001 (CAV (2), 2021)

String Theories Involving Regular Membership Predicates: From Practice to Theory and Back. - Murphy Berzish; Joel D. Day; Vijay Ganesh 001; Mitja Kulczynski; Florin Manea; Federico Mora 002; Dirk Nowotka (WORDS, 2021)

Matching Patterns with Variables Under Hamming Distance. - Pawel Gawrychowski; Florin Manea; Stefan Siemer (MFCS, 2021)

Blocksequences of k-local Words. - Pamela Fleischmann; Lukas Haschke; Florin Manea; Dirk Nowotka; Cedric Tsatia Tsida; Judith Wiedenbeck (SOFSEM, 2021)

Efficiently Testing Simon's Congruence. - Pawel Gawrychowski; Maria Kosche; Tore Koß; Florin Manea; Stefan Siemer (STACS, 2021)

On Turing Machines Deciding According to the Shortest Computations. - Florin Manea (Axioms, 2021)

Reconstructing Words from Right-Bounded-Block Words. - Pamela Fleischmann; Marie Lejeune; Florin Manea; Dirk Nowotka; Michel Rigo (Int. J. Found. Comput. Sci., 2021)

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

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

Matching Patterns with Variables Under Edit Distance. - Pawel Gawrychowski; Florin Manea; Stefan Siemer (SPIRE, 2022)

Fast and Longest Rollercoasters. - Pawel Gawrychowski; Florin Manea; Radoslaw Serafin (Algorithmica, 2022)

Formal Languages via Theories over Strings. - Joel D. Day; Vijay Ganesh 001; Nathan Grewal; Florin Manea (CoRR, 2022)

A Generic Information Extraction System for String Constraints. - Joel D. Day; Adrian Kröger; Mitja Kulczynski; Florin Manea; Dirk Nowotka; Danny Bøgsted Poulsen (CoRR, 2022)

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

Absent Subsequences in Words. - Maria Kosche; Tore Koß; Florin Manea; Stefan Siemer (Fundam. Informaticae, 2022)

Preface and Greeting Messages. - Florin Manea; Bianca Truthe (J. Autom. Lang. Comb., 2022)

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

k-Universality of Regular Languages. - Duncan Adamson; Pamela Fleischmann; Annika Huch; Tore Koß; Florin Manea; Dirk Nowotka (ISAAC, 2023)

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

On the Number of Factors in the LZ-End Factorization. - Pawel Gawrychowski; Maria Kosche; Florin Manea (SPIRE, 2023)

Formal Languages via Theories over Strings: An Overview of Some Recent Results. - Joel D. Day; Vijay Ganesh 001; Florin Manea (Bull. EATCS, 2023)

Towards more efficient methods for solving regular-expression heavy string constraints. - Murphy Berzish; Joel D. Day; Vijay Ganesh 001; Mitja Kulczynski; Florin Manea; Federico Mora 002; Dirk Nowotka (Theor. Comput. Sci., 2023)

On the Expressive Power of String Constraints. - Joel D. Day; Vijay Ganesh 001; Nathan Grewal; Florin Manea (Proc. ACM Program. Lang., 2023)

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

Subsequences with Generalised Gap Constraints: Upper and Lower Complexity Bounds. - Florin Manea; Jonas Richardsen; Markus L. Schmid (CPM, 2024)

Layered and Staged Monte Carlo Tree Search for SMT Strategy Synthesis. - Zhengyang Lu 002; Stefan Siemer; Piyush Jha; Joel D. Day; Florin Manea; Vijay Ganesh 001 (IJCAI, 2024)

Subsequence Matching and Analysis Problems for Formal Languages. - Szilárd Zsolt Fazekas; Tore Koß; Florin Manea; Robert Mercas; Timo Specht (ISAAC, 2024)

Enumerating m-Length Walks in Directed Graphs with Constant Delay. - Duncan Adamson; Pawel Gawrychowski; Florin Manea (LATIN (1), 2024)

SMTQuery: Analysing SMT-LIB String Benchmarks. - Mitja Kulczynski; Kevin Lotz; Florin Manea; Danny Bøgsted Poulsen; Paul Sarnighausen-Cahn (SBMF, 2024)

Semënov Arithmetic, Affine {VASS}, and String Constraints. - Andrei Draghici; Christoph Haase; Florin Manea (STACS, 2024)

A Closer Look at the Expressive Power of Logics Based on Word Equations. - Joel D. Day; Vijay Ganesh 001; Nathan Grewal; Matthew Konefal; Florin Manea (Theory Comput. Syst., 2024)

On the structure of solution-sets to regular word equations. - Joel D. Day; Florin Manea (Theory Comput. Syst., 2024)

Revisiting Weighted Information Extraction: A Simpler and Faster Algorithm for Ranked Enumeration. - Pawel Gawrychowski; Florin Manea; Markus L. Schmid (Proc. ACM Manag. Data, 2024)

On the Decidability and Expressive Power of Several Theories Based on String Constraints. - Justus Greve-Kramer; Tore Koß; Florin Manea; Timo Specht (DCFS, 2025)

k-Universality of Regular Languages Revisited. - Duncan Adamson; Pamela Fleischmann; Annika Huch; Tore Koß; Florin Manea (IJTCS-FAW, 2025)

Linear Time Subsequence and Supersequence Regex Matching. - Antoine Amarilli; Florin Manea; Tina Ringleb; Markus L. Schmid (MFCS, 2025)

Subsequence Matching and Analysis Problems for Automata with Translucent Letters. - Szilárd Zsolt Fazekas; Béla Klein; Tore Koß; Florin Manea; Robert Mercas; Timo Specht (CIAA, 2025)

The edit distance to k-subsequence universality. - Joel D. Day; Pamela Fleischmann; Maria Kosche; Tore Koß; Florin Manea; Stefan Siemer (J. Comput. Syst. Sci., 2025)

k-Universality of Regular Languages Revisited. - Duncan Adamson; Pamela Fleischmann; Annika Huch; Tore Koß; Florin Manea (CoRR, 2025)

Efficiently Finding All Minimal and Shortest Absent Subsequences in a String. - Florin Manea; Tina Ringleb; Stefan Siemer; Maximilian Winkler (CoRR, 2025)

Longest Common Subsequence with Gap Constraints. - Duncan Adamson; Paul Sarnighausen-Cahn; Marius Dumitran; Maria Kosche; Tore Koß; Florin Manea; Stefan Siemer (Theory Comput. Syst., 2025)

Novel tree-search method for synthesizing SMT strategies. - Zhengyang John Lu; Joel D. Day; Piyush Jha; Paul Sarnighausen-Cahn; Stefan Siemer; Florin Manea; Vijay Ganesh 001 (Acta Informatica, 2025)