×

Found 80 Documents (Results 1–80)

List homomorphism: beyond the known boundaries. (English) Zbl 07719369

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, 593-609 (2022).
MSC:  68Qxx 68Rxx 68Wxx
PDFBibTeX XMLCite
Full Text: DOI

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

Recognizing graphs close to bipartite graphs. (English) Zbl 1441.68167

Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 70, 14 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI

Computational complexity of graph partition under vertex-compaction to an irreflexive hexagon. (English) Zbl 1441.68197

Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 69, 14 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI

On the (parameterized) complexity of recognizing well-covered \((r,\ell)\)-graphs. (English) Zbl 1483.68247

Chan, T-H. Hubert (ed.) et al., Combinatorial optimization and applications. 10th international conference, COCOA 2016, Hong Kong, China, December 16–18, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10043, 423-437 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

\(2K_2\) vertex-set partition into nonempty parts. (English) Zbl 1341.05205

Liebling, Th. (ed.) et al., The IV Latin-American algorithms, graphs, and optimization symposium, Puerto Varas, Chile, November 25–29, 2007. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 30, 291-296 (2008).
PDFBibTeX XMLCite
Full Text: DOI

The polynomial dichotomy for three nonempty part sandwich problems. (English) Zbl 1341.05240

Liebling, Th. (ed.) et al., The IV Latin-American algorithms, graphs, and optimization symposium, Puerto Varas, Chile, November 25–29, 2007. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 30, 81-86 (2008).
MSC:  05C85 68Q17 05C62
PDFBibTeX XMLCite
Full Text: DOI

Matrix partitions with finitely many obstructions. (English) Zbl 1158.05325

Hliněný, Petr (ed.) et al., 6th Czech-Slovak international symposium on combinatorics, graph theory, algorithms and applications, DIMATIA Center, Charles University, Prague, Czech Republic, July 10–16, 2006. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 28, 371-378 (2007).
MSC:  05C50 15A99 05C75
PDFBibTeX XMLCite
Full Text: DOI

Polar cographs. (English) Zbl 1136.05316

Hliněný, Petr (ed.) et al., 6th Czech-Slovak international symposium on combinatorics, graph theory, algorithms and applications, DIMATIA Center, Charles University, Prague, Czech Republic, July 10–16, 2006. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 28, 317-323 (2007).
MSC:  05C70 05C85
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

Software