Mareike Massow

Publication List Details

Period

2007 - 2009

Number

10

Co-Authors

Linear Extension Diameter of Downset Lattices of 2-Dimensional Posets (2009)

Felsner, Stefan, Massow, Mareike

The linear extension diameter of a finite poset P is the maximum distance between a pair of linear extensions of P, where the distance between two linear extensions is the number of pairs of elements...

Diametral Pairs of Linear Extensions (2008)

Brightwell, Graham, Massow, Mareike

Given a finite poset P, we consider pairs of linear extensions of P with maximal distance, where the distance between two linear extensions L_1, L_2 is the number of pairs of elements of P appearing...

am Fachbereich Mathematik der (2008)

Mareike Massow

Die selbständige und eigenhändige Anfertigung versichere ich an Eides

Ideas for a Thesis Project: Drawing Partial Orders (2008)

Mareike Massow, Advisor Prof, Dr. Stefan Felsner

Suppose we are given a partially ordered set P = (X, <) and aim to draw it in the plane. How can we find a good way of doing this? First of all: What makes a drawing good? One possible answer to...

Diametral Pairs of Linear Extensions (2008)

Graham Brightwell, Mareike Massow

Given a finite poset P, we consider pairs of linear extensions of P with maximal distance, where the distance between two linear extensions L1, L2 is the number of pairs of elements of P appearing in...

Thickness of Bar 1-Visibility Graphs (2007)

Massow, Mareike, Felsner, Stefan

Bar k-visibility graphs are graphs admitting a representation in which the vertices correspond to horizontal line segments, called bars, and the edges correspond to vertical lines of sight which can...

Thickness of Bar 1-Visibility Graphs (2007)

Massow, Mareike, Felsner, Stefan

Bar k-visibility graphs are graphs admitting a representation in which the vertices correspond to horizontal line segments, called bars, and the edges correspond to vertical lines of sight which can...

Parameters of Bar k-Visibility Graphs (2007)

Stefan Felsner, Mareike Massow

Bar k-visibility graphs are graphs admitting a representation in which the vertices correspond to horizontal line segments, called bars, and the edges correspond to vertical lines of sight which can...

Thickness of bar 1-visibility graphs (2007)

Stefan Felsner, Mareike Massow

Abstract. Bar k-visibility graphs are graphs admitting a representation in which the vertices correspond to horizontal line segments, called bars, and the edges correspond to vertical lines of sight...