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=544
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Popular and clan-popular
b
-matchings
Katarzyna Paluch
Theoretical Computer Science
544
, 2014, pp. 3-13
A 4.31-approximation for the geometric unique coverage problem on unit disks
Takehiro Ito
,
Shin-ichi Nakano
,
Yoshio Okamoto
,
Yota Otachi
,
Ryuhei Uehara
,
Takeaki Uno
,
Yushi Uno
Theoretical Computer Science
544
, 2014, pp. 14-31
On the number of upward planar orientations of maximal planar graphs
Fabrizio Frati
,
Joachim Gudmundsson
,
Emo Welzl
Theoretical Computer Science
544
, 2014, pp. 32-59
Efficient counting of square substrings in a tree
Tomasz Kociumaka
,
Jakub Pachocki
,
Jakub Radoszewski
,
Wojciech Rytter
,
Tomasz Waleń
Theoretical Computer Science
544
, 2014, pp. 60-73
Abstract flows over time: A first step towards solving dynamic packing problems
Jan-Philipp W. Kappmeier
,
Jannik Matuschke
,
Britta Peis
Theoretical Computer Science
544
, 2014, pp. 74-83
Reconfiguration of list
L(2,1)
-labelings in a graph
Takehiro Ito
,
Kazuto Kawamura
,
Hirotaka Ono
,
Xiao Zhou
Theoretical Computer Science
544
, 2014, pp. 84-97