Andrzej Kisielewicz: List of publications

  1. Černý conjecture for edge-colored digraphs with few junctions, Electronic Notes in Discrete Mathematics 54 (2016) 115-120 (with: M. Grech).
  2. Recognizing 3-collapsing words over a binary alphabet, Theoretical Computer Science 629 (2016) 64-79 (with: A. Cherubini).
  3. Towards a Real-time Game Description Language, Proceedings of the 8th International Conference on Agents and Artificial Intelligence, pp. 494-499, 2016 (with: J. Kowalski).
  4. 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).
  5. 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.
  6. Synchronizing Automata with Extremal Properties, MFCS (1) 2015: 331-343, Lecture Notes in Computer Science 9234 (2015), 331-343 (with: M. Szykuła).
  7. Game Description Language for Real-time Games, Proceedings of the IJCAI-15 Workshop on General Game Playing, pp. 23-30, 2015 (with: J. Kowalski).
  8. 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).
  9. Computing the shortest reset words of synchronizing automata, J. Combin. Optim., 29 (2015), 88-124 (with: J. Kowalski, M. Szykuła).
  10. Symmetry groups of boolean functions, European J. Combin. 40 (2014) 1-10; (with: M. Grech )
  11. Binary 3-compressible automata, 15th Italian Conference on Theoretical Computer Science, CEUR Workshop Proceedings (2014), 109-120; (with: A. Cherubini)
  12. The Polish School of Argumentation: A Manifesto, Argumentation 28 (2014) 267-2823. (with: K. Budzyńska at al. )
  13. 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).
  14. Generating small automata and the Černý conjecture, CIAA 2013, Lecture Notes in Computer Science 7982 (2013), 340-348 (with: M. Szykuła).
  15. All totally symmetric colored graphs, Discrete Mathematics and Theoretical Computer Science 15 (1) (2013), 133-146 (with: M. Grech).
  16. 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).
  17. Rainbow induced subgraphs in proper vertex colorings, Fundamenta Informaticae 111 (2011), 437-451 (with: M. Szykuła)
  18. Supergraphs and combinatorial complexity of permutation groups [ ps ], Ars Combinatoria, 101 (2011), 193-207
    (Extended version: Supergraphs. Ideas, results, and problems. [ ps ].)
  19. On the problem of freenes of multiplicative matrix semigroups, Theoretical Computer Science 411 (2010), 1115-1120 (with: P. Gawrychowski, M. Gutan)
  20. Collapsing words, permutation conditions and coherent colorings of trees, Theoretical Computer Science 410 (2009), 2135-2147 (with: A. Cherubini)
  21. Totally symmetric colored graphs (with: M. Grech ), J. Graph Theory 62 (2009), 329-345.
  22. On the length of shortest 2-collapsing words, Discrete Mathematics and Theoretical Computer Science 11 (2009), 33--44 (with: A. Cherubini, B. Piochi)
  23. 2-sychronizing words, Language and Automata Theory and Applications 2008, Lect. Notes Comput. Sci. 5196, pp. 221-231, 2008. (with: P. Gawrychowski).
  24. Graphical complexity of products of permutation groups (with: M. Grech, A. Je¿ ), Discrete Math. 308 (2008), 1142-1152.
  25. 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).
  26. 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 ).
  27. Rings and semigroups with permutable zero products, (with: M. Gutan), J. Pure and Applied Algebra, 206 (2006), 355-369.
  28. 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 ).
  29. Reversible group rings (with M. Gutan), J. Algebra. 279 (2004), 280-291.
  30. Pseudo-random properties of self-complementary symmetric graphs (with W. Peisert) J. Graph Theory 47 (2004), 310-316.
  31. Direct product of automorphism groups of coloured graphs (with M. Grech), Discrete Math. 283 (2004), 81-86.
  32. Complexity of identity checking problem for semigroups, Internat. J. Algebra Comput. 14 (2004), 455-464.
  33. Minimal expansions of semilattices (with P. Jipsen), Internat. J. Algebra Comput. 14 (2004), 465-477.
  34. Definabilty in the lattice of equational theories of commutative semigroups, Trans. Amer. Math. Soc. 356 (2004), 3483-3504.
  35. Semigroups with good and bad magnifiers (with M. Gutan), J.  Algebra 267 (2003), 587-607.
  36. Complete systems of minimal algebras, Internat. J.  Algebra Comput. 13 (2003), 69-79.
  37. Essential arities in algebras of finite type and arity trees, Discrete Math., 248 (2002), 79-91, (with J. Tomasik ).
  38. Permutability class of a semigroup, J. Algebra 226 (2000), 295-310.
  39. Covering relation for equational theories of commutative semigroups, J. Algebra 232 (2000), 493-506 (with M. Grech).
  40. A very strong set theory, Studia Logica 61 (1998), 171-178.
  41. Unification in commutative semigroups, J. Algebra 200 (1998), 246-257.
  42. Symmetry groups of boolean functions and constructions of permutation groups, J. Algebra 199 (1998), 379-403.
  43. The complexity of upward drawings on spheres, Order 14 (1997), 327-363 (with S.M. Hashemi, I. Rival).
  44. Austin identities, Algebra Universalis 38 (1997), 324-328.
  45. On the minimal extension of the sequence (0, 1, 1, 7), Algebra Universalis 37 (1997), 445-447 (with D. Wang).
  46. 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.
  47. 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).
  48. Varieties of commutative semigroups, Trans. Amer. Math. Soc. 342 (1994), 275-306.
  49. On the number of operations in a clone Proc. Amer. Math. Soc. 122 (1994), 359-369 (with J. Berman ).
  50. Every triangle-free planar graph has a planar upward drawing, Order 10 (1993), 1-16 (with I. Rival).
  51. Polynomial density of commutative semigroups, Bull. Austral. Math. Soc. 48 (1993), 151-162 (with N. Newrly).
  52. 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).
  53. An equational basis in four variables for the three-element tournament, Colloq. Math. 63 (1992),41-44 (with G. Grätzer, B. Wolk).
  54. All pseudovarieties of commutative semigroups, in Semigroups with applications (Oberwolfach, 1991), (J.M. Howie et al. eds), World Scientific, Singapore, 1992, pp. 78-89.
  55. Totally commutative semigroups, J. Austral. Math. Soc., Ser A 51 (1991), 381-399 (with J. Dudek).
  56. The pn-sequences of idempotent algebras are strictly increasing, II, Algebra Universalis 28 (1991), 453-458.
  57. Idempotent algebras with log-linear free spectra, Algebra Universalis 28 (1991), 119-127 (with J. Dudek).
  58. 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.
  59. On reduction theorems in the problem of composition of functions, Fund. Math. 135 (1990), 203-211.
  60. Double extension set theory, Reports on Math. Logic 23 (1989), 81-89.
  61. On finite models of regular identities, Notre Dame J. Formal Logic 30 (1989), 624-628 (with J. Dudek).
  62. On algebras with bases of different cardinalities, Fund. Math. 133 (1989), 147-154.
  63. On composition of idempotent functions, Acta. Sci. Math. (Szeged) 53 (1989), 217-223.
  64. Ternary clones: a problem of Fajtlowicz, Houston J. Math. 14 (1988), 515-527.
  65. Marczewski's problem on algebras with bases of different cardinalities - solution and generalization, Bull. Polish Acad. Sci. Math. 36 (1988), 11-13,
  66. A solution of Dedekind`s problem on the number of isotone Boolean functions, J. Reine Angew. Math. 386 (1988), 139-144.
  67. Characterization of pn-sequences for nonidempotent algebras, J. Algebra 108 (1987), 102-115.
  68. On idempotent algebras with pn = 2n, Algebra Universalis 23 (1986), 313-323.
  69. Minimal extensions of minimal representable sequences, Algebra Universalis 22 (1986), 244-252.
  70. Codes of varieties, Bull. Polish Acad. Sci. Math. 34 (1986), 1-6 (with J. Dudek, J. Tomasik ).
  71. (5 years break ...)

  72. The pn-sequences of idempotent algebras are strictly increasing, Algebra Universalis 13 (1981), 233-250.
  73. A remark on diagonal algebras, Algebra Universalis 12 (1981), 200-204.

    BOOKS ( in Polish )

  1. Sztuczna inteligencja i logika. Podsumowanie przedsięwzięcia naukowego. [ Artificial intelligence and logic. An account of a scientific venture ], WNT, Warszawa 2011, 380 pp., wydanie drugie: Wydawnictwo WNT, Warszawa 2015.

  2. Wprowadzenie do informatyki. Poradnik ucznia i nauczyciela. [ An introduction to computers ], Helion 2002, 164 pp. Wydanie drugie Helion 2005, 196pp.

  3. Logika i zdrowy rozsądek [ Logic and commonsense ], manuskrypt, 189 pp.
Back to my main page... Last modified: ...recently