default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Grüttmüller
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c2]Alexander Pögelt
, Katja Ihsberner, Norbert Pengel, Milos Kravcik, Martin Grüttmüller, Wolfram Hardt:
Individualised Mathematical Task Recommendations Through Intended Learning Outcomes and Reinforcement Learning. ITS (1) 2024: 117-130- 2023
- [c1]Matteo Orsoni, Alexander Pögelt, Nghia Duong-Trung, Mariagrazia Benassi, Milos Kravcik, Martin Grüttmüller:
Recommending Mathematical Tasks Based on Reinforcement Learning and Item Response Theory. ITS 2023: 16-28
2010 – 2019
- 2014
- [j13]Martin Grüttmüller, Ian T. Roberts, Leanne J. Rylands:
Antichains and completely separating systems - A catalogue and applications. Discret. Appl. Math. 163: 165-180 (2014) - 2010
- [j12]Ian T. Roberts, Leanne J. Rylands, Terry Montag, Martin Grüttmüller:
On the number of minimal completely separating systems and antichains in a Boolean lattice. Australas. J Comb. 48: 143-158 (2010)
2000 – 2009
- 2009
- [j11]Martin Grüttmüller, Sven Hartmann, Thomas Kalinowski, Uwe Leck, Ian T. Roberts:
Maximal Flat Antichains of Minimum Weight. Electron. J. Comb. 16(1) (2009) - 2008
- [j10]Martin Grüttmüller, Sven Hartmann:
Pan-orientable block designs. Australas. J Comb. 40: 57-68 (2008) - [j9]Gennian Ge, Martin Grüttmüller, Sven Hartmann, Rolf S. Rees:
Mandatory representation designs I with k=2mod3. Discret. Math. 308(23): 5394-5406 (2008) - 2006
- [j8]Martin Grüttmüller, Ian T. Roberts, Sue D'Arcy, Judith Egan:
The minimum number of blocks in pairwise balanced designs with maximum block size 4: the final cases. Australas. J Comb. 36: 303-314 (2006) - [j7]Martin Grüttmüller:
Enumeration of Super-simple Cyclic Block Designs of Small Order. Electron. Notes Discret. Math. 27: 45-46 (2006) - 2004
- [j6]Ramadan A. El-Shanawany, Hans-Dietrich O. F. Gronau, Martin Grüttmüller:
Orthogonal double covers of Kn, n by small graphs. Discret. Appl. Math. 138(1-2): 47-63 (2004) - [j5]Martin Grüttmüller:
Completing partial latin squares with prescribed diagonals. Discret. Appl. Math. 138(1-2): 89-97 (2004) - 2003
- [j4]Martin Grüttmüller:
Completing partial latin squares with two cyclically generated prescribed diagonals. J. Comb. Theory A 103(2): 349-362 (2003) - 2002
- [j3]Hans-Dietrich O. F. Gronau, Martin Grüttmüller, Sven Hartmann, Uwe Leck, Volker Leck:
On Orthogonal Double Covers of Graphs. Des. Codes Cryptogr. 27(1-2): 49-91 (2002)
1990 – 1999
- 1999
- [j2]Martin Grüttmüller:
On the PBD-closure of Sets Containing 3. Discret. Appl. Math. 95(1-3): 251-272 (1999) - 1996
- [j1]Martin Grüttmüller:
On the number of indecomposable block designs. Australas. J Comb. 14: 181-186 (1996)
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-05 20:10 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:
