Combinatorics on Infinite Words (2008)
Karhumäki, Juhani, Lepistö, Arto
We consider several problems of infinite words over a finite alphabet. In particular, we describe a few automata-theoretic methods to define infinite words. Properties of infinite words studied in...
A Faster Algorithm for Minimum Cycle Basis of Graphs (2004)
Mehlhorn, Kurt, Michail, Dimitrios, Telikepalli, Kavitha, Paluch, Katarzyna, Díaz, Josep, Karhumäki, Juhani, ...
In this paper we consider the problem of computing a minimum cycle basis in a graph $G$ with $m$ edges and $n$ vertices. The edges of $G$ have non-negative weights on them. The previous best result...
Online scheduling with bounded migration (2004)
Sanders, Peter, Sivadasan, Naveen, Skutella, Martin, Díaz, Josep, Karhumäki, Juhani, Lepistö, Arto, ...
External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs (2004)
Arge, Lars, Meyer, Ulrich, Toma, Laura, Diaz, Josep, Karhumäki, Juhani, Lepistö, Arto, ...
A Characterization of the Periodicity of Bi-Infinite Words (2003)
Harju, Tero, Lepistö, Arto, Nowotka, Dirk
A finite word is called bordered if it has a proper prefix which is also a suffix of that word. Costa proves in [Theoret. Comput. Sci., 290(3):2053-2061, 2003] that a bi-infinite word w is of the...
A Characterization of 2+-free Words over a Binary Alphabet (1996)
http://www.tucs.fi/Publications/techreports/TR74.php