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=556
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An inductive construction of minimally rigid body-hinge simple graphs
Yuki Kobayashi
,
Yuya Higashikawa
,
Naoki Katoh
,
Naoyuki Kamiyama
Theoretical Computer Science
556
, 2014, pp. 2-12
Mining hidden links in social networks to achieve equilibrium
Huan Ma
,
Zaixin Lu
,
Deying Li
,
Yuqing Zhu
,
Lidan Fan
,
Weili Wu
Theoretical Computer Science
556
, 2014, pp. 13-24
A loopless algorithm for generating multiple binary tree sequences simultaneously
Ro-Yu Wu
,
Jou-Ming Chang
,
Hung-Chang Chan
,
Kung-Jui Pai
Theoretical Computer Science
556
, 2014, pp. 25-33
Following a curve with the discrete Fréchet distance
Tim Wylie
,
Binhai Zhu
Theoretical Computer Science
556
, 2014, pp. 34-44
Touring a sequence of disjoint polygons: Complexity and extension
Arash Ahadi
,
Amirhossein Mozafari
,
Alireza Zarei
Theoretical Computer Science
556
, 2014, pp. 45-54
Circular convex bipartite graphs: Feedback vertex sets
Tian Liu
,
Min Lu
,
Zhao Lu
,
Ke Xu
Theoretical Computer Science
556
, 2014, pp. 55-62
Approximating the maximum multiple RNA interaction problem
Weitian Tong
,
Randy Goebel
,
Tian Liu
,
Guohui Lin
Theoretical Computer Science
556
, 2014, pp. 63-70
Online bin covering: Expectations vs. guarantees
Marie G. Christ
,
Lene M. Favrholdt
,
Kim S. Larsen
Theoretical Computer Science
556
, 2014, pp. 71-84
Parameterized and approximation algorithms for finding two disjoint matchings
Zhi-Zhong Chen
,
Ying Fan
,
Lusheng Wang
Theoretical Computer Science
556
, 2014, pp. 85-93