default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLars-Daniel Öhman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Gerold Jäger, Klas Markström, Lars-Daniel Öhman, Denys Shcherbak:
Enumeration of Sets of Mutually Orthogonal Latin Rectangles. Electron. J. Comb. 31(1) (2024)- [i4]Gerold Jäger, Klas Markström, Lars-Daniel Öhman, Denys Shcherbak:
Enumeration of Row-Column Designs. CoRR abs/2406.16444 (2024) - 2023
- [j12]Signe Lundqvist, Klara Stokes
, Lars-Daniel Öhman:
Exploring the rigidity of planar configurations of points and rods. Discret. Appl. Math. 336: 68-82 (2023) - [j11]Gerold Jäger, Klas Markström, Denys Shcherbak, Lars-Daniel Öhman:
Small Youden Rectangles, Near Youden Rectangles, and Their Connections to Other Row-Column Designs. Discret. Math. Theor. Comput. Sci. 25 (2023)
2010 – 2019
- 2019
- [i3]Gerold Jäger, Klas Markström, Denys Shcherbak, Lars-Daniel Öhman:
Small Youden Rectangles and Their Connections to Other Row-Column Designs. CoRR abs/1910.02791 (2019) - [i2]Gerold Jäger, Klas Markström, Denys Shcherbak, Lars-Daniel Öhman:
Enumeration of Sets of Mutually Orthogonal Latin Rectangles. CoRR abs/1910.02950 (2019) - 2018
- [i1]Gerold Jäger, Klas Markström, Lars-Daniel Öhman, Denys Shcherbak:
Triples of Orthogonal Latin and Youden Rectangles For Small Orders. CoRR abs/1810.12639 (2018) - 2015
- [j10]Tomas Nilson, Lars-Daniel Öhman:
Triple arrays and Youden squares. Des. Codes Cryptogr. 75(3): 429-451 (2015) - [c1]Denys Shcherbak, Gerold Jäger, Lars-Daniel Öhman:
On the Zero Forcing Number of Bijection Graphs. IWOCA 2015: 334-345 - 2014
- [j9]Tristan Denley, Lars-Daniel Öhman:
Extending Partial Latin Cubes. Ars Comb. 113: 405-414 (2014) - 2013
- [j8]Lina Jansson Andrén, Carl Johan Casselgren, Lars-Daniel Öhman:
Avoiding Arrays of Odd Order by Latin Squares. Comb. Probab. Comput. 22(2): 184-212 (2013) - [j7]Johanna Björklund, Lars-Daniel Öhman:
Simulation relations for pattern matching in directed graphs. Theor. Comput. Sci. 485: 1-15 (2013) - 2012
- [j6]Lars-Daniel Öhman:
On the intricacy of avoiding multiple-entry arrays. Discret. Math. 312(20): 3030-3036 (2012) - 2011
- [j5]Lars-Daniel Öhman:
Latin squares with prescriptions and restrictions. Australas. J Comb. 51: 77-88 (2011) - 2010
- [j4]Klas Markström, Lars-Daniel Öhman:
Unavoidable arrays. Contributions Discret. Math. 5(1) (2010)
2000 – 2009
- 2009
- [j3]Lars-Daniel Öhman:
A note on completing latin squares. Australas. J Comb. 45: 117-124 (2009) - 2006
- [j2]Jonathan Cutler, Lars-Daniel Öhman:
Latin Squares with Forbidden Entries. Electron. J. Comb. 13(1) (2006) - [j1]Lars-Daniel Öhman:
The intricacy of avoiding arrays is 2. Discret. Math. 306(5): 531-532 (2006)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-25 19:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
