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=412
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the complexity of reconfiguration problems
Takehiro Ito
,
Erik D. Demaine
,
Nicholas J.A. Harvey
,
Christos H. Papadimitriou
,
Martha Sideri
,
Ryuhei Uehara
,
Yushi Uno
Theoretical Computer Science
412
(12-14), 2011, pp. 1054-1065
The impact of mobility on the geocasting problem in mobile ad-hoc networks: Solvability and cost
R. Baldoni
,
A. Fernández Anta
,
K. Ioannidou
,
A. Milani
Theoretical Computer Science
412
(12-14), 2011, pp. 1066-1080
Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints
Yumei Huo
,
Hairong Zhao
Theoretical Computer Science
412
(12-14), 2011, pp. 1081-1091
Online and semi-online hierarchical scheduling for load balancing on uniform machines
Li-ying Hou
,
Liying Kang
Theoretical Computer Science
412
(12-14), 2011, pp. 1092-1098
The transposition median problem is
NP
-complete
Martin Bader
Theoretical Computer Science
412
(12-14), 2011, pp. 1099-1110
A Kleene-Schützenberger theorem for weighted timed automata
Manfred Droste
,
Karin Quaas
Theoretical Computer Science
412
(12-14), 2011, pp. 1140-1153
Computing bond orders in molecule graphs
S. Böcker
,
Q.B.A. Bui
,
A. Truss
Theoretical Computer Science
412
(12-14), 2011, pp. 1184-1195
Local and global price of anarchy of graphical games
Oren Ben-Zwi
,
Amir Ronen
Theoretical Computer Science
412
(12-14), 2011, pp. 1196-1207
Highly concurrent multi-word synchronization
Hagit Attiya
,
Eshcar Hillel
Theoretical Computer Science
412
(12-14), 2011, pp. 1243-1262
Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs
Pinar Heggernes
,
Daniel Meister
,
Andrzej Proskurowski
Theoretical Computer Science
412
(12-14), 2011, pp. 1275-1297
Guarding a set of line segments in the plane
Valentin E. Brimkov
,
Andrew Leach
,
Michael Mastroianni
,
Jimmy Wu
Theoretical Computer Science
412
(15), 2011, pp. 1313-1324
Exact optimization for the
\ell^1
-Compressive Sensing problem using a modified Dantzig-Wolfe method
Alexandre Borghi
,
Jérôme Darbon
,
Sylvain Peyronnet
Theoretical Computer Science
412
(15), 2011, pp. 1325-1337
Efficient search of combinatorial maps using signatures
Stéphane Gosselin
,
Guillaume Damiand
,
Christine Solnon
Theoretical Computer Science
412
(15), 2011, pp. 1392-1405
Alpha Markov Measure Field model for probabilistic image segmentation
Oscar Dalmau
,
Mariano Rivera
Theoretical Computer Science
412
(15), 2011, pp. 1434-1441
Sparse interpolation of multivariate rational functions
Annie Cuyt
,
Wen-shin Lee
Theoretical Computer Science
412
(16), 2011, pp. 1445-1456
Dynamic normal forms and dynamic characteristic polynomial
Gudmund Skovbjerg Frandsen
,
Piotr Sankowski
Theoretical Computer Science
412
(16), 2011, pp. 1470-1483
Computing monodromy via continuation methods on random Riemann surfaces
André Galligo
,
Adrien Poteaux
Theoretical Computer Science
412
(16), 2011, pp. 1492-1507
A note on Gao's algorithm for polynomial factorization
Carlos Hoppen
,
Virginia M. Rodrigues
,
Vilmar Trevisan
Theoretical Computer Science
412
(16), 2011, pp. 1508-1522
Efficient and accurate computation of upper bounds of approximation errors
S. Chevillard
,
J. Harrison
,
M. Joldeş
,
Ch. Lauter
Theoretical Computer Science
412
(16), 2011, pp. 1523-1543
Illustration of fairness in evolutionary multi-objective optimization
Tobias Friedrich
,
Christian Horoba
,
Frank Neumann
Theoretical Computer Science
412
(17), 2011, pp. 1546-1556
Minimization strategies for maximally parallel multiset rewriting systems
Artiom Alhazov
,
Sergey Verlan
Theoretical Computer Science
412
(17), 2011, pp. 1581-1591
Runtime analysis of the 1-ANT ant colony optimizer
Benjamin Doerr
,
Frank Neumann
,
Dirk Sudholt
,
Carsten Witt
Theoretical Computer Science
412
(17), 2011, pp. 1629-1644
A well-mixed function with circuit complexity
5n
: Tightness of the Lachish-Raz-type bounds
Kazuyuki Amano
,
Jun Tarui
Theoretical Computer Science
412
(18), 2011, pp. 1646-1651
Inductive inference and computable numberings
Klaus Ambos-Spies
,
Serikzhan Badaev
,
Sergey Goncharov
Theoretical Computer Science
412
(18), 2011, pp. 1652-1668
Splitting and nonsplitting in the enumeration degrees
M.M. Arslanov
,
S.B. Cooper
,
I.Sh. Kalimullin
,
M.I. Soskova
Theoretical Computer Science
412
(18), 2011, pp. 1669-1685
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>