×

Found 302 Documents (Results 1–100)

Graph-theoretic concepts in computer science. 49th international workshop, WG 2023, Fribourg, Switzerland, June 28–30, 2023. Revised selected papers. (English) Zbl 07768553

Lecture Notes in Computer Science 14093. Cham: Springer (ISBN 978-3-031-43379-5/pbk; 978-3-031-43380-1/ebook). xiii, 478 p. (2023).
MSC:  68-06 68R10 00B25
PDFBibTeX XMLCite
Full Text: DOI

Few induced disjoint paths for \(H\)-free graphs. (English) Zbl 1528.90224

Ljubić, Ivana (ed.) et al., Combinatorial optimization. 7th international symposium, ISCO 2022, virtual event, May 18–20, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13526, 89-101 (2022).
MSC:  90C27
PDFBibTeX XMLCite
Full Text: DOI

Classifying subset feedback vertex set for \(H\)-free graphs. (English) Zbl 07682426

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, 412-424 (2022).
MSC:  68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Induced disjoint paths and connected subgraphs for \(H\)-free graphs. (English) Zbl 07682425

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, 398-411 (2022).
MSC:  68R10
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

The complexity of \(L(p, q)\)-edge-labelling. (English) Zbl 07556570

Mutzel, Petra (ed.) et al., WALCOM: algorithms and computation. 16th international conference and workshops, WALCOM 2022, Jember, Indonesia, March 24–26, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13174, 175-186 (2022).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Partitioning \(H\)-free graphs of bounded diameter. (English) Zbl 07788594

Ahn, Hee-Kap (ed.) et al., 32nd international symposium on algorithms and computation, ISAAC 2021, Fukuoka, Japan, December 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 212, Article 21, 14 p. (2021).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

QCSP on reflexive tournaments. (English) Zbl 07740913

Mutzel, Petra (ed.) et al., 29th annual European symposium on algorithms. ESA 2021, Lisbon, Portugal (virtual conference), September 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 204, Article 58, 15 p. (2021).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Feedback vertex set and even cycle transversal for \(H\)-free graphs: finding large block graphs. (English) Zbl 07724255

Bonchi, Filippo (ed.) et al., 46th international symposium on mathematical foundations of computer science, MFCS 2021, August 23–27, 2021, Tallinn, Estonia. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 202, Article 82, 14 p. (2021).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Preface. (English) Zbl 07620416

Dabrowski, Konrad K. (ed.) et al., Surveys in combinatorics 2021. Based on plenary lectures given at the 28th British combinatorial conference, hosted online by Durham University, Durham, UK, July 5–9, 2021. Cambridge: Cambridge University Press. Lond. Math. Soc. Lect. Note Ser. 470, vii-viii (2021).
MSC:  00Bxx
PDFBibTeX XMLCite
Full Text: Link

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

Solving problems on generalized convex graphs via mim-width. (English) Zbl 07498678

Lubiw, Anna (ed.) et al., Algorithms and data structures. 17th international symposium, WADS 2021, virtual event, August 9–11, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12808, 200-214 (2021).
MSC:  68P05 68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Disjoint paths and connected subgraphs for \(H\)-free graphs. (English) Zbl 07495038

Flocchini, Paola (ed.) et al., Combinatorial algorithms. 32nd international workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12757, 414-427 (2021).
MSC:  68Rxx 68Wxx
PDFBibTeX XMLCite
Full Text: DOI

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

Surveys in combinatorics 2021. Based on plenary lectures given at the 28th British combinatorial conference, hosted online by Durham University, Durham, UK, July 5–9, 2021. (English) Zbl 1497.05001

London Mathematical Society Lecture Note Series 470. Cambridge: Cambridge University Press (ISBN 978-1-00-901888-3/pbk; 978-1-00-903621-4/ebook). viii, 369 p. (2021).
MSC:  05-06 00B25
PDFBibTeX XMLCite
Full Text: DOI

Contracting to a longest path in \(H\)-free graphs. (English) Zbl 07765380

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

Bounding the mim-width of hereditary graph classes. (English) Zbl 07764097

Cao, Yixin (ed.) et al., 15th international symposium on parameterized and exact computation, IPEC 2020, Hong Kong, China, virtual conference, December 14–18, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 180, Article 6, 18 p. (2020).
MSC:  68Q25 68Q27 68Wxx
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

Computing subset transversals in \(H\)-free graphs. (English) Zbl 07636205

Adler, Isolde (ed.) et al., Graph-theoretic concepts in computer science. 46th international workshop, WG 2020, Leeds, UK, June 24–26, 2020. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12301, 187-199 (2020).
MSC:  68R10
PDFBibTeX XMLCite
Full Text: DOI

Clique-width: harnessing the power of atoms. (English) Zbl 07636200

Adler, Isolde (ed.) et al., Graph-theoretic concepts in computer science. 46th international workshop, WG 2020, Leeds, UK, June 24–26, 2020. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12301, 119-133 (2020).
MSC:  68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Steiner trees for hereditary graph classes. (English) Zbl 07600807

Kohayakawa, Yoshiharu (ed.) et al., Latin 2020: theoretical informatics. 14th Latin American symposium, São Paulo, Brazil, January 5–8, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12118, 613-624 (2020).
MSC:  68Qxx 68Rxx 68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Colouring \(H\)-free graphs of bounded diameter. (English) Zbl 07561658

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 14, 14 p. (2019).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Finding a small number of colourful components. (English) Zbl 1514.68204

Pisanti, Nadia (ed.) et al., 30th annual symposium on combinatorial pattern matching, CPM 2019, Pisa, Italy, June 18–20, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 128, Article 20, 14 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Clique-width for hereditary graph classes. (English) Zbl 1476.05175

Lo, Allan (ed.) et al., Surveys in combinatorics 2019. Papers based on the 27th British combinatorial conference, University of Birmingham, Birmingham, UK, July 29 – August 2, 2019. Cambridge: Cambridge University Press. Lond. Math. Soc. Lect. Note Ser. 456, 1-56 (2019).
MSC:  05C75 05C15
PDFBibTeX XMLCite
Full Text: DOI arXiv

On cycle transversals and their connected variants in the absence of a small linear forest. (English) Zbl 07160840

Gąsieniec, Leszek Antoni (ed.) et al., Fundamentals of computation theory. 22nd international symposium, FCT 2019, Copenhagen, Denmark, August 12–14, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11651, 258-273 (2019).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

Graph isomorphism for \((H_1,H_2)\)-free graphs: an almost complete dichotomy. (English) Zbl 1512.68196

Friggstad, Zachary (ed.) et al., Algorithms and data structures. 16th international symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11646, 181-195 (2019).
PDFBibTeX XMLCite
Full Text: DOI Link

Computing with foresight and industry. 15th conference on computability in Europe, CiE 2019, Durham, UK, July 15–19, 2019. Proceedings. (English) Zbl 1428.68037

Lecture Notes in Computer Science 11558. Cham: Springer (ISBN 978-3-030-22995-5/pbk; 978-3-030-22996-2/ebook). xii, 323 p. (2019).
MSC:  68-06 68Qxx 00B25
PDFBibTeX XMLCite
Full Text: DOI

Colouring \((P_r+P_s)\)-free graphs. (English) Zbl 07561359

Hsu, Wen-Lian (ed.) et al., 29th international symposium on algorithms and computation, ISAAC 2018, December 16–19, 2018, Jiaoxi, Yilan, Taiwan. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 123, Article 5, 13 p. (2018).
MSC:  68R10 05C15 68Q25
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

On the price of independence for vertex cover, feedback vertex set and odd cycle transversal. (English) Zbl 1516.05185

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 63, 15 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Surjective H-colouring over reflexive digraphs. (English) Zbl 1485.68191

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 49, 14 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI

Colouring square-free graphs without long induced paths. (English) Zbl 1487.68127

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 35, 15 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI

Connected vertex cover for \((sP_1+P_5)\)-free graphs. (English) Zbl 1436.68244

Brandstädt, Andreas (ed.) et al., Graph-theoretic concepts in computer science. 44th international workshop, WG 2018, Cottbus, Germany, June 27–29, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11159, 279-291 (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

Computing small pivot-minors. (English) Zbl 1517.68286

Brandstädt, Andreas (ed.) et al., Graph-theoretic concepts in computer science. 44th international workshop, WG 2018, Cottbus, Germany, June 27–29, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11159, 125-138 (2018).
PDFBibTeX XMLCite
Full Text: DOI Link

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

Biographic Reference