Conference Papers

81.

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

80.

M. Berzish, J. D. Day, V. Ganesh, M. Kulczynski, F. Manea, F. Mora, D. Nowotka (2021): An SMT Solver for Regular Expressions and Linear Arithmetic over String Length, Proc. CAV 2021, LNCS, to appear.

79.

M. Berzish, J. D. Day, V. Ganesh, M. Kulczynski, F. Manea, F. Mora, D. Nowotka (2021): String Theories involving Regular Membership Predicates: From Practice to Theory and Back, Proc. WORDS 2021, LNCS, to appear.

78.

P. Gawrychowski, M. Kosche, T. Koss, F. Manea, S. Siemer (2021): Efficiently Testing Simon's Congruence, Proc. STACS 2021, LIPIcs, vol. 187, pg. 34:1-34:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

77.

J. Day, P. Fleischmann, M. Kosche, T. Koss, F. Manea, S. Siemer (2021): The Edit Distance to k-Subsequence Universality, Proc. STACS 2021, LIPIcs, vol. 187, pg. 25:1-25:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

76.

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 (ARCOSS), vol. 12607, pg. 119-134, Springer.

75.

J. Day, F. Manea (2020): On the structure of solution sets to regular word equations, Proc. ICALP 2020 - Track B, LIPIcs, vol. 168, pg. 124:1-124:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

74.

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

73.

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

72.

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,, vol. 12086, pg. 96--109, Springer.

71.

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

70.

J. Day, T. Ehlers, M. Kulczynski, F. Manea, D. Nowotka, D. B. Poulsen (2019): On Solving Word Equations Using SAT, Proc. RP 2019, Lecture Notes in Computer Science, vol. 11674, pg. 93-106, Springer.

69.

F. Manea, M. L. Schmid (2019): Matching Patterns with Variables, Proc. WORDS 2019, Lecture Notes in Computer Science, vol. 11682, pg. 1-27, Springer. (Invited Paper)

68.

J. Day, F. Manea, D. Nowotka (2019): Upper Bounds on the Length of Minimal Solutions to Certain Quadratic Word Equations, Proc. MFCS 2019, LIPIcs, vol. 138, pg. 44:1-44:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

67.

J. Day, P. Fleischmann, F. Manea, D. Nowotka (2019): k-Spectra of weakly-c-Balanced Words, Proc. DLT 2019, Lecture Notes in Computer Science, vol. 11647, pg. 265-277, Springer.

66.

K. Casel, J. Day, P. Fleischmann, T. Kociumaka, F. Manea, Markus L. Schmid (2019): Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number, Proc. ICALP 2019 - Track B, LIPIcs, vol. 132, pg. 109:1-109:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

65.

P. Gawrychowski, F. Manea, R. Serafin (2019): Fast and Longest Rollercoasters, Proc. STACS 2019, LIPIcs, vol. 126, pg. 30:1-30:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

64.

J. Day, V. Ganesh, P. He, F. Manea, D. Nowotka (2018): The Satisfiability of Word Equations: Decidable and Undecidable Theories, Proc. RP 2018, Lecture Notes in Computer Science 11123, pg. 15-29, Springer.

63.

J. Day, P. Fleischmann, F. Manea, D. Nowotka, M. L. Schmid (2018): On Matching Repetitive Patterns, Proc. DLT 2018, Lecture Notes in Computer Science 11088, pg. 269-281, Springer.

62.

T. Biedl, A. Biniaz, R. Cummings, A. Lubiw, F. Manea, D. Nowotka, J. Shallit (2018): Rollercoasters and Caterpillars, Proc. ICALP 2018 - Track A, LIPIcs, vol. 107, pg. 18:1–18:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

61.

J. Day, P. Fleischmann, F. Manea, D. Nowotka (2017): Local Patterns, Proc. FSTTCS 2017, LIPIcs, vol. 93, pg. 21:1–24:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

60.

J. Day, F. Manea, D. Nowotka (2017): The Hardness of Solving Simple Word Equations, MFCS 2017, LIPIcs, vol. 83, pg. 18:1–18:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

59.

D. Kosolobov, F. Manea, D. Nowotka (2017): Detecting One-Variable Patterns, Proc. SPIRE 2017, Lecture Notes in Computer Science 10508, pg. 254–270, Springer.

58.

J. Day, P. Fleischmann, F. Manea, D. Nowotka (2017): Equations Enforcing Repetitions under Permutations, Proc. WORDS 2017, Lecture Notes in Computer Science 10432, pg. 72–84, Springer.

57.

F. Manea, D. Nowotka, M. L. Schmid (2016): On the Solvability Problem for Restricted Classes of Word Equations, Proc. DLT 2016, Lecture Notes in Computer Science 9840, pg. 306–318, Springer.

56.

Y. Matsuoka, S. Inenaga, H. Bannai, M. Takeda, F. Manea (2016): Factorizing a string into squares in linear time, Proc. CPM 2016, LIPIcs, vol. 54, pg. 27:1–27:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

55.

P. Gawrychowski, T. I, S. Inenaga, D. Köppl, F. Manea (2016): Efficiently Finding All Maximal α-gapped Repeats, Proc. STACS 2016, LIPIcs, vol. 47, pg. 39:1–39:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

54.

P. Gawrychowski, F. Manea (2015): Longest α-gapped Repeat and Palindrome, Proc. FCT 2015, Lecture Notes in Computer Science 9210, pg. 27–40, Springer.

53.

M. Dumitran, F. Manea, D. Nowotka (2015): On Prefix/Suffix-Square Free Words, Proc. SPIRE 2015, Lecture Notes in Computer Science 9309, pg. 54–66, Springer.

52.

M. Dumitran, F. Manea (2015): Longest Gapped Repeats and Palindromes, Proc. MFCS 2015, Lecture Notes in Computer Science 9234, pg. 205–217, Springer.

51.

F. Manea, S. Seki (2015): Square-density Increasing Mappings, Proc. WORDS 2015, Lecture Notes in Computer Science 9304, pg. 147–159, Springer.

50.

M. Dumitran, F. Manea (2015): Prefix-Suffix Square Completion, Proc. WORDS 2015, Lecture Notes in Computer Science 9304, pg. 160–169, Springer.

49.

J. Currie, F. Manea, D. Nowotka (2015): Unary Patterns under Permutations, Proc. DLT 2015, Lecture Notes in Computer Science 9168, pg. 191–202, Springer.

48.

H. Fernau, F. Manea, R. Mercas, M. L. Schmid (2015): Pattern Matching with Variables: Fast Algorithms and New Hardness Results, Proc. STACS 2015, LIPIcs, vol. 30, pg. 302–315, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

47.

H. Bordihn, F. Manea, V. Mitrana, D. C. Voinescu (2014): Two Variants of Synchronized Shuffle on Backbones, Discrete Mathematics and Computer Science 2014: In Memoriam Alexandru Mateescu, pg. 77-87, The Publishing House of the Romanian Academy.

46.

P. Gawrychowski, F. Manea, D. Nowotka (2014): Testing Generalised Freeness of Words, Proc. STACS 2014, LIPIcs 25, pg. 337–349, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

45.

F. Manea, M. Müller, D. Nowotka, S. Seki (2014): Generalised Lyndon-Schützenberger Equations, Proc. MFCS 2014, Lecture Notes in Computer Science 8634 (ARCoSS subline), pg. 402–413, Springer.

44.

T. Ehlers, F. Manea, R. Mercas, D. Nowotka (2014): k-Abelian Pattern Matching, Proc. DLT 2014, Lecture Notes in Computer Science 8633, pg. 178–190, Springer.

43.

M. Dumitran, J. Gil, F. Manea, V. Mitrana (2014): Bounded Duplication Languages, Proc. CIAA 2014, Lecture Notes in Computer Science 8587, pg. 176–187, Springer.

42.

N. Jonoska, F. Manea, S. Seki (2014): A Stronger Square Conjecture on Binary Words. Proc. SOFSEM 2014, , Lecture Notes in Computer Science 8327, pg. 339–350, Springer.

41.

F. Manea, M. Müller, D. Nowotka (2013): On the Pseudoperiodic Extension of u^l = v^mwⁿ, Proc. FSTTCS 2013, LIPIcs, 24, pg. 475–486, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

40.

P. Gawrychowski, F. Manea, R. Mercas, D. Nowotka, C. Tiseanu (2013): Finding pseudo-repetitions, Proc. STACS 2013, LIPIcs 20, pg. 257–268, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

39.

P. Gawrychowski, F. Manea, D. Nowotka (2013): Discovering Hidden Repetitions in Words, Proc. CiE 2013, Lecture Notes in Computer Science 7921, pg. 210–219, Springer.

38.

J. Dassow, F. Manea, R. Mercas, M. Müller (2013): Inner Palindromic Closure, DLT 2013, Lecture Notes in Computer Science 7907, pg. 155–166, Springer.

37.

F. Manea, R. Mercas, D. Nowotka (2012): Fine and Wilf Theorem and Pseudo-repetitions, Proc. MFCS 2012, Lecture Notes in Computer Science 7464, pg. 668–680, Springer.

36.

C. Grozea, F. Manea, M. Müller, D. Nowotka (2012): String Matching with Involutions, Proc. UCNC 2012, Lecture Notes in Computer Science, 7445, pg. 108 – 119, Springer.

35.

F. Manea, B. Truthe (2012): On Internal Contextual Grammars with Subregular Selection Languages, Proc. DCFS 2012, Lecture Notes in Computer Science 7386, pg. 222-235, Springer.

34.

F. Manea, M. Müller, D. Nowotka (2012): The Avoidability of Cubes under Permutations, Proc. DLT 2012, Lecture Notes in Computer Science 7410, pg. 416-427, Springer.

33.

F. Manea, R. Mercas, V. Mitrana (2012): Hairpin Lengthening and Shortening of Regular Languages., Dassow Festschrift, Lecture Notes in Computer Science 7300, pg. 145–159, Springer.

32.

J. Dassow, F. Manea, R. Mercas (2012): Connecting Partial Words and Regular Languages, Proc. CiE 2012, Lecture Notes in Computer Science 7318, pg. 151-161, Springer.

31.

F. Manea, R. Mercas, C. Tiseanu (2011): Periodicity Algorithms for Partial Words, Proc. MFCS 2011, Lecture Notes in Computer Science 6907, pg. 472-484, Springer.

30.

J. Dassow, F. Manea, B. Truthe (2011): On Normal Forms for Networks of Evolutionary Processors, Proc. UC 2011, Lecture Notes in Computer Science 6714, pg. 89-100, Springer.

29.

J. Dassow, F. Manea, B. Truthe (2011): On Contextual Grammars with Subregular Selection Languages, Proc. DCFS 2011, Lecture Notes in Computer Science 6808, pg. 135-146, Springer.

28.

R. Gramatovici, F. Manea (2011): k-Local Internal Contextual Grammars, Proc. DCFS 2011, Lecture Notes in Computer Science 6808, pg. 172-183, Springer.

27.

J. Dassow, F. Manea, B. Truthe (2011): Networks of Evolutionary Processors with Subregular Filters, Proc. LATA 2011, Lecture Notes in Computer Science 6638, pg. 262-273, Springer.

26.

F. Manea, B. Truthe (2011): Accepting Networks of Evolutionary Processors with Subregular Filters, Proc. AFL 2011, pg. 300–314, Institute of Mathematics and Informatics of Nyregyhza College, Debrecen, Hungary.

25.

J. Dassow, F. Manea, B. Truthe (2011): Generating Networks of Evolutionary Processors, Proc. NCMA 2011, books@ocg.at 282, pg. 121-136, Österreichische Computer Gesellschaft.

24.

F. Manea (2011): Deciding Networks of Evolutionary Processors, Proc. DLT 2011, Lecture Notes in Computer Science 6795, pg. 337-349, Springer.

23.

F. Manea (2011): Deciding according to the shortest computations, Proc. CiE 2011, Lecture Notes in Computer Science 6735, pg. 191–200, Springer.

22.

P. Bottoni, R. Gramatovici, A. Labella, F. Manea, V. Mitrana (2011): Context Insertions, Paun Festschrift, Lecture Notes in Computer Science 6610, pg. 24–34, Springer.

21.

J. Dassow, F. Manea (2010): Accepting Hybrid Networks of Evolutionary Processors with Special Topologies and Small Communication, Proc. DCFS 2010, Electronic Proceedings in Theoretical Computer Science 31, pg. 68–77.

20.

F. Manea, C. Martin-Vide, V. Mitrana (2010): Hairpin Lengthening, Proc. CiE 2010, Lecture Notes in Computer Science 6158, pg. 296–306, Springer.

19.

F. Manea, C. Tiseanu (2010): Hard Counting Problems for Partial Words, Proc. LATA 2010, Lecture Notes in Computer Science 6031, pg. 426–438, Springer.

18.

A. Diaconu, F. Manea, C. Tiseanu (2009): Combinatorial Queries and Updates on Partial Words, Proc. FCT 2009, Lecture Notes in Computer Science 5699, pg. 96–108, Springer.

17.

P. Bottoni, A. Labella, F. Manea, V. Mitrana, J. Sempere (2009): Networks of Evolutionary Picture Processors With Filtered Connections, Proc. UC 2009, Lecture Notes in Computer Science 5715, pg. 70–84, Springer.

16.

P. Bottoni, A. Labella, F. Manea, V. Mitrana, J. Sempere (2009): Filter Position in Networks of Evolutionary Processors Does Not Matter: A Direct Proof, Proc. DNA 2009, Lecture Notes in Computer Science 5877, pg. 1–11, Springer.

15.

F. Manea, V. Mitrana, J. Sempere (2009): Some Remarks on Superposition Based on Watson-Crick-like Complementarity, Proc. DLT 2009, Lecture Notes in Computer Science 5583, pg. 372–383, Springer.

14.

R. Loos, F. Manea, V. Mitrana (2009): Small Universal Accepting Networks of Evolutionary Processors with Filtered Connections, Proc. DCFS 2009, Electronic Proceedings in Theoretical Computer Science 3, pg. 173–182.

13.

F. Manea, V. Mitrana (2009): Accepting Networks of Evolutionary Processors: Complexity Aspects. Recent Results and New Challenges, Proc. ICAART 2009, pg. 597–604, INSTICC Press.

12.

F. Manea, V. Mitrana, T. Yokomori (2008): Some Remarks on the Hairpin Completion, Proc. AFL 2008, pg. 302–313, Computer and Automation Research Institute of the Hungarian Academy of Sciences, Hungary.

11.

L. Dinu, R. Gramatovici, F. Manea (2007): On the syllabification of words via go-through automata, Proc. LATA 2007, pg. 223–235, Univ. Rovira i Virgili, Tarragona, Spain.

10.

F. Manea, V. Mitrana (2007): Hairpin Completion Versus Hairpin Reduction, Proc. CiE 2007, Lecture Notes in Computer Science 4497, pg. 532–541, Springer.

9.

J. Castellanos, F. Manea, L. F. de Mingo Lopez, Victor Mitrana (2007): Accepting Networks of Splicing Processors With Filtered Connections, Proc. MCU 2007, Lecture Notes in Computer Science 4664, pg. 218–229, Springer.

8.

F. Manea, C. Martin-Vide, V. Mitrana (2006): All NP-Problems Can Be Solved in Polynomial Time by ANSP of Constant Size, Proc. DNA 2006, Lecture Notes in Computer Science 4287, pg. 47–57, Springer.

7.

F. Manea, C. Martin-Vide, V. Mitrana (2006): A universal AHNEP, Proc. DCM 2006 - Workshop of ICALP, Electronic Notes in Theoretical Computer Science Vol. 135, no. 3, pg. 95–105 , Elsevier.

6.

F. Manea, C. Martin-Vide, V. Mitrana (2005): Accepting Networks of Splicing Processors, Proc. CiE 2005, Lecture Notes in Computer Science 3526, pg. 300–309, Springer.

5.

F. Manea (2005): Timed Accepting Hybrid Networks of Evolutionary Processors, Proc. IWINAC 2005, Lecture Notes in Computer Science 3562, pg. 122–132, Springer.

4.

R. Gramatovici, F. Manea (2005): A CYK-based parser for Local Internal Contextual Grammars with Context-Free choice, Proc. AFL 2005, 122-130, Institute of Informatics, University of Szeged, Hungary.

3.

F. Manea, C. Martin-Vide, V. Mitrana (2005): Solving 3CNF-SAT and HPP in Linear Time Using WWW, Proc. MCU 2004, Lecture Notes in Computer Science 3354, pg. 269–280, Springer.

2.

F. Manea, Using AHNEPs in the Recognition of Context Free Languages, Proc. ECAI-2004 Workshop on Symbolic Networks, W05 at ECAI-2004, 15 pg, University of Valencia, Spain.

1.

F. Manea (2003): Contextual Grammars and Go Through Automata, Proc. ESSLLI 2003 Student Session, pg. 159–168, Technical University Vienna.