BibTeX records: Jens Maßberg

download as .bib file

@article{DBLP:journals/gc/Massberg16,
  author       = {Jens Ma{\ss}berg},
  title        = {The Union-Closed Sets Conjecture for Small Families},
  journal      = {Graphs Comb.},
  volume       = {32},
  number       = {5},
  pages        = {2047--2051},
  year         = {2016},
  url          = {https://doi.org/10.1007/s00373-016-1701-3},
  doi          = {10.1007/S00373-016-1701-3},
  timestamp    = {Sun, 22 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/gc/Massberg16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Massberg16,
  author       = {Jens Ma{\ss}berg},
  title        = {Embedding rectilinear Steiner trees with length restrictions},
  journal      = {Theor. Comput. Sci.},
  volume       = {654},
  pages        = {59--69},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2016.06.018},
  doi          = {10.1016/J.TCS.2016.06.018},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Massberg16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Massberg15,
  author       = {Jens Ma{\ss}berg},
  title        = {Generalized Huffman coding for binary trees with choosable edge lengths},
  journal      = {Inf. Process. Lett.},
  volume       = {115},
  number       = {4},
  pages        = {502--506},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.ipl.2014.11.013},
  doi          = {10.1016/J.IPL.2014.11.013},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Massberg15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/FujishigeM15,
  author       = {Satoru Fujishige and
                  Jens Ma{\ss}berg},
  title        = {Dual consistent systems of linear inequalities and cardinality constrained
                  polytopes},
  journal      = {Math. Program.},
  volume       = {150},
  number       = {1},
  pages        = {35--48},
  year         = {2015},
  url          = {https://doi.org/10.1007/s10107-014-0748-2},
  doi          = {10.1007/S10107-014-0748-2},
  timestamp    = {Wed, 14 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/FujishigeM15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cocoon/Massberg15,
  author       = {Jens Ma{\ss}berg},
  editor       = {Dachuan Xu and
                  Donglei Du and
                  Ding{-}Zhu Du},
  title        = {The Rectilinear Steiner Tree Problem with Given Topology and Length
                  Restrictions},
  booktitle    = {Computing and Combinatorics - 21st International Conference, {COCOON}
                  2015, Beijing, China, August 4-6, 2015, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {9198},
  pages        = {445--456},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-319-21398-9\_35},
  doi          = {10.1007/978-3-319-21398-9\_35},
  timestamp    = {Sun, 25 Oct 2020 22:58:52 +0100},
  biburl       = {https://dblp.org/rec/conf/cocoon/Massberg15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/Massberg15,
  author       = {Jens Ma{\ss}berg},
  title        = {Solitaire Chess is NP-complete},
  journal      = {CoRR},
  volume       = {abs/1501.06398},
  year         = {2015},
  url          = {http://arxiv.org/abs/1501.06398},
  eprinttype    = {arXiv},
  eprint       = {1501.06398},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/Massberg15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/Massberg15a,
  author       = {Jens Ma{\ss}berg},
  title        = {The Depth-Restricted Rectilinear Steiner Arborescence Problem is NP-complete},
  journal      = {CoRR},
  volume       = {abs/1508.06792},
  year         = {2015},
  url          = {http://arxiv.org/abs/1508.06792},
  eprinttype    = {arXiv},
  eprint       = {1508.06792},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/Massberg15a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dcg/Massberg14,
  author       = {Jens Ma{\ss}berg},
  title        = {Perfect Graphs and Guarding Rectilinear Art Galleries},
  journal      = {Discret. Comput. Geom.},
  volume       = {51},
  number       = {3},
  pages        = {569--577},
  year         = {2014},
  url          = {https://doi.org/10.1007/s00454-014-9587-4},
  doi          = {10.1007/S00454-014-9587-4},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dcg/Massberg14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/Massberg14,
  author       = {Jens Ma{\ss}berg},
  title        = {Generalized Huffman Coding for Binary Trees with Choosable Edge Lengths},
  journal      = {CoRR},
  volume       = {abs/1402.3435},
  year         = {2014},
  url          = {http://arxiv.org/abs/1402.3435},
  eprinttype    = {arXiv},
  eprint       = {1402.3435},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/Massberg14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/Massberg14a,
  author       = {Jens Ma{\ss}berg},
  title        = {The "Game about Squares" is NP-hard},
  journal      = {CoRR},
  volume       = {abs/1408.3645},
  year         = {2014},
  url          = {http://arxiv.org/abs/1408.3645},
  eprinttype    = {arXiv},
  eprint       = {1408.3645},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/Massberg14a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/Massberg14b,
  author       = {Jens Ma{\ss}berg},
  title        = {The rectilinear Steiner tree problem with given topology and length
                  restrictions},
  journal      = {CoRR},
  volume       = {abs/1412.5010},
  year         = {2014},
  url          = {http://arxiv.org/abs/1412.5010},
  eprinttype    = {arXiv},
  eprint       = {1412.5010},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/Massberg14b.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/MassbergN13,
  author       = {Jens Ma{\ss}berg and
                  Tim Nieberg},
  title        = {Rectilinear paths with minimum segment lengths},
  journal      = {Discret. Appl. Math.},
  volume       = {161},
  number       = {12},
  pages        = {1769--1775},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.dam.2011.12.003},
  doi          = {10.1016/J.DAM.2011.12.003},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/MassbergN13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Massberg13,
  author       = {Jens Ma{\ss}berg},
  title        = {Online binary minimax trees},
  journal      = {Discret. Appl. Math.},
  volume       = {161},
  number       = {16-17},
  pages        = {2556--2562},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.dam.2013.05.033},
  doi          = {10.1016/J.DAM.2013.05.033},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Massberg13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iscopt/FujishigeM12,
  author       = {Satoru Fujishige and
                  Jens Ma{\ss}berg},
  editor       = {Ali Ridha Mahjoub and
                  Vangelis Markakis and
                  Ioannis Milis and
                  Vangelis Th. Paschos},
  title        = {Dual Consistent Systems of Linear Inequalities and Cardinality Constrained
                  Polytopes},
  booktitle    = {Combinatorial Optimization - Second International Symposium, {ISCO}
                  2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {7422},
  pages        = {153--164},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-32147-4\_15},
  doi          = {10.1007/978-3-642-32147-4\_15},
  timestamp    = {Tue, 14 May 2019 10:00:53 +0200},
  biburl       = {https://dblp.org/rec/conf/iscopt/FujishigeM12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/MassbergS11,
  author       = {Jens Ma{\ss}berg and
                  Jan Schneider},
  title        = {Rectangle packing with additional restrictions},
  journal      = {Theor. Comput. Sci.},
  volume       = {412},
  number       = {50},
  pages        = {6948--6958},
  year         = {2011},
  url          = {https://doi.org/10.1016/j.tcs.2011.09.007},
  doi          = {10.1016/J.TCS.2011.09.007},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/MassbergS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/BartoschekHMRV10,
  author       = {Christoph Bartoschek and
                  Stephan Held and
                  Jens Ma{\ss}berg and
                  Dieter Rautenbach and
                  Jens Vygen},
  title        = {The repeater tree construction problem},
  journal      = {Inf. Process. Lett.},
  volume       = {110},
  number       = {24},
  pages        = {1079--1083},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.ipl.2010.08.016},
  doi          = {10.1016/J.IPL.2010.08.016},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/BartoschekHMRV10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/MassbergR09,
  author       = {Jens Ma{\ss}berg and
                  Dieter Rautenbach},
  title        = {Binary trees with choosable edge lengths},
  journal      = {Inf. Process. Lett.},
  volume       = {109},
  number       = {18},
  pages        = {1087--1092},
  year         = {2009},
  url          = {https://doi.org/10.1016/j.ipl.2009.07.002},
  doi          = {10.1016/J.IPL.2009.07.002},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/MassbergR09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/colognetwente/MassbergN09,
  author       = {Jens Ma{\ss}berg and
                  Tim Nieberg},
  editor       = {Sonia Cafieri and
                  Antonio Mucherino and
                  Giacomo Nannicini and
                  Fabien Tarissan and
                  Leo Liberti},
  title        = {Colored Independent Sets},
  booktitle    = {Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial
                  Optimization, {CTW} 2009, Paris, France, June 2-4 2009},
  pages        = {35--39},
  year         = {2009},
  url          = {http://www.lix.polytechnique.fr/ctw09/ctw09-proceedings.pdf\#page=47},
  timestamp    = {Thu, 12 Mar 2020 11:34:41 +0100},
  biburl       = {https://dblp.org/rec/conf/colognetwente/MassbergN09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/colognetwente/MasssbergS09,
  author       = {Jens Ma{\ss}berg and
                  Jan Schneider},
  editor       = {Sonia Cafieri and
                  Antonio Mucherino and
                  Giacomo Nannicini and
                  Fabien Tarissan and
                  Leo Liberti},
  title        = {Rectangle Packing with Additional Restrictions},
  booktitle    = {Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial
                  Optimization, {CTW} 2009, Paris, France, June 2-4 2009},
  pages        = {84--86},
  year         = {2009},
  url          = {http://www.lix.polytechnique.fr/ctw09/ctw09-proceedings.pdf\#page=96},
  timestamp    = {Mon, 23 Jan 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/colognetwente/MasssbergS09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/talg/MassbergV08,
  author       = {Jens Ma{\ss}berg and
                  Jens Vygen},
  title        = {Approximation algorithms for a facility location problem with service
                  capacities},
  journal      = {{ACM} Trans. Algorithms},
  volume       = {4},
  number       = {4},
  pages        = {50:1--50:15},
  year         = {2008},
  url          = {https://doi.org/10.1145/1383369.1383381},
  doi          = {10.1145/1383369.1383381},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/talg/MassbergV08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/approx/MassbergV05,
  author       = {Jens Ma{\ss}berg and
                  Jens Vygen},
  editor       = {Chandra Chekuri and
                  Klaus Jansen and
                  Jos{\'{e}} D. P. Rolim and
                  Luca Trevisan},
  title        = {Approximation Algorithms for Network Design and Facility Location
                  with Service Capacities},
  booktitle    = {Approximation, Randomization and Combinatorial Optimization, Algorithms
                  and Techniques, 8th International Workshop on Approximation Algorithms
                  for Combinatorial Optimization Problems, {APPROX} 2005 and 9th InternationalWorkshop
                  on Randomization and Computation, {RANDOM} 2005, Berkeley, CA, USA,
                  August 22-24, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3624},
  pages        = {158--169},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/11538462\_14},
  doi          = {10.1007/11538462\_14},
  timestamp    = {Tue, 21 Sep 2021 09:36:24 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/MassbergV05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iccad/HeldKMRV03,
  author       = {Stephan Held and
                  Bernhard Korte and
                  Jens Ma{\ss}berg and
                  Matthias Ringe and
                  Jens Vygen},
  title        = {Clock Scheduling and Clocktree Construction for High Performance {ASICS}},
  booktitle    = {2003 International Conference on Computer-Aided Design, {ICCAD} 2003,
                  San Jose, CA, USA, November 9-13, 2003},
  pages        = {232--240},
  publisher    = {{IEEE} Computer Society / {ACM}},
  year         = {2003},
  url          = {https://doi.ieeecomputersociety.org/10.1109/ICCAD.2003.1257653},
  doi          = {10.1109/ICCAD.2003.1257653},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/iccad/HeldKMRV03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.