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=440-441
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
New lower bounds for certain classes of bin packing algorithms
János Balogh
,
József Békési
,
Gábor Galambos
Theoretical Computer Science
440-441
, 2012, pp. 1-13
Tractability and approximability of maximal strip recovery
Laurent Bulteau
,
Guillaume Fertin
,
Minghui Jiang
,
Irena Rusu
Theoretical Computer Science
440-441
, 2012, pp. 14-28
A semi-dynamical approach for solving qualitative spatial constraint satisfaction problems
Khalil Challita
Theoretical Computer Science
440-441
, 2012, pp. 29-38
Locating factors of a characteristic word via the generalized Zeckendorf representation of numbers
Wai-Fong Chuan
,
Hui-Ling Ho
Theoretical Computer Science
440-441
, 2012, pp. 39-51
Choosing the best among peers
Jurek Czyzowicz
,
Leszek Ga̧sieniec
,
Andrzej Pelc
Theoretical Computer Science
440-441
, 2012, pp. 52-59
Exact and approximation algorithms for error-detecting even codes
Paulo E.D. Pinto
,
Fábio Protti
,
Jayme L. Szwarcfiter
Theoretical Computer Science
440-441
, 2012, pp. 60-72
Extremal minimality conditions on automata
Antonio Restivo
,
Roberto Vaglica
Theoretical Computer Science
440-441
, 2012, pp. 73-84