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=406
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The supercover of an
m
-flat is a discrete analytical object
Eric Andres
Theoretical Computer Science
406
(1-2), 2008, pp. 8-14
A framework for generating some discrete sets with disjoint components by using uniform distributions
Péter Balázs
Theoretical Computer Science
406
(1-2), 2008, pp. 15-23
On the polyhedral complexity of the integer points in a hyperball
Valentin E. Brimkov
,
Reneta P. Barneva
Theoretical Computer Science
406
(1-2), 2008, pp. 24-30
Discrete sets with minimal moment of inertia
S. Brlek
,
G. Labelle
,
A. Lacasse
Theoretical Computer Science
406
(1-2), 2008, pp. 31-42
Reconstruction of binary matrices under fixed size neighborhood constraints
S. Brocchi
,
A. Frosini
,
C. Picouleau
Theoretical Computer Science
406
(1-2), 2008, pp. 43-54
Reconstruction of convex lattice sets from tomographic projections in quartic time
Sara Brunetti
,
Alain Daurat
Theoretical Computer Science
406
(1-2), 2008, pp. 55-62
On the reconstruction of binary and permutation matrices under (binary) tomographic constraints
S. Brunetti
,
A. Del Lungo
,
P. Gritzmann
,
S. de Vries
Theoretical Computer Science
406
(1-2), 2008, pp. 63-71
Finding a minimum medial axis of a discrete shape is
NP
-hard
David Coeurjolly
,
Jérôme Hulin
,
Isabelle Sivignon
Theoretical Computer Science
406
(1-2), 2008, pp. 72-79
Convex decomposition of
U
-polygons
Paolo Dulio
Theoretical Computer Science
406
(1-2), 2008, pp. 80-89
Scanning integer matrices by means of two rectangular windows
Andrea Frosini
,
Maurice Nivat
,
Simone Rinaldi
Theoretical Computer Science
406
(1-2), 2008, pp. 90-96
Minimal non-deletable sets and minimal non-codeletable sets in binary images
T. Yung Kong
Theoretical Computer Science
406
(1-2), 2008, pp. 97-118
A 3D fully parallel surface-thinning algorithm
Kálmán Palágyi
Theoretical Computer Science
406
(1-2), 2008, pp. 119-135
Additivity obstructions for integral matrices and pyramids
Miguel Santoyo
,
Ernesto Vallejo
Theoretical Computer Science
406
(1-2), 2008, pp. 136-145
On isoperimetrically optimal polyforms
Daniel Vainsencher
,
Alfred M. Bruckstein
Theoretical Computer Science
406
(1-2), 2008, pp. 146-159
On image reconstruction algorithms for binary electromagnetic geotomography
Rafal Zdunek
Theoretical Computer Science
406
(1-2), 2008, pp. 160-170
Deterministic monotone algorithms for scheduling on related machines
Pasquale Ambrosio
,
Vincenzo Auletta
Theoretical Computer Science
406
(3), 2008, pp. 173-186
A new model for selfish routing
Thomas Lücking
,
Marios Mavronicolas
,
Burkhard Monien
,
Manuel Rode
Theoretical Computer Science
406
(3), 2008, pp. 187-206
The Steiner tree problem on graphs: Inapproximability results
Miroslav Chlebík
,
Janka Chlebíková
Theoretical Computer Science
406
(3), 2008, pp. 207-214
Large independent sets in general random intersection graphs
S. Nikoletseas
,
C. Raptopoulos
,
P. Spirakis
Theoretical Computer Science
406
(3), 2008, pp. 215-224
On the complexity of bandwidth allocation in radio networks
Ralf Klasing
,
Nelson Morales
,
Stéphane Pérennes
Theoretical Computer Science
406
(3), 2008, pp. 225-239
High level communication functionalities for wireless sensor networks
Carme Àlvarez
,
Josep Díaz
,
Jordi Petit
,
José Rolim
,
Maria Serna
Theoretical Computer Science
406
(3), 2008, pp. 240-247
A randomized algorithm for the joining protocol in dynamic distributed networks
Colin Cooper
,
Ralf Klasing
,
Tomasz Radzik
Theoretical Computer Science
406
(3), 2008, pp. 248-262