1 citations · 2 across the 13 of their papers we have counts for
16 papers
Jumbled Simon's Equivalence and Embeddings
Pamela Fleischmann, Annika Huch, Sungmin Kim +2
\emph{Jumbled scattered factors} are a generalisation of scattered factors (or subsequences) where a jumbled scattered factor is obtained from another word by deleting and rearrang…
Witness Languages for Pumping Lemmata
Pamela Fleischmann, Annika Huch, Christian Rauch
In 2022 Dassow and Jecker started investigations on the operational complexity of the pumping constant w.r.t.~two pumping lemmata. Since then, the research on pumping lemmata emerg…
Language-Representability: Possibilities and Limitations
Zhidan Feng, Henning Fernau, Pamela Fleischmann +2
The study of word-representability was initiated by the seminal work of Kitaev and Pyatkin in 2008 that has later led to the monograph by Kitaev and Lozin in 2015. In this paper, w…
-word--representable Graphs
Duncan Adamson, Amanita Dietz, Pamela Fleischmann +2
This paper investigates the new notion of -word--repre\-sentable graphs: the nodes of the graph correspond to the letters of the two words and there exists an edge between tw…
On Languages Describing Large Graph Classes
Henning Fernau, Pamela Fleischmann, Kevin Mann +1
In this work, we introduce a new notion for representing graph classes with formal languages. In contrast to the seminal work by Kitaev and Pyatkin to represent graphs by words, we…
(Sets of ) Complement Scattered Factors
Duncan Adamson, Pamela Fleischmann, Annika Huch
Starting in the 1970s with the fundamental work of Imre Simon, \emph{scattered factors} (also known as subsequences or scattered subwords) have remained a consistently and heavily…
Determining Factorial Speed Fast
Zhidan Feng, Henning Fernau, Pamela Fleischmann +2
The speed of a graph class measures how many labeled graphs on vertices one can find in . This graph class complexity function is explicitly provided on graphc…
Word Chain Generators for Prefix Normal Words
Duncan Adamson, Moritz Dudey, Pamela Fleischmann +1
In 2011, Fici and Lipták introduced prefix normal words. A binary word is prefix normal if it has no factor (substring) that contains more occurrences of the letter 1 than the pref…
Word-Representable Graphs and Locality of Words
Philipp Böll, Pamela Fleischmann, Annika Huch +4
In this work, we investigate the relationship between -repre\-sentable graphs and graphs representable by -local words. In particular, we show that every graph representable…
Jumbled Scattered Factors
Pamela Fleischmann, Annika Huch, Melf Kammholz +1
In this work, we combine the research on (absent) scattered factors with the one of jumbled words. For instance, is an absent scattered factor of $\mathtt{cauliflow…
-Universality of Regular Languages Revisited
Duncan Adamson, Pamela Fleischmann, Annika Huch +2
A subsequence of a word is a word such that , for some set of indices . A word is \e…
Generalized Word-Representable Graphs
Zhidan Feng, Henning Fernau, Pamela Fleischmann +2
The literature on word-representable graphs is quite rich, and a number of variations of the original definition have been proposed over the years. We are initiating a systematic s…
-local Graphs
Christian Beth, Pamela Fleischmann, Annika Huch +4
In 2017 Day et al. introduced the notion of locality as a structural complexity-measure for patterns in the field of pattern matching established by Angluin in 1980. In 2019 Casel…
Rollercoasters with Plateaus
Duncan Adamson, Pamela Fleischmann, Annika Huch
In this paper we investigate the problem of detecting, counting, and enumerating (generating) all maximum length plateau--rollercoasters appearing as a subsequence of some given…
Tight Bounds for the Number of Absent Subsequences
Duncan Adamson, Pamela Fleischmann, Annika Huch +3
A {\em subsequence} of a word is a word that can be obtained by deleting some letters from while maintaining the relative order of the remaining letters, e.g., $\mathtt…
MaxSAT with Absolute Value Functions: A Parameterized Perspective
Max Bannach, Pamela Fleischmann, Malte Skambath
The natural generalization of the Boolean satisfiability problem to optimization problems is the task of determining the maximum number of clauses that can simultaneously be satisf…