Note:
It is our group's policy to list authors in alphabetical order whenever context allowes. |
journal papers |
Ulrik Brandes and Barbara Pampel:
Orthogonal-Ordering Constraints are Tough.
Journal of Graph Algorithms and Applications 17(1):1-10, 2013.
|
Ulrik Brandes, Sabine Cornelsen, Barbara Pampel and Arnaud Sallaberry:
Path-based Supports for Hypergraphs.
Journal of Discrete Algorithms 14:248-261, 2012.
|
conference papers |
Ulrik Brandes, Sabine Cornelsen, Barbara Pampel and Arnaud Sallaberry:
Blocks of Hypergraphs.
Proc. 21st Intl. Workshop Combinatorial Algorithms (IWOCA 2010),
LNCS 6460, pp. 201-211.
© Springer-Verlag, 2011.
|
Ulrik Brandes, Sabine Cornelsen, Barbara Pampel and Arnaud Sallaberry:
Path-based Supports for Hypergraphs.
Proc. 21st Intl. Workshop Combinatorial Algorithms (IWOCA 2010),
to appear.
|
Ulrik Brandes and Barbara Pampel:
On the Hardness of Orthogonal-Order Preserving Graph Drawing.
Proc. 16th Intl. Symp. Graph Drawing (GD '08),
LNCS 5417, pp. 266-277.
© Springer-Verlag, 2009.
|
Ulrik Brandes and Barbara Schlieper:
Angle and Distance Constraints on Tree Drawings.
Proc. 14th Intl. Symp. Graph Drawing (GD '06).
LNCS 4372, pp. 54-65.
© Springer-Verlag, 2007.
|
Christian Bachmaier, Ulrik Brandes, and Barbara Schlieper: Drawing
Phylogenetic Trees. Proc. 16th Intl. Symp. Algorithms and Computation
(ISAAC '05). LNCS 3827,
pp. 1110-1121. © Springer-Verlag, 2005. |