Sokołowski, Marek Bounds on half graph orders in powers of sparse graphs. (English) Zbl 1511.05120 Electron. J. Comb. 30, No. 2, Research Paper P2.3, 89 p. (2023). MSC: 05C42 05C12 05C35 05C75 PDFBibTeX XMLCite \textit{M. Sokołowski}, Electron. J. Comb. 30, No. 2, Research Paper P2.3, 89 p. (2023; Zbl 1511.05120) Full Text: DOI arXiv
Bonnet, Édouard; Kim, Eun Jung; Reinald, Amadeus; Thomassé, Stéphan; Watrigant, Rémi Twin-width and polynomial kernels. (English) Zbl 1523.68046 Algorithmica 84, No. 11, 3300-3337 (2022). MSC: 68R10 05C69 05C70 68Q25 68Q27 PDFBibTeX XMLCite \textit{É. Bonnet} et al., Algorithmica 84, No. 11, 3300--3337 (2022; Zbl 1523.68046) Full Text: DOI arXiv
Drange, Pål Grønås; Muzi, Irene; Reidl, Felix Harmless sets in sparse classes. (English) Zbl 07577707 Bazgan, Cristina (ed.) et al., Combinatorial algorithms. 33rd international workshop, IWOCA 2022, Trier, Germany, June 7–9, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13270, 299-312 (2022). MSC: 68Rxx 68Wxx PDFBibTeX XMLCite \textit{P. G. Drange} et al., Lect. Notes Comput. Sci. 13270, 299--312 (2022; Zbl 07577707) Full Text: DOI arXiv
Fomin, Fedor V.; Ramamoorthi, Vijayaragunathan On the parameterized complexity of the expected coverage problem. (English) Zbl 07523541 Theory Comput. Syst. 66, No. 2, 432-453 (2022). MSC: 68Qxx 05Cxx 90Bxx PDFBibTeX XMLCite \textit{F. V. Fomin} and \textit{V. Ramamoorthi}, Theory Comput. Syst. 66, No. 2, 432--453 (2022; Zbl 07523541) Full Text: DOI
Joret, Gwenaël; Micek, Piotr Improved bounds for weak coloring numbers. (English) Zbl 1486.05092 Electron. J. Comb. 29, No. 1, Research Paper P1.60, 16 p. (2022). MSC: 05C15 05C83 PDFBibTeX XMLCite \textit{G. Joret} and \textit{P. Micek}, Electron. J. Comb. 29, No. 1, Research Paper P1.60, 16 p. (2022; Zbl 1486.05092) Full Text: DOI arXiv
Lokshtanov, Daniel; Mouawad, Amer E.; Panolan, Fahad; Siebertz, Sebastian On the parameterized complexity of reconfiguration of connected dominating sets. (English) Zbl 1518.68273 Algorithmica 84, No. 2, 482-509 (2022). MSC: 68R10 05C69 68Q27 PDFBibTeX XMLCite \textit{D. Lokshtanov} et al., Algorithmica 84, No. 2, 482--509 (2022; Zbl 1518.68273) Full Text: DOI arXiv Link
Kublenz, Simeon; Siebertz, Sebastian; Vigny, Alexandre Constant round distributed domination on graph classes with bounded expansion. (English) Zbl 07495148 Jurdziński, Tomasz (ed.) et al., Structural information and communication complexity. 28th international colloquium, SIROCCO 2021, Wrocław, Poland, June 28 – July 1, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12810, 334-351 (2021). MSC: 68Mxx 68Q11 68R10 PDFBibTeX XMLCite \textit{S. Kublenz} et al., Lect. Notes Comput. Sci. 12810, 334--351 (2021; Zbl 07495148) Full Text: DOI arXiv
Pilipczuk, Michał; Siebertz, Sebastian Kernelization and approximation of distance-\(r\) independent sets on nowhere dense graphs. (English) Zbl 1506.05162 Eur. J. Comb. 94, Article ID 103309, 19 p. (2021). MSC: 05C69 05C75 68Q25 PDFBibTeX XMLCite \textit{M. Pilipczuk} and \textit{S. Siebertz}, Eur. J. Comb. 94, Article ID 103309, 19 p. (2021; Zbl 1506.05162) Full Text: DOI arXiv
Lokshtanov, Daniel; Mouawad, Amer E.; Panolan, Fahad; Siebertz, Sebastian On the parameterized complexity of reconfiguration of connected dominating sets. (English) Zbl 07764115 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 24, 15 p. (2020). MSC: 68Q25 68Q27 68Wxx PDFBibTeX XMLCite \textit{D. Lokshtanov} et al., LIPIcs -- Leibniz Int. Proc. Inform. 180, Article 24, 15 p. (2020; Zbl 07764115) Full Text: DOI
Einarson, Carl; Reidl, Felix A general kernelization technique for domination and independence problems in sparse classes. (English) Zbl 07764102 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 11, 15 p. (2020). MSC: 68Q25 68Q27 68Wxx PDFBibTeX XMLCite \textit{C. Einarson} and \textit{F. Reidl}, LIPIcs -- Leibniz Int. Proc. Inform. 180, Article 11, 15 p. (2020; Zbl 07764102) Full Text: DOI arXiv
Fomin, Fedor V.; Ramamoorthi, Vijayaragunathan On the parameterized complexity of the expected coverage problem. (English) Zbl 07603924 Fernau, Henning, Computer science – theory and applications. 15th international computer science symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 – July 3, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12159, 224-236 (2020). MSC: 68Qxx PDFBibTeX XMLCite \textit{F. V. Fomin} and \textit{V. Ramamoorthi}, Lect. Notes Comput. Sci. 12159, 224--236 (2020; Zbl 07603924) Full Text: DOI
Blanché, Alexandre; Mizuta, Haruka; Ouvrard, Paul; Suzuki, Akira Decremental optimization of dominating sets under the reconfiguration framework. (English) Zbl 07600999 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, 69-82 (2020). MSC: 68Rxx 68Wxx PDFBibTeX XMLCite \textit{A. Blanché} et al., Lect. Notes Comput. Sci. 12126, 69--82 (2020; Zbl 07600999) Full Text: DOI arXiv
Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Thilikos, Dimitrios M. Bidimensionality and kernels. (English) Zbl 1475.05161 SIAM J. Comput. 49, No. 6, 1397-1422 (2020). Reviewer: Steve Noble (London) MSC: 05C85 05C10 68R10 05C83 68Q25 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., SIAM J. Comput. 49, No. 6, 1397--1422 (2020; Zbl 1475.05161) Full Text: DOI arXiv
Einarson, Carl; Reidl, Felix Domination above \(r\)-independence: does sparseness help? (English) Zbl 07561684 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 40, 13 p. (2019). MSC: 68Qxx PDFBibTeX XMLCite \textit{C. Einarson} and \textit{F. Reidl}, LIPIcs -- Leibniz Int. Proc. Inform. 138, Article 40, 13 p. (2019; Zbl 07561684) Full Text: DOI arXiv
Kreutzer, Stephan; Muzi, Irene; Ossona, De Mendez Patrice; Rabinovich, Roman; Siebertz, Sebastian Algorithmic properties of sparse digraphs. (English) Zbl 07559155 Niedermeier, Rolf (ed.) et al., 36th international symposium on theoretical aspects of computer science, STACS 2019, March 13–16, 2019, Berlin, Germany. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 126, Article 46, 20 p. (2019). MSC: 68Qxx PDFBibTeX XMLCite \textit{S. Kreutzer} et al., LIPIcs -- Leibniz Int. Proc. Inform. 126, Article 46, 20 p. (2019; Zbl 07559155) Full Text: DOI
Fabiański, Grzegorz; Pilipczuk, Michal; Siebertz, Sebastian; Toruńczyk, Szymon Progressive algorithms for domination and independence. (English) Zbl 07559136 Niedermeier, Rolf (ed.) et al., 36th international symposium on theoretical aspects of computer science, STACS 2019, March 13–16, 2019, Berlin, Germany. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 126, Article 27, 16 p. (2019). MSC: 68Qxx PDFBibTeX XMLCite \textit{G. Fabiański} et al., LIPIcs -- Leibniz Int. Proc. Inform. 126, Article 27, 16 p. (2019; Zbl 07559136) Full Text: DOI arXiv
Nadara, Wojciech; Pilipczuk, Marcin; Rabinovich, Roman; Reidl, Felix; Siebertz, Sebastian Empirical evaluation of approximation algorithms for generalized graph coloring and uniform quasi-wideness. (English) Zbl 1521.68256 ACM J. Exp. Algorithm. 24, No. 2, Article No. 2.6, 34 p. (2019). MSC: 68W25 05C15 05C42 68R10 PDFBibTeX XMLCite \textit{W. Nadara} et al., ACM J. Exp. Algorithm. 24, No. 2, Article No. 2.6, 34 p. (2019; Zbl 1521.68256) Full Text: DOI Link
Eiben, Eduard; Kumar, Mithilesh; Mouawad, Amer E.; Panolan, Fahad; Siebertz, Sebastian Lossy kernels for connected dominating set on sparse graphs. (English) Zbl 1430.68195 SIAM J. Discrete Math. 33, No. 3, 1743-1771 (2019). MSC: 68R10 05C69 68Q27 PDFBibTeX XMLCite \textit{E. Eiben} et al., SIAM J. Discrete Math. 33, No. 3, 1743--1771 (2019; Zbl 1430.68195) Full Text: DOI
Eiben, Eduard; Hermelin, Danny; Ramanujan, M. S. On approximate preprocessing for domination and hitting subgraphs with connected deletion sets. (English) Zbl 1425.68309 J. Comput. Syst. Sci. 105, 158-170 (2019). MSC: 68R10 68Q25 68W25 PDFBibTeX XMLCite \textit{E. Eiben} et al., J. Comput. Syst. Sci. 105, 158--170 (2019; Zbl 1425.68309) Full Text: DOI
Hanaka, Tesshu; Nishimura, Naomi; Ono, Hirotaka On directed covering and domination problems. (English) Zbl 1407.05194 Discrete Appl. Math. 259, 76-99 (2019). MSC: 05C70 05C69 05C20 05C85 PDFBibTeX XMLCite \textit{T. Hanaka} et al., Discrete Appl. Math. 259, 76--99 (2019; Zbl 1407.05194) Full Text: DOI Link
Misra, Neeldhara; Panolan, Fahad; Rai, Ashutosh; Raman, Venkatesh; Saurabh, Saket Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs. (English) Zbl 1414.05128 Algorithmica 81, No. 1, 26-46 (2019). MSC: 05C17 05C85 05C15 68Q17 68W20 PDFBibTeX XMLCite \textit{N. Misra} et al., Algorithmica 81, No. 1, 26--46 (2019; Zbl 1414.05128) Full Text: DOI
Reidl, Felix; Villaamil, Fernando Sánchez; Stavropoulos, Konstantinos Characterising bounded expansion by neighbourhood complexity. (English) Zbl 1400.05248 Eur. J. Comb. 75, 152-168 (2019). MSC: 05C99 05C15 PDFBibTeX XMLCite \textit{F. Reidl} et al., Eur. J. Comb. 75, 152--168 (2019; Zbl 1400.05248) Full Text: DOI arXiv Link
Nadara, Wojciech; Pilipczuk, Marcin; Rabinovich, Roman; Reidl, Felix; Siebertz, Sebastian Empirical evaluation of approximation algorithms for generalized graph coloring and uniform quasi-wideness. (English) Zbl 1493.68398 D’Angelo, Gianlorenzo (ed.), 17th symposium on experimental algorithms, SEA 2018, June 27–29, 2018, L’Aquila, Italy. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 103, Article 14, 16 p. (2018). MSC: 68W25 05C15 05C85 68R10 PDFBibTeX XMLCite \textit{W. Nadara} et al., LIPIcs -- Leibniz Int. Proc. Inform. 103, Article 14, 16 p. (2018; Zbl 1493.68398) Full Text: DOI arXiv
Eiben, Eduard; Kumar, Mithilesh; Mouawad, Amer E.; Panolan, Fahad; Siebertz, Sebastian Lossy kernels for connected dominating set on sparse graphs. (English) Zbl 1487.68176 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 29, 15 p. (2018). MSC: 68R10 05C69 68Q27 PDFBibTeX XMLCite \textit{E. Eiben} et al., LIPIcs -- Leibniz Int. Proc. Inform. 96, Article 29, 15 p. (2018; Zbl 1487.68176) Full Text: DOI arXiv
Siebertz, Sebastian Reconfiguration on nowhere dense graph classes. (English) Zbl 1393.05171 Electron. J. Comb. 25, No. 3, Research Paper P3.24, 18 p. (2018). MSC: 05C42 05C69 05C85 68R10 PDFBibTeX XMLCite \textit{S. Siebertz}, Electron. J. Comb. 25, No. 3, Research Paper P3.24, 18 p. (2018; Zbl 1393.05171) Full Text: arXiv Link
Lokshtanov, Daniel; Mouawad, Amer E.; Panolan, Fahad; Ramanujan, M. S.; Saurabh, Saket Reconfiguration on sparse graphs. (English) Zbl 1390.68351 J. Comput. Syst. Sci. 95, 122-131 (2018). MSC: 68Q25 05C69 68Q17 PDFBibTeX XMLCite \textit{D. Lokshtanov} et al., J. Comput. Syst. Sci. 95, 122--131 (2018; Zbl 1390.68351) Full Text: DOI arXiv
Hanaka, Tesshu; Nishimura, Naomi; Ono, Hirotaka On directed covering and domination problems. (English) Zbl 1457.05088 Okamoto, Yoshio (ed.) et al., 28th international symposium on algorithms and computation, ISAAC 2017, December 9–12, 2017, Phuket, Thailand. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 92, Article 45, 12 p. (2017). MSC: 05C70 05C20 05C69 05C85 68Q17 68Q27 PDFBibTeX XMLCite \textit{T. Hanaka} et al., LIPIcs -- Leibniz Int. Proc. Inform. 92, Article 45, 12 p. (2017; Zbl 1457.05088) Full Text: DOI
Muzi, Irene; O’Brien, Michael P.; Reidl, Felix; Sullivan, Blair D. Being even slightly shallow makes life hard. (English) Zbl 1441.68194 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 79, 13 p. (2017). MSC: 68R10 05C42 05C83 68Q17 68Q27 PDFBibTeX XMLCite \textit{I. Muzi} et al., LIPIcs -- Leibniz Int. Proc. Inform. 83, Article 79, 13 p. (2017; Zbl 1441.68194) Full Text: DOI arXiv
Eiben, Eduard; Hermelin, Danny; Ramanujan, M. S. Lossy kernels for hitting subgraphs. (English) Zbl 1441.68175 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 67, 14 p. (2017). MSC: 68R10 68Q27 68W25 68W40 PDFBibTeX XMLCite \textit{E. Eiben} et al., LIPIcs -- Leibniz Int. Proc. Inform. 83, Article 67, 14 p. (2017; Zbl 1441.68175) Full Text: DOI
Bonamy, Marthe; Kowalik, Łukasz; Pilipczuk, Michał; Socała, Arkadiusz Linear kernels for outbranching problems in sparse digraphs. (English) Zbl 1378.68063 Algorithmica 79, No. 1, 159-188 (2017). MSC: 68Q25 05C20 05C85 PDFBibTeX XMLCite \textit{M. Bonamy} et al., Algorithmica 79, No. 1, 159--188 (2017; Zbl 1378.68063) Full Text: DOI
van den Heuvel, Jan; Ossona de Mendez, Patrice; Quiroz, Daniel; Rabinovich, Roman; Siebertz, Sebastian On the generalised colouring numbers of graphs that exclude a fixed minor. (English) Zbl 1369.05089 Eur. J. Comb. 66, 129-144 (2017). MSC: 05C15 05C35 PDFBibTeX XMLCite \textit{J. van den Heuvel} et al., Eur. J. Comb. 66, 129--144 (2017; Zbl 1369.05089) Full Text: DOI arXiv Link
Gajarský, Jakub; Hliněný, Petr; Obdržálek, Jan; Ordyniak, Sebastian; Reidl, Felix; Rossmanith, Peter; Sánchez Villaamil, Fernando; Sikdar, Somnath Kernelization using structural parameters on sparse graph classes. (English) Zbl 1353.68127 J. Comput. Syst. Sci. 84, 219-242 (2017). MSC: 68Q25 05C85 PDFBibTeX XMLCite \textit{J. Gajarský} et al., J. Comput. Syst. Sci. 84, 219--242 (2017; Zbl 1353.68127) Full Text: DOI arXiv Link
Dvořák, Zdeněk Sublinear separators, fragility and subexponential expansion. (English) Zbl 1327.05316 Eur. J. Comb. 52, Part A, 103-119 (2016). MSC: 05C83 05C70 05C85 PDFBibTeX XMLCite \textit{Z. Dvořák}, Eur. J. Comb. 52, Part A, 103--119 (2016; Zbl 1327.05316) Full Text: DOI arXiv
Lokshtanov, Daniel; Mouawad, Amer E.; Panolan, Fahad; Ramanujan, M. S.; Saurabh, Saket Reconfiguration on sparse graphs. (English) Zbl 1451.68134 Dehne, Frank (ed.) et al., Algorithms and data structures. 14th international symposium, WADS 2015, Victoria, BC, Canada, August 5–7, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9214, 506-517 (2015). MSC: 68Q25 05C69 68Q17 68Q27 68R10 PDFBibTeX XMLCite \textit{D. Lokshtanov} et al., Lect. Notes Comput. Sci. 9214, 506--517 (2015; Zbl 1451.68134) Full Text: DOI arXiv