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=423
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Determining the chromatic number of triangle-free
2P_3
-free graphs in polynomial time
Hajo Broersma
,
Petr A. Golovach
,
Daniël Paulusma
,
Jian Song
Theoretical Computer Science
423
, 2012, pp. 1-10
A note on sorting buffers offline
Ho-Leung Chan
,
Nicole Megow
,
René Sitters
,
Rob van Stee
Theoretical Computer Science
423
, 2012, pp. 11-18
The set of parameterized
k
-covers problem
A.A. Gorbenko
,
V.Yu. Popov
Theoretical Computer Science
423
, 2012, pp. 19-24
On the NP-completeness of the perfect matching free subgraph problem
Mathieu Lacroix
,
A. Ridha Mahjoub
,
Sébastien Martin
,
Christophe Picouleau
Theoretical Computer Science
423
, 2012, pp. 25-29
Monge properties of sequence alignment
Luís M.S. Russo
Theoretical Computer Science
423
, 2012, pp. 30-49
Finding all maximally-matchable edges in a bipartite graph
Tamir Tassa
Theoretical Computer Science
423
, 2012, pp. 50-58
An improved algorithm for online rectangle filling
Rob van Stee
Theoretical Computer Science
423
, 2012, pp. 59-74
Corrigendum to ``A simple and efficient Union-Find-Delete algorithm''
Amir M. Ben-Amram
,
Simon Yoffe
Theoretical Computer Science
423
, 2012, pp. 75-75