Clock Scheduling and Clocktree Construction for High Performance ASICS. - Stephan Held; Bernhard Korte; Jens Maßberg; Matthias Ringe; Jens Vygen (ICCAD, 2003)

Approximation Algorithms for Network Design and Facility Location with Service Capacities. - Jens Maßberg; Jens Vygen (APPROX-RANDOM, 2005)

Approximation algorithms for a facility location problem with service capacities. - Jens Maßberg; Jens Vygen (ACM Trans. Algorithms, 2008)

Colored Independent Sets. - Jens Maßberg; Tim Nieberg (CTW, 2009)

Binary trees with choosable edge lengths. - Jens Maßberg; Dieter Rautenbach (Inf. Process. Lett., 2009)

The repeater tree construction problem. - Christoph Bartoschek; Stephan Held; Jens Maßberg; Dieter Rautenbach; Jens Vygen (Inf. Process. Lett., 2010)

Rectangle packing with additional restrictions. - Jens Maßberg; Jan Schneider 002 (Theor. Comput. Sci., 2011)

Online binary minimax trees. - Jens Maßberg (Discret. Appl. Math., 2013)

Rectilinear paths with minimum segment lengths. - Jens Maßberg; Tim Nieberg (Discret. Appl. Math., 2013)

The "Game about Squares" is NP-hard. - Jens Maßberg (CoRR, 2014)

Perfect Graphs and Guarding Rectilinear Art Galleries. - Jens Maßberg (Discret. Comput. Geom., 2014)

The Rectilinear Steiner Tree Problem with Given Topology and Length Restrictions. - Jens Maßberg (COCOON, 2015)

Solitaire Chess is NP-complete. - Jens Maßberg (CoRR, 2015)

The Depth-Restricted Rectilinear Steiner Arborescence Problem is NP-complete. - Jens Maßberg (CoRR, 2015)

Generalized Huffman coding for binary trees with choosable edge lengths. - Jens Maßberg (Inf. Process. Lett., 2015)

Dual consistent systems of linear inequalities and cardinality constrained polytopes. - Satoru Fujishige; Jens Maßberg (Math. Program., 2015)

The Union-Closed Sets Conjecture for Small Families. - Jens Maßberg (Graphs Comb., 2016)

Embedding rectilinear Steiner trees with length restrictions. - Jens Maßberg (Theor. Comput. Sci., 2016)