Goyal, Dishant; Jaiswal, Ragesh Tight FPT approximation for socially fair clustering. (English) Zbl 07691942 Inf. Process. Lett. 182, Article ID 106383, 12 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{D. Goyal} and \textit{R. Jaiswal}, Inf. Process. Lett. 182, Article ID 106383, 12 p. (2023; Zbl 07691942) Full Text: DOI arXiv
Choudhary, Pratibha; Goodrich, Michael T.; Gupta, Siddharth; Khodabandeh, Hadi; Matias, Pedro; Raman, Venkatesh Improved kernels for tracking paths. (English) Zbl 07649515 Inf. Process. Lett. 181, Article ID 106360, 11 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{P. Choudhary} et al., Inf. Process. Lett. 181, Article ID 106360, 11 p. (2023; Zbl 07649515) Full Text: DOI
Kelk, Steven; Linz, Simone; Meuwese, Ruben Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance. (English) Zbl 07647059 Inf. Process. Lett. 180, Article ID 106336, 8 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{S. Kelk} et al., Inf. Process. Lett. 180, Article ID 106336, 8 p. (2023; Zbl 07647059) Full Text: DOI arXiv
Schierreich, Šimon; Suchý, Ondřej Waypoint routing on bounded treewidth graphs. (English) Zbl 1472.68121 Inf. Process. Lett. 173, Article ID 106165, 9 p. (2022). MSC: 68R10 05C85 68Q27 90C27 90C35 PDFBibTeX XMLCite \textit{Š. Schierreich} and \textit{O. Suchý}, Inf. Process. Lett. 173, Article ID 106165, 9 p. (2022; Zbl 1472.68121) Full Text: DOI arXiv
Luckow, Max-Jonathan; Fluschnik, Till On the computational complexity of length- and neighborhood-constrained path problems. (English) Zbl 1478.68251 Inf. Process. Lett. 156, Article ID 105913, 8 p. (2020). MSC: 68R10 05C38 68Q17 68Q27 PDFBibTeX XMLCite \textit{M.-J. Luckow} and \textit{T. Fluschnik}, Inf. Process. Lett. 156, Article ID 105913, 8 p. (2020; Zbl 1478.68251) Full Text: DOI arXiv
Paulusma, Daniël; Szeider, Stefan On the parameterized complexity of \((k,s)\)-SAT. (English) Zbl 1478.68105 Inf. Process. Lett. 143, 34-36 (2019). MSC: 68Q27 68R07 68W40 PDFBibTeX XMLCite \textit{D. Paulusma} and \textit{S. Szeider}, Inf. Process. Lett. 143, 34--36 (2019; Zbl 1478.68105) Full Text: DOI Link
Lin, Weibo; Xiao, Mingyu A \((3+\epsilon)k\)-vertex kernel for edge-disjoint triangle packing. (English) Zbl 1469.68075 Inf. Process. Lett. 142, 20-26 (2019). MSC: 68R10 05C70 05C85 68Q27 PDFBibTeX XMLCite \textit{W. Lin} and \textit{M. Xiao}, Inf. Process. Lett. 142, 20--26 (2019; Zbl 1469.68075) Full Text: DOI
Lin, Mugang; Feng, Qilong; Wang, Jianxin; Chen, Jianer; Fu, Bin; Li, Wenjun An improved FPT algorithm for almost forest deletion problem. (English) Zbl 1457.68220 Inf. Process. Lett. 136, 30-36 (2018). MSC: 68R10 05C85 68Q27 68W40 PDFBibTeX XMLCite \textit{M. Lin} et al., Inf. Process. Lett. 136, 30--36 (2018; Zbl 1457.68220) Full Text: DOI
Shitov, Yaroslav On the complexity of graph coloring with additional local conditions. (English) Zbl 1476.05190 Inf. Process. Lett. 135, 92-94 (2018). MSC: 05C85 05C15 68Q17 PDFBibTeX XMLCite \textit{Y. Shitov}, Inf. Process. Lett. 135, 92--94 (2018; Zbl 1476.05190) Full Text: DOI arXiv
Marcilon, Thiago; Sampaio, Rudini The P3 infection time is W[1]-hard parameterized by the treewidth. (English) Zbl 1427.68127 Inf. Process. Lett. 132, 55-61 (2018). MSC: 68Q25 05C38 68Q17 68R10 PDFBibTeX XMLCite \textit{T. Marcilon} and \textit{R. Sampaio}, Inf. Process. Lett. 132, 55--61 (2018; Zbl 1427.68127) Full Text: DOI
Roayaei, Mehdy; Razzazi, Mohammadreza An FPT-algorithm for modifying a graph of bounded treewidth to decrease the size of its dominating set using minimum modification. (English) Zbl 1357.68088 Inf. Process. Lett. 116, No. 9, 590-594 (2016). MSC: 68Q25 05C69 05C85 68Q17 PDFBibTeX XMLCite \textit{M. Roayaei} and \textit{M. Razzazi}, Inf. Process. Lett. 116, No. 9, 590--594 (2016; Zbl 1357.68088) Full Text: DOI
Barbero, Florian; Gutin, Gregory; Jones, Mark; Sheng, Bin; Yeo, Anders Linear-vertex kernel for the problem of packing \(r\)-stars into a graph without long induced paths. (English) Zbl 1357.05121 Inf. Process. Lett. 116, No. 6, 433-436 (2016). MSC: 05C70 05C85 PDFBibTeX XMLCite \textit{F. Barbero} et al., Inf. Process. Lett. 116, No. 6, 433--436 (2016; Zbl 1357.05121) Full Text: DOI arXiv
van Bevern, René; Chen, Jiehua; Hüffner, Falk; Kratsch, Stefan; Talmon, Nimrod; Woeginger, Gerhard J. Approximability and parameterized complexity of multicover by \(c\)-intervals. (English) Zbl 1329.68149 Inf. Process. Lett. 115, No. 10, 744-749 (2015). MSC: 68Q25 68Q17 68W25 PDFBibTeX XMLCite \textit{R. van Bevern} et al., Inf. Process. Lett. 115, No. 10, 744--749 (2015; Zbl 1329.68149) Full Text: DOI
Scott, Allan; Srinivasan, Venkatesh; Stege, Ulrike \(k\)-attribute-anonymity is hard even for \(k=2\). (English) Zbl 1302.68128 Inf. Process. Lett. 115, No. 2, 368-370 (2015). MSC: 68Q17 68P15 94A62 PDFBibTeX XMLCite \textit{A. Scott} et al., Inf. Process. Lett. 115, No. 2, 368--370 (2015; Zbl 1302.68128) Full Text: DOI
Abu-Khzam, Faisal N. Maximum common induced subgraph parameterized by vertex cover. (English) Zbl 1284.68274 Inf. Process. Lett. 114, No. 3, 99-103 (2014). MSC: 68Q17 05C85 PDFBibTeX XMLCite \textit{F. N. Abu-Khzam}, Inf. Process. Lett. 114, No. 3, 99--103 (2014; Zbl 1284.68274) Full Text: DOI
van Iersel, Leo; Linz, Simone A quadratic kernel for computing the hybridization number of multiple trees. (English) Zbl 1287.68060 Inf. Process. Lett. 113, No. 9, 318-323 (2013). MSC: 68Q17 68Q25 92C42 92D15 PDFBibTeX XMLCite \textit{L. van Iersel} and \textit{S. Linz}, Inf. Process. Lett. 113, No. 9, 318--323 (2013; Zbl 1287.68060) Full Text: DOI arXiv
Guillemot, Sylvain; Marx, Dániel A faster FPT algorithm for bipartite contraction. (English) Zbl 1284.68648 Inf. Process. Lett. 113, No. 22-24, 906-912 (2013). MSC: 68W20 05C85 PDFBibTeX XMLCite \textit{S. Guillemot} and \textit{D. Marx}, Inf. Process. Lett. 113, No. 22--24, 906--912 (2013; Zbl 1284.68648) Full Text: DOI arXiv
Gutin, G.; Muciaccia, G.; Yeo, A. (Non-)existence of polynomial kernels for the test cover problem. (English) Zbl 1259.68093 Inf. Process. Lett. 113, No. 4, 123-126 (2013). MSC: 68Q25 05C70 05C85 PDFBibTeX XMLCite \textit{G. Gutin} et al., Inf. Process. Lett. 113, No. 4, 123--126 (2013; Zbl 1259.68093) Full Text: DOI arXiv
Crowston, R.; Gutin, G.; Jones, M.; Yeo, A. Parameterized Eulerian strong component arc deletion problem on tournaments. (English) Zbl 1242.68113 Inf. Process. Lett. 112, No. 6, 249-251 (2012). MSC: 68Q17 05C45 05C20 05C85 PDFBibTeX XMLCite \textit{R. Crowston} et al., Inf. Process. Lett. 112, No. 6, 249--251 (2012; Zbl 1242.68113) Full Text: DOI arXiv
Fomin, Fedor V.; Golovach, Petr A.; van Leeuwen, Erik Jan Spanners of bounded degree graphs. (English) Zbl 1260.68154 Inf. Process. Lett. 111, No. 3, 142-144 (2011). MSC: 68Q17 05C12 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Inf. Process. Lett. 111, No. 3, 142--144 (2011; Zbl 1260.68154) Full Text: DOI
Gutin, Gregory; Yeo, Anders Note on maximal bisection above tight lower bound. (English) Zbl 1379.68165 Inf. Process. Lett. 110, No. 21, 966-969 (2010). MSC: 68Q25 05C70 68Q17 PDFBibTeX XMLCite \textit{G. Gutin} and \textit{A. Yeo}, Inf. Process. Lett. 110, No. 21, 966--969 (2010; Zbl 1379.68165) Full Text: DOI arXiv
Bonizzoni, Paola; Della Vedova, Gianluca; Dondi, Riccardo; Pirola, Yuri Variants of constrained longest common subsequence. (English) Zbl 1234.68472 Inf. Process. Lett. 110, No. 20, 877-881 (2010). MSC: 68W32 68Q17 PDFBibTeX XMLCite \textit{P. Bonizzoni} et al., Inf. Process. Lett. 110, No. 20, 877--881 (2010; Zbl 1234.68472) Full Text: DOI arXiv
Fomin, Fedor V.; Gaspers, Serge; Golovach, Petr A.; Kratsch, Dieter; Saurabh, Saket Parameterized algorithm for eternal vertex cover. (English) Zbl 1234.68150 Inf. Process. Lett. 110, No. 16, 702-706 (2010). MSC: 68Q25 05C85 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Inf. Process. Lett. 110, No. 16, 702--706 (2010; Zbl 1234.68150) Full Text: DOI
Lucas, Joan M. An improved kernel size for rotation distance in binary trees. (English) Zbl 1233.68147 Inf. Process. Lett. 110, No. 12-13, 481-484 (2010). MSC: 68Q25 68R05 PDFBibTeX XMLCite \textit{J. M. Lucas}, Inf. Process. Lett. 110, No. 12--13, 481--484 (2010; Zbl 1233.68147) Full Text: DOI
Crowston, Robert; Gutin, Gregory; Jones, Mark Note on Max Lin-2 above average. (English) Zbl 1229.68044 Inf. Process. Lett. 110, No. 11, 451-454 (2010). MSC: 68Q25 68Q17 PDFBibTeX XMLCite \textit{R. Crowston} et al., Inf. Process. Lett. 110, No. 11, 451--454 (2010; Zbl 1229.68044) Full Text: DOI arXiv
Liu, Hong; Zhu, Daming Parameterized complexity of control problems in Maximin election. (English) Zbl 1229.68045 Inf. Process. Lett. 110, No. 10, 383-388 (2010). MSC: 68Q25 91B14 PDFBibTeX XMLCite \textit{H. Liu} and \textit{D. Zhu}, Inf. Process. Lett. 110, No. 10, 383--388 (2010; Zbl 1229.68045) Full Text: DOI
Papakonstantinou, Periklis A. A note on width-parameterized SAT: an exact machine-model characterization. (English) Zbl 1206.68150 Inf. Process. Lett. 110, No. 1, 8-12 (2009). MSC: 68Q25 68T20 PDFBibTeX XMLCite \textit{P. A. Papakonstantinou}, Inf. Process. Lett. 110, No. 1, 8--12 (2009; Zbl 1206.68150) Full Text: DOI
Cleary, Sean; John, Katherine St. Rotation distance is fixed-parameter tractable. (English) Zbl 1205.68531 Inf. Process. Lett. 109, No. 16, 918-922 (2009). MSC: 68W40 PDFBibTeX XMLCite \textit{S. Cleary} and \textit{K. St. John}, Inf. Process. Lett. 109, No. 16, 918--922 (2009; Zbl 1205.68531) Full Text: DOI arXiv
Guo, Jiong; Niedermeier, Rolf; Uhlmann, Johannes Two fixed-parameter algorithms for vertex covering by paths on trees. (English) Zbl 1185.05115 Inf. Process. Lett. 106, No. 2, 81-86 (2008). MSC: 05C70 05C05 05C85 68Q25 PDFBibTeX XMLCite \textit{J. Guo} et al., Inf. Process. Lett. 106, No. 2, 81--86 (2008; Zbl 1185.05115) Full Text: DOI
Stewart, Iain A. On the fixed-parameter tractability of parameterized model-checking problems. (English) Zbl 1186.68303 Inf. Process. Lett. 106, No. 1, 33-36 (2008). MSC: 68Q60 68W40 PDFBibTeX XMLCite \textit{I. A. Stewart}, Inf. Process. Lett. 106, No. 1, 33--36 (2008; Zbl 1186.68303) Full Text: DOI Link
Cabello, Sergio; Giannopoulos, Panos; Knauer, Christian On the parameterized complexity of \(d\)-dimensional point set pattern matching. (English) Zbl 1184.68595 Inf. Process. Lett. 105, No. 2, 73-77 (2008). MSC: 68W05 68T10 PDFBibTeX XMLCite \textit{S. Cabello} et al., Inf. Process. Lett. 105, No. 2, 73--77 (2008; Zbl 1184.68595) Full Text: DOI
Hagen, Matthias On the fixed-parameter tractability of the equivalence test of monotone normal forms. (English) Zbl 1184.68662 Inf. Process. Lett. 103, No. 4, 163-167 (2007). MSC: 68W40 PDFBibTeX XMLCite \textit{M. Hagen}, Inf. Process. Lett. 103, No. 4, 163--167 (2007; Zbl 1184.68662) Full Text: DOI
Gottlob, Georg; Lee, Stephanie Tien A logical approach to multicut problems. (English) Zbl 1190.90032 Inf. Process. Lett. 103, No. 4, 136-141 (2007). MSC: 90B10 PDFBibTeX XMLCite \textit{G. Gottlob} and \textit{S. T. Lee}, Inf. Process. Lett. 103, No. 4, 136--141 (2007; Zbl 1190.90032) Full Text: DOI
Guo, Jiong; Niedermeier, Rolf A fixed-parameter tractability result for multicommodity demand flow in trees. (English) Zbl 1184.68357 Inf. Process. Lett. 97, No. 3, 109-114 (2006). MSC: 68R10 68W05 68R05 PDFBibTeX XMLCite \textit{J. Guo} and \textit{R. Niedermeier}, Inf. Process. Lett. 97, No. 3, 109--114 (2006; Zbl 1184.68357) Full Text: DOI
Bläser, Markus Computing small partial coverings. (English) Zbl 1173.68854 Inf. Process. Lett. 85, No. 6, 327-331 (2003). MSC: 68W20 PDFBibTeX XMLCite \textit{M. Bläser}, Inf. Process. Lett. 85, No. 6, 327--331 (2003; Zbl 1173.68854) Full Text: DOI
Balasubramanian, R.; Fellows, Michael R.; Raman, Venkatesh An improved fixed-parameter algorithm for vertex cover. (English) Zbl 1337.05095 Inf. Process. Lett. 65, No. 3, 163-168 (1998). MSC: 05C85 05C70 68Q25 PDFBibTeX XMLCite \textit{R. Balasubramanian} et al., Inf. Process. Lett. 65, No. 3, 163--168 (1998; Zbl 1337.05095) Full Text: DOI Link
Cai, Leizhen Fixed-parameter tractability of graph modification problems for hereditary properties. (English) Zbl 0875.68702 Inf. Process. Lett. 58, No. 4, 171-176 (1996). MSC: 68R10 PDFBibTeX XMLCite \textit{L. Cai}, Inf. Process. Lett. 58, No. 4, 171--176 (1996; Zbl 0875.68702) Full Text: DOI