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 YEAR=2013
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Topological morphing of planar graphs
Patrizio Angelini
,
Pier Francesco Cortese
,
Giuseppe Di Battista
,
Maurizio Patrignani
Theoretical Computer Science
514
, 2013, pp. 2-20
Social context congestion games
Vittorio Bilò
,
Alessandro Celi
,
Michele Flammini
,
Vasco Gallotti
Theoretical Computer Science
514
, 2013, pp. 21-35
Optimal eviction policies for stochastic address traces
Gianfranco Bilardi
,
Francesco Versaci
Theoretical Computer Science
514
, 2013, pp. 36-60
Reoptimization of maximum weight induced hereditary subgraph problems
Nicolas Boria
,
Jérôme Monnot
,
Vangelis Th. Paschos
Theoretical Computer Science
514
, 2013, pp. 61-74
Better bounds for incremental frequency allocation in bipartite graphs
Marek Chrobak
,
Łukasz Jeż
,
Jiȓí Sgall
Theoretical Computer Science
514
, 2013, pp. 75-83
On computing the diameter of real-world undirected graphs
Pilu Crescenzi
,
Roberto Grossi
,
Michel Habib
,
Leonardo Lanzi
,
Andrea Marino
Theoretical Computer Science
514
, 2013, pp. 84-95
Category-based routing in social networks: Membership dimension and the small-world phenomenon
David Eppstein
,
Michael T. Goodrich
,
Maarten Löffler
,
Darren Strash
,
Lowell Trott
Theoretical Computer Science
514
, 2013, pp. 96-104
Paired many-to-many disjoint path covers in faulty hypercubes
Shinhaeng Jo
,
Jung-Heum Park
,
Kyung-Yong Chwa
Theoretical Computer Science
513
, 2013, pp. 1-24
A scalable approach to computing representative lowest common ancestor in directed acyclic graphs
Santanu Kumar Dash
,
Sven-Bodo Scholz
,
Stephan Herhut
,
Bruce Christianson
Theoretical Computer Science
513
, 2013, pp. 25-37
Succinct encoding of arbitrary graphs
Arash Farzan
,
J. Ian Munro
Theoretical Computer Science
513
, 2013, pp. 38-52
Maximum balanced subgraph problem parameterized above lower bound
R. Crowston
,
G. Gutin
,
M. Jones
,
G. Muciaccia
Theoretical Computer Science
513
, 2013, pp. 53-64
A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
Peter Eades
,
Seok-Hee Hong
,
Naoki Katoh
,
Giuseppe Liotta
,
Pascal Schweitzer
,
Yusuke Suzuki
Theoretical Computer Science
513
, 2013, pp. 65-76
An improved approximation ratio for the jump number problem on interval orders
Przemysƚaw Krysztowiak
Theoretical Computer Science
513
, 2013, pp. 77-84
On compressing permutations and adaptive sorting
Jérémy Barbay
,
Gonzalo Navarro
Theoretical Computer Science
513
, 2013, pp. 109-123
Parameterized complexity of
k
-Chinese Postman Problem
Gregory Gutin
,
Gabriele Muciaccia
,
Anders Yeo
Theoretical Computer Science
513
, 2013, pp. 124-128
Building self-stabilizing overlay networks with the transitive closure framework
Andrew Berns
,
Sukumar Ghosh
,
Sriram V. Pemmaraju
Theoretical Computer Science
512
, 2013, pp. 2-14
Tight complexity analysis of population protocols with cover times - The ZebraNet example
J. Beauquier
,
P. Blanchard
,
J. Burman
,
S. Delaët
Theoretical Computer Science
512
, 2013, pp. 15-27
A protocol for implementing Byzantine storage in churn-prone distributed systems
Roberto Baldoni
,
Silvia Bonomi
,
Amir Soltani Nezhad
Theoretical Computer Science
512
, 2013, pp. 28-40
A non-topological proof for the impossibility of
k
-set agreement
Hagit Attiya
,
Armando Castañeda
Theoretical Computer Science
512
, 2013, pp. 41-48
Self-stabilizing labeling and ranking in ordered trees
Ajoy K. Datta
,
Stéphane Devismes
,
Lawrence L. Larmore
,
Yvan Rivierre
Theoretical Computer Science
512
, 2013, pp. 49-66
Trust-aware peer sampling: Performance and privacy tradeoffs
Davide Frey
,
Arnaud Jégou
,
Anne-Marie Kermarrec
,
Michel Raynal
,
Julien Stainer
Theoretical Computer Science
512
, 2013, pp. 67-83
Dynamic regular registers in systems with churn
Andreas Klappenecker
,
Hyunyoung Lee
,
Jennifer L. Welch
Theoretical Computer Science
512
, 2013, pp. 84-97
The computational power of simple protocols for self-awareness on graphs
Ioannis Chatzigiannakis
,
Othon Michail
,
Stavros Nikolaou
,
Paul G. Spirakis
Theoretical Computer Science
512
, 2013, pp. 98-118
The weakest failure detector to implement a register in asynchronous systems with hybrid communication
Damien Imbs
,
Michel Raynal
Theoretical Computer Science
512
, 2013, pp. 130-142
On an extension of the Sort & Search method with application to scheduling theory
Ch. Lenté
,
M. Liedloff
,
A. Soukhal
,
V. T'Kindt
Theoretical Computer Science
511
, 2013, pp. 13-22
Seiten 1
2
3
4
5
6
7
8
9
10
11
12
>