Improving bounds on the minimum Euclidean distance for block codes by inner distance measure optimization. - Efraim Laksman; Håkan Lennerstad; Magnus Nilsson (Discret. Math., 2010)

Optimal Computer Crash Performance Precaution. - Efraim Laksman; Håkan Lennerstad; Lars Lundberg (Discret. Math. Theor. Comput. Sci., 2012)

Combinatorial Optimization: Three Applications. - Efraim Laksman (2012)

Generalized upper bounds on the minimum distance of PSK block codes. - Efraim Laksman; Håkan Lennerstad; Magnus Nilsson (IMA J. Math. Control. Inf., 2015)

Significant Route Identification using Daily 24-hour Traffic Flows. - Mattias Dahl; Johan Holmgren; Henrik Fredriksson; Efraim Laksman (ITSC, 2020)

The stochastic opportunistic replacement problem, part III: improved bounding procedures. - Efraim Laksman; Ann-Brith Strömberg; Michael Patriksson (Ann. Oper. Res., 2020)