Branson, Luke; Sutton, Andrew M. Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems closed under induced subgraphs. (English) Zbl 1506.68188 Theor. Comput. Sci. 951, Article ID 113719, 23 p. (2023). MSC: 68W50 68Q27 68R10 90C27 PDFBibTeX XMLCite \textit{L. Branson} and \textit{A. M. Sutton}, Theor. Comput. Sci. 951, Article ID 113719, 23 p. (2023; Zbl 1506.68188) Full Text: DOI
Goodrich, Timothy D.; Horton, Eric; Sullivan, Blair D. An updated experimental evaluation of graph bipartization methods. (English) Zbl 1499.68271 ACM J. Exp. Algorithm. 26, Paper No. 12, 24 p. (2021). MSC: 68R10 05C70 05C85 68Q12 90C35 PDFBibTeX XMLCite \textit{T. D. Goodrich} et al., ACM J. Exp. Algorithm. 26, Paper No. 12, 24 p. (2021; Zbl 1499.68271) Full Text: DOI arXiv
Ghoshal, Suprovat; Louis, Anand; Raychaudhury, Rahul Approximation algorithms for partially colorable graphs. (English) Zbl 07650095 Achlioptas, Dimitris (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques, 22nd international conference, APPROX 2019, and 23rd international conference, RANDOM 2019, Massachusetts Institute of Technology, Cambridge, MA, USA, September 20–22, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 145, Article 28, 20 p. (2019). MSC: 68W20 68W25 90C27 PDFBibTeX XMLCite \textit{S. Ghoshal} et al., LIPIcs -- Leibniz Int. Proc. Inform. 145, Article 28, 20 p. (2019; Zbl 07650095) Full Text: DOI arXiv
Fiorini, Samuel; Krithika, R.; Narayanaswamy, N. S.; Raman, Venkatesh Approximability of clique transversal in perfect graphs. (English) Zbl 1392.68201 Algorithmica 80, No. 8, 2221-2239 (2018). MSC: 68Q25 05C17 05C85 68Q17 90C05 PDFBibTeX XMLCite \textit{S. Fiorini} et al., Algorithmica 80, No. 8, 2221--2239 (2018; Zbl 1392.68201) Full Text: DOI
Song, Yinglei An improved parameterized algorithm for the independent feedback vertex set problem. (English) Zbl 1419.05205 Theor. Comput. Sci. 535, 25-30 (2014). MSC: 05C85 05C69 68W40 90C39 68Q25 PDFBibTeX XMLCite \textit{Y. Song}, Theor. Comput. Sci. 535, 25--30 (2014; Zbl 1419.05205) Full Text: DOI arXiv
Guillemot, Sylvain FPT algorithms for path-transversal and cycle-transversal problems. (English) Zbl 1248.90072 Discrete Optim. 8, No. 1, 61-71 (2011). MSC: 90C35 90C60 PDFBibTeX XMLCite \textit{S. Guillemot}, Discrete Optim. 8, No. 1, 61--71 (2011; Zbl 1248.90072) Full Text: DOI
Hüffner, Falk; Betzler, Nadja; Niedermeier, Rolf Separator-based data reduction for signed graph balancing. (English) Zbl 1206.90201 J. Comb. Optim. 20, No. 4, 335-360 (2010). MSC: 90C35 05C15 PDFBibTeX XMLCite \textit{F. Hüffner} et al., J. Comb. Optim. 20, No. 4, 335--360 (2010; Zbl 1206.90201) Full Text: DOI
Gutin, Gregory; Karapetyan, Daniel; Razgon, Igor Fixed-parameter algorithms in analysis of heuristics for extracting networks in linear programs. (English) Zbl 1273.68175 Chen, Jianer (ed.) et al., Parameterized and exact computation. 4th international workshop, IWPEC 2009, Copenhagen, Denmark, September 10–11, 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-11268-3/pbk). Lecture Notes in Computer Science 5917, 222-233 (2009). MSC: 68Q25 90C05 PDFBibTeX XMLCite \textit{G. Gutin} et al., Lect. Notes Comput. Sci. 5917, 222--233 (2009; Zbl 1273.68175) Full Text: DOI
Fiorini, Samuel; Hardy, Nadia; Reed, Bruce; Vetta, Adrian Approximate min-max relations for odd cycles in planar graphs. (English) Zbl 1113.05054 Math. Program. 110, No. 1 (B), 71-91 (2007). MSC: 05C38 05C85 68W25 90C27 PDFBibTeX XMLCite \textit{S. Fiorini} et al., Math. Program. 110, No. 1 (B), 71--91 (2007; Zbl 1113.05054) Full Text: DOI