Lars-Daniel Öhman

22 papers C 1Journal 21
YearRankTypeTitle / Venue / Authors
2026 J jnl
Near triple arrays.
J. Comb. Theory, Ser. A
Alexey Gordeev, Klas Markström, Lars-Daniel Öhman
2025 J jnl
Near Triple Arrays.
CoRR
Alexey Gordeev, Klas Markström, Lars-Daniel Öhman
2025 J jnl
Resolvable Triple Arrays.
CoRR
Alexey Gordeev, Lars-Daniel Öhman
2025 J jnl
When is a Planar Rod Configuration Infinitesimally Rigid?
Discret. Comput. Geom.
Signe Lundqvist, Klara Stokes, Lars-Daniel Öhman
2024 J jnl
Enumeration of Row-Column Designs.
CoRR
Gerold Jäger, Klas Markström, Lars-Daniel Öhman, Denys Shcherbak
2024 J jnl
Enumeration of Sets of Mutually Orthogonal Latin Rectangles.
Electron. J. Comb.
Gerold Jäger, Klas Markström, Lars-Daniel Öhman, Denys Shcherbak
2023 J jnl
Exploring the rigidity of planar configurations of points and rods.
Discret. Appl. Math.
Signe Lundqvist, Klara Stokes, Lars-Daniel Öhman
2023 J jnl
Small Youden Rectangles, Near Youden Rectangles, and Their Connections to Other Row-Column Designs.
Discret. Math. Theor. Comput. Sci.
Gerold Jäger, Klas Markström, Denys Shcherbak, Lars-Daniel Öhman
2019 J jnl
Enumeration of Sets of Mutually Orthogonal Latin Rectangles.
CoRR
Gerold Jäger, Klas Markström, Denys Shcherbak, Lars-Daniel Öhman
2019 J jnl
Small Youden Rectangles and Their Connections to Other Row-Column Designs.
CoRR
Gerold Jäger, Klas Markström, Denys Shcherbak, Lars-Daniel Öhman
2018 J jnl
Triples of Orthogonal Latin and Youden Rectangles For Small Orders.
CoRR
Gerold Jäger, Klas Markström, Lars-Daniel Öhman, Denys Shcherbak
2015 C conf
On the Zero Forcing Number of Bijection Graphs.
IWOCA
Denys Shcherbak, Gerold Jäger, Lars-Daniel Öhman
2015 J jnl
Triple arrays and Youden squares.
Des. Codes Cryptogr.
Tomas Nilson, Lars-Daniel Öhman
2014 J jnl
Extending Partial Latin Cubes.
Ars Comb.
Tristan Denley, Lars-Daniel Öhman
2013 J jnl
Avoiding Arrays of Odd Order by Latin Squares.
Comb. Probab. Comput.
Lina Jansson Andrén, Carl Johan Casselgren, Lars-Daniel Öhman
2013 J jnl
Simulation relations for pattern matching in directed graphs.
Theor. Comput. Sci.
Johanna Björklund, Lars-Daniel Öhman
2012 J jnl
On the intricacy of avoiding multiple-entry arrays.
Discret. Math.
Lars-Daniel Öhman
2011 J jnl
Latin squares with prescriptions and restrictions.
Australas. J Comb.
Lars-Daniel Öhman
2010 J jnl
Unavoidable arrays.
Contributions Discret. Math.
Klas Markström, Lars-Daniel Öhman
2009 J jnl
A note on completing latin squares.
Australas. J Comb.
Lars-Daniel Öhman
2006 J jnl
Latin Squares with Forbidden Entries.
Electron. J. Comb.
Jonathan Cutler, Lars-Daniel Öhman
2006 J jnl
The intricacy of avoiding arrays is 2.
Discret. Math.
Lars-Daniel Öhman