Marie-Louise Lackner

activity

20152025

most citedThe Complexity of Pattern Matching for

321

-Avoiding and Skew-Merged Permutations

6 citations · 10 across the 6 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2015

Longest increasing subsequences and log concavity

Miklós Bóna, Marie-Louise Lackner, Bruce Sagan

Let $π$ be a permutation of $[n] = {1, \dots, n}$ and denote by $ℓ (π)$ the length of a longest increasing subsequence of $π$ . Let $ℓ_{n, k}$ be the number of permutations $π$ of…

math.CO2015★ 6 cited

The Complexity of Pattern Matching for $321$ -Avoiding and Skew-Merged Permutations

Michael H. Albert, Marie-Louise Lackner, Martin Lackner +1

The Permutation Pattern Matching problem, asking whether a pattern permutation $π$ is contained in a permutation $τ$ , is known to be NP-complete. In this paper we present two polyn…

math.CO2015★ 2 cited

Runs in labelled trees and mappings

Marie-Louise Lackner, Alois Panholzer

We generalize the concept of ascending and descending runs from permutations to rooted labelled trees and mappings, i.e., functions from the set ${1, \dots, n}$ into itself. A co…

Longest increasing subsequences and log concavity

The Complexity of Pattern Matching for 321-Avoiding and Skew-Merged Permutations

Runs in labelled trees and mappings

The Complexity of Pattern Matching for $321$ -Avoiding and Skew-Merged Permutations