Nikola Ruskuc

Publication Activity (10 Years)

Years Active: 1995-2021
Publications (10 Years): 2

Top Topics

Interval Algebra

Hough Transform

Constraint Satisfaction

Top Venues

SIAM J. Discret. Math.

Int. J. Algebra Comput.

Publications

M. McDevitt, Nikola Ruskuc
Atomicity and Well Quasi-Order for Consecutive Orderings on Words and Permutations. SIAM J. Discret. Math. 35 (1) (2021)
Sophie Huczynska, Nikola Ruskuc
On well quasi-order of graph classes under homomorphic image orderings. Eur. J. Comb. 63 (2017)
Alan J. Cain, Nikola Ruskuc
Subalgebras of FA-presentable algebras CoRR (2012)
Alan J. Cain, Nikola Ruskuc, Richard M. Thomas
Unary FA-Presentable Semigroups. Int. J. Algebra Comput. 22 (4) (2012)
M. D. Atkinson, Nikola Ruskuc, Rebecca Smith
Substitution-closed pattern classes. J. Comb. Theory, Ser. A 118 (2) (2011)
Michael H. Albert, Steve Linton, Nikola Ruskuc, Vincent Vatter, Steve Waton
On convex permutations. Discret. Math. 311 (8-9) (2011)
Michael H. Albert, M. D. Atkinson, Robert Brignall, Nikola Ruskuc, Rebecca Smith, J. West
Growth Rates for Subclasses of Av(321). Electron. J. Comb. 17 (1) (2010)
Alan J. Cain, Graham P. Oliver, Nikola Ruskuc, Richard M. Thomas
Automatic Presentations and Semigroup Constructions. Theory Comput. Syst. 47 (2) (2010)
Alan J. Cain, Graham P. Oliver, Nikola Ruskuc, Richard M. Thomas
Automatic presentations for semigroups. Inf. Comput. 207 (11) (2009)
Robert Brignall, Nikola Ruskuc, Vincent Vatter
Simple permutations: Decidability and unavoidable substructures. Theor. Comput. Sci. 391 (1-2) (2008)
Sophie Huczynska, Nikola Ruskuc
Pattern classes of permutations via bijections between linearly ordered sets. Eur. J. Comb. 29 (1) (2008)
Alan J. Cain, Graham P. Oliver, Nikola Ruskuc, Richard M. Thomas
Automatic Presentations for Cancellative Semigroups. LATA (2008)
Michael H. Albert, Steve Linton, Nikola Ruskuc
The Insertion Encoding of Permutations. Electron. J. Comb. 12 (2005)
Mike D. Atkinson, Maximillian M. Murphy, Nikola Ruskuc
Pattern Avoidance Classes and Subpermutations. Electron. J. Comb. 12 (2005)
Ersebet R. Dombi, Nick D. Gilbert, Nikola Ruskuc
Finite Presentability of HNN Extensions of Inverse Semigroups. Int. J. Algebra Comput. 15 (3) (2005)
Luís Descalço, Nikola Ruskuc
Subsemigroups of the Bicyclic Monoid. Int. J. Algebra Comput. 15 (1) (2005)
Michael H. Albert, Mike D. Atkinson, Nikola Ruskuc
Regular closed sets of permutations. Theor. Comput. Sci. 306 (1-3) (2003)
Mike D. Atkinson, Max Murphy, Nikola Ruskuc
Partially Well-Ordered Closed Sets of Permutations. Order 19 (2) (2002)
Steve Linton, Götz Pfeiffer, Edmund F. Robertson, Nikola Ruskuc
Computing Transformation Semigroups. J. Symb. Comput. 33 (2) (2002)
Mike D. Atkinson, Max Murphy, Nikola Ruskuc
Sorting with two ordered stacks in series. Theor. Comput. Sci. 289 (1) (2002)
Michael Hoffmann, Richard M. Thomas, Nikola Ruskuc
Automatic Semigroups with Subsemigroups of Finite Rees Index. Int. J. Algebra Comput. 12 (3) (2002)
Friedrich Otto, Nikola Ruskuc
Confluent Monadic String-Rewriting Systems and Automatic Structures. J. Autom. Lang. Comb. 6 (3) (2001)
Colin M. Campbell, Edmund F. Robertson, Nikola Ruskuc, Richard M. Thomas
Automatic semigroups. Theor. Comput. Sci. 250 (1-2) (2001)
Colin M. Campbell, Edmund F. Robertson, Nikola Ruskuc, Richard M. Thomas
On Subsemigroups and ideals in Free Products of Semigroups. Int. J. Algebra Comput. 6 (5) (1996)
Colin M. Campbell, Edmund F. Robertson, Nikola Ruskuc, Richard M. Thomas
Rewriting a Semigroup Presentation. Int. J. Algebra Comput. 5 (1) (1995)