Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=530
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Solving the maximum duo-preservation string mapping problem with linear programming
Wenbin Chen
,
Zhengzhang Chen
,
Nagiza F. Samatova
,
Lingxi Peng
,
Jianxiong Wang
,
Maobin Tang
Theoretical Computer Science
530
, 2014, pp. 1-11
Competitive router scheduling with structured data
Yishay Mansour
,
Boaz Patt-Shamir
,
Dror Rawitz
Theoretical Computer Science
530
, 2014, pp. 12-22
Average-case linear-time similar substring searching by the
q
-gram distance
Hiroyuki Hanada
,
Mineichi Kudo
,
Atsuyoshi Nakamura
Theoretical Computer Science
530
, 2014, pp. 23-41
Squares in partial words
F. Blanchet-Sadri
,
Yang Jiao
,
John M. Machacek
,
J.D. Quigley
,
Xufan Zhang
Theoretical Computer Science
530
, 2014, pp. 42-57
The diagnosability of triangle-free graphs
Cheng-Kuan Lin
,
Yuan-Hsiang Teng
Theoretical Computer Science
530
, 2014, pp. 58-65
Complexity insights of the
Minimum Duplication
problem
Guillaume Blin
,
Paola Bonizzoni
,
Riccardo Dondi
,
Romeo Rizzi
,
Florian Sikora
Theoretical Computer Science
530
, 2014, pp. 66-79
The Covering Canadian Traveller Problem
Chung-Shou Liao
,
Yamming Huang
Theoretical Computer Science
530
, 2014, pp. 80-88
The complexity of LSH feasibility
Flavio Chierichetti
,
Ravi Kumar
,
Mohammad Mahdian
Theoretical Computer Science
530
, 2014, pp. 89-101