Dissemin is shutting down on January 1st, 2025

Published in

Springer, Journal of Combinatorial Optimization, 2(37), p. 501-522, 2018

DOI: 10.1007/s10878-018-0300-z

Springer Verlag, Lecture Notes in Computer Science, p. 99-111

DOI: 10.1007/978-3-319-62389-4_9

Links

Tools

Export citation

Search in Google Scholar

Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes

This paper is made freely available by the publisher.
This paper is made freely available by the publisher.

Full text: Download

Green circle
Preprint: archiving allowed
Orange circle
Postprint: archiving restricted
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO