Visualization of Complex BPEL Models. - Benjamin Albrecht; Philip Effinger; Markus Held; Michael Kaufmann 001; Stephan Kottler (GD, 2009)

An automatic layout algorithm for BPEL processes. - Benjamin Albrecht; Philip Effinger; Markus Held; Michael Kaufmann 001 (SOFTVIS, 2010)

Space Efficient Modifications to Structator - A Fast Index-Based Search Tool for RNA Sequence-Structure Patterns. - Benjamin Albrecht; Volker Heun (SEA, 2012)

Fast computation of minimum hybridization networks. - Benjamin Albrecht; Céline Scornavacca; Alberto Cenci; Daniel H. Huson (Bioinform., 2012)

A First Step Toward Computing All Hybridization Networks For Two Rooted Binary Phylogenetic Trees. - Céline Scornavacca; Simone Linz; Benjamin Albrecht (J. Comput. Biol., 2012)

Computing Hybridization Networks for Multiple Rooted Binary Phylogenetic Trees by Maximum Acyclic Agreement Forests. - Benjamin Albrecht (CoRR, 2014)

Computing all hybridization networks for multiple binary phylogenetic input trees. - Benjamin Albrecht (BMC Bioinform., 2015)

Fast computation of all maximum acyclic agreement forests for two rooted binary phylogenetic trees. - Benjamin Albrecht (CoRR, 2015)

Computing a Relevant Set of Nonbinary Maximum Acyclic Agreement Forests. - Benjamin Albrecht (CoRR, 2015)

Computing hybridization networks using agreement forests. - Benjamin Albrecht (2016)

Random Forests in Chapel. - Benjamin Albrecht (IPDPS Workshops, 2020)

MAIRA- real-time taxonomic and functional analysis of long reads on a laptop. - Benjamin Albrecht; Caner Bagci; Daniel H. Huson (BMC Bioinform., 2020)