The Union-Closed Sets Conjecture for Small Families von Maßberg, Jens

Volltext

Embedding rectilinear Steiner trees with length restrictions von Masberg, Jens

Volltext

Generalized Huffman coding for binary trees with choosable edge lengths von Massberg, Jens

Volltext

The Rectilinear Steiner Tree Problem with Given Topology and Length Restrictions von Maßberg, Jens

Volltext

Dual consistent systems of linear inequalities and cardinality constrained polytopes von Fujishige, Satoru, Maßberg, Jens

Volltext

Perfect Graphs and Guarding Rectilinear Art Galleries von Masberg, Jens

Volltext

Online binary minimax trees von MaAberg, Jens

Volltext

Rectilinear paths with minimum segment lengths von Maßberg, Jens, Nieberg, Tim

Volltext

Rectangle packing with additional restrictions von Maßberg, Jens, Schneider, Jan

Volltext

Binary trees with choosable edge lengths von Maßberg, Jens, Rautenbach, Dieter

Volltext

Approximation Algorithms for Network Design and Facility Location with Service Capacities von Maßberg, Jens, Vygen, Jens

Volltext

Approximation algorithms for a facility location problem with service capacities von Maßberg, Jens, Vygen, Jens

Volltext

The Depth-Restricted Rectilinear Steiner Arborescence Problem is NP-complete von Maßberg, Jens

Volltext bestellen

The Union-Closed Sets Conjecture for Small Families von Maßberg, Jens

Volltext bestellen

Solitaire Chess is NP-complete von Maßberg, Jens

Volltext bestellen

The rectilinear Steiner tree problem with given topology and length restrictions von Maßberg, Jens

Volltext

Dual Consistent Systems of Linear Inequalities and Cardinality Constrained Polytopes von Fujishige, Satoru, Maßberg, Jens

Volltext

Generalized Huffman Coding for Binary Trees with Choosable Edge Lengths von Maßberg, Jens

Volltext

The "Game about Squares" is NP-hard von Maßberg, Jens

Volltext bestellen

The Depth-Restricted Rectilinear Steiner Arborescence Problem is NP-complete von Maßberg, Jens

Volltext