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=576
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Feasibility checking in Horn constraint systems through a reduction based approach
K. Subramani
,
James Worthington
Theoretical Computer Science
576
, 2015, pp. 1-17
On the average-case complexity of parameterized clique
Nikolaos Fountoulakis
,
Tobias Friedrich
,
Danny Hermelin
Theoretical Computer Science
576
, 2015, pp. 18-29
Matching preclusion and conditional matching preclusion problems for the folded Petersen cube
Eddie Cheng
,
Robert Connolly
,
Christoper Melekian
Theoretical Computer Science
576
, 2015, pp. 30-44
Complexity of node coverage games
Farn Wang
,
Sven Schewe
,
Jung-Hsuan Wu
Theoretical Computer Science
576
, 2015, pp. 45-60
Fixed-parameter tractability for subset feedback set problems with parity constraints
Naonori Kakimura
,
Ken-ichi Kawarabayashi
Theoretical Computer Science
576
, 2015, pp. 61-76
Quasipolynomial size proofs of the propositional pigeonhole principle
Sam Buss
Theoretical Computer Science
576
, 2015, pp. 77-84
Extending partial representations of subclasses of chordal graphs
Pavel Klavík
,
Jan Kratochvíl
,
Yota Otachi
,
Toshiki Saitoh
Theoretical Computer Science
576
, 2015, pp. 85-101
Tractability and hardness of flood-filling games on trees
Michael R. Fellows
,
Uéverton dos Santos Souza
,
Fábio Protti
,
Maise Dantas da Silva
Theoretical Computer Science
576
, 2015, pp. 102-116