BibTeX records: Efraim Laksman

download as .bib file

@article{DBLP:journals/anor/LaksmanSP20,
  author       = {Efraim Laksman and
                  Ann{-}Brith Str{\"{o}}mberg and
                  Michael Patriksson},
  title        = {The stochastic opportunistic replacement problem, part {III:} improved
                  bounding procedures},
  journal      = {Ann. Oper. Res.},
  volume       = {292},
  number       = {2},
  pages        = {711--733},
  year         = {2020},
  url          = {https://doi.org/10.1007/s10479-019-03278-z},
  doi          = {10.1007/S10479-019-03278-Z},
  timestamp    = {Thu, 16 Sep 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/LaksmanSP20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/itsc/DahlHFL20,
  author       = {Mattias Dahl and
                  Johan Holmgren and
                  Henrik Fredriksson and
                  Efraim Laksman},
  title        = {Significant Route Identification using Daily 24-hour Traffic Flows},
  booktitle    = {23rd {IEEE} International Conference on Intelligent Transportation
                  Systems, {ITSC} 2020, Rhodes, Greece, September 20-23, 2020},
  pages        = {1--6},
  publisher    = {{IEEE}},
  year         = {2020},
  url          = {https://doi.org/10.1109/ITSC45102.2020.9294400},
  doi          = {10.1109/ITSC45102.2020.9294400},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/itsc/DahlHFL20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/imamci/LaksmanLN15,
  author       = {Efraim Laksman and
                  H{\aa}kan Lennerstad and
                  Magnus Nilsson},
  title        = {Generalized upper bounds on the minimum distance of {PSK} block codes},
  journal      = {{IMA} J. Math. Control. Inf.},
  volume       = {32},
  number       = {2},
  pages        = {305--327},
  year         = {2015},
  url          = {https://doi.org/10.1093/imamci/dnt047},
  doi          = {10.1093/IMAMCI/DNT047},
  timestamp    = {Fri, 03 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/imamci/LaksmanLN15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/basesearch/Laksman12,
  author       = {Efraim Laksman},
  title        = {Combinatorial Optimization: Three Applications},
  school       = {Blekinge Institute of Technology, Karlskrona, Sweden},
  year         = {2012},
  url          = {https://nbn-resolving.org/urn:nbn:se:bth-00538},
  urn          = {urn:nbn:se:bth-00538},
  timestamp    = {Mon, 02 Jan 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/phd/basesearch/Laksman12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/LaksmanLL12,
  author       = {Efraim Laksman and
                  H{\aa}kan Lennerstad and
                  Lars Lundberg},
  title        = {Optimal Computer Crash Performance Precaution},
  journal      = {Discret. Math. Theor. Comput. Sci.},
  volume       = {14},
  number       = {1},
  pages        = {55--68},
  year         = {2012},
  url          = {https://doi.org/10.46298/dmtcs.573},
  doi          = {10.46298/DMTCS.573},
  timestamp    = {Tue, 24 Jan 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dmtcs/LaksmanLL12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LaksmanLN10,
  author       = {Efraim Laksman and
                  H{\aa}kan Lennerstad and
                  Magnus Nilsson},
  title        = {Improving bounds on the minimum Euclidean distance for block codes
                  by inner distance measure optimization},
  journal      = {Discret. Math.},
  volume       = {310},
  number       = {22},
  pages        = {3267--3275},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.disc.2010.04.025},
  doi          = {10.1016/J.DISC.2010.04.025},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/LaksmanLN10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics