Andrzej Szepietowski

Publication Activity (10 Years)

Years Active: 1982-2021
Publications (10 Years): 9

Top Topics

Edge Enhancement

Top Venues

Inf. Process. Lett.

Int. J. Found. Comput. Sci.

Publications

Janusz Dybizbanski, Andrzej Szepietowski
Hamiltonian cycles and paths in hypercubes with disjoint faulty edges. Inf. Process. Lett. 172 (2021)
Grzegorz Madejski, Andrzej Szepietowski
Membership Problem for Two-Dimensional General Row Jumping Finite Automata. Int. J. Found. Comput. Sci. 31 (4) (2020)
Janusz Dybizbanski, Pascal Ochem, Alexandre Pinlou, Andrzej Szepietowski
Oriented cliques and colorings of graphs with low maximum degree. Discret. Math. 343 (5) (2020)
Janusz Dybizbanski, Anna Nenca, Andrzej Szepietowski
Signed coloring of 2-dimensional grids. Inf. Process. Lett. 156 (2020)
Andrzej Szepietowski
Negative closed walks in signed graphs: A note. CoRR (2019)
Janusz Dybizbanski, Andrzej Szepietowski
Hamiltonian cycles in hypercubes with faulty edges. CoRR (2018)
Janusz Dybizbanski, Andrzej Szepietowski
Hamiltonian cycles and paths in hypercubes with disjoint faulty edges. CoRR (2018)
Janusz Dybizbanski, Andrzej Szepietowski
Hamiltonian cycles in hypercubes with faulty edges. Int. J. Comput. Math. Comput. Syst. Theory 3 (4) (2018)
Janusz Dybizbanski, Andrzej Szepietowski
Hamiltonian paths in hypercubes with local traps. Inf. Sci. 375 (2017)
Janusz Dybizbanski, Andrzej Szepietowski
The oriented chromatic number of Halin graphs. Inf. Process. Lett. 114 (1-2) (2014)
Janusz Dybizbanski, Andrzej Szepietowski
Oriented chromatic number of Halin graphs. CoRR (2013)
Andrzej Szepietowski
Coloring directed cycles. CoRR (2013)
Andrzej Szepietowski
Fault tolerance of edge pancyclicity in alternating group graphs. Appl. Math. Comput. 218 (19) (2012)
Andrzej Szepietowski
Hamiltonian cycles in hypercubes with 2n-4 faulty edges. Inf. Sci. 215 (2012)
Andrzej Szepietowski
Fault tolerance of vertex pancyclicity in alternating group graphs. Appl. Math. Comput. 217 (16) (2011)
Andrzej Szepietowski
Closure properties of hyper-minimized automata. RAIRO Theor. Informatics Appl. 45 (4) (2011)
Andrzej Szepietowski
Fault-tolerant edge and vertex pancyclicity in alternating group graphs. Appl. Math. Comput. 217 (6) (2010)
Andrzej Szepietowski
Fooling Turing machines with sublogarithmic space: a note on 'For completeness, sublogarithmic space is no space' by M. Agrawal. Inf. Process. Lett. 106 (4) (2008)
Andrzej Szepietowski
A note on alternating one-pebble Turing machines with sublogarithmic space. Inf. Process. Lett. 98 (5) (2006)
Andrzej Szepietowski, Monika Targan
A note on the oriented chromatic number of grids. Inf. Process. Lett. 92 (2) (2004)
Andrzej Szepietowski, Monika Targan
The Counterfeit Coin Problem. Bull. EATCS 82 (2004)
Jakub Neumann, Andrzej Szepietowski, Igor Walukiewicz
Complexity of weak acceptance conditions in tree automata. Inf. Process. Lett. 84 (4) (2002)
Joanna Jedrzejowicz, Andrzej Szepietowski
On the expressive power of the shuffle operator matched with intersection by regular sets. RAIRO Theor. Informatics Appl. 35 (4) (2001)
Jakub Neumann, Andrzej Szepietowski
The Emptiness Problem for Weak Rabin Tree Automata. DCFS (2001)
Joanna Jedrzejowicz, Andrzej Szepietowski
Shuffle languages are in P. Theor. Comput. Sci. 250 (1-2) (2001)
Robert Fidytek, Andrzej Wlodzimierz Mostowski, Rafal Somla, Andrzej Szepietowski
Algorithms counting monotone Boolean functions. Inf. Process. Lett. 79 (5) (2001)
Andrzej Szepietowski
Lower space bounds for accepting shuffle languages. RAIRO Theor. Informatics Appl. 33 (3) (1999)
Andrzej Szepietowski
There is no complete axiom system for shuffle expressions. RAIRO Theor. Informatics Appl. 33 (3) (1999)
Andrzej Szepietowski
Weak and Strong One-Way Space Complexity Classes. Inf. Process. Lett. 68 (6) (1998)
Andrzej Szepietowski
The Element Distinctness Problem on One-Tape Turing Machines. Inf. Process. Lett. 59 (4) (1996)
Andrzej Szepietowski
On space functions constructed by two-dimensional turing machines. Inf. Sci. 60 (1-2) (1992)
Andrzej Szepietowski
Some remarks on two-dimensional finite automata. Inf. Sci. 63 (1-2) (1992)
Andrzej Szepietowski
Two-dimensional on-line tessellation acceptors are not closed under complement. Inf. Sci. 64 (1-2) (1992)
Andrzej Szepietowski
On three-way two-dimensional multicounter automata. Inf. Sci. 55 (1-3) (1991)
Andrzej Szepietowski
A week mode of space complexity can be used in the proof that [DSPACE(log log n) = NSPACE(log logn)] => [L = NL]. Bull. EATCS 40 (1990)
Andrzej Szepietowski
. Theor. Comput. Sci. 74 (1) (1990)
Andrzej Szepietowski
Some Notes on Strong and Weak log log n Space Complexity. Inf. Process. Lett. 33 (2) (1989)
Andrzej Szepietowski
On three-way two-dimensional turing machines. Inf. Sci. 47 (2) (1989)
Andrzej Szepietowski
. STACS (1989)
Andrzej Szepietowski
Some Remarks on the Alternating Hierarchy and Closure Under Complement for Sublogarithmic Space. Inf. Process. Lett. 33 (2) (1989)
Andrzej Szepietowski
Remarks on Languages Acceptable in log n Space. Inf. Process. Lett. 27 (4) (1988)
Andrzej Szepietowski
There are no Fully Space Constructible Functions Between log log n and log n. Inf. Process. Lett. 24 (6) (1987)
Andrzej Szepietowski
On Paterson's Problem. J. Inf. Process. Cybern. 21 (6) (1985)
Andrzej Szepietowski
Remarks on Searching Labyrinths by Automata. FCT (1983)
Andrzej Szepietowski
On Searching Plane Labyrinths by 1-Pebble-Automata. J. Inf. Process. Cybern. 19 (1/2) (1983)
Andrzej Szepietowski
A Finite 5-Pebble-Automaton Can Search Every Maze. Inf. Process. Lett. 15 (5) (1982)