×

Found 114 Documents (Results 1–100)

Finding list homomorphisms from bounded-treewidth graphs to reflexive graphs: a complete complexity characterization. (English) Zbl 1487.68125

Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 96, Article 27, 15 p. (2018).
MSC:  68Q25 05C60 68R10
Full Text: DOI

Minimum cost homomorphisms to reflexive digraphs. (English) Zbl 1136.68462

Laber, Eduardo Sany (ed.) et al., LATIN 2008: Theoretical informatics. 8th Latin American symposium, Búzios, Brazil, April 7–11, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-78772-3/pbk). Lecture Notes in Computer Science 4957, 182-193 (2008).

Contractible coherence spaces and maximal maps. (English) Zbl 0935.18001

Brookes, Stephen (ed.) et al., Mathematical foundations of programming semantics. Proceedings of the 15th conference, Tulane Univ., New Orleans, LA, April 28 - May 1, 1999. Amsterdam: Elsevier, Electronic Notes in Theoretical Computer Science. 20, electronic paper No. 18 (1999).

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software