default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrzej Kisielewicz 0001
Person information
- affiliation: Wrocław University of Science and Technology, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j29]Mariusz Grech, Andrzej Kisielewicz:
Distinguishing index of graphs with simple automorphism groups. Eur. J. Comb. 99: 103414 (2022)- [j28]Mariusz Grech, Andrzej Kisielewicz:
Asymmetric edge-colorings of graphs with three colors. Eur. J. Comb. 106: 103526 (2022) - [j27]Mariusz Grech
, Andrzej Kisielewicz:
Wreath product in automorphism groups of graphs. J. Graph Theory 101(1): 29-51 (2022) - 2020
- [j26]Mariusz Grech, Andrzej Kisielewicz:
Graphical representations of cyclic permutation groups. Discret. Appl. Math. 277: 172-179 (2020) - [j25]Mariusz Grech, Andrzej Kisielewicz:
Synchronizing sequences for road colored digraphs. Discret. Appl. Math. 285: 128-140 (2020)
2010 – 2019
- 2019
- [j24]Mariusz Grech, Andrzej Kisielewicz:
Cyclic Permutation Groups that are Automorphism Groups of Graphs. Graphs Comb. 35(6): 1405-1432 (2019) - 2018
- [j23]Mariusz Grech, Andrzej Kisielewicz:
Cyclic Automorphism Groups of Graphs and Edge-Colored Graphs. Electron. Notes Discret. Math. 68: 41-46 (2018) - [j22]Mariusz Grech, Andrzej Kisielewicz:
2-closed abelian permutation groups. Electron. Notes Discret. Math. 68: 83-88 (2018) - [c13]Jakub Kowalski, Andrzej Kisielewicz:
Regular Language Inference for Learning Rules of Simplified Boardgames. CIG 2018: 1-8 - 2017
- [c12]Jakub Kowalski, Lukasz Zarczynski, Andrzej Kisielewicz:
Evaluating Chess-Like Games Using Generated Natural Language Descriptions. ACG 2017: 127-139 - 2016
- [j21]Mariusz Grech, Andrzej Kisielewicz:
Černý conjecture for edge-colored digraphs with few junctions. Electron. Notes Discret. Math. 54: 115-120 (2016) - [j20]Alessandra Cherubini, Andrzej Kisielewicz:
Recognizing 3-collapsing words over a binary alphabet. Theor. Comput. Sci. 629: 64-79 (2016) - [c11]Jakub Kowalski, Andrzej Kisielewicz:
Towards a Real-time Game Description Language. ICAART (2) 2016: 494-499 - [c10]Andrzej Kisielewicz, Jakub Kowalski, Marek Szykula:
Experiments with Synchronizing Automata. CIAA 2016: 176-188 - [i6]Andrzej Kisielewicz, Jakub Kowalski, Marek Szykula:
Experiments with Synchronizing Automata. CoRR abs/1607.04025 (2016) - [i5]Andrzej Kisielewicz, Marek Szykula:
Synchronizing Automata with Extremal Properties. CoRR abs/1608.01268 (2016) - 2015
- [j19]Andrzej Kisielewicz, Jakub Kowalski, Marek Szykula:
Computing the shortest reset words of synchronizing automata. J. Comb. Optim. 29(1): 88-124 (2015) - [c9]Jakub Kowalski, Andrzej Kisielewicz:
Testing general game players against a Simplified Boardgames player using temporal-difference learning. CEC 2015: 1466-1473 - [c8]Andrzej Kisielewicz, Marek Szykula:
Synchronizing Automata with Extremal Properties. MFCS (1) 2015: 331-343 - 2014
- [j18]Mariusz Grech, Andrzej Kisielewicz:
Symmetry groups of boolean functions. Eur. J. Comb. 40: 1-10 (2014) - [c7]Alessandra Cherubini, Andrzej Kisielewicz:
Binary 3-compressible automata. ICTCS 2014: 109-120 - [i4]Andrzej Kisielewicz, Marek Szykula:
Synchronizing Automata with Large Reset Lengths. CoRR abs/1404.3311 (2014) - 2013
- [j17]Mariusz Grech, Andrzej Kisielewicz:
All totally symmetric colored graphs. Discret. Math. Theor. Comput. Sci. 15(1): 133-146 (2013) - [j16]Mariusz Grech, Andrzej Kisielewicz:
The Černý conjecture for automata respecting intervals of a directed graph. Discret. Math. Theor. Comput. Sci. 15(3): 61-72 (2013) - [c6]Andrzej Kisielewicz, Jakub Kowalski, Marek Szykula:
A Fast Algorithm Finding the Shortest Reset Words. COCOON 2013: 182-196 - [c5]Andrzej Kisielewicz, Marek Szykula:
Generating Small Automata and the Černý Conjecture. CIAA 2013: 340-348 - 2012
- [i3]Marek Szykula, Andrzej Kisielewicz:
Rainbow Induced Subgraphs in Replication Graphs. CoRR abs/1201.5340 (2012) - [i2]Andrzej Kisielewicz, Jakub Kowalski, Marek Szykula:
Fast algorithm finding the shortest reset words. CoRR abs/1203.2822 (2012) - [i1]Mariusz Grech, Andrzej Kisielewicz:
The Cerny conjecture for automata respecting intervals of a directed graph. CoRR abs/1207.2556 (2012) - 2011
- [j15]Andrzej Kisielewicz:
Supergraphs And Graphical Complexity Of Permutation Groups. Ars Comb. 101: 193-207 (2011) - [j14]Andrzej Kisielewicz, Marek Szykula:
Rainbow Induced Subgraphs in Proper Vertex Colorings. Fundam. Informaticae 111(4): 437-451 (2011) - 2010
- [j13]Pawel Gawrychowski, Marin Gutan, Andrzej Kisielewicz:
On the problem of freeness of multiplicative matrix semigroups. Theor. Comput. Sci. 411(7-9): 1115-1120 (2010)
2000 – 2009
- 2009
- [j12]Alessandra Cherubini, Andrzej Kisielewicz, Brunetto Piochi:
On the length of shortest 2-collapsing words. Discret. Math. Theor. Comput. Sci. 11(1): 33-44 (2009) - [j11]Mariusz Grech, Andrzej Kisielewicz:
Totally symmetric colored graphs. J. Graph Theory 62(4): 329-345 (2009) - [j10]Alessandra Cherubini, Andrzej Kisielewicz:
Collapsing words, permutation conditions and coherent colorings of trees. Theor. Comput. Sci. 410(21-23): 2135-2147 (2009) - 2008
- [j9]Mariusz Grech, Artur Jez, Andrzej Kisielewicz:
Graphical complexity of products of permutation groups. Discret. Math. 308(7): 1142-1152 (2008) - [c4]Pawel Gawrychowski, Andrzej Kisielewicz:
2-Synchronizing Words. LATA 2008: 221-231 - 2006
- [c3]Alessandra Cherubini, Andrzej Kisielewicz:
Recognizing Collapsing Words is co-NP-Complete. DCFS 2006: 106-117 - [c2]Alessandra Cherubini, Pawel Gawrychowski, Andrzej Kisielewicz, Brunetto Piochi:
A Combinatorial Approach to Collapsing Words. MFCS 2006: 256-266 - 2004
- [j8]Mariusz Grech, Andrzej Kisielewicz:
Direct product of automorphism groups of colored graphs. Discret. Math. 283(1-3): 81-86 (2004) - [j7]Andrzej Kisielewicz:
Complexity of Semigroup Identity Checking. Int. J. Algebra Comput. 14(4): 455-464 (2004) - [j6]Peter Jipsen, Andrzej Kisielewicz:
Minimal Expansions of Semilattices. Int. J. Algebra Comput. 14(4): 465-477 (2004) - [j5]Andrzej Kisielewicz, Wojciech Peisert:
Pseudo-random properties of self-complementary symmetric graphs. J. Graph Theory 47(4): 310-316 (2004) - 2003
- [j4]Andrzej Kisielewicz:
Complete Systems Of Subalgebras. Int. J. Algebra Comput. 13(1): 69-79 (2003) - 2002
- [j3]Andrzej Kisielewicz, Jerzy Tomasik:
Essential arities in algebras of finite type and arity trees. Discret. Math. 248(1-3): 79-91 (2002)
1990 – 1999
- 1998
- [j2]Andrzej Kisielewicz:
A Very Strong Set Theory? Stud Logica 61(2): 171-178 (1998) - 1995
- [c1]S. Mehdi Hashemi, Andrzej Kisielewicz, Ivan Rival:
Upward Drawings on Planes and Speres. GD 1995: 277-286
1980 – 1989
- 1989
- [j1]Józef Dudek, Andrzej Kisielewicz:
On Finite Models of Regular Identities. Notre Dame J. Formal Log. 30(4): 624-628 (1989)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
