Follow
Jens Massberg
Jens Massberg
Verified email at uni-ulm.de
Title
Cited by
Cited by
Year
Clock scheduling and clocktree construction for high performance ASICs
S Held, B Korte, J Maßberg, M Ringe, J Vygen
ICCAD-2003. International Conference on Computer Aided Design (IEEE Cat. No …, 2003
782003
The repeater tree construction problem
C Bartoschek, S Held, J Maßberg, D Rautenbach, J Vygen
Information Processing Letters 110 (24), 1079-1083, 2010
202010
Approximation algorithms for a facility location problem with service capacities
J Maßberg, J Vygen
ACM Transactions on Algorithms (TALG) 4 (4), 1-15, 2008
192008
Rectilinear paths with minimum segment lengths
J Maßberg, T Nieberg
Discrete Applied Mathematics 161 (12), 1769-1775, 2013
122013
Rectangle packing with additional restrictions
J Maßberg, J Schneider
Theoretical computer science 412 (50), 6948-6958, 2011
102011
Approximation algorithms for network design and facility location with service capacities
J Maßberg, J Vygen
International Workshop on Approximation Algorithms for Combinatorial …, 2005
102005
Binary trees with choosable edge lengths
J Maßberg, D Rautenbach
Information processing letters 109 (18), 1087-1092, 2009
72009
The union-closed sets conjecture for small families
J Maßberg
Graphs and Combinatorics 32, 2047-2051, 2016
62016
The rectilinear Steiner tree problem with given topology and length restrictions
J Maßberg
Computing and Combinatorics: 21st International Conference, COCOON 2015 …, 2015
52015
Method and computer system for optimizing the signal time behavior of an electronic circuit design
G Hutzl, S Held, J Koehl, B Korte, J Massberg, M Ringe, J Vygen
US Patent 7,844,931, 2010
52010
Facility location and clock tree synthesis
JU Maßberg
Universitäts-und Landesbibliothek Bonn, 2010
52010
Perfect graphs and guarding rectilinear art galleries
J Maßberg
Discrete & Computational Geometry 51, 569-577, 2014
42014
Generalized Huffman coding for binary trees with choosable edge lengths
J Maßberg
Information Processing Letters 115 (4), 502-506, 2015
32015
Structure for optimizing the signal time behavior of an electronic circuit design
G Hutzl, S Held, J Koehl, B Korte, J Massberg, M Ringe, J Vygen
US Patent 7,886,245, 2011
32011
Colored Independent Sets.
J Maßberg, T Nieberg
CTW, 35-39, 2009
22009
Embedding rectilinear Steiner trees with length restrictions
J Maßberg
Theoretical Computer Science 654, 59-69, 2016
12016
The Depth-Restricted Rectilinear Steiner Arborescence Problem is NP-complete
J Maßberg
arXiv preprint arXiv:1508.06792, 2015
12015
Dual consistent systems of linear inequalities and cardinality constrained polytopes
S Fujishige, J Maßberg
Mathematical Programming 150, 35-48, 2015
12015
Geometrical and combinatorial optimization problems
J Maßberg
Universität Ulm, 2015
2015
Solitaire Chess is NP-complete
J Maßberg
arXiv preprint arXiv:1501.06398, 2015
2015
The system can't perform the operation now. Try again later.
Articles 1–20