 | 2009 |
| 7 |  | Benoit Larose,
Matt Valeriote,
László Zádori:
Omitting Types, Bounded Width and the Ability to Count.
IJAC 19(5): 647-668 (2009) |
| 2007 |
| 6 |  | László Zádori:
Solvability of Systems of Polynomial Equations over Finite Algebras.
IJAC 17(4): 821-835 (2007) |
| 2006 |
| 5 |  | Benoit Larose,
László Zádori:
Taylor Terms, Constraint Satisfaction and the Complexity of Polynomial Equations over Finite Algebras.
IJAC 16(3): 563-582 (2006) |
| 2005 |
| 4 |  | Benoit Larose,
Cynthia Loten,
László Zádori:
A polynomial-time algorithm for near-unanimity graphs.
J. Algorithms 55(2): 177-191 (2005) |
| 2003 |
| 3 |  | Benoit Larose,
László Zádori:
The Complexity of the Extendibility Problem for Finite Posets.
SIAM J. Discrete Math. 17(1): 114-121 (2003) |
| 2001 |
| 2 |  | Csaba Szabó,
László Zádori:
Idempotent Totally Symmetric Operations on Finite Posets.
Order 18(1): 39-47 (2001) |
| 1997 |
| 1 |  | Benoit Larose,
László Zádori:
Algebraic properties and dismantlability of finite posets.
Discrete Mathematics 163(1-3): 89-99 (1997) |