Jens Maßberg

Affiliations:
  • University of Bonn, Germany


According to our database1, Jens Maßberg authored at least 18 papers between 2003 and 2016.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2016
Embedding rectilinear Steiner trees with length restrictions.
Theor. Comput. Sci., 2016

The Union-Closed Sets Conjecture for Small Families.
Graphs Comb., 2016

2015
Dual consistent systems of linear inequalities and cardinality constrained polytopes.
Math. Program., 2015

Generalized Huffman coding for binary trees with choosable edge lengths.
Inf. Process. Lett., 2015

The Depth-Restricted Rectilinear Steiner Arborescence Problem is NP-complete.
CoRR, 2015

Solitaire Chess is NP-complete.
CoRR, 2015

The Rectilinear Steiner Tree Problem with Given Topology and Length Restrictions.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014
Perfect Graphs and Guarding Rectilinear Art Galleries.
Discret. Comput. Geom., 2014

The "Game about Squares" is NP-hard.
CoRR, 2014

2013
Rectilinear paths with minimum segment lengths.
Discret. Appl. Math., 2013

Online binary minimax trees.
Discret. Appl. Math., 2013

2011
Rectangle packing with additional restrictions.
Theor. Comput. Sci., 2011

2010
The repeater tree construction problem.
Inf. Process. Lett., 2010

2009
Binary trees with choosable edge lengths.
Inf. Process. Lett., 2009

Colored Independent Sets.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008
Approximation algorithms for a facility location problem with service capacities.
ACM Trans. Algorithms, 2008

2005
Approximation Algorithms for Network Design and Facility Location with Service Capacities.
Proceedings of the Approximation, 2005

2003
Clock Scheduling and Clocktree Construction for High Performance ASICS.
Proceedings of the 2003 International Conference on Computer-Aided Design, 2003


  Loading...