| 2009 |
| 13 | EE | Alessandra Cherubini,
Andrzej Kisielewicz:
Collapsing words, permutation conditions and coherent colorings of trees.
Theor. Comput. Sci. 410(21-23): 2135-2147 (2009) |
| 2008 |
| 12 | EE | Pawel Gawrychowski,
Andrzej Kisielewicz:
2-Synchronizing Words.
LATA 2008: 221-231 |
| 11 | EE | Mariusz Grech,
Artur Jez,
Andrzej Kisielewicz:
Graphical complexity of products of permutation groups.
Discrete Mathematics 308(7): 1142-1152 (2008) |
| 2006 |
| 10 | EE | Alessandra Cherubini,
Pawel Gawrychowski,
Andrzej Kisielewicz,
B. Piochi:
A Combinatorial Approach to Collapsing Words.
MFCS 2006: 256-266 |
| 2004 |
| 9 | EE | Mariusz Grech,
Andrzej Kisielewicz:
Direct product of automorphism groups of colored graphs.
Discrete Mathematics 283(1-3): 81-86 (2004) |
| 8 | EE | Andrzej Kisielewicz:
Complexity of Semigroup Identity Checking.
IJAC 14(4): 455-464 (2004) |
| 7 | EE | P. Jipsen,
Andrzej Kisielewicz:
Minimal Expansions of Semilattices.
IJAC 14(4): 465-477 (2004) |
| 6 | EE | Andrzej Kisielewicz,
Wojciech Peisert:
Pseudo-random properties of self-complementary symmetric graphs.
Journal of Graph Theory 47(4): 310-316 (2004) |
| 2003 |
| 5 | EE | Andrzej Kisielewicz:
Complete Systems Of Subalgebras.
IJAC 13(1): 69-79 (2003) |
| 2002 |
| 4 | EE | Andrzej Kisielewicz,
Jerzy Tomasik:
Essential arities in algebras of finite type and arity trees.
Discrete Mathematics 248(1-3): 79-91 (2002) |
| 1998 |
| 3 | | Andrzej Kisielewicz:
A Very Strong Set Theory?
Studia Logica 61(2): 171-178 (1998) |
| 1995 |
| 2 | | S. Mehdi Hashemi,
Andrzej Kisielewicz,
Ivan Rival:
Upward Drawings on Planes and Speres.
Graph Drawing 1995: 277-286 |
| 1989 |
| 1 | | Józef Dudek,
Andrzej Kisielewicz:
On Finite Models of Regular Identities.
Notre Dame Journal of Formal Logic 30(4): 624-628 (1989) |