|
|
|
|
|
Giacomo Bergami
Recent findings demonstrate how database technology enhances the computation of formal verification tasks expressible in linear time logic for finite traces (LTLf). Human-readable declarative languages also help the common practitioner to express tempora...
ver más
|
|
|
|
|
|
|
|
|
|
|
Nattawut Phetmak and Jittat Fakcharoenphol
We consider a problem in computational origami. Given a piece of paper as a convex polygon P and a point f located within, we fold every point on a boundary of P to f and compute a region that is safe from folding, i.e., the region with no creases. This ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Anna Mpanti, Stavros D. Nikolopoulos and Leonidas Palios
Consider a graph G which belongs to a graph class ??
C
. We are interested in connecting a node ?????(??)
w
?
V
(
G
)
to G by a single edge ????
u
w
where ?????(??)
u
?
V
(
G
)
; we call such an edge a tail. As the graph resulting from G after the addi...
ver más
|
|
|
|
|
|
|
|
|
|
|
Gabriel Valiente
Graph algorithms that test adjacencies are usually implemented with an adjacency-matrix representation because the adjacency test takes constant time with adjacency matrices, but it takes linear time in the degree of the vertices with adjacency lists. In...
ver más
|
|
|
|
|
|
|
|
|
|
|
Bernd Finkbeiner, Martin Fränzle, Florian Kohn and Paul Kröger
Signal Temporal Logic is a linear-time temporal logic designed for classifying the time-dependent signals originating from continuous-state or hybrid-state dynamical systems according to formal specifications. It has been conceived as a tool for systemat...
ver más
|
|
|
|
|
|
|
|
|
|
|
Johannes K. Fichte, Markus Hecher, Michael Morak and Stefan Woltran
Efficient exact parameterized algorithms are an active research area. Such algorithms exhibit a broad interest in the theoretical community. In the last few years, implementations for computing various parameters (parameter detection) have been establish...
ver más
|
|
|
|
|
|
|
|
|
|
|
Dominik Köppl
We present linear-time algorithms computing the reversed Lempel?Ziv factorization [Kolpakov and Kucherov, TCS?09] within the space bounds of two different suffix tree representations. We can adapt these algorithms to compute the longest previous non-over...
ver más
|
|
|
|
|
|
|
|
|
|
|
Dominik Köppl
We present algorithms computing the non-overlapping Lempel?Ziv-77 factorization and the longest previous non-overlapping factor table within small space in linear or near-linear time with the help of modern suffix tree representations fitting into limite...
ver más
|
|
|
|
|
|
|
|
|
|
|
Fabian Gärtner and Peter F. Stadler
Superbubbles are a class of induced subgraphs in digraphs that play an essential role in assembly algorithms for high-throughput sequencing data. They are connected with the remainder of the host digraph by a single entrance and a single exit vertex. Lin...
ver más
|
|
|
|
|
|
|
|
|
|
|
Sukhpal Singh Ghuman, Emanuele Giaquinta and Jorma Tarhio
We present two modifications of Duval?s algorithm for computing the Lyndon factorization of a string. One of the algorithms has been designed for strings containing runs of the smallest character. It works best for small alphabets and it is able to skip ...
ver más
|
|
|
|
|
|