Cohen, Nathann; Havet, Frédéric; Mazauric, Dorian; Sau, Ignasi; Watrigant, Rémi Complexity dichotomies for the Minimum \(\mathcal{F}\)-Overlay problem. (English) Zbl 1410.68161 J. Discrete Algorithms 52-53, 133-142 (2018). MSC: 68Q25 05C60 05C65 68Q17 68R10 PDFBibTeX XMLCite \textit{N. Cohen} et al., J. Discrete Algorithms 52--53, 133--142 (2018; Zbl 1410.68161) Full Text: DOI
Milosz, Robin; Hamel, Sylvie Exploring the median of permutations problem. (English) Zbl 1410.68343 J. Discrete Algorithms 52-53, 92-111 (2018). MSC: 68T20 05A05 PDFBibTeX XMLCite \textit{R. Milosz} and \textit{S. Hamel}, J. Discrete Algorithms 52--53, 92--111 (2018; Zbl 1410.68343) Full Text: DOI
Darties, Benoît; Champseix, Nicolas; Chateau, Annie; Giroudeau, Rodolphe; Weller, Mathias Complexity and lowers bounds for power edge set problem. (English) Zbl 1410.68292 J. Discrete Algorithms 52-53, 70-91 (2018). MSC: 68R10 05C85 68Q25 68W25 PDFBibTeX XMLCite \textit{B. Darties} et al., J. Discrete Algorithms 52--53, 70--91 (2018; Zbl 1410.68292) Full Text: DOI
Abu-Khzam, Faisal N. On the complexity of multi-parameterized cluster editing. (English) Zbl 1419.68056 J. Discrete Algorithms 45, 26-34 (2017). MSC: 68Q25 05C69 05C85 68Q17 68R10 PDFBibTeX XMLCite \textit{F. N. Abu-Khzam}, J. Discrete Algorithms 45, 26--34 (2017; Zbl 1419.68056) Full Text: DOI arXiv
Jäger, Gerold; Climer, Sharlee; Zhang, Weixiong The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability. (English) Zbl 1362.92046 J. Discrete Algorithms 37, 68-83 (2016). MSC: 92D10 68Q25 90C10 90C47 PDFBibTeX XMLCite \textit{G. Jäger} et al., J. Discrete Algorithms 37, 68--83 (2016; Zbl 1362.92046) Full Text: DOI
Friedrich, Tobias; Hercher, Christian On the kernel size of clique cover reductions for random intersection graphs. (English) Zbl 1336.05115 J. Discrete Algorithms 34, 128-136 (2015). MSC: 05C80 05C69 05C85 PDFBibTeX XMLCite \textit{T. Friedrich} and \textit{C. Hercher}, J. Discrete Algorithms 34, 128--136 (2015; Zbl 1336.05115) Full Text: DOI
Mishra, Sounaka; Pananjady, Ashwin; Safina Devi, N. On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion. (English) Zbl 1337.68135 J. Discrete Algorithms 33, 71-80 (2015). MSC: 68Q25 05C85 68Q17 68W25 PDFBibTeX XMLCite \textit{S. Mishra} et al., J. Discrete Algorithms 33, 71--80 (2015; Zbl 1337.68135) Full Text: DOI arXiv
Stephen, Sudeep; Rajan, Bharati; Ryan, Joe; Grigorious, Cyriac; William, Albert Power domination in certain chemical structures. (English) Zbl 1318.05053 J. Discrete Algorithms 33, 10-18 (2015). MSC: 05C69 05C85 92E10 PDFBibTeX XMLCite \textit{S. Stephen} et al., J. Discrete Algorithms 33, 10--18 (2015; Zbl 1318.05053) Full Text: DOI
Pinter, Ron Y.; Shachnai, Hadas; Zehavi, Meirav Partial information network queries. (English) Zbl 1322.68258 J. Discrete Algorithms 31, 129-145 (2015). MSC: 68W20 05C85 05C90 92C42 PDFBibTeX XMLCite \textit{R. Y. Pinter} et al., J. Discrete Algorithms 31, 129--145 (2015; Zbl 1322.68258) Full Text: DOI
Bachmaier, Christian; Brandenburg, Franz J.; Gleißner, Andreas; Hofmeier, Andreas On the hardness of maximum rank aggregation problems. (English) Zbl 1322.68086 J. Discrete Algorithms 31, 2-13 (2015). MSC: 68Q17 68R05 91B06 91B08 PDFBibTeX XMLCite \textit{C. Bachmaier} et al., J. Discrete Algorithms 31, 2--13 (2015; Zbl 1322.68086) Full Text: DOI
Jordán, Tibor; Schlotter, Ildikó Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem. (English) Zbl 1320.68102 J. Discrete Algorithms 30, 29-44 (2015). MSC: 68Q25 05C60 05C85 68Q17 68R10 PDFBibTeX XMLCite \textit{T. Jordán} and \textit{I. Schlotter}, J. Discrete Algorithms 30, 29--44 (2015; Zbl 1320.68102) Full Text: DOI
Bazgan, Cristina; Chopin, Morgan; Nichterlein, André; Sikora, Florian Parameterized approximability of maximizing the spread of influence in networks. (English) Zbl 1361.68105 J. Discrete Algorithms 27, 54-65 (2014). MSC: 68Q25 05C82 68W25 91D30 PDFBibTeX XMLCite \textit{C. Bazgan} et al., J. Discrete Algorithms 27, 54--65 (2014; Zbl 1361.68105) Full Text: DOI
Pinter, Ron Y.; Zehavi, Meirav Algorithms for topology-free and alignment network queries. (English) Zbl 1362.05123 J. Discrete Algorithms 27, 29-53 (2014). MSC: 05C85 68W40 92C42 PDFBibTeX XMLCite \textit{R. Y. Pinter} and \textit{M. Zehavi}, J. Discrete Algorithms 27, 29--53 (2014; Zbl 1362.05123) Full Text: DOI
Dondi, Riccardo; El-Mabrouk, Nadia; Swenson, Krister M. Gene tree correction for reconciliation and species tree inference: complexity and algorithms. (English) Zbl 1284.68694 J. Discrete Algorithms 25, 51-65 (2014). MSC: 68W32 92D20 68Q17 PDFBibTeX XMLCite \textit{R. Dondi} et al., J. Discrete Algorithms 25, 51--65 (2014; Zbl 1284.68694) Full Text: DOI
Dondi, Riccardo The constrained shortest common supersequence problem. (English) Zbl 1334.68316 J. Discrete Algorithms 21, 11-17 (2013). MSC: 68W32 68Q25 68W25 PDFBibTeX XMLCite \textit{R. Dondi}, J. Discrete Algorithms 21, 11--17 (2013; Zbl 1334.68316) Full Text: DOI
Böcker, Sebastian A golden ratio parameterized algorithm for cluster editing. (English) Zbl 1257.05164 J. Discrete Algorithms 16, 79-89 (2012). MSC: 05C85 68Q17 05C69 PDFBibTeX XMLCite \textit{S. Böcker}, J. Discrete Algorithms 16, 79--89 (2012; Zbl 1257.05164) Full Text: DOI
Chimani, Markus; Mutzel, Petra; Zey, Bernd Improved Steiner tree algorithms for bounded treewidth. (English) Zbl 1257.05166 J. Discrete Algorithms 16, 67-78 (2012). MSC: 05C85 05C05 PDFBibTeX XMLCite \textit{M. Chimani} et al., J. Discrete Algorithms 16, 67--78 (2012; Zbl 1257.05166) Full Text: DOI
Sorge, Manuel; van Bevern, René; Niedermeier, Rolf; Weller, Mathias A new view on rural postman based on Eulerian extension and matching. (English) Zbl 1255.68076 J. Discrete Algorithms 16, 12-33 (2012). MSC: 68Q17 90C27 05C85 05C45 PDFBibTeX XMLCite \textit{M. Sorge} et al., J. Discrete Algorithms 16, 12--33 (2012; Zbl 1255.68076) Full Text: DOI
Couturier, Jean-François; Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël On the parameterized complexity of coloring graphs in the absence of a linear forest. (English) Zbl 1247.68108 J. Discrete Algorithms 15, 56-62 (2012). MSC: 68Q25 05C15 PDFBibTeX XMLCite \textit{J.-F. Couturier} et al., J. Discrete Algorithms 15, 56--62 (2012; Zbl 1247.68108) Full Text: DOI Link
Walicki, Michał; Dyrkolbotn, Sjur Finding kernels or solving SAT. (English) Zbl 1253.68160 J. Discrete Algorithms 10, 146-164 (2012). MSC: 68Q17 68T20 68R10 PDFBibTeX XMLCite \textit{M. Walicki} and \textit{S. Dyrkolbotn}, J. Discrete Algorithms 10, 146--164 (2012; Zbl 1253.68160) Full Text: DOI
Amini, Omid; Sau, Ignasi; Saurabh, Saket Parameterized complexity of finding small degree-constrained subgraphs. (English) Zbl 1242.68119 J. Discrete Algorithms 10, 70-83 (2012). MSC: 68Q25 05C85 90C39 PDFBibTeX XMLCite \textit{O. Amini} et al., J. Discrete Algorithms 10, 70--83 (2012; Zbl 1242.68119) Full Text: DOI
Kubica, Marcin; Rizzi, Romeo; Vialette, Stéphane; Waleń, Tomasz Approximation of RNA multiple structural alignment. (English) Zbl 1230.68224 J. Discrete Algorithms 9, No. 4, 365-376 (2011). MSC: 68W32 05C85 68R10 68Q25 92D20 PDFBibTeX XMLCite \textit{M. Kubica} et al., J. Discrete Algorithms 9, No. 4, 365--376 (2011; Zbl 1230.68224) Full Text: DOI
Kamiński, Marcin; Paulusma, Daniël; Thilikos, Dimitrios M. Contracting planar graphs to contractions of triangulations. (English) Zbl 1225.05231 J. Discrete Algorithms 9, No. 3, 299-306 (2011). MSC: 05C85 05C10 68R10 PDFBibTeX XMLCite \textit{M. Kamiński} et al., J. Discrete Algorithms 9, No. 3, 299--306 (2011; Zbl 1225.05231) Full Text: DOI arXiv
Abu-Khzam, Faisal N.; Mouawad, Amer E.; Liedloff, Mathieu An exact algorithm for connected red-blue dominating set. (English) Zbl 1225.05226 J. Discrete Algorithms 9, No. 3, 252-262 (2011). MSC: 05C85 05C69 PDFBibTeX XMLCite \textit{F. N. Abu-Khzam} et al., J. Discrete Algorithms 9, No. 3, 252--262 (2011; Zbl 1225.05226) Full Text: DOI
Binkele-Raible, Daniel; Brankovic, Ljiljana; Cygan, Marek; Fernau, Henning; Kneis, Joachim; Kratsch, Dieter; Langer, Alexander; Liedloff, Mathieu; Pilipczuk, Marcin; Rossmanith, Peter; Wojtaszczyk, Jakub Onufry Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack. (English) Zbl 1225.05227 J. Discrete Algorithms 9, No. 3, 214-230 (2011). MSC: 05C85 05C69 PDFBibTeX XMLCite \textit{D. Binkele-Raible} et al., J. Discrete Algorithms 9, No. 3, 214--230 (2011; Zbl 1225.05227) Full Text: DOI
Komusiewicz, Christian; Niedermeier, Rolf; Uhlmann, Johannes Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring. (English) Zbl 1228.05154 J. Discrete Algorithms 9, No. 1, 137-151 (2011). MSC: 05C15 05C90 PDFBibTeX XMLCite \textit{C. Komusiewicz} et al., J. Discrete Algorithms 9, No. 1, 137--151 (2011; Zbl 1228.05154) Full Text: DOI
Dondi, Riccardo; Fertin, Guillaume; Vialette, Stéphane Complexity issues in vertex-colored graph pattern matching. (English) Zbl 1222.05053 J. Discrete Algorithms 9, No. 1, 82-99 (2011). MSC: 05C15 05C85 68Q17 PDFBibTeX XMLCite \textit{R. Dondi} et al., J. Discrete Algorithms 9, No. 1, 82--99 (2011; Zbl 1222.05053) Full Text: DOI
Binkele-Raible, Daniel; Fernau, Henning A new upper bound for Max-2-SAT: A graph-theoretic approach. (English) Zbl 1203.90130 J. Discrete Algorithms 8, No. 4, 388-401 (2010). MSC: 90C27 90C60 PDFBibTeX XMLCite \textit{D. Binkele-Raible} and \textit{H. Fernau}, J. Discrete Algorithms 8, No. 4, 388--401 (2010; Zbl 1203.90130) Full Text: DOI
Dom, Michael; Guo, Jiong; Hüffner, Falk; Niedermeier, Rolf; Truss, Anke Fixed-parameter tractability results for feedback set problems in tournaments. (English) Zbl 1191.68349 J. Discrete Algorithms 8, No. 1, 76-86 (2010). MSC: 68Q25 90C27 90C60 PDFBibTeX XMLCite \textit{M. Dom} et al., J. Discrete Algorithms 8, No. 1, 76--86 (2010; Zbl 1191.68349) Full Text: DOI
Samer, Marko; Szeider, Stefan Algorithms for propositional model counting. (English) Zbl 1214.05166 J. Discrete Algorithms 8, No. 1, 50-64 (2010). MSC: 05C85 PDFBibTeX XMLCite \textit{M. Samer} and \textit{S. Szeider}, J. Discrete Algorithms 8, No. 1, 50--64 (2010; Zbl 1214.05166) Full Text: DOI
Escoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs. (English) Zbl 1214.05162 J. Discrete Algorithms 8, No. 1, 36-49 (2010). MSC: 05C85 05C70 05C10 68W25 PDFBibTeX XMLCite \textit{B. Escoffier} et al., J. Discrete Algorithms 8, No. 1, 36--49 (2010; Zbl 1214.05162) Full Text: DOI
Damaschke, Peter; Molokov, Leonid The union of minimal hitting sets: parameterized combinatorial bounds and counting. (English) Zbl 1176.90602 J. Discrete Algorithms 7, No. 4, 391-401 (2009). MSC: 90C35 90C27 PDFBibTeX XMLCite \textit{P. Damaschke} and \textit{L. Molokov}, J. Discrete Algorithms 7, No. 4, 391--401 (2009; Zbl 1176.90602) Full Text: DOI
Moser, Hannes; Thilikos, Dimitrios M. Parameterized complexity of finding regular induced subgraphs. (English) Zbl 1187.68351 J. Discrete Algorithms 7, No. 2, 181-190 (2009). MSC: 68R10 PDFBibTeX XMLCite \textit{H. Moser} and \textit{D. M. Thilikos}, J. Discrete Algorithms 7, No. 2, 181--190 (2009; Zbl 1187.68351) Full Text: DOI
Fernau, Henning; Manlove, David F. Vertex and edge covers with clustering properties: Complexity and algorithms. (English) Zbl 1187.68342 J. Discrete Algorithms 7, No. 2, 149-167 (2009). MSC: 68R10 68W25 68Q25 05C85 PDFBibTeX XMLCite \textit{H. Fernau} and \textit{D. F. Manlove}, J. Discrete Algorithms 7, No. 2, 149--167 (2009; Zbl 1187.68342) Full Text: DOI
Fertin, Guillaume; Rizzi, Romeo; Vialette, Stéphane Finding occurrences of protein complexes in protein-protein interaction graphs. (English) Zbl 1162.92015 J. Discrete Algorithms 7, No. 1, 90-101 (2009). MSC: 92C40 05C85 05C90 68Q25 68W40 PDFBibTeX XMLCite \textit{G. Fertin} et al., J. Discrete Algorithms 7, No. 1, 90--101 (2009; Zbl 1162.92015) Full Text: DOI
Dom, Michael; Guo, Jiong; Niedermeier, Rolf; Wernicke, Sebastian Red-blue covering problems and the consecutive ones property. (English) Zbl 1161.90018 J. Discrete Algorithms 6, No. 3, 393-407 (2008). MSC: 90C35 05C70 68W40 PDFBibTeX XMLCite \textit{M. Dom} et al., J. Discrete Algorithms 6, No. 3, 393--407 (2008; Zbl 1161.90018) Full Text: DOI
Spillner, Andreas A fixed parameter algorithm for optimal convex partitions. (English) Zbl 1154.90571 J. Discrete Algorithms 6, No. 4, 561-569 (2008). MSC: 90C25 90C51 PDFBibTeX XMLCite \textit{A. Spillner}, J. Discrete Algorithms 6, No. 4, 561--569 (2008; Zbl 1154.90571) Full Text: DOI
Abu-Khzam, Faisal N.; Fernau, Henning; Langston, Michael A. A bounded search tree algorithm for parameterized face cover. (English) Zbl 1154.90600 J. Discrete Algorithms 6, No. 4, 541-552 (2008). MSC: 90C35 90B40 PDFBibTeX XMLCite \textit{F. N. Abu-Khzam} et al., J. Discrete Algorithms 6, No. 4, 541--552 (2008; Zbl 1154.90600) Full Text: DOI
Dujmović, Vida; Fernau, Henning; Kaufmann, Michael Fixed parameter algorithms for one-sided crossing minimization revisited. (English) Zbl 1155.68054 J. Discrete Algorithms 6, No. 2, 313-323 (2008). MSC: 68R10 05C62 05C85 PDFBibTeX XMLCite \textit{V. Dujmović} et al., J. Discrete Algorithms 6, No. 2, 313--323 (2008; Zbl 1155.68054) Full Text: DOI
Backofen, Rolf; Siebert, Sven Fast detection of common sequence structure patterns in RNAs. (English) Zbl 1121.92028 J. Discrete Algorithms 5, No. 2, 212-228 (2007). MSC: 92C40 90C39 90C90 68W99 PDFBibTeX XMLCite \textit{R. Backofen} and \textit{S. Siebert}, J. Discrete Algorithms 5, No. 2, 212--228 (2007; Zbl 1121.92028) Full Text: DOI
Grandoni, Fabrizio A note on the complexity of minimum dominating set. (English) Zbl 1127.05070 J. Discrete Algorithms 4, No. 2, 209-214 (2006). Reviewer: Arnfried Kemnitz (Braunschweig) MSC: 05C69 05C85 68R10 PDFBibTeX XMLCite \textit{F. Grandoni}, J. Discrete Algorithms 4, No. 2, 209--214 (2006; Zbl 1127.05070) Full Text: DOI
Guo, Jiong; Niedermeier, Rolf Exact algorithms and applications for tree-like Weighted Set Cover. (English) Zbl 1110.68173 J. Discrete Algorithms 4, No. 4, 608-622 (2006). MSC: 68W40 05C85 68R10 92B05 PDFBibTeX XMLCite \textit{J. Guo} and \textit{R. Niedermeier}, J. Discrete Algorithms 4, No. 4, 608--622 (2006; Zbl 1110.68173) Full Text: DOI
Nicolas, François; Rivals, Eric Hardness results for the center and median string problems under the weighted and unweighted edit distances. (English) Zbl 1101.68709 J. Discrete Algorithms 3, No. 2-4, 390-415 (2005). MSC: 68R05 68T10 68Q17 92D20 PDFBibTeX XMLCite \textit{F. Nicolas} and \textit{E. Rivals}, J. Discrete Algorithms 3, No. 2--4, 390--415 (2005; Zbl 1101.68709) Full Text: DOI
Niedermeier, Rolf; Rossmanith, Peter An efficient fixed-parameter algorithm for 3-hitting set. (English) Zbl 1118.68511 J. Discrete Algorithms 1, No. 1, 89-102 (2003). MSC: 68Q25 PDFBibTeX XMLCite \textit{R. Niedermeier} and \textit{P. Rossmanith}, J. Discrete Algorithms 1, No. 1, 89--102 (2003; Zbl 1118.68511) Full Text: DOI