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
[2]
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND YEAR=2013
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Inapproximability results for the minimum integral solution problem with preprocessing over
\ell_{\infty}
norm
Wenbin Chen
,
Lingxi Peng
,
Jianxiong Wang
,
Fufang Li
,
Maobin Tang
,
Wei Xiong
,
Songtao Wang
Theoretical Computer Science
478
, 2013, pp. 127-131
Normal numbers and finite automata
Verónica Becher
,
Pablo Ariel Heiber
Theoretical Computer Science
477
, 2013, pp. 109-116
Equilibrium pricing with positive externalities
Nima AhmadiPourAnari
,
Shayan Ehsani
,
Mohammad Ghodsi
,
Nima Haghpanah
,
Nicole Immorlica
,
Hamid Mahini
,
Vahab Mirrokni
Theoretical Computer Science
476
, 2013, pp. 1-15
Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords
Jian Chang
,
Hui-Juan Wang
,
Jian-Liang Wu
,
Yong-Ga A
Theoretical Computer Science
476
, 2013, pp. 16-23
Ranking games that have competitiveness-based strategies
Leslie Ann Goldberg
,
Paul W. Goldberg
,
Piotr Krysta
,
Carmine Ventre
Theoretical Computer Science
476
, 2013, pp. 24-37
Obtaining planarity by contracting few edges
Petr A. Golovach
,
Pim van 't Hof
,
Daniël Paulusma
Theoretical Computer Science
476
, 2013, pp. 38-46
Unique perfect phylogeny is intractable
Michel Habib
,
Juraj Stacho
Theoretical Computer Science
476
, 2013, pp. 47-66
Short and efficient convertible undeniable signature schemes without random oracles
Qiong Huang
,
Duncan S. Wong
Theoretical Computer Science
476
, 2013, pp. 67-83
On the mixed domination problem in graphs
James K. Lan
,
Gerard Jennhwa Chang
Theoretical Computer Science
476
, 2013, pp. 84-93
Degree distribution of large networks generated by the partial duplication model
Si Li
,
Kwok Pui Choi
,
Taoyang Wu
Theoretical Computer Science
476
, 2013, pp. 94-108
On the hull number of some graph classes
J. Araujo
,
V. Campos
,
F. Giroire
,
N. Nisse
,
L. Sampaio
,
R. Soares
Theoretical Computer Science
475
, 2013, pp. 1-12
Partitioning the arcs of a digraph into a star forest of the underlying graph with prescribed orientation properties
Jrgen Bang-Jensen
,
Daniel Gonçalves
,
Anders Yeo
Theoretical Computer Science
475
, 2013, pp. 13-20
On weight function methods in Chooser-Picker games
Maƚgorzata Bednarska-Bzdȩga
Theoretical Computer Science
475
, 2013, pp. 21-33
Deciding representability of sets of words of equal length
F. Blanchet-Sadri
,
Sean Simmons
Theoretical Computer Science
475
, 2013, pp. 34-46
Factorization of products of hypergraphs: Structure and algorithms
Alain Bretto
,
Yannick Silvestre
,
Thierry Vallée
Theoretical Computer Science
475
, 2013, pp. 47-58
Unique permutation hashing
Shlomi Dolev
,
Limor Lahiani
,
Yinnon Haviv
Theoretical Computer Science
475
, 2013, pp. 59-65
Necessary conditions for subclasses of random context languages
Sigrid Ewert
,
Andries van der Walt
Theoretical Computer Science
475
, 2013, pp. 66-72
A tiling system for the class of
L
-convex polyominoes
S. Brocchi
,
A. Frosini
,
R. Pinzani
,
S. Rinaldi
Theoretical Computer Science
475
, 2013, pp. 73-81
Fault-tolerant path embedding in folded hypercubes with both node and edge faults
Che-Nan Kuo
,
Hsin-Hung Chou
,
Nai-Wen Chang
,
Sun-Yuan Hsieh
Theoretical Computer Science
475
, 2013, pp. 82-91
A
\phi
-competitive algorithm for collecting items with increasing weights from a dynamic queue
Marcin Bienkowski
,
Marek Chrobak
,
Christoph Dürr
,
Mathilde Hurand
,
Artur Jeż
,
Łukasz Jeż
,
Grzegorz Stachowiak
Theoretical Computer Science
475
, 2013, pp. 92-102
Generating bracelets with fixed content
S. Karim
,
J. Sawada
,
Z. Alamgir
,
S.M. Husnine
Theoretical Computer Science
475
, 2013, pp. 103-112
Faster compressed dictionary matching
Wing-Kai Hon
,
Tsung-Han Ku
,
Rahul Shah
,
Sharma V. Thankachan
,
Jeffrey Scott Vitter
Theoretical Computer Science
475
, 2013, pp. 113-119
Proof of the Brlek-Reutenauer conjecture
L'. Balková
,
E. Pelantová
,
S̑. Starosta
Theoretical Computer Science
475
, 2013, pp. 120-125
Erratum to ``On the structure of graphs in the Caucal hierarchy''
Achim Blumensath
Theoretical Computer Science
475
, 2013, pp. 126-127
The expressive power of time Petri nets
B. Bérard
,
F. Cassez
,
S. Haddad
,
D. Lime
,
O.H. Roux
Theoretical Computer Science
474
, 2013, pp. 1-20
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>