Marie-Louise Bruner
Vienna University of Technology
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Marie-Louise Bruner.
Algorithmica | 2016
Marie-Louise Bruner; Martin Lackner
The NP-complete Permutation Pattern Matching problem asks whether a k-permutation P is contained in a n-permutation T as a pattern. This is the case if there exists an order-preserving embedding of P into T. In this paper, we present a fixed-parameter algorithm solving this problem with a worst-case runtime of
scandinavian workshop on algorithm theory | 2012
Marie-Louise Bruner; Martin Lackner
arXiv: Computational Complexity | 2013
Marie-Louise Bruner; Martin Lackner
{\mathcal O}(1.79^{\mathsf {run}(T)}\cdot n\cdot k)
arXiv: Combinatorics | 2013
Marie-Louise Bruner
arXiv: Combinatorics | 2015
Marie-Louise Bruner
O(1.79run(T)·n·k), where
arXiv: Combinatorics | 2015
Marie-Louise Bruner; Alois Panholzer
arXiv: Computational Complexity | 2011
Marie-Louise Bruner; Martin Lackner
\mathsf {run}(T)
arXiv: Combinatorics | 2015
Miklós Bóna; Marie-Louise Bruner
arXiv: Combinatorics | 2015
Marie-Louise Bruner; Alois Panholzer
run(T) denotes the number of alternating runs of T. This algorithm is particularly well-suited for instances where T has few runs, i.e., few ups and downs. Moreover, since
national conference on artificial intelligence | 2014
Marie-Louise Bruner; Martin Lackner
