×

Found 66 Documents (Results 1–66)

Grouped domination parameterized by vertex cover, twin cover, and beyond. (English) Zbl 07745712

Mavronicolas, Marios (ed.), Algorithms and complexity. 13th international conference, CIAC 2023, Larnaca, Cyprus, June 13–16, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13898, 263-277 (2023).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Reconfiguration of regular induced subgraphs. (English) Zbl 07556559

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, 35-46 (2022).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Exploring the gap between treedepth and vertex cover through vertex integrity. (English) Zbl 07667136

Calamoneri, Tiziana (ed.) et al., Algorithms and complexity. 12th international conference, CIAC 2021, virtual event, May 10–12, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12701, 271-285 (2021).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Parameterized complexity of graph burning. (English) Zbl 07764112

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 21, 10 p. (2020).
MSC:  68Q25 68Q27 68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Grundy distinguishes treewidth from pathwidth. (English) Zbl 07651153

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

Parameterized complexity of \((A,\ell)\)-path packing. (English) Zbl 07600997

Gąsieniec, Leszek (ed.) et al., Combinatorial algorithms. 31st international workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12126, 43-55 (2020).
MSC:  68Rxx 68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Vertex deletion problems on chordal graphs. (English) Zbl 1491.68084

Lokam, Satya (ed.) et al., 37th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2017, IIT Kanpur, India, December 12–14, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 93, Article 22, 14 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI

Reconfiguration of colorable sets in classes of perfect graphs. (English) Zbl 1477.68231

Eppstein, David (ed.), 16th Scandinavian symposium and workshops on algorithm theory. SWAT 2018, June 18–20, 2018, Malmö University, Malmö, Sweden. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 101, Article 27, 13 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI

Parameterized orientable deletion. (English) Zbl 1477.68229

Eppstein, David (ed.), 16th Scandinavian symposium and workshops on algorithm theory. SWAT 2018, June 18–20, 2018, Malmö University, Malmö, Sweden. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 101, Article 24, 13 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI

How bad is the freedom to Flood-It? (English) Zbl 1489.05102

Ito, Hiro (ed.) et al., 9th international conference on fun with algorithms, FUN 2018, June 13–15, 2018, La Maddalena Island, Italy. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 100, Article 5, 13 p. (2018).
MSC:  05C57 05C85 68Q27
PDFBibTeX XMLCite
Full Text: DOI

Safe sets in graphs: graph classes and structural parameters. (English) Zbl 1483.68245

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, 241-253 (2016).
PDFBibTeX XMLCite
Full Text: DOI HAL

Induced minor free graphs: isomorphism and clique-width. (English) Zbl 1417.05196

Mayr, Ernst W. (ed.), Graph-theoretic concepts in computer science. 41st international workshop, WG 2015, Garching, Germany, June 17–19, 2015. Revised papers. Berlin: Springer. Lect. Notes Comput. Sci. 9224, 299-311 (2016).
MSC:  05C83 05C60 05C69
PDFBibTeX XMLCite
Full Text: DOI arXiv

Approximability of the path-distance-width for AT-free graphs. (English) Zbl 1341.05054

Kolman, Petr (ed.) et al., Graph-theoretic concepts in computer science. 37th international workshop, WG 2011, Teplá Monastery, Czech Republic, June 21–24, 2011. Revised papers. Berlin: Springer (ISBN 978-3-642-25869-5/pbk). Lecture Notes in Computer Science 6986, 271-282 (2011).
MSC:  05C12 05C38 68Q17
PDFBibTeX XMLCite
Full Text: DOI

Hardness results and an exact exponential algorithm for the spanning tree congestion problem. (English) Zbl 1331.68094

Ogihara, Mitsunori (ed.) et al., Theory and applications of models of computation. 8th annual conference, TAMC 2011, Tokyo, Japan, May 23–25, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20876-8/pbk). Lecture Notes in Computer Science 6648, 452-462 (2011).
PDFBibTeX XMLCite
Full Text: DOI

Complexity results for the spanning tree congestion problem. (English) Zbl 1308.68067

Thilikos, Dimitrios M. (ed.), Graph theoretic concepts in computer science. 36th international workshop, WG 2010, Zarós, Crete, Greece, June 28–30, 2010. Revised papers. Berlin: Springer (ISBN 978-3-642-16925-0/pbk). Lecture Notes in Computer Science 6410, 3-14 (2010).
PDFBibTeX XMLCite
Full Text: DOI

Efficient enumeration of ordered trees with \(k\) leaves (extended abstract). (English) Zbl 1211.05170

Das, Sandip (ed.) et al., WALCOM: Algorithms and computation. Third international workshop, WALCOM 2009, Kolkata, India, February 18–20, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-00201-4/pbk). Lecture Notes in Computer Science 5431, 141-150 (2009).
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