default search action
Jens Maßberg
Refine list
refinements active!
zoomed in on 22 of 22 records
view refined list in
export refined list as
refine by search term
refine by type
- |
- no options
- temporarily not available
refine by coauthor
- no options
- temporarily not available
refine by orcid
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
2010 – 2019
- 2016
- [j11]Jens Maßberg:
The Union-Closed Sets Conjecture for Small Families. Graphs Comb. 32(5): 2047-2051 (2016) - [j10]Jens Maßberg:
Embedding rectilinear Steiner trees with length restrictions. Theor. Comput. Sci. 654: 59-69 (2016) - 2015
- [j9]Jens Maßberg:
Generalized Huffman coding for binary trees with choosable edge lengths. Inf. Process. Lett. 115(4): 502-506 (2015) - [j8]Satoru Fujishige, Jens Maßberg:
Dual consistent systems of linear inequalities and cardinality constrained polytopes. Math. Program. 150(1): 35-48 (2015) - [c6]Jens Maßberg:
The Rectilinear Steiner Tree Problem with Given Topology and Length Restrictions. COCOON 2015: 445-456 - [i5]Jens Maßberg:
Solitaire Chess is NP-complete. CoRR abs/1501.06398 (2015) - [i4]Jens Maßberg:
The Depth-Restricted Rectilinear Steiner Arborescence Problem is NP-complete. CoRR abs/1508.06792 (2015) - 2014
- [j7]Jens Maßberg:
Perfect Graphs and Guarding Rectilinear Art Galleries. Discret. Comput. Geom. 51(3): 569-577 (2014) - [i3]Jens Maßberg:
Generalized Huffman Coding for Binary Trees with Choosable Edge Lengths. CoRR abs/1402.3435 (2014) - [i2]Jens Maßberg:
The "Game about Squares" is NP-hard. CoRR abs/1408.3645 (2014) - [i1]Jens Maßberg:
The rectilinear Steiner tree problem with given topology and length restrictions. CoRR abs/1412.5010 (2014) - 2013
- [j6]Jens Maßberg, Tim Nieberg:
Rectilinear paths with minimum segment lengths. Discret. Appl. Math. 161(12): 1769-1775 (2013) - [j5]Jens Maßberg:
Online binary minimax trees. Discret. Appl. Math. 161(16-17): 2556-2562 (2013) - 2012
- [c5]Satoru Fujishige, Jens Maßberg:
Dual Consistent Systems of Linear Inequalities and Cardinality Constrained Polytopes. ISCO 2012: 153-164 - 2011
- [j4]Jens Maßberg, Jan Schneider:
Rectangle packing with additional restrictions. Theor. Comput. Sci. 412(50): 6948-6958 (2011) - 2010
- [j3]Christoph Bartoschek, Stephan Held, Jens Maßberg, Dieter Rautenbach, Jens Vygen:
The repeater tree construction problem. Inf. Process. Lett. 110(24): 1079-1083 (2010) - no results
2000 – 2009
- 2009
- [j2]Jens Maßberg, Dieter Rautenbach:
Binary trees with choosable edge lengths. Inf. Process. Lett. 109(18): 1087-1092 (2009) - [c4]Jens Maßberg, Tim Nieberg:
Colored Independent Sets. CTW 2009: 35-39 - [c3]Jens Maßberg, Jan Schneider:
Rectangle Packing with Additional Restrictions. CTW 2009: 84-86 - 2008
- [j1]Jens Maßberg, Jens Vygen:
Approximation algorithms for a facility location problem with service capacities. ACM Trans. Algorithms 4(4): 50:1-50:15 (2008) - 2005
- [c2]Jens Maßberg, Jens Vygen:
Approximation Algorithms for Network Design and Facility Location with Service Capacities. APPROX-RANDOM 2005: 158-169 - 2003
- [c1]Stephan Held, Bernhard Korte, Jens Maßberg, Matthias Ringe, Jens Vygen:
Clock Scheduling and Clocktree Construction for High Performance ASICS. ICCAD 2003: 232-240 - no results
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint