Florin Manea
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
73
Venues
22
Active years
2004–2026
Best venue rank
A*
Where they publish
Papers
73 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | CiE | Self-assembly of Strings and Languages Revisited: Efficient Membership Algorithms. | Katalin Anna Lzr, Florin Manea, Stefan Siemer, Timo Specht |
| 2026 | CiE | Efficiently Finding All Shortest Absent Subsequences in a String. | Florin Manea, Tina Ringleb, Stefan Siemer, Maximilian Winkler |
| 2026 | CP | Learning Unified Graph and Language Representations for SMT Algorithm Selection. | Zhengyang Lu, Paul Sarnighausen-Cahn, Jiahao Chen, Arie Gurfinkel, Florin Manea, Vijay Ganesh |
| 2026 | CPM | Optimal Structure for Prefix-Substring Queries. | Pawel Gawrychowski, Florin Manea, Jonas Richardsen |
| 2026 | DLT | Self-assembly of Strings and Languages Revisited: Efficiently Deciding Closure Under Self-assembly. | Katalin Anna Lzr, Florin Manea, Stefan Siemer, Timo Specht |
| 2025 | FAW | k-Universality of Regular Languages Revisited. | Duncan Adamson, Pamela Fleischmann, Annika Huch, Tore Ko, Florin Manea |
| 2025 | FCT | Tight Bounds for the Number of Absent Subsequences. | Duncan Adamson, Pamela Fleischmann, Annika Huch, Florin Manea, Paul Sarnighausen-Cahn, Max Wiedenhft |
| 2025 | MFCS | Linear Time Subsequence and Supersequence Regex Matching. | Antoine Amarilli, Florin Manea, Tina Ringleb, Markus L. Schmid |
| 2024 | CPM | Subsequences with Generalised Gap Constraints: Upper and Lower Complexity Bounds. | Florin Manea, Jonas Richardsen, Markus L. Schmid |
| 2024 | IJCAI | Layered and Staged Monte Carlo Tree Search for SMT Strategy Synthesis. | Zhengyang Lu, Stefan Siemer, Piyush Jha, Joel D. Day, Florin Manea, Vijay Ganesh |
| 2024 | ISAAC | Subsequence Matching and Analysis Problems for Formal Languages. | Szilrd Zsolt Fazekas, Tore Ko, Florin Manea, Robert Mercas, Timo Specht |
| 2024 | LATIN | Enumerating m-Length Walks in Directed Graphs with Constant Delay. | Duncan Adamson, Pawel Gawrychowski, Florin Manea |
| 2024 | STACS | Semnov Arithmetic, Affine {VASS}, and String Constraints. | Andrei Draghici, Christoph Haase, Florin Manea |
| 2023 | ISAAC | k-Universality of Regular Languages. | Duncan Adamson, Pamela Fleischmann, Annika Huch, Tore Ko, Florin Manea, Dirk Nowotka |
| 2023 | SPIRE | On the Number of Factors in the LZ-End Factorization. | Pawel Gawrychowski, Maria Kosche, Florin Manea |
| 2022 | ISAAC | Subsequences with Gap Constraints: Complexity Bounds for Matching and Analysis Problems. | Joel D. Day, Maria Kosche, Florin Manea, Markus L. Schmid |
| 2022 | SPIRE | Matching Patterns with Variables Under Edit Distance. | Pawel Gawrychowski, Florin Manea, Stefan Siemer |
| 2021 | CAV | An SMT Solver for Regular Expressions and Linear Arithmetic over String Length. | Murphy Berzish, Mitja Kulczynski, Federico Mora, Florin Manea, Joel D. Day, Dirk Nowotka, Vijay Ganesh |
| 2021 | MFCS | Matching Patterns with Variables Under Hamming Distance. | Pawel Gawrychowski, Florin Manea, Stefan Siemer |
| 2021 | STACS | The Edit Distance to k-Subsequence Universality. | Joel D. Day, Pamela Fleischmann, Maria Kosche, Tore Ko, Florin Manea, Stefan Siemer |
| 2021 | STACS | Efficiently Testing Simon's Congruence. | Pawel Gawrychowski, Maria Kosche, Tore Ko, Florin Manea, Stefan Siemer |
| 2021 | SOFSEM | Blocksequences of k-local Words. | Pamela Fleischmann, Lukas Haschke, Florin Manea, Dirk Nowotka, Cedric Tsatia Tsida, Judith Wiedenbeck |
| 2020 | DLT | Scattered Factor-Universality of Words. | Laura Barker, Pamela Fleischmann, Katharina Harwardt, Florin Manea, Dirk Nowotka |
| 2020 | DLT | Reconstructing Words from Right-Bounded-Block Words. | Pamela Fleischmann, Marie Lejeune, Florin Manea, Dirk Nowotka, Michel Rigo |
| 2020 | ICALP | On the Structure of Solution Sets to Regular Word Equations. | Joel D. Day, Florin Manea |
| 2020 | ICSE | Rule-based Word Equation Solving. | Joel D. Day, Mitja Kulczynski, Florin Manea, Dirk Nowotka, Danny Bgsted Poulsen |
| 2020 | ICSE | The Power of String Solving: Simplicity of Comparison. | Mitja Kulczynski, Florin Manea, Dirk Nowotka, Danny Bgsted Poulsen |
| 2019 | DLT | k-Spectra of Weakly-c-Balanced Words. | Joel D. Day, Pamela Fleischmann, Florin Manea, Dirk Nowotka |
| 2019 | ICALP | 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 |
| 2019 | MFCS | Upper Bounds on the Length of Minimal Solutions to Certain Quadratic Word Equations. | Joel D. Day, Florin Manea, Dirk Nowotka |
| 2019 | STACS | Fast and Longest Rollercoasters. | Pawel Gawrychowski, Florin Manea, Radoslaw Serafin |
| 2018 | DLT | On Matching Generalised Repetitive Patterns. | Joel D. Day, Pamela Fleischmann, Florin Manea, Dirk Nowotka, Markus L. Schmid |
| 2018 | ICALP | Rollercoasters and Caterpillars. | Therese Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, Jeffrey O. Shallit |
| 2017 | MFCS | The Hardness of Solving Simple Word Equations. | Joel D. Day, Florin Manea, Dirk Nowotka |
| 2017 | SPIRE | Detecting One-Variable Patterns. | Dmitry Kosolobov, Florin Manea, Dirk Nowotka |
| 2016 | CPM | Factorizing a String into Squares in Linear Time. | Yoshiaki Matsuoka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Florin Manea |
| 2016 | DLT | On the Solvability Problem for Restricted Classes of Word Equations. | Florin Manea, Dirk Nowotka, Markus L. Schmid |
| 2016 | STACS | Efficiently Finding All Maximal alpha-gapped Repeats. | Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Kppl, Florin Manea |
| 2015 | DLT | Unary Patterns with Permutations. | James D. Currie, Florin Manea, Dirk Nowotka |
| 2015 | FCT | Longest α-Gapped Repeat and Palindrome. | Pawel Gawrychowski, Florin Manea |
| 2015 | MFCS | Longest Gapped Repeats and Palindromes. | Marius Dumitran, Florin Manea |
| 2015 | STACS | Pattern Matching with Variables: Fast Algorithms and New Hardness Results. | Henning Fernau, Florin Manea, Robert Mercas, Markus L. Schmid |
| 2015 | SPIRE | On Prefix/Suffix-Square Free Words. | Marius Dumitran, Florin Manea, Dirk Nowotka |
| 2014 | DLT | k-Abelian Pattern Matching. | Thorsten Ehlers, Florin Manea, Robert Mercas, Dirk Nowotka |
| 2014 | MFCS | Generalised Lyndon-Schtzenberger Equations. | Florin Manea, Mike Mller, Dirk Nowotka, Shinnosuke Seki |
| 2014 | STACS | Testing Generalised Freeness of Words. | Pawel Gawrychowski, Florin Manea, Dirk Nowotka |
| 2014 | SOFSEM | A Stronger Square Conjecture on Binary Words. | Natasa Jonoska, Florin Manea, Shinnosuke Seki |
| 2013 | CiE | Discovering Hidden Repetitions in Words. | Pawel Gawrychowski, Florin Manea, Dirk Nowotka |
| 2013 | DLT | Inner Palindromic Closure. | Jrgen Dassow, Florin Manea, Robert Mercas, Mike Mller |
| 2013 | STACS | Finding Pseudo-repetitions. | Pawel Gawrychowski, Florin Manea, Robert Mercas, Dirk Nowotka, Catalin Tiseanu |
| 2012 | CiE | Connecting Partial Words and Regular Languages. | Jrgen Dassow, Florin Manea, Robert Mercas |
| 2012 | DLT | The Avoidability of Cubes under Permutations. | Florin Manea, Mike Mller, Dirk Nowotka |
| 2012 | MFCS | Fine and Wilf's Theorem and Pseudo-repetitions. | Florin Manea, Robert Mercas, Dirk Nowotka |
| 2012 | UC | String Matching with Involutions. | Cristian Grozea, Florin Manea, Mike Mller, Dirk Nowotka |
| 2011 | CiE | Deciding According to the Shortest Computations. | Florin Manea |
| 2011 | DLT | Deciding Networks of Evolutionary Processors. | Florin Manea |
| 2011 | LATA | Networks of Evolutionary Processors with Subregular Filters. | Jrgen Dassow, Florin Manea, Bianca Truthe |
| 2011 | MFCS | Periodicity Algorithms for Partial Words. | Florin Manea, Robert Mercas, Catalin Tiseanu |
| 2011 | UC | On Normal Forms for Networks of Evolutionary Processors. | Jrgen Dassow, Florin Manea, Bianca Truthe |
| 2010 | CiE | Hairpin Lengthening. | Florin Manea, Carlos Martn-Vide, Victor Mitrana |
| 2010 | LATA | Hard Counting Problems for Partial Words. | Florin Manea, Catalin Tiseanu |
| 2009 | DLT | Some Remarks on Superposition Based on Watson-Crick-Like Complementarity. | Florin Manea, Victor Mitrana, Jos M. Sempere |
| 2009 | DNA | Filter Position in Networks of Evolutionary Processors Does Not Matter: A Direct Proof. | Paolo Bottoni, Anna Labella, Florin Manea, Victor Mitrana, Jos M. Sempere |
| 2009 | FCT | Combinatorial Queries and Updates on Partial Words. | Adrian Diaconu, Florin Manea, Catalin Tiseanu |
| 2009 | ICAART | Accepting Networks of Evolutionary Processors: Complexity Aspects - Recent Results and New Challenges. | Florin Manea, Victor Mitrana |
| 2009 | UC | Networks of Evolutionary Picture Processors with Filtered Connections. | Paolo Bottoni, Anna Labella, Florin Manea, Victor Mitrana, Jos M. Sempere |
| 2007 | CiE | Hairpin Completion Versus Hairpin Reduction. | Florin Manea, Victor Mitrana |
| 2007 | LATA | On the syllabification of words via go-through automata. | Liviu Petrisor Dinu, Radu Gramatovici, Florin Manea |
| 2007 | MCU | Accepting Networks of Splicing Processors with Filtered Connections. | Juan Castellanos, Florin Manea, Luis Fernando de Mingo Lpez, Victor Mitrana |
| 2006 | DNA | All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size. | Florin Manea, Carlos Martn-Vide, Victor Mitrana |
| 2005 | CiE | Accepting Networks of Splicing Processors. | Florin Manea, Carlos Martn-Vide, Victor Mitrana |
| 2005 | IWINAC | Timed Accepting Hybrid Networks of Evolutionary Processors. | Florin Manea |
| 2004 | MCU | Solving 3CNF-SAT and HPP in Linear Time Using WWW. | Florin Manea, Carlos Martn-Vide, Victor Mitrana |