A Finite 5-Pebble-Automaton Can Search Every Maze. - Andrzej Szepietowski (Inf. Process. Lett., 1982)

Remarks on Searching Labyrinths by Automata. - Andrzej Szepietowski (FCT, 1983)

On Searching Plane Labyrinths by 1-Pebble-Automata. - Andrzej Szepietowski (J. Inf. Process. Cybern., 1983)

On Paterson's Problem. - Andrzej Szepietowski (J. Inf. Process. Cybern., 1985)

There are no Fully Space Constructible Functions Between log log n and log n. - Andrzej Szepietowski (Inf. Process. Lett., 1987)

Remarks on Languages Acceptable in log n Space. - Andrzej Szepietowski (Inf. Process. Lett., 1988)

Some Remarks on the Alternating Hierarchy and Closure Under Complement for Sublogarithmic Space. - Andrzej Szepietowski (Inf. Process. Lett., 1989)

Some Notes on Strong and Weak log log n Space Complexity. - Andrzej Szepietowski (Inf. Process. Lett., 1989)

On three-way two-dimensional turing machines. - Andrzej Szepietowski (Inf. Sci., 1989)

A week mode of space complexity can be used in the proof that [DSPACE(log log n) = NSPACE(log logn)] => [L = NL]. - Andrzej Szepietowski (Bull. EATCS, 1990)

If Deterministic and Nondeterministic Space Complexities are Equal for log log n, then they are also Equal for log n. - Andrzej Szepietowski (Theor. Comput. Sci., 1990)

On three-way two-dimensional multicounter automata. - Andrzej Szepietowski (Inf. Sci., 1991)

Two-dimensional on-line tessellation acceptors are not closed under complement. - Andrzej Szepietowski (Inf. Sci., 1992)

Some remarks on two-dimensional finite automata. - Andrzej Szepietowski (Inf. Sci., 1992)

On space functions constructed by two-dimensional turing machines. - Andrzej Szepietowski (Inf. Sci., 1992)

Turing Machines with Sublogarithmic Space - Andrzej Szepietowski (Springer, 1994)

The Element Distinctness Problem on One-Tape Turing Machines. - Andrzej Szepietowski (Inf. Process. Lett., 1996)

Weak and Strong One-Way Space Complexity Classes. - Andrzej Szepietowski (Inf. Process. Lett., 1998)

There is no complete axiom system for shuffle expressions. - Andrzej Szepietowski (RAIRO Theor. Informatics Appl., 1999)

Lower space bounds for accepting shuffle languages. - Andrzej Szepietowski (RAIRO Theor. Informatics Appl., 1999)

The Emptiness Problem for Weak Rabin Tree Automata. - Jakub Neumann; Andrzej Szepietowski (DCFS, 2001)

Algorithms counting monotone Boolean functions. - Robert Fidytek; Andrzej Wlodzimierz Mostowski; Rafal Somla; Andrzej Szepietowski (Inf. Process. Lett., 2001)

On the expressive power of the shuffle operator matched with intersection by regular sets. - Joanna Jedrzejowicz; Andrzej Szepietowski (RAIRO Theor. Informatics Appl., 2001)

Shuffle languages are in P. - Joanna Jedrzejowicz; Andrzej Szepietowski (Theor. Comput. Sci., 2001)

Complexity of weak acceptance conditions in tree automata. - Jakub Neumann; Andrzej Szepietowski; Igor Walukiewicz (Inf. Process. Lett., 2002)

The Counterfeit Coin Problem. - Andrzej Szepietowski; Monika Targan (Bull. EATCS, 2004)

A note on the oriented chromatic number of grids. - Andrzej Szepietowski; Monika Targan (Inf. Process. Lett., 2004)

A note on alternating one-pebble Turing machines with sublogarithmic space. - Andrzej Szepietowski (Inf. Process. Lett., 2006)

Fooling Turing machines with sublogarithmic space: a note on 'For completeness, sublogarithmic space is no space' by M. Agrawal. - Andrzej Szepietowski (Inf. Process. Lett., 2008)

Fault-tolerant edge and vertex pancyclicity in alternating group graphs. - Andrzej Szepietowski (Appl. Math. Comput., 2010)

Fault tolerance of vertex pancyclicity in alternating group graphs. - Andrzej Szepietowski (Appl. Math. Comput., 2011)

Closure properties of hyper-minimized automata. - Andrzej Szepietowski (RAIRO Theor. Informatics Appl., 2011)

Fault tolerance of edge pancyclicity in alternating group graphs. - Andrzej Szepietowski (Appl. Math. Comput., 2012)

Hamiltonian cycles in hypercubes with 2n-4 faulty edges. - Andrzej Szepietowski (Inf. Sci., 2012)

Coloring directed cycles. - Andrzej Szepietowski (CoRR, 2013)

The oriented chromatic number of Halin graphs. - Janusz Dybizbanski; Andrzej Szepietowski (Inf. Process. Lett., 2014)

Hamiltonian paths in hypercubes with local traps. - Janusz Dybizbanski; Andrzej Szepietowski (Inf. Sci., 2017)

Hamiltonian cycles in hypercubes with faulty edges. - Janusz Dybizbanski; Andrzej Szepietowski (Int. J. Comput. Math. Comput. Syst. Theory, 2018)

Negative closed walks in signed graphs: A note. - Andrzej Szepietowski (CoRR, 2019)

Oriented cliques and colorings of graphs with low maximum degree. - Janusz Dybizbanski; Pascal Ochem; Alexandre Pinlou; Andrzej Szepietowski (Discret. Math., 2020)

Membership Problem for Two-Dimensional General Row Jumping Finite Automata. - Grzegorz Madejski; Andrzej Szepietowski (Int. J. Found. Comput. Sci., 2020)

Signed coloring of 2-dimensional grids. - Janusz Dybizbanski; Anna Nenca; Andrzej Szepietowski (Inf. Process. Lett., 2020)

Hamiltonian cycles and paths in hypercubes with disjoint faulty edges. - Janusz Dybizbanski; Andrzej Szepietowski (Inf. Process. Lett., 2021)