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=478
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An algebraic proof of Rabin's Tree Theorem
Achim Blumensath
Theoretical Computer Science
478
, 2013, pp. 1-21
Bidder optimal assignments for general utilities
Paul Dütting
,
Monika Henzinger
,
Ingmar Weber
Theoretical Computer Science
478
, 2013, pp. 22-32
New results on maximum induced matchings in bipartite graphs and beyond
Konrad K. Dabrowski
,
Marc Demange
,
Vadim V. Lozin
Theoretical Computer Science
478
, 2013, pp. 33-40
Single approximation for the biobjective Max TSP
Cristina Bazgan
,
Laurent Gourvès
,
Jérôme Monnot
,
Fanny Pascual
Theoretical Computer Science
478
, 2013, pp. 41-50
On the independence number of graphs with maximum degree 3
Iyad Kanj
,
Fenghui Zhang
Theoretical Computer Science
478
, 2013, pp. 51-75
Adaptively secure non-interactive threshold cryptosystems
Benoît Libert
,
Moti Yung
Theoretical Computer Science
478
, 2013, pp. 76-100
Unambiguous 1-uniform morphisms
Hossein Nevisi
,
Daniel Reidenbach
Theoretical Computer Science
478
, 2013, pp. 101-117
Linear time and space gathering of anonymous mobile agents in asynchronous trees
Daisuke Baba
,
Tomoko Izumi
,
Fukuhito Ooshita
,
Hirotsugu Kakugawa
,
Toshimitsu Masuzawa
Theoretical Computer Science
478
, 2013, pp. 118-126
Inapproximability results for the minimum integral solution problem with preprocessing over
\ell_{\infty}
norm
Wenbin Chen
,
Lingxi Peng
,
Jianxiong Wang
,
Fufang Li
,
Maobin Tang
,
Wei Xiong
,
Songtao Wang
Theoretical Computer Science
478
, 2013, pp. 127-131