×

Found 305 Documents (Results 1–100)

Quantaloidal approach to constraint satisfaction. (English) Zbl 07804588

Kishida, Kohei (ed.), Proceedings of the fourth international conference on applied category theory 2021, ACT 2021, Cambridge, UK, July 12–16, 2021. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 372, 289-305 (2022).
MSC:  18N10 08A70
PDFBibTeX XMLCite
Full Text: arXiv Link

Min orderings and list homomorphism dichotomies for signed and unsigned graphs. (English) Zbl 07719364

Castañeda, Armando (ed.) et al., Latin 2022: theoretical informatics. 15th Latin American symposium, Guanajuato, Mexico, November 7–11, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13568, 510-526 (2022).
MSC:  68Qxx 68Rxx 68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

An algorithmic framework for locally constrained homomorphisms. (English) Zbl 07682405

Bekos, Michael A. (ed.) et al., Graph-theoretic concepts in computer science. 48th international workshop, WG 2022, Tübingen, Germany, June 22–24, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13453, 114-128 (2022).
MSC:  68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

On list \(k\)-coloring convex bipartite graphs. (English) Zbl 1479.05100

Gentile, Claudio (ed.) et al., Graphs and combinatorial optimization: from theory to applications. Proceedings of the 18th Cologne-Twente workshop on graphs and combinatorial optimization (CTW2020), online, September 14–16, 2020. Cham: Springer. AIRO Springer Ser. 5, 15-26 (2021).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Sparsification lower bounds for list \(H\)-coloring. (English) Zbl 07765416

Cao, Yixin (ed.) et al., 31st international symposium on algorithms and computation, ISAAC 2020, Hong Kong, China, virtual conference, December 14–18, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 181, Article 58, 17 p. (2020).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Full complexity classification of the list homomorphism problem for bounded-treewidth graphs. (English) Zbl 07651213

Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 74, 24 p. (2020).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

List homomorphism problems for signed graphs. (English) Zbl 07559391

Esparza, Javier (ed.) et al., 45th international symposium on mathematical foundations of computer science, MFCS 2020, August 25–26, 2020, Prague, Czech Republic. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 170, Article 20, 14 p. (2020).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

A unified approach to structural limits and limits of graphs with bounded tree-depth. (English) Zbl 1491.03004

Memoirs of the American Mathematical Society 1272. Providence, RI: American Mathematical Society (AMS) (ISBN 978-1-4704-4065-7/pbk; 978-1-4704-5652-8/ebook). v, 108 p. (2020).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Counting homomorphisms modulo a prime number. (English) Zbl 07561703

Rossmanith, Peter (ed.) et al., 44th international symposium on mathematical foundations of computer science, MFCS 2019, Aachen, Germany, August 26–30, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 138, Article 59, 13 p. (2019).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Toward a dichotomy for approximation of \(H\)-coloring. (English) Zbl 07561584

Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 91, 16 p. (2019).
MSC:  68Nxx 68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Retracting graphs to cycles. (English) Zbl 07561563

Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 70, 15 p. (2019).
MSC:  68Nxx 68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Dismantlability, connectedness, and mixing in relational structures. (English) Zbl 1503.08001

Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 29, 15 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI

Complexity of \(C_K\)-coloring in hereditary classes of graphs. (English) Zbl 07525468

Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 31, 15 p. (2019).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Relating structure and power: comonadic semantics for computational resources. (English) Zbl 1509.03098

Ghica, Dan R. (ed.) et al., 27th EACSL annual conference on computer science logic, CSL 2018, Birmingham, United Kingdom, September 4–8, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 119, Article 2, 17 p. (2018).
MSC:  03C13 18C15 18C50
PDFBibTeX XMLCite
Full Text: DOI

Consistency for counting quantifiers. (English) Zbl 1510.68031

Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 11, 13 p. (2018).
MSC:  68Q25 03B70 08A70
PDFBibTeX XMLCite
Full Text: DOI

Relating structure and power: comonadic semantics for computational resources (extended abstract). (English) Zbl 1509.03096

Cîrstea, Corina (ed.), Coalgebraic methods in computer science. 14th IFIP WG 1.3 international workshop, CMCS 2018, colocated with ETAPS 2018, Thessaloniki, Greece, April 14–15, 2018. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 11202, 1-5 (2018).
MSC:  03C13 18C15 18C50
PDFBibTeX XMLCite
Full Text: DOI arXiv

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