×

Found 23 Documents (Results 1–23)

Acyclic, star, and injective colouring: bounding the diameter. (English) Zbl 07538588

Kowalik, Łukasz (ed.) et al., Graph-theoretic concepts in computer science. 47th international workshop, WG 2021, Warsaw, Poland, June 23–25, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12911, 336-348 (2021).
MSC:  68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Injective colouring for H-free graphs. (English) Zbl 07493522

Santhanam, Rahul (ed.) et al., Computer science – theory and applications. 16th international computer science symposium in Russia, CSR 2021, Sochi, Russia, June 28 – July 2, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12730, 18-30 (2021).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Acyclic, star and injective colouring: a complexity picture for \(H\)-free graphs. (English) Zbl 07651161

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 22, 22 p. (2020).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Disconnected cuts in claw-free graphs. (English) Zbl 1524.05256

Azar, Yossi (ed.) et al., 26th annual European symposium on algorithms, ESA 2018, August 20–22, 2018, Helsinki, Finland. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 112, Article 61, 14 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

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

Surjective \(H\)-colouring: new hardness results. (English) Zbl 1489.68192

Kari, Jarkko (ed.) et al., Unveiling dynamics and complexity. 13th conference on computability in Europe, CiE 2017, Turku, Finland, June 12–16, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10307, 270-281 (2017).
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

The complexity of counting quantifiers on equality languages. (English) Zbl 1476.68113

Beckmann, Arnold (ed.) et al., Pursuit of the universal. 12th conference on computability in Europe, CiE 2016, Paris, France, June 27 – July 1, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9709, 333-342 (2016).
MSC:  68Q25 03B70
PDFBibTeX XMLCite
Full Text: DOI Link

Circuit satisfiability and constraint satisfaction around Skolem arithmetic. (English) Zbl 1475.68123

Beckmann, Arnold (ed.) et al., Pursuit of the universal. 12th conference on computability in Europe, CiE 2016, Paris, France, June 27 – July 1, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9709, 323-332 (2016).
PDFBibTeX XMLCite
Full Text: DOI Link

Constraint satisfaction problems over the integers with successor. (English) Zbl 1440.68111

Halldórsson, Magnús M. (ed.) et al., Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015. Proceedings. Part I. Berlin: Springer. Lect. Notes Comput. Sci. 9134, 256-267 (2015).
MSC:  68Q25 03B70
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

First-order model checking problems parameterized by the model. (English) Zbl 1142.68439

Beckmann, Arnold (ed.) et al., Logic and theory of algorithms. 4th conference on computability in Europe, CiE 2008, Athens, Greece, June 15–20, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-69405-2/pbk). Lecture Notes in Computer Science 5028, 417-427 (2008).
MSC:  68Q60 03B70
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field