| 2008 |
|---|
| 13 | EE | Sophie Huczynska,
Nikola Ruskuc:
Pattern classes of permutations via bijections between linearly ordered sets.
Eur. J. Comb. 29(1): 118-139 (2008) |
| 12 | EE | Robert Brignall,
Nikola Ruskuc,
Vincent Vatter:
Simple permutations: Decidability and unavoidable substructures.
Theor. Comput. Sci. 391(1-2): 150-163 (2008) |
| 2005 |
|---|
| 11 | EE | Mike D. Atkinson,
M. M. Murphy,
Nikola Ruskuc:
Pattern Avoidance Classes and Subpermutations.
Electr. J. Comb. 12: (2005) |
| 10 | EE | Michael H. Albert,
Steve Linton,
Nikola Ruskuc:
The Insertion Encoding of Permutations.
Electr. J. Comb. 12: (2005) |
| 9 | EE | Luis Descalço,
Nikola Ruskuc:
Subsemigroups of the Bicyclic Monoid.
IJAC 15(1): 37-57 (2005) |
| 8 | EE | Ersebet R. Dombi,
Nick D. Gilbert,
Nikola Ruskuc:
Finite Presentability of HNN Extensions of Inverse Semigroups.
IJAC 15(3): 423-436 (2005) |
| 2003 |
|---|
| 7 | EE | Michael H. Albert,
Mike D. Atkinson,
Nikola Ruskuc:
Regular closed sets of permutations.
Theor. Comput. Sci. 306(1-3): 85-100 (2003) |
| 2002 |
|---|
| 6 | EE | Michael Hoffmann,
Richard M. Thomas,
Nikola Ruskuc:
Automatic Semigroups with Subsemigroups of Finite Rees Index.
IJAC 12(3): 463-461 (2002) |
| 5 | EE | Steve Linton,
G. Pfeiffer,
Edmund F. Robertson,
Nikola Ruskuc:
Computing Transformation Semigroups.
J. Symb. Comput. 33(2): 145-162 (2002) |
| 4 | EE | Mike D. Atkinson,
Max Murphy,
Nikola Ruskuc:
Partially Well-Ordered Closed Sets of Permutations.
Order 19(2): 101-113 (2002) |
| 3 | | Mike D. Atkinson,
Max Murphy,
Nikola Ruskuc:
Sorting with two ordered stacks in series.
Theor. Comput. Sci. 289(1): 205-223 (2002) |
| 2001 |
|---|
| 2 | | Friedrich Otto,
Nikola Ruskuc:
Confluent Monadic String-Rewriting Systems and Automatic Structures.
Journal of Automata, Languages and Combinatorics 6(3): 375-388 (2001) |
| 1 | EE | Colin M. Campbell,
Edmund F. Robertson,
Nikola Ruskuc,
Richard M. Thomas:
Automatic semigroups.
Theor. Comput. Sci. 250(1-2): 365-391 (2001) |
