Sciweavers

19 search results - page 2 / 4

» sofsem 2005

8

SOFSEM
2005
Springer

102views Theoretical Computer Science» more SOFSEM 2005»

Non-planar Orthogonal Drawings with Fixed Topology

13 years 10 months ago

Non-planar Orthogonal Drawings with Fixed Topology

Download ls11-www.cs.uni-dortmund.de

Markus Chimani, Gunnar W. Klau, René Weiski...

claim paper

Read More »

18

SOFSEM
2005
Springer

101views Theoretical Computer Science» more SOFSEM 2005»

Fast Bit-Vector Algorithms for Approximate String Matching Under Indel Distance

13 years 10 months ago

Fast Bit-Vector Algorithms for Approximate String Matching Under Indel Distance

Download dis.unal.edu.co

Heikki Hyyrö, Yoan J. Pinzon, Ayumi Shinohara

claim paper

Read More »

11

SOFSEM
2005
Springer

102views Theoretical Computer Science» more SOFSEM 2005»

Cost-Constrained Minimum-Delay Multicasting

13 years 10 months ago

Cost-Constrained Minimum-Delay Multicasting

Download www.lab.ss.titech.ac.jp

Satoshi Tayu, Turki Ghazi Al-Mutairi, Shuichi Ueno

claim paper

Read More »

14

SOFSEM
2005
Springer

123views Theoretical Computer Science» more SOFSEM 2005»

Discovering Treewidth

13 years 10 months ago

Discovering Treewidth

Download igitur-archive.library.uu.nl

Abstract. Treewidth is a graph parameter with several interesting theoretical and practical applications. This survey reviews algorithmic results on determining the treewidth of a ...

Hans L. Bodlaender

claim paper

Read More »

12

SOFSEM
2005
Springer

112views Theoretical Computer Science» more SOFSEM 2005»

Characteristic Patterns for LTL

13 years 10 months ago

Characteristic Patterns for LTL

Download www.fi.muni.cz

We give a new characterization of those languages that are deﬁnable in fragments of LTL where the nesting depths of X and U modalities are bounded by given constants. This brings...

Antonín Kucera, Jan Strejcek

claim paper

Read More »

« Prev « First page 2 / 4 Last » Next »