- Orbit closed permutation groups, relation groups, and simple groups. J. Algebraic Combinatorics 57 (2023), 1045-1072 (with: M. Grech).
- Asymmetric edge-colorings of graphs with three colors, European J. Combinatorics 106 (2022) 103526 (with: M. Grech).
- Wreath product in automorphism groups of graphs, J. Graph Theory (2022), 101 (2022) 29-51 (with: M. Grech).
- Distinguishing index of graphs with simple automorphism groups, European J. Combinatorics 99 (2022),
103414 (with: M. Grech),
- Abelian permutation groups with graphical representations, J. Algebraic Combinatorics 55(2) (2022), 513-531 (with: M. Grech),
- Synchronizing sequences for road colored digraphs, Discrete Applied Mathematics 285 (2020), 128-140 (with: M. Grech).
- Graphical representations of cyclic permutation groups, Discrete Applied Mathematics 277 (2020), 172-179 (with: M. Grech).
- Cyclic permutation groups that are automorphism groups of graphs, Graphs and Combinatorics 35 (6) (2019), 1405-1432 (with: M. Grech).
- Odpowiedź na polemiki i komentarze do mojej książki „Logika i argumentacja”, Studia Philosophica Wratislaviensia 13 (3) (2018), 137-170.
- Wprowadzenie do dyskusji (Sympozjum na temat książki „Logika i argumentacja” Andrzeja Kisielewicza), Studia Philosophica Wratislaviensia 13 (3) (2018), 43-48.
- 2-closed abelian permutation groups, Electronic Notes in Discrete Mathematics 68 (2018) 83-88
(with: M. Grech).
- Regular Language Inference for Learning Rules of Simplified Boardgames, 2018 IEEE Conference on Computational Intelligence and Games, CIG 2018, pp. 1-8
(with: J. Kowalski).
- Cyclic Automorphism Groups of Graphs and Edge-Colored Graphs, Electronic Notes in Discrete Mathematics 68 (2018) 41-46
(with: M. Grech).
- Evaluating Chess-Like Games Using Generated Natural Language Descriptions, Advances in Computer Games - 15th International Conferences, ACG 2017, Lecture Notes in Computer Science 10664 (2017), pp. 127-139,
(with: J. Kowalski, and Ł. Żarczyński).
- Černý conjecture for edge-colored digraphs with few junctions, Electronic Notes in Discrete Mathematics 54 (2016) 115-120
(with: M. Grech).
- Recognizing 3-collapsing words over a binary alphabet, Theoretical Computer Science 629 (2016) 64-79
(with: A. Cherubini).
- Towards a Real-time Game Description Language, Proceedings of the 8th International Conference on Agents and Artificial Intelligence, 2016 2016, pp. 494-499
(with: J. Kowalski).
- Experiments with Synchronizing Automata, CIAA 2016: Implementation and Application of Automata, Lecture Notes in Computer Science 9705 (2016), pp. 176-188
(with: J. Kowalski, M. Szykuła).
- A new approach to argumentation and reasoning based on mathematical practice, Proceedings of the first European Conference on Argumentation, Lisbon, June 2015, pp. 269-285, Studies in Logic and Argumentation 62, College Publications 2016.
- Synchronizing Automata with Extremal Properties, MFCS (1) 2015: 331-343, Lecture Notes in Computer Science 9234 (2015), 331-343
(with: M. Szykuła).
- Game Description Language for Real-time Games, Proceedings of the IJCAI-15 Workshop on General Game Playing, pp. 23-30, 2015
(with: J. Kowalski).
- Testing General Game Players Against a Simplified Boardgames Player Using Temporal-difference Learning, IEEE Congress on Evolutionary Computation, IEEE 2015, pages 1466-1473
(with: J. Kowalski).
- Computing the shortest reset words of synchronizing automata,
J. Combin. Optim., 29 (2015), 88-124 (with: J. Kowalski, M. Szykuła).
- Symmetry groups of boolean functions, European J. Combin. 40 (2014) 1-10;
(with: M. Grech )
- Binary 3-compressible automata, 15th Italian Conference on Theoretical Computer Science, CEUR Workshop Proceedings (2014), 109-120;
(with: A. Cherubini)
- The Polish School of Argumentation: A Manifesto, Argumentation 28 (2014) 267-2823.
(with: K. Budzyńska at al. )
- The Černý conjecture for automata respecting intervals of a directed
graph, Discrete Mathematics and Theoretical Computer Science 15 (3) (2013), 61-72 (with: M. Grech).
- Generating small automata and the Černý conjecture, CIAA 2013, Lecture Notes in
Computer Science 7982 (2013), 340-348 (with: M. Szykuła).
- All totally symmetric colored graphs, Discrete Mathematics and Theoretical Computer Science 15 (1) (2013), 133-146 (with: M. Grech).
- A fast algorithm finding the shortest reset words, COCOON 2013, Lecture Notes in Computer
Science 7936 (2013), 182-196 (with: J. Kowalski, M. Szykuła).
- Rainbow induced subgraphs in proper vertex colorings, Fundamenta Informaticae
111 (2011), 437-451 (with: M. Szykuła)
- Supergraphs and combinatorial complexity of permutation groups
[ ps ], Ars Combinatoria, 101 (2011), 193-207
(Extended version: Supergraphs. Ideas, results, and problems. [ ps ].)
- On the problem of freenes of multiplicative matrix semigroups, Theoretical Computer Science
411 (2010), 1115-1120 (with: P. Gawrychowski, M. Gutan)
- Collapsing words, permutation conditions and coherent colorings of trees, Theoretical Computer Science
410 (2009), 2135-2147 (with: A. Cherubini)
- Totally symmetric colored graphs (with: M. Grech ),
J. Graph Theory 62 (2009), 329-345.
- On the length of shortest 2-collapsing words, Discrete Mathematics and Theoretical Computer Science 11
(2009), 33--44 (with: A. Cherubini, B. Piochi)
- 2-sychronizing words,
Language and Automata Theory and Applications 2008, Lect. Notes Comput. Sci. 5196, pp. 221-231, 2008.
(with: P. Gawrychowski).
- Graphical complexity of products of permutation groups (with: M. Grech, A. Jeż ),
Discrete Math. 308 (2008), 1142-1152.
- A bound for the length of shortest
2-collapsing words, in: B. Arnoux, M. Cassaigne (eds.), Proceedings of the 6th International
Conference on Words,
Institut de Mathématique de Luminy, 2007, 90--99 (with: A. Cherubini, B. Piochi).
- Recognizing collapsing words is co-NP-complete, in: H. Leung, G. Pighizzini (eds.), Proceedings of the 8th
International Workshop on Descriptional Complexity of Formal Systems, Las Cruces, NM, USA, 2006, pp. 106-117,
(with: A. Cherubini ).
- Rings and semigroups with permutable zero products, (with:
M. Gutan), J. Pure and Applied Algebra, 206 (2006),
355-369.
- A combinatorial approach to collapsing words, Mathematical Foundations
of Computer Science 2006, Lect. Notes Comput. Sci. 4162, Springer, Berlin
2006, 256-266, (with: A. Cherubini, P. Gawrychowski, B. Piochi ).
- Reversible group rings (with
M. Gutan), J. Algebra. 279 (2004), 280-291.
- Pseudo-random properties of self-complementary symmetric graphs (with W. Peisert)
J. Graph Theory 47 (2004), 310-316.
- Direct product of automorphism groups of coloured graphs (with M. Grech),
Discrete Math. 283 (2004), 81-86.
- Complexity of identity checking problem for semigroups, Internat. J. Algebra Comput.
14 (2004), 455-464.
- Minimal expansions of semilattices (with P. Jipsen),
Internat. J. Algebra Comput. 14 (2004), 465-477.
- Definabilty in the lattice of equational theories of commutative semigroups,
Trans. Amer. Math. Soc. 356 (2004), 3483-3504.
- Semigroups with good and bad magnifiers
(with M. Gutan), J. Algebra
267 (2003), 587-607.
- Complete systems of minimal algebras, Internat. J.
Algebra Comput. 13 (2003), 69-79.
- Essential arities in algebras of finite type and arity trees, Discrete Math., 248 (2002), 79-91,
(with J. Tomasik ).
- Permutability class of a semigroup, J. Algebra 226 (2000), 295-310.
- Covering relation for equational theories of commutative semigroups, J. Algebra 232 (2000), 493-506 (with M. Grech).
- A very strong set theory, Studia Logica 61 (1998), 171-178.
- Unification in commutative semigroups, J. Algebra 200 (1998), 246-257.
- Symmetry groups of boolean functions and constructions of permutation groups, J. Algebra 199 (1998), 379-403.
- The complexity of upward drawings on spheres, Order 14 (1997), 327-363 (with S.M. Hashemi, I. Rival).
- Austin identities, Algebra Universalis 38 (1997), 324-328.
- On the minimal extension of the sequence (0, 1, 1, 7), Algebra Universalis 37 (1997), 445-447 (with D. Wang).
- Easy planarity testing for ordered sets, in Operations Research Proceedings 1966, (ed. U. Zimmermann at al.), Springer-Verlag Berlin Heilderberg New York 1997, 151-156.
- Upward drawings on planes and spheres (extended abstract), in Graph drawing (Passau, 1995), Lecture Notes in Comput. Sci. 1027 (1996), 277-286 (with
S.M. Hashemi, I. Rival).
- Varieties of commutative semigroups, Trans. Amer. Math. Soc. 342 (1994), 275-306.
- On the number of operations in a clone Proc. Amer. Math. Soc. 122 (1994), 359-369 (with J. Berman ).
- Every triangle-free planar graph has a planar upward drawing, Order 10 (1993), 1-16 (with
I. Rival).
- Polynomial density of commutative semigroups, Bull. Austral. Math. Soc. 48 (1993), 151-162 (with N. Newrly).
- A survey of some open problems on pn-sequences and free spectra of algebras and varieties, Universal Algebra and Quasigroup Theory, (A. Romanowska, J. D. H. Smith, eds.), Haldermann Verlag, Berlin, 1992, 57-88 (with G. Grätzer).
- An equational basis in four variables for the three-element tournament, Colloq. Math. 63 (1992),41-44 (with
G. Grätzer, B. Wolk).
- All pseudovarieties of commutative semigroups, in Semigroups with applications (Oberwolfach, 1991), (J.M. Howie et al. eds), World Scientific, Singapore, 1992, pp. 78-89.
- Totally commutative semigroups, J. Austral. Math. Soc., Ser A 51 (1991), 381-399 (with J. Dudek).
- The pn-sequences of idempotent algebras are strictly increasing, II, Algebra Universalis 28 (1991), 453-458.
- Idempotent algebras with log-linear free spectra, Algebra Universalis 28 (1991), 119-127
(with J. Dudek).
- Varieties of algebras with no nontrivial finite members, in Lattices, semigroups, and universal algebra (Lisbon, 1988), (J. Almeida et al. eds), Plenum Press, New York, London, 1990, pp. 129-136.
- On reduction theorems in the problem of composition of functions, Fund. Math. 135 (1990), 203-211.
- Double extension set theory, Reports on Math. Logic 23 (1989), 81-89.
- On finite models of regular identities, Notre Dame J. Formal Logic 30 (1989), 624-628 (with J. Dudek).
- On algebras with bases of different cardinalities, Fund. Math. 133 (1989), 147-154.
- On composition of idempotent functions, Acta. Sci. Math. (Szeged) 53 (1989), 217-223.
- Ternary clones: a problem of Fajtlowicz, Houston J. Math. 14 (1988), 515-527.
- Marczewski's problem on algebras with bases of different cardinalities - solution and generalization, Bull. Polish Acad. Sci. Math. 36 (1988), 11-13,
- A solution of Dedekind`s problem on the number of isotone Boolean functions, J. Reine Angew. Math. 386 (1988), 139-144.
-
Characterization of pn-sequences for nonidempotent algebras, J. Algebra 108 (1987), 102-115.
-
On idempotent algebras with pn = 2n, Algebra Universalis 23 (1986), 313-323.
-
Minimal extensions of minimal representable sequences, Algebra Universalis 22 (1986), 244-252.
-
Codes of varieties, Bull. Polish Acad. Sci. Math. 34 (1986), 1-6 (with J. Dudek, J. Tomasik ).
(5 years break ...)
-
The pn-sequences of idempotent algebras are strictly increasing, Algebra Universalis 13 (1981), 233-250.
-
A remark on diagonal algebras, Algebra Universalis 12 (1981), 200-204.
|