Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDMarie-Louise Bruner
Person information
- affiliation: TU Wien, Institute of Discrete Mathematics and Geometry, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j5]Marie-Louise Lackner, Alois Panholzer
:
Runs in labelled trees and mappings. Discret. Math. 343(9): 111990 (2020)- [c3]Cyril Banderier, Marie-Louise Lackner, Michael Wallner:
Latticepathology and Symmetric Functions (Extended Abstract). AofA 2020: 2:1-2:16 - [i8]Johannes Vass, Marie-Louise Lackner, Nysret Musliu:
Exact and Metaheuristic Approaches for the Production Leveling Problem. CoRR abs/2006.08731 (2020)
2010 – 2019
- 2019
- [i7]Paul Harrenstein, Marie-Louise Lackner, Martin Lackner:
A Mathematical Analysis of an Election System Proposed by Gottlob Frege. CoRR abs/1907.03643 (2019) - 2017
- [j4]Marie-Louise Lackner, Martin Lackner:
On the likelihood of single-peaked preferences. Soc. Choice Welf. 48(4): 717-745 (2017) - 2016
- [j3]Marie-Louise Bruner, Martin Lackner:
A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs. Algorithmica 75(1): 84-117 (2016) - [j2]Michael H. Albert, Marie-Louise Lackner, Martin Lackner, Vincent Vatter:
The Complexity of Pattern Matching for 321-Avoiding and Skew-Merged Permutations. Discret. Math. Theor. Comput. Sci. 18(2) (2016) - [j1]Marie-Louise Lackner, Alois Panholzer:
Parking functions for mappings. J. Comb. Theory, Ser. A 142: 1-28 (2016) - 2015
- [i6]Marie-Louise Bruner, Martin Lackner:
On the Likelihood of Single-Peaked Preferences. CoRR abs/1505.05852 (2015) - [i5]Michael H. Albert, Marie-Louise Lackner, Martin Lackner, Vincent Vatter:
The Complexity of Pattern Matching for 321-Avoiding and Skew-Merged Permutations. CoRR abs/1510.06051 (2015) - 2014
- [c2]Marie-Louise Bruner, Martin Lackner:
The Likelihood of Structure in Preference Profiles. MPREF@AAAI 2014 - 2013
- [i4]Marie-Louise Bruner, Martin Lackner:
The computational landscape of permutation patterns. CoRR abs/1301.0340 (2013) - 2012
- [c1]Marie-Louise Bruner, Martin Lackner:
A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs. SWAT 2012: 261-270 - [i3]Marie-Louise Bruner, Martin Lackner:
A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs. CoRR abs/1204.5224 (2012) - [i2]Marie-Louise Bruner, Martin Lackner:
From Peaks to Valleys, Running Up and Down: Fast Permutation Pattern Matching. Tiny Trans. Comput. Sci. 1 (2012) - 2011
- [i1]Marie-Louise Bruner, Martin Lackner:
A W[1]-Completeness Result for Generalized Permutation Pattern Matching. CoRR abs/1109.1951 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2020-08-07 23:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
