Lars-Daniel Öhman

According to our database, Lars-Daniel Öhman authored at least 19 papers between 2006 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2026

Near triple arrays.

Alexey Gordeev, Klas Markström, Lars-Daniel Öhman

J. Comb. Theory, Ser. A, 2026

2025

When is a Planar Rod Configuration Infinitesimally Rigid?

Signe Lundqvist, Klara Stokes, Lars-Daniel Öhman

Discret. Comput. Geom., January, 2025

2024

Enumeration of Row-Column Designs.

Gerold Jäger, Klas Markström, Lars-Daniel Öhman, Denys Shcherbak

CoRR, 2024

Enumeration of Sets of Mutually Orthogonal Latin Rectangles.

Gerold Jäger, Klas Markström, Lars-Daniel Öhman, Denys Shcherbak

Electron. J. Comb., 2024

2023

Exploring the rigidity of planar configurations of points and rods.

Signe Lundqvist, Klara Stokes, Lars-Daniel Öhman

Discret. Appl. Math., September, 2023

Small Youden Rectangles, Near Youden Rectangles, and Their Connections to Other Row-Column Designs.

Gerold Jäger, Klas Markström, Denys Shcherbak, Lars-Daniel Öhman

Discret. Math. Theor. Comput. Sci., 2023

2019

Small Youden Rectangles and Their Connections to Other Row-Column Designs.

Gerold Jäger, Klas Markström, Denys Shcherbak, Lars-Daniel Öhman

CoRR, 2019

2018

Triples of Orthogonal Latin and Youden Rectangles For Small Orders.

Gerold Jäger, Klas Markström, Lars-Daniel Öhman, Denys Shcherbak

CoRR, 2018

2015

Triple arrays and Youden squares.

Tomas Nilson, Lars-Daniel Öhman

Des. Codes Cryptogr., 2015

On the Zero Forcing Number of Bijection Graphs.

Denys Shcherbak, Gerold Jäger, Lars-Daniel Öhman

Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

2014

Extending Partial Latin Cubes.

Tristan Denley, Lars-Daniel Öhman

Ars Comb., 2014

2013

Simulation relations for pattern matching in directed graphs.

Johanna Björklund, Lars-Daniel Öhman

Theor. Comput. Sci., 2013

Avoiding Arrays of Odd Order by Latin Squares.

Lina Jansson Andrén, Carl Johan Casselgren, Lars-Daniel Öhman

Comb. Probab. Comput., 2013

2012

On the intricacy of avoiding multiple-entry arrays.

Lars-Daniel Öhman

Discret. Math., 2012

2011

Latin squares with prescriptions and restrictions.

Lars-Daniel Öhman

Australas. J Comb., 2011

2010

Unavoidable arrays.

Klas Markström, Lars-Daniel Öhman

Contributions Discret. Math., 2010

2009

A note on completing latin squares.

Lars-Daniel Öhman

Australas. J Comb., 2009

2006

The intricacy of avoiding arrays is 2.

Lars-Daniel Öhman

Discret. Math., 2006

Latin Squares with Forbidden Entries.

Jonathan Cutler, Lars-Daniel Öhman

Electron. J. Comb., 2006