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
[1]
Hilfe
Suche: Journal=Theory of Computing Systems AND Volume=52
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The rank-width of edge-coloured graphs
Mamadou Moustapha Kanté
,
Michael Rao
Theory of Computing Systems
52
(4), 2013, pp. 599-644
Colorings with few colors: Counting, enumeration and combinatorial bounds
Jean-Francois Couturier
,
Petr A. Golovach
,
Dieter Kratsch
Theory of Computing Systems
52
(4), 2013, pp. 645-667
Improved lower bounds on the price of stability of undirected network design games
Vittorio Bilò
,
Ioannis Caragiannis
,
Angelo Fanelli
Theory of Computing Systems
52
(4), 2013, pp. 668-686
Partition into triangles on bounded degree graphs
Johan M.M. van Rooij
,
Marcel E. van Kooten Niekerk
Theory of Computing Systems
52
(4), 2013, pp. 687-718
Parameterized complexity of satisfying almost all linear equations over
\mathbb F_2
R. Crowston
,
G. Gutin
,
M. Jones
,
A. Yeo
Theory of Computing Systems
52
(4), 2013, pp. 719-728
Built-in coloring for highly-concurrent doubly-linked lists
Hagit Attiya
,
Eshcar Hillel
Theory of Computing Systems
52
(4), 2013, pp. 729-762
Collusion in atomic splittable routing games
Chien-Chung Huang
Theory of Computing Systems
52
(4), 2013, pp. 763-801
Seiten
<
1
2