Ian T. Roberts - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 20 from 20

2025

Sizes of Flat Maximal Antichains of SubsetsJerrold R. Griggs, Thomas Kalinowski, Uwe Leck, Ian T. Roberts, Michael Schmitz 0005. order, 42(1):131-156, April 2025. [doi]

2023

The Saturation Spectrum for Antichains of SubsetsJerrold R. Griggs, Thomas Kalinowski, Uwe Leck, Ian T. Roberts, Michael Schmitz. order, 40(3):537-574, October 2023. [doi]

2021

Minimum Weight Flat Antichains of SubsetsJerrold R. Griggs, Sven Hartmann, Thomas Kalinowski, Uwe Leck, Ian T. Roberts. order, 38(3):441-453, 2021. [doi]

2016

Minimizing the regularity of maximal regular antichains of 2- and 3-setsThomas Kalinowski, Uwe Leck, Christian Reiher, Ian T. Roberts. ajc, 64:277-288, 2016. [doi]

2014

Antichains and completely separating systems - A catalogue and applicationsMartin Grüttmüller, Ian T. Roberts, Leanne J. Rylands. DAM, 163:165-180, 2014. [doi]

Inequalities for cross-unions of collections of finite setsUwe Leck, Ian T. Roberts. ejc, 35:392-401, 2014. [doi]

2013

Maximal Antichains of Minimum SizeThomas Kalinowski, Uwe Leck, Ian T. Roberts. combinatorics, 20(2):3, 2013. [doi]

On the existence of regular antichainsIan T. Roberts, Matthias Böhm. DM, 313(4):348-356, 2013. [doi]

2) or 11 ≤ k ≤ 12Ian T. Roberts, Sue D'Arcy, Hans-Dietrich O. F. Gronau. ajc, 55:73-94, 2013. [doi]

2012

Minimizing the weight of the union-closure of families of two-setsUwe Leck, Ian T. Roberts, Jamie Simpson. ajc, 52:67-74, 2012. [doi]

2011

Minimizing the weight of the union-closure of uniform families of setsUwe Leck, Ian T. Roberts. endm, 38:553-558, 2011. [doi]

2010

A note on the union-closed sets conjectureIan T. Roberts, Jamie Simpson. ajc, 47:265-268, 2010. [doi]

On the number of minimal completely separating systems and antichains in a Boolean latticeIan T. Roberts, Leanne J. Rylands, Terry Montag, Martin Grüttmüller. ajc, 48:143-158, 2010. [doi]

2009

Maximal Flat Antichains of Minimum WeightMartin Grüttmüller, Sven Hartmann, Thomas Kalinowski, Uwe Leck, Ian T. Roberts. combinatorics, 16(1), 2009. [doi]

Covering separating systems and an application to search theoryOudone Phanalasy, Ian T. Roberts, Leanne J. Rylands. ajc, 45:3-14, 2009. [doi]

2006

The minimum number of blocks in pairwise balanced designs with maximum block size 4: the final casesMartin Grüttmüller, Ian T. Roberts, Sue D'Arcy, Judith Egan. ajc, 36:303-314, 2006. [doi]

2005

Minimal (n) and (n, h, k) Completely Separating SystemsIan T. Roberts, Leanne J. Rylands. ajc, 33:57-66, 2005. [doi]

Completely separating systems of k-sets for 7 ≤ k ≤ 10Ian T. Roberts. ajc, 33:87-98, 2005. [doi]

1998

Completely separating systems of k-setsColin Ramsay, Ian T. Roberts, Frank Ruskey. DM, 183(1-3):265-275, 1998. [doi]

1996

Minimal completely separating systems of setsColin Ramsay, Ian T. Roberts. ajc, 13:129-150, 1996. [doi]

Sign in or sign up to see more results.

runs on WebDSL