Nikola Ruskuc - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 24 from 24

2024

Decidability of Well Quasi-Order and Atomicity for Equivalence Relations Under Embedding OrderingsVictoria Ironmonger, Nikola Ruskuc. order, 41(3):761-786, December 2024. [doi]

2021

Atomicity and Well Quasi-Order for Consecutive Orderings on Words and PermutationsM. McDevitt, Nikola Ruskuc. siamdm, 35(1):495-520, 2021. [doi]

2017

On well quasi-order of graph classes under homomorphic image orderingsSophie Huczynska, Nikola Ruskuc. ejc, 63:164-175, 2017. [doi]

2011

On convex permutationsMichael H. Albert, Steve Linton, Nikola Ruskuc, Vincent Vatter, Steve Waton. DM, 311(8-9):715-722, 2011. [doi]

Substitution-closed pattern classesM. D. Atkinson, Nikola Ruskuc, Rebecca Smith. JCT, 118(2):317-340, 2011. [doi]

2010

Growth Rates for Subclasses of Av(321)Michael H. Albert, M. D. Atkinson, Robert Brignall, Nikola Ruskuc, Rebecca Smith, J. West. combinatorics, 17(1), 2010. [doi]

Automatic Presentations and Semigroup ConstructionsAlan J. Cain, Graham P. Oliver, Nikola Ruskuc, Richard M. Thomas. mst, 47(2):568-592, 2010. [doi]

2009

Automatic presentations for semigroupsAlan J. Cain, Graham P. Oliver, Nikola Ruskuc, Richard M. Thomas. iandc, 207(11):1156-1168, 2009. [doi]

2008

Simple permutations: Decidability and unavoidable substructuresRobert Brignall, Nikola Ruskuc, Vincent Vatter. TCS, 391(1-2):150-163, 2008. [doi]

Automatic Presentations for Cancellative SemigroupsAlan J. Cain, Graham P. Oliver, Nikola Ruskuc, Richard M. Thomas. LATA 2008: 149-159 [doi]

Pattern classes of permutations via bijections between linearly ordered setsSophie Huczynska, Nikola Ruskuc. ejc, 29(1):118-139, 2008. [doi]

2005

2003

Regular closed sets of permutationsMichael H. Albert, Mike D. Atkinson, Nikola Ruskuc. TCS, 306(1-3):85-100, 2003. [doi]

2002

Automatic Semigroups with Subsemigroups of Finite Rees IndexMichael Hoffmann 0002, Richard M. Thomas, Nikola Ruskuc. ijac, 12(3):463-461, 2002. [doi]

Sorting with two ordered stacks in seriesMike D. Atkinson, Max Murphy, Nikola Ruskuc. TCS, 289(1):205-223, 2002.

Partially Well-Ordered Closed Sets of PermutationsMike D. Atkinson, Max Murphy, Nikola Ruskuc. order, 19(2):101-113, 2002. [doi]

Computing Transformation SemigroupsSteve Linton, G. Pfeiffer, Edmund F. Robertson, Nikola Ruskuc. JSC, 33(2):145-162, 2002. [doi]

2001

Automatic semigroupsColin M. Campbell, Edmund F. Robertson, Nikola Ruskuc, Richard M. Thomas. TCS, 250(1-2):365-391, 2001. [doi]

Confluent Monadic String-Rewriting Systems and Automatic StructuresFriedrich Otto, Nikola Ruskuc. jalc, 6(3):375-388, 2001.

1996

On Subsemigroups and ideals in Free Products of SemigroupsColin M. Campbell, Edmund F. Robertson, Nikola Ruskuc, Richard M. Thomas. ijac, 6(5):571-592, 1996. [doi]

1995

Rewriting a Semigroup PresentationColin M. Campbell, Edmund F. Robertson, Nikola Ruskuc, R. M. Thomas. ijac, 5(1):81-104, 1995. [doi]

Sign in or sign up to see more results.

runs on WebDSL