Andrzej Kisielewicz

J. Graph Theory, 2022

Asymmetric edge-colorings of graphs with three colors.

[BibT_eX]

[DOI]

Eur. J. Comb., 2022

Distinguishing index of graphs with simple automorphism groups.

[BibT_eX]

[DOI]

Eur. J. Comb., 2022

2020

Synchronizing sequences for road colored digraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Graphical representations of cyclic permutation groups.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

2019

Cyclic Permutation Groups that are Automorphism Groups of Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2019

2018

2-closed abelian permutation groups.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2018

Cyclic Automorphism Groups of Graphs and Edge-Colored Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2018

Regular Language Inference for Learning Rules of Simplified Boardgames.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE Conference on Computational Intelligence and Games, 2018

2017

Evaluating Chess-Like Games Using Generated Natural Language Descriptions.

[BibT_eX]

[DOI]

Lukasz Zarczynski

Proceedings of the Advances in Computer Games - 15th International Conferences, 2017

2016

Recognizing 3-collapsing words over a binary alphabet.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Černý conjecture for edge-colored digraphs with few junctions.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2016

Experiments with Synchronizing Automata.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2016

Towards a Real-time Game Description Language.

[BibT_eX]

[DOI]

Proceedings of the 8th International Conference on Agents and Artificial Intelligence (ICAART 2016), 2016

2015

Computing the shortest reset words of synchronizing automata.

[BibT_eX]

[DOI]

J. Comb. Optim., 2015

Synchronizing Automata with Extremal Properties.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Testing general game players against a Simplified Boardgames player using temporal-difference learning.

[BibT_eX]

[DOI]

Proceedings of the IEEE Congress on Evolutionary Computation, 2015

2014

Symmetry groups of boolean functions.

[BibT_eX]

[DOI]

Eur. J. Comb., 2014

Synchronizing Automata with Large Reset Lengths.

[BibT_eX]

[DOI]

CoRR, 2014

Binary 3-compressible automata.

[BibT_eX]

[DOI]

Proceedings of the 15th Italian Conference on Theoretical Computer Science, 2014

2013

The Černý conjecture for automata respecting intervals of a directed graph.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2013

All totally symmetric colored graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2013

Generating Small Automata and the Černý Conjecture.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2013

A Fast Algorithm Finding the Shortest Reset Words.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012

Rainbow Induced Subgraphs in Replication Graphs

[BibT_eX]

[DOI]

CoRR, 2012

2011

Rainbow Induced Subgraphs in Proper Vertex Colorings.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2011

Supergraphs And Graphical Complexity Of Permutation Groups.

[BibT_eX]

Ars Comb., 2011

2010

On the problem of freeness of multiplicative matrix semigroups.

[BibT_eX]

[DOI]

Pawel Gawrychowski

Marin Gutan

Theor. Comput. Sci., 2010

2009

Collapsing words, permutation conditions and coherent colorings of trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Totally symmetric colored graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2009

On the length of shortest 2-collapsing words.

[BibT_eX]

[DOI]

Brunetto Piochi

Discret. Math. Theor. Comput. Sci., 2009

2008

Graphical complexity of products of permutation groups.

[BibT_eX]

[DOI]

Artur Jez

Discret. Math., 2008

2-Synchronizing Words.

[BibT_eX]

[DOI]

Pawel Gawrychowski

Proceedings of the Language and Automata Theory and Applications, 2008

2006

A Combinatorial Approach to Collapsing Words.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Recognizing Collapsing Words is co-NP-Complete.

[BibT_eX]

Proceedings of the 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21, 2006

2004

Pseudo-random properties of self-complementary symmetric graphs.

[BibT_eX]

[DOI]

Wojciech Peisert

J. Graph Theory, 2004

Complexity of Semigroup Identity Checking.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2004

Minimal Expansions of Semilattices.

[BibT_eX]

[DOI]

Peter Jipsen

Int. J. Algebra Comput., 2004

Direct product of automorphism groups of colored graphs.

[BibT_eX]

[DOI]

Discret. Math., 2004

2003

Complete Systems Of Subalgebras.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2003

2002

Essential arities in algebras of finite type and arity trees.

[BibT_eX]

[DOI]

Jerzy Tomasik

Discret. Math., 2002

1998

A Very Strong Set Theory?

[BibT_eX]

[DOI]

Stud Logica, 1998

1995

Upward Drawings on Planes and Speres.

[BibT_eX]

[DOI]

S. Mehdi Hashemi

Ivan Rival

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1995

1989

On Finite Models of Regular Identities.

[BibT_eX]

[DOI]

Józef Dudek