Dublois, Louis; Lampis, Michael; Paschos, Vangelis Th. Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation. (English) Zbl 07540243 Theor. Comput. Sci. 923, 271-291 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{L. Dublois} et al., Theor. Comput. Sci. 923, 271--291 (2022; Zbl 07540243) Full Text: DOI arXiv
Katsikarelis, Ioannis; Lampis, Michael; Paschos, Vangelis Th. Structurally parameterized \(d\)-scattered set. (English) Zbl 1479.05081 Discrete Appl. Math. 308, 168-186 (2022). MSC: 05C12 05C69 68R10 PDFBibTeX XMLCite \textit{I. Katsikarelis} et al., Discrete Appl. Math. 308, 168--186 (2022; Zbl 1479.05081) Full Text: DOI
Dublois, Louis; Lampis, Michael; Paschos, Vangelis Th. Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation. (English) Zbl 07667131 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, 202-215 (2021). MSC: 68Wxx PDFBibTeX XMLCite \textit{L. Dublois} et al., Lect. Notes Comput. Sci. 12701, 202--215 (2021; Zbl 07667131) Full Text: DOI
Dublois, Louis; Lampis, Michael; Paschos, Vangelis Th. New algorithms for mixed dominating set. (English) Zbl 07764100 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 9, 17 p. (2020). MSC: 68Q25 68Q27 68Wxx PDFBibTeX XMLCite \textit{L. Dublois} et al., LIPIcs -- Leibniz Int. Proc. Inform. 180, Article 9, 17 p. (2020; Zbl 07764100) Full Text: DOI
Katsikarelis, Ioannis; Lampis, Michael; Paschos, Vangelis Th. Structural parameters, tight bounds, and approximation for \((k, r)\)-center. (English) Zbl 1414.05102 Discrete Appl. Math. 264, 90-117 (2019). MSC: 05C12 05C69 PDFBibTeX XMLCite \textit{I. Katsikarelis} et al., Discrete Appl. Math. 264, 90--117 (2019; Zbl 1414.05102) Full Text: DOI arXiv Link
Paschos, Vangelis Th. When polynomial approximation meets exact computation. (English) Zbl 1434.68202 Ann. Oper. Res. 271, No. 1, 87-103 (2018). MSC: 68Q25 05C85 68W25 PDFBibTeX XMLCite \textit{V. Th. Paschos}, Ann. Oper. Res. 271, No. 1, 87--103 (2018; Zbl 1434.68202) Full Text: DOI
Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin; Fernau, Henning; Jansen, Klaus; Klein, Kim-Manuel; Lampis, Michael; Liedloff, Mathieu; Monnot, Jérôme; Paschos, Vangelis Th. The many facets of upper domination. (English) Zbl 1388.68099 Theor. Comput. Sci. 717, 2-25 (2018). MSC: 68Q25 05C69 68W25 PDFBibTeX XMLCite \textit{C. Bazgan} et al., Theor. Comput. Sci. 717, 2--25 (2018; Zbl 1388.68099) Full Text: DOI
Bonnet, Édouard; Paschos, Vangelis Th. Sparsification and subexponential approximation. (English) Zbl 1408.68068 Acta Inf. 55, No. 1, 1-15 (2018). Reviewer: Sevag Gharibian (Paderborn) MSC: 68Q17 68W25 PDFBibTeX XMLCite \textit{É. Bonnet} and \textit{V. Th. Paschos}, Acta Inf. 55, No. 1, 1--15 (2018; Zbl 1408.68068) Full Text: DOI arXiv
Bonnet, Édouard; Lampis, Michael; Paschos, Vangelis Th. Time-approximation trade-offs for inapproximable problems. (English) Zbl 1380.68440 J. Comput. Syst. Sci. 92, 171-180 (2018). MSC: 68W25 68Q17 68Q25 68R10 PDFBibTeX XMLCite \textit{É. Bonnet} et al., J. Comput. Syst. Sci. 92, 171--180 (2018; Zbl 1380.68440) Full Text: DOI Link
Katsikarelis, Ioannis; Lampis, Michael; Paschos, Vangelis Th. Structural parameters, tight bounds, and approximation for \((k,r)\)-center. (English) Zbl 1457.68126 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 50, 13 p. (2017). MSC: 68Q25 05C12 05C69 05C85 68Q17 68Q27 68W25 PDFBibTeX XMLCite \textit{I. Katsikarelis} et al., LIPIcs -- Leibniz Int. Proc. Inform. 92, Article 50, 13 p. (2017; Zbl 1457.68126) Full Text: DOI
Bourgeois, Nicolas; Giannakos, Aristotelis; Lucarelli, Giorgio; Milis, Ioannis; Paschos, Vangelis Th. Exact and superpolynomial approximation algorithms for the densest K-subgraph problem. (English) Zbl 1375.90296 Eur. J. Oper. Res. 262, No. 3, 894-903 (2017). MSC: 90C35 90C27 05C85 90C60 PDFBibTeX XMLCite \textit{N. Bourgeois} et al., Eur. J. Oper. Res. 262, No. 3, 894--903 (2017; Zbl 1375.90296) Full Text: DOI
Escoffier, Bruno; Paschos, Vangelis Th.; Tourniaire, Emeric Super-polynomial approximation branching algorithms. (English) Zbl 1401.68360 RAIRO, Oper. Res. 50, No. 4-5, 979-994 (2016). MSC: 68W25 68Q25 90C27 PDFBibTeX XMLCite \textit{B. Escoffier} et al., RAIRO, Oper. Res. 50, No. 4--5, 979--994 (2016; Zbl 1401.68360) Full Text: DOI HAL
Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin; Fernau, Henning; Jansen, Klaus; Klein, Kim-Manuel; Lampis, Michael; Liedloff, Mathieu; Monnot, Jérôme; Paschos, Vangelis Th. Algorithmic aspects of Upper Domination: a parameterised perspective. (English) Zbl 1476.68114 Dondi, Riccardo (ed.) et al., Algorithmic aspects in information and management. 11th international conference, AAIM 2016, Bergamo, Italy, July 18–20, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9778, 113-124 (2016). MSC: 68Q27 05C69 68Q17 PDFBibTeX XMLCite \textit{C. Bazgan} et al., Lect. Notes Comput. Sci. 9778, 113--124 (2016; Zbl 1476.68114) Full Text: DOI
Paschos, Vangelis Th. When polynomial approximation meets exact computation. (English) Zbl 1355.68128 4OR 13, No. 3, 227-245 (2015). MSC: 68Q25 05C85 68W25 PDFBibTeX XMLCite \textit{V. Th. Paschos}, 4OR 13, No. 3, 227--245 (2015; Zbl 1355.68128) Full Text: DOI
Bonnet, Édouard; Escoffier, Bruno; Paschos, Vangelis; Tourniaire, Émeric Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization. (English) Zbl 1312.68095 Algorithmica 71, No. 3, 566-580 (2015). MSC: 68Q25 05C70 05C85 PDFBibTeX XMLCite \textit{É. Bonnet} et al., Algorithmica 71, No. 3, 566--580 (2015; Zbl 1312.68095) Full Text: DOI Link
Bonnet, Edouard; Escoffier, Bruno; Kim, Eun; Paschos, Vangelis On subexponential and FPT-time inapproximability. (English) Zbl 1312.68232 Algorithmica 71, No. 3, 541-565 (2015). MSC: 68W25 05C69 68Q17 68Q25 PDFBibTeX XMLCite \textit{E. Bonnet} et al., Algorithmica 71, No. 3, 541--565 (2015; Zbl 1312.68232) Full Text: DOI arXiv
Della Croce, Federico; Paschos, Vangelis Th. Efficient algorithms for the max \(k\)-vertex cover problem. (English) Zbl 1315.90056 J. Comb. Optim. 28, No. 3, 674-691 (2014). MSC: 90C35 90C27 PDFBibTeX XMLCite \textit{F. Della Croce} and \textit{V. Th. Paschos}, J. Comb. Optim. 28, No. 3, 674--691 (2014; Zbl 1315.90056) Full Text: DOI
Escoffier, Bruno; Paschos, Vangelis Th.; Tourniaire, Emeric Approximating MAX SAT by moderately exponential and parameterized algorithms. (English) Zbl 1303.68155 Theor. Comput. Sci. 560, Part 2, 147-157 (2014). MSC: 68W25 68Q25 PDFBibTeX XMLCite \textit{B. Escoffier} et al., Theor. Comput. Sci. 560, Part 2, 147--157 (2014; Zbl 1303.68155) Full Text: DOI
Paschos, Vangelis Th. Moderately exponential approximation: bridging the gap between exact computation and polynomial approximation. (English) Zbl 1375.68070 Migdalas, Athanasios (ed.) et al., Optimization theory, decision making, and operations research applications. Proceedings of the 1st international symposium and 10th Balkan conference on operational research, Thessaloniki, Greece, September 22–25, 2011. New York, NY: Springer (ISBN 978-1-4614-5133-4/hbk; 978-1-4614-5134-1/ebook). Springer Proceedings in Mathematics & Statistics 31, 1-14 (2013). MSC: 68Q25 68W25 90C27 90C60 PDFBibTeX XMLCite \textit{V. Th. Paschos}, Springer Proc. Math. Stat. 31, 1--14 (2013; Zbl 1375.68070) Full Text: DOI HAL
Boria, Nicolas; Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis Th. Exponential approximation schemata for some network design problems. (English) Zbl 1334.68300 J. Discrete Algorithms 22, 43-52 (2013). MSC: 68W25 68Q25 90B10 90C27 90C35 PDFBibTeX XMLCite \textit{N. Boria} et al., J. Discrete Algorithms 22, 43--52 (2013; Zbl 1334.68300) Full Text: DOI
Escoffier, Bruno; Paschos, Vangelis Th.; Tourniaire, Emeric Moderately exponential time and fixed parameter approximation algorithms. (English) Zbl 1310.68239 Optimization 62, No. 8, 1019-1036 (2013). MSC: 68W25 05C69 05C70 05C85 68Q17 68Q25 90C27 PDFBibTeX XMLCite \textit{B. Escoffier} et al., Optimization 62, No. 8, 1019--1036 (2013; Zbl 1310.68239) Full Text: DOI
Bourgeois, N.; Della Croce, F.; Escoffier, B.; Paschos, V. Th. Algorithms for dominating clique problems. (English) Zbl 1252.05160 Theor. Comput. Sci. 459, 77-88 (2012). MSC: 05C69 05C85 68W40 68W25 PDFBibTeX XMLCite \textit{N. Bourgeois} et al., Theor. Comput. Sci. 459, 77--88 (2012; Zbl 1252.05160) Full Text: DOI
Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis Th. Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms. (English) Zbl 1237.05146 Discrete Appl. Math. 159, No. 17, 1954-1970 (2011). MSC: 05C69 05C70 05C85 68W25 68Q17 90C27 PDFBibTeX XMLCite \textit{N. Bourgeois} et al., Discrete Appl. Math. 159, No. 17, 1954--1970 (2011; Zbl 1237.05146) Full Text: DOI Link