References
Published online by Cambridge University Press: 03 January 2019
- Type
- Chapter
- Information
- KernelizationTheory of Parameterized Preprocessing, pp. 483 - 504Publisher: Cambridge University PressPrint publication year: 2019
References
Abu-Khzam, Faisal N. 2010a. An improved kernelization algorithm for r-Set Packing. Information Processing Letters, 110(16), 621–624.Google Scholar
Abu-Khzam, Faisal N. 2010b. A kernelization algorithm for d-Hitting Set. Journal of Computer and System Sciences, 76(7), 524–531.Google Scholar
Abu-Khzam, Faisal N., and Khuzam, Mazen Bou. 2012. An improved kernel for the Undirected Planar Feedback Vertex Set Problem. Pages 264–273 of: Proceedings of the 7th International Symposium on Parameterized and Exact Computation (IPEC). Lecture Notes in Computer Science, vol. 7535. Springer.Google Scholar
Abu-Khzam, Faisal N., Collins, Rebecca L., Fellows, Michael R., Langston, Michael A., Suters, W. Henry, and Symons, Christopher T. 2004. Kernelization algorithms for the Vertex Cover Problem: Theory and experiments. Pages 62–69 of: Proceedings of the 6th Workshop on Algorithm Engineering and Experiments and the 1st Workshop on Analytic Algorithmics and Combinatorics (ALENEX/ANALC). SIAM.Google Scholar
Abu-Khzam, Faisal N., Fellows, Michael R., Langston, Michael A., and Suters, W. Henry. 2007. Crown structures for vertex cover kernelization. Theory of Computing Systems, 41(3), 411–430.Google Scholar
Agarwal, Amit,Charikar, Moses, Makarychev, Konstantin, and Makarychev, Yury. 2005. approximation algorithms for Min UnCut, Min 2CNF deletion, and directed cut problems. Pages 573–581 of: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC). ACM.Google Scholar
Agrawal, Akanksha, Kolay, Sudeshna, Lokshtanov, Daniel, and Saurabh, Saket. 2016a. A faster FPT algorithm and a smaller kernel for Block Graph Vertex Deletion. Pages 1–13 of: Proceedings of the 12th Latin American Theoretical Informatics Symposium (LATIN). Lecture Notes in Computer Science, vol. 9644. Springer.Google Scholar
Agrawal, Akanksha, Lokshtanov, Daniel, Mouawad, Amer E., and Saurabh, Saket. 2016b. Simultaneous Feedback Vertex Set: A parameterized perspective. Pages 7:1–7:15 of: Proceedings of the 33rd International Symposium on Theoretical Aspects of Computer Science (STACS). Leibniz International Proceedings in Informatics (LIPIcs), vol. 47. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.Google Scholar
Agrawal, Akanksha, Saurabh, Saket, and Tale, Prafullkumar. 2017. On the parameterized complexity of contraction to generalization of trees. Pages 1:1–1:12 of: Proceedings of the 12th International Symposium on Parameterized and Exact Computation (IPEC). Leibniz International Proceedings in Informatics (LIPIcs), vol. 89. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.Google Scholar
Alber, Jochen, Bodlaender, Hans L., Fernau, Henning, Kloks, Ton, and Niedermeier, Rolf. 2002. Fixed parameter algorithms for dominating set and related problems on planar graphs. Algorithmica, 33(4), 461–493.Google Scholar
Alber, Jochen, Fernau, Henning, and Niedermeier, Rolf. 2004a. Parameterized complexity: Exponential speed-up for planar graph problems. Journal of Algorithms, 52(1), 26–56.Google Scholar
Alber, Jochen, Fellows, Michael R., and Niedermeier, Rolf. 2004b. Polynomial-time data reduction for dominating set. Journal of ACM, 51(3), 363–384.Google Scholar
Alber, Jochen, Betzler, Nadja, and Niedermeier, Rolf. 2006. Experiments on data reduction for optimal domination in networks. Annals OR, 146(1), 105–117.Google Scholar
Alon, Noga. 1986. The number of polytopes, configurations and real matroids. Mathematika, 33(1), 62–71.Google Scholar
Alon, Noga, Yuster, Raphael, and Zwick, Uri. 1995. Color-coding. Journal of ACM, 42(4), 844–856.Google Scholar
Alon, Noga, Gutin, Gregory, Kim, Eun Jung, Szeider, Stefan, and Yeo, Anders. 2011. Solving MAX-r-SAT above a tight lower bound. Algorithmica, 61(3), 638–655.Google Scholar
Arkin, Esther M., Halldórsson, Magnús M., and Hassin, Refael. 1993. Approximating the tree and tour covers of a graph. Information Processing Letters, 47(6), 275–282.Google Scholar
Arnborg, Stefan, and Proskurowski, Andrzej. 1989. Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Applied Mathematics, 23(1), 11–24.Google Scholar
Arnborg, Stefan, Lagergren, Jens, and Seese, Detlef. 1991. Easy problems for tree-decomposable graphs. Journal of Algorithms, 12(2), 308–340.Google Scholar
Arnborg, Stefan, Courcelle, Bruno, Proskurowski, Andrzej, and Seese, Detlef. 1993. An algebraic theory of graph reduction. Journal of ACM, 40(5), 1134–1164.Google Scholar
Arora, Sanjeev, and Barak, Boaz. 2009. Computational Complexity—A Modern Approach. Cambridge University Press.Google Scholar
Bafna, Vineet, Berman, Piotr, and Fujito, Toshihiro. 1999. A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM Journal on Discrete Mathematics, 12(3), 289–297.Google Scholar
Baker, Brenda S. 1994. Approximation algorithms for NP-complete problems on planar graphs. Journal of ACM, 41(1), 153–180.Google Scholar
Balasubramanian, R., Fellows, Michael R., and Raman, Venkatesh. 1998. An improved fixed-parameter algorithm for vertex cover. Information Processing Letters, 65(3), 163–168.Google Scholar
Bansal, Nikhil, Blum, Avrim, and Chawla, Shuchi. 2004. Correlation clustering. Machine Learning, 56(1–3), 89–113.Google Scholar
Bar-Yehuda, Reuven, Geiger, Dan, Naor, Joseph, and Roth, Ron M. 1998. Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and Bayesian inference. SIAM Journal of Computing, 27(4), 942–959.Google Scholar
Bartlett, Andrew, Chartier, Timothy P., Langville, Amy N., and Rankin, Timothy D. 2008. Integer programming model for the Sudoku problem. The Journal of Online Mathematics and Its Applications, 8.Google Scholar
Basavaraju, Manu, Francis, Mathew C., Ramanujan, M. S., and Saurabh, Saket. 2016. Partially polynomial kernels for set cover and test cover. SIAM Journal of Discrete Mathematics, 30(3), 1401–1423.Google Scholar
Bellman, Richard. 1962. Dynamic programming treatment of the travelling salesman problem. Journal of ACM, 9(1), 61–63.Google Scholar
Berge, Claude. 1973. Graphs and Hypergraphs. North-Holland Mathematical Library, vol. 6. Amsterdam, The Netherlands: North-Holland Publishing Co.Google Scholar
Bessy, Stéphane, and Perez, Anthony. 2013. Polynomial kernels for proper interval completion and related problems. Information and Computation, 231, 89–108.Google Scholar
Bessy, Stéphane, Fomin, Fedor V., Gaspers, Serge, Paul, Christophe, Perez, Anthony, Saurabh, Saket, and Thomassé, Stéphan. 2011. Kernels for feedback arc set in tournaments. Journal of Computer and System Sciences, 77(6), 1071–1078.Google Scholar
Binkele-Raible, Daniel, Fernau, Henning, Fomin, Fedor V., Lokshtanov, Daniel, Saurabh, Saket, and Villanger, Yngve. 2012. Kernel(s) for problems with no kernel: On out-trees with many leaves. ACM Transactions on Algorithms, 8(4), 38.Google Scholar
Björklund, Andreas, Husfeldt, Thore, and Taslaman, Nina. 2012. Shortest cycle through specified elements. Pages 1747–1753 of: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM.Google Scholar
Bliznets, Ivan, Fomin, Fedor V., Pilipczuk, Marcin, and Pilipczuk, Michał. 2016. Subexponential parameterized algorithm for interval completion. Pages 1116–1131 of: Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM.Google Scholar
Bodlaender, Hans L. 1996. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM Journal of Computing, 25(6), 1305–1317.Google Scholar
Bodlaender, Hans L. 2006. Treewidth: Characterizations, applications, and computations. Pages 1–14 of: Proceedings of the 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG). Lecture Notes in Computer Science, vol. 4271. Springer.Google Scholar
Bodlaender, Hans L. 2009. Kernelization: New upper and lower bound techniques. Pages 17–37 of: Proceedings of the 4th International Workshop on Parameterized and Exact Computation (IWPEC). Lecture Notes in Computer Science, vol. 5917. Springer.Google Scholar
Bodlaender, Hans L., and de Fluiter, Babette. 1996. Reduction algorithms for constructing solutions in graphs with small treewidth. Pages 199–208 of: Proceedings of the Second Annual International Conference on Computing and Combinatorics (COCOON). Lecture Notes Computer Science, vol. 1090. Springer.Google Scholar
Bodlaender, Hans L., and Hagerup, Torben. 1998. Parallel algorithms with optimal speedup for bounded treewidth. SIAM Journal on Computing, 27(6), 1725–1746.Google Scholar
Bodlaender, Hans L., and Penninkx, Eelko. 2008. A linear kernel for planar feedback vertex set. Pages 160–171 of: Proceedings of the 3rd International Workshop on Parameterized and Exact Computation (IWPEC). Lecture Notes in Computer Science, vol. 5018. Springer.Google Scholar
Bodlaender, Hans L., and van Antwerpen-de Fluiter, Babette. 2001. Reduction algorithms for graphs of small treewidth. Information and Computation, 167(2), 86–119.Google Scholar
Bodlaender, Hans L., and van Dijk, Thomas C. 2010. A cubic kernel for feedback vertex set and loop cutset. Theory of Computing Systems, 46(3), 566–597.Google Scholar
Bodlaender, Hans L., Penninkx, Eelko, and Tan, Richard B. 2008, . A linear kernel for the k-disjoint cycle problem on planar graphs. Pages 306–317 of: Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC). Lecture Notes in Computer Science, vol. 5369. Springer.Google Scholar
Bodlaender, Hans L., Fomin, Fedor V., Lokshtanov, Daniel, Penninkx, Eelko, Saurabh, , Saket, , and Thilikos, Dimitrios M. 2009a. (Meta) kernelization. Pages 629–638 of: Proceedings of the 50th Annual Symposium on Foundations of Computer Science (FOCS). IEEE.Google Scholar
Bodlaender, Hans L., Downey, Rodney G., Fellows, Michael R., and Hermelin, Danny. 2009b. On problems without polynomial kernels. Journal of Computer and System Sciences, 75(8), 423–434.Google Scholar
Bodlaender, Hans L., Thomassé, Stéphan, and Yeo, Anders. 2011. Kernel bounds for disjoint cycles and disjoint paths. Theoretical Computer Science, 412(35), 4570–4578.Google Scholar
Bodlaender, Hans L., Jansen, Bart M. P., and Kratsch, Stefan. 2013. Kernel bounds for path and cycle problems. Theoretical Computer Science, 511, 117–136.Google Scholar
Bodlaender, Hans L., Jansen, Bart M. P., and Kratsch, Stefan. 2014. Kernelization lower bounds by cross-composition. SIAM Journal on Discrete Mathematics, 28(1), 277–305.Google Scholar
Bodlaender, Hans L., Cygan, Marek, Kratsch, Stefan, and Nederlof, Jesper. 2015. Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. Information and Computation, 243, 86–111.Google Scholar
Bodlaender, Hans L., Drange, Pål Grønås, Dregi, Markus S., Fomin, Fedor V., Lokshtanov, Daniel, and Pilipczuk, Michał. 2016a. A ck n 5-approximation algorithm for treewidth. SIAM Journal on Computing, 45(2), 317–378.Google Scholar
Bodlaender, Hans L., Fomin, Fedor V., Lokshtanov, Daniel, Penninkx, Eelko, Saurabh, Saket, and Thilikos, Dimitrios M. 2016b. (Meta) kernelization. Journal of ACM, 63(5), 44:1–44:69.Google Scholar
Bollobás, Béla. 1965. On generalized graphs. Acta Mathematica Academiae Scientiarum Hungaricae, 16(3–4), 447–452.Google Scholar
Bonamy, Marthe, and Kowalik, Lukasz. 2016. A 13k-kernel for planar feedback vertex set via region decomposition. Theoretical Computer Science, 645, 25–40.Google Scholar
Bondy, Adrian, and Murty, Ram M. 2008. Graph Theory. Graduate Texts in Mathematics, vol. 244. Springer.Google Scholar
Bonsma, Paul S., Brüggemann, Tobias, and Woeginger, Gerhard J. 2003. A faster FPT algorithm for finding spanning trees with many leaves. Pages 259–268 of: Proceedings of the 28th Symposium on Mathematical Foundations of Computer Science (MFCS). Lecture Notes in Computer Science, vol. 2747. Springer.Google Scholar
Borchers, Al, and Du, Ding-Zhu. 1997. The k-Steiner ratio in graphs. SIAM Journal on Computing, 26(3), 857–869.Google Scholar
Brooks, Leonard R. 1941. On colouring the nodes of a network. Mathematical Proceedings of the Cambridge Philosophical Society, 37(2), 194–197.Google Scholar
Bunch, James R., and Hopcroft, John E. 1974. Triangular factorization and inversion by fast matrix multiplication. Mathematics of Computation, 28(125), 231–236.Google Scholar
Burrage, Kevin, Estivill-Castro, Vladimir, Fellows, Michael R., Langston, Michael A., Mac, Shev, and Rosamond, Frances A. 2006. The undirected feedback vertex set problem has a poly(k) kernel. Pages 192–202 of: Proceedings of the 2nd International Workshop on Parameterized and Exact Computation (IWPEC). Lecture Notes in Computer Science, vol. 4169. Springer.Google Scholar
Buss, Jonathan F., and Goldsmith, Judy. 1993. Nondeterminism within P. SIAM Journal of Computing, 22(3), 560–572.Google Scholar
Byrka, Jaroslaw, Grandoni, Fabrizio, Rothvoß, Thomas, and Sanità, Laura. 2013. Steiner tree approximation via iterative randomized rounding. Journal of ACM, 60(1), 6:1–6:33.Google Scholar
Cai, Leizhen, and Cai, Yufei. 2015. Incompressibility of H-free edge modification problems. Algorithmica, 71(3), 731–757.Google Scholar
Cai, Liming, Chen, Jianer, Downey, Rodney G., and Fellows, Michael R. 1997. Advice classes of parameterized tractability. Annals of Pure and Applied Logic, 84(1), 119–138.Google Scholar
Cao, Yixin, and Chen, Jianer. 2012. Cluster editing: Kernelization based on edge cuts. Algorithmica, 64(1), 152–169.Google Scholar
Chekuri, Chandra, and Chuzhoy, Julia. 2016. Polynomial bounds for the Grid-Minor Theorem. Journal of ACM, 63(5), 40:1–40:65.Google Scholar
Chen, Guantao, and Yu, Xingxing. 2002. Long cycles in 3-connected graphs. Journal of Combinatorial Theory Series B, 86(1), 80–99.Google Scholar
Chen, Jianer, and Lu, Songjian. 2009. Improved parameterized set splitting algorithms: A probabilistic approach. Algorithmica, 54(4), 472–489.Google Scholar
Chen, Jianer, and Meng, Jie. 2012. A 2k kernel for the cluster editing problem. Journal of Computer and System Sciences, 78(1), 211–220.Google Scholar
Chen, Jianer, Kanj, Iyad A., and Jia, Weijia. 2001. Vertex cover: Further observations and further improvements. Journal of Algorithms, 41(2), 280–301.Google Scholar
Chen, Jianer, Fernau, Henning, Kanj, Iyad A., and Xia, Ge. 2007. Parametric duality and kernelization: Lower bounds and upper bounds on kernel size. SIAM Journal of Computing, 37(4), 1077–1106.Google Scholar
Chen, Jianer, Liu, Yang, Lu, Songjian, O’Sullivan, Barry, and Razgon, Igor. 2008. A fixed-parameter algorithm for the directed feedback vertex set problem. Journal of ACM, 55(5), 21:1–21:19.Google Scholar
Xue, Chen, and Zhou, Yuan. 2017. Parameterized algorithms for Constraint Satisfaction problems above average with global cardinality constraints. Pages 358–377 of: Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM.Google Scholar
Chen, Zhi-Zhong, Jiang, Tao, and Lin, Guohui. 2003. Computing phylogenetic roots with bounded degrees and errors. SIAM Journal of Computing, 32(4), 864–879.Google Scholar
Chlebík, Miroslav, and Chlebíková, Janka. 2008. Crown reductions for the Minimum Weighted Vertex Cover problem. Discrete Applied Mathematics, 156(3), 292–312.Google Scholar
Chor, Benny, Fellows, Michael R., and Juedes, David W. 2004. Linear kernels in linear time, or how to save k colors in O(n2 ) steps. Pages 257–269 of: Proceedings of the 30th Workshop on Graph-Theoretic Concepts in Computer Science (WG). Lecture Notes in Computer Science, vol. 3353. Springer.Google Scholar
Chuzhoy, Julia. 2015. Improved bounds for the Flat Wall Theorem. Pages 256–275 of: Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM.Google Scholar
Chuzhoy, Julia. 2016. Improved bounds for the Excluded Grid Theorem. CoRR, abs/1602.02629.Google Scholar
Condon, Anne, Edelsbrunner, Herbert, Emerson, E. Allen, Fortnow, Lance, Haber, Stuart, Karp, Richard M., Leivant, Daniel, Lipton, Richard J., Lynch, Nancy, Parberry, Ian, Papadimitriou, Christos H., Rabin, Michael, Rosenberg, Arnold, Royer, James S., Savage, John, Selman, Alan L., Smith, Carl, Tardos, Eva, and Vitter, Jeffrey Scott. 1999. Challenges for Theory of Computing: Report for an NSF-Sponsored Workshop on Research in Theoretical Computer Science. Available at https://www.cse.buffalo.edu/∼selman/report/Report.html.Google Scholar
Cormen, Thomas H., Leiserson, Charles E., Rivest, Ronald L., and Stein, Clifford. 2009. Introduction to Algorithms (3 ed.). MIT Press.Google Scholar
Corneil, Derek G., Perl, Yehoshua, and Stewart, Lorna K. 1985. A linear recognition algorithm for cographs. SIAM Journal of Computing, 14(4), 926–934.Google Scholar
Courcelle, Bruno. 1990. The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Information and Computation, 85(1), 12–75.Google Scholar
Courcelle, Bruno. 1992. The monadic second-order logic of graphs III: Treewidth, forbidden minors and complexity issues. Informatique Théorique, 26(3), 257–286.Google Scholar
Crowston, Robert, Gutin, Gregory, and Jones, Mark. 2010. Note on Max Lin-2 above average. Information Processing Letters, 110(11), 451–454.Google Scholar
Crowston, Robert, Jones, Mark, and Mnich, Matthias. 2012a. Max-Cut Parameterized above the Edwards-Erdős Bound. Pages 242–253 of: Proceedings of the 39th International Colloquium of Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science, vol. 7391. Springer.Google Scholar
Crowston, Robert, Gutin, Gregory, Jones, Mark, and Yeo, Anders. 2012b. A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic applications. Algorithmica, 64(1), 56–68.Google Scholar
Crowston, Robert, Jones, Mark, Muciaccia, Gabriele, Philip, Geevarghese, Rai, Ashutosh, and Saurabh, Saket. 2013. Polynomial kernels for lambda-extendible properties parameterized above the poljak-turzik bound. Pages 43–54 of: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS). Leibniz International Proceedings in Informatics (LIPIcs), vol. 24. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.Google Scholar
Crowston, Robert, Fellows, Michael R., Gutin, Gregory, Jones, Mark, Kim, Eun Jung, Rosamond, Frances A., Ruzsa, Imre Z., Thomassé, Stéphan, and Yeo, Anders. 2014. Satisfying more than half of a system of linear equations over GF(2): A multivariate approach. Journal of Computer and System Sciences, 80(4), 687–696.Google Scholar
Cygan, Marek, Kratsch, Stefan, Pilipczuk, Marcin, Pilipczuk, Michał, and Wahlström, Magnus. 2011. Clique cover and graph separation: New incompressibility results. CoRR, abs/1111.0570.Google Scholar
Cygan, Marek, Pilipczuk, Marcin, Pilipczuk, Michał, and Wojtaszczyk, Jakub Onufry. 2012. Kernelization hardness of connectivity problems in d-degenerate graphs. Discrete Applied Mathematics, 160(15), 2131–2141.Google Scholar
Cygan, Marek, Kratsch, Stefan, Pilipczuk, Marcin, Pilipczuk, Michał, and Wahlström, Magnus. 2014a. Clique cover and graph separation: New incompressibility results. ACM Transactions on Computation Theory, 6(2), 6:1–6:19.Google Scholar
Cygan, Marek, Pilipczuk, Marcin, Pilipczuk, Michał, and Wojtaszczyk, Jakub Onufry. 2014b. Solving the 2-Disjoint connected subgraphs problem faster than 2n. Algorithmica, 70(2), 195–207.Google Scholar
Cygan, Marek, Fomin, Fedor V., Kowalik, Lukasz, Lokshtanov, Daniel, Marx, Dániel, Pilipczuk, Marcin, Pilipczuk, Michał, and Saurabh, Saket. 2015. Parameterized Algorithms. Springer.Google Scholar
Cygan, Marek, Grandoni, Fabrizio, and Hermelin, Danny. 2017. Tight kernel bounds for problems on graphs with small degeneracy. ACM Transactions on Algorithms, 13(3), 43:1–43:22.Google Scholar
Daligault, Jean, and Thomassé, Stéphan. 2009. On finding directed trees with many leaves. Pages 86–97 of: Proceedings of the 4th International Workshop on Parameterized and Exact Computation (IWPEC). Lecture Notes in Computer Science, vol. 5917. Springer.Google Scholar
Daligault, Jean, Gutin, Gregory, Kim, Eun Jung, and Yeo, Anders. 2010. FPT algorithms and kernels for the Directed k-Leaf problem. Journal of Computer and System Sciences, 76(2), 144–152.Google Scholar
de Fluiter, Babette. 1997. Algorithms for Graphs of Small Treewidth. Ph thesis, Utrecht University.Google Scholar
Dehne, Frank K. H. A., Fellows, Michael R., and Rosamond, Frances A. 2003. An FPT algorithm for set splitting. Pages 180–191 of: Proceedings of the 29th International Workshop on Graph-Theoretic Concepts in Computer Science (WG). Lecture Notes in Computer Science, vol. 2880. Springer.Google Scholar
Dehne, Frank K. H. A., Fellows, Michael R., Rosamond, Frances A., and Shaw, Peter. 2004. Greedy localization, iterative compression, modeled crown reductions: New FPT techniques, an improved algorithm for set splitting, and a novel 2k kernelization for vertex cover. Pages 271–280 of: Proceedings of the 1st International Workshop on Parameterized and Exact Computation (IWPEC). Lecture Notes in Computer Science, vol. 3162. Springer.Google Scholar
Dehne, Frank K. H. A., Fellows, Michael R., Fernau, Henning, Prieto-Rodriguez, Elena, and Rosamond, Frances A. 2006. Nonblocker: Parameterized algorithmics for minimum dominating set. Pages 237–245 of: SOFSEM 2006: Theory and Practice of Computer Science, 32nd Conference on Current Trends in Theory and Practice of Computer Science, Merín, Czech Republic, January 21–27, 2006, Proceedings.Google Scholar
Dell, Holger. 2014. AND-compression of NP-complete problems: Streamlined proof and minor observations. Pages 184–195 of: Proceedings of the 9th International Symposium on Parameterized and Exact Computation (IPEC). Lecture Notes in Computer Science, vol. 8894. Springer.Google Scholar
Dell, Holger, and Marx, Dániel. 2012. Kernelization of packing problems. Pages 68–81 of: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM.Google Scholar
Dell, Holger, and van Melkebeek, Dieter. 2014. Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. Journal of ACM, 61(4), 23.Google Scholar
Demaine, Erik D., and Hajiaghayi, MohammadTaghi. 2005. Bidimensionality: New connections between FPT algorithms and PTASs. Pages 590–601 of: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM.Google Scholar
Demaine, Erik D., and Hajiaghayi, MohammadTaghi. 2008a. The Bidimensionality Theory and its algorithmic applications. The Computer Journal, 51(3), 292–302.Google Scholar
Demaine, Erik D., and Hajiaghayi, MohammadTaghi. 2008b. Linearity of grid minors in treewidth with applications through bidimensionality. Combinatorica, 28(1), 19–36.Google Scholar
Demaine, Erik D., Fomin, Fedor V., Hajiaghayi, MohammadTaghi, and Thilikos, Dimitrios M. 2005. Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs. Journal of ACM, 52(6), 866–893.Google Scholar
DeMillo, Richard A., and Lipton, Richard J. 1978. A probabilistic remark on algebraic program testing. Information Processing Letters, 7(4), 193–195.Google Scholar
Diestel, Reinhard. 2005. Graph theory. 3rd ed. Graduate Texts in Mathematics, vol. 173. Springer-Verlag.Google Scholar
Dinur, Irit, and Safra, Samuel. 2005. On the hardness of approximating minimum vertex cover. Annals of Mathematics (2), 162(1), 439–485.Google Scholar
Dom, Michael, Guo, Jiong, Hüffner, Falk, Niedermeier, Rolf, and Truß, Anke. 2010. Fixed-parameter tractability results for feedback set problems in tournaments. Journal of Discrete Algorithms, 8(1), 76–86.Google Scholar
Dom, Michael, Lokshtanov, Daniel, and Saurabh, Saket. 2014. Kernelization lower bounds through colors and IDs. ACM Transactions on Algorithms, 11(2), 13.Google Scholar
Dorn, Frederic, Fomin, Fedor V., and Thilikos, Dimitrios M. 2008. Subexponential parameterized algorithms. Computer Science Review, 2(1), 29–39.Google Scholar
Downey, Rodney G., and Fellows, Michael R. 1999. Parameterized complexity. Springer-Verlag.Google Scholar
Downey, Rodney G., and Fellows, Michael R. 2013. Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer.Google Scholar
Drange, Pål Grønås, Dregi, Markus Sortland, Fomin, Fedor V., Kreutzer, Stephan, Lokshtanov, Daniel, Pilipczuk, Marcin, Pilipczuk, Michał, Reidl, Felix, Villaamil, Fernando Sánchez, Saurabh, Saket, Siebertz, Sebastian, and Sikdar, Somnath. 2016a. Kernelization and sparseness: The case of dominating set. Pages 31:1– 31:14 of: Proceedings of the 33rd International Symposium on Theoretical Aspects of Computer Science (STACS). LIPIcs, vol. 47. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.Google Scholar
Drange, Pål Grønås, Dregi, Markus S., and van’t Hof, Pim. 2016b. On the computational complexity of vertex integrity and component order connectivity. Algorithmica, 76(4), 1181–1202.Google Scholar
Dreyfus, Stuart E., and Wagner, Robert A. 1971. The Steiner problem in graphs. Networks, 1(3), 195–207.Google Scholar
Drucker, Andrew. 2015. New limits to classical and quantum instance compression. SIAM Journal on Computing, 44(5), 1443–1479.Google Scholar
Dvořák, Pavel, Feldmann, Andreas Emil, Knop, Dušan, Masařík, Tomáš, Toufar, Tomáš, and Veselý, Pavel. 2017. Parameterized approximation schemes for steiner trees with small number of steiner vertices. CoRR, abs/1710.00668.Google Scholar
Dvorák, Zdenek, and Lidický, Bernard. 2017. Independent sets near the lower bound in bounded degree graphs. Pages 28:1–28:13 of: Proceedings of the 34th International Symposium on Theoretical Aspects of Computer Science (STACS). Leibniz International Proceedings in Informatics (LIPIcs), vol. 66. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik.Google Scholar
Dvorak, Zdenek, and Mnich, Matthias. 2014. Large independent sets in triangle-free planar graphs. Pages 346–357 of: Proceedings of the 22nd Annual European Symposium on Algorithms (ESA). Lecture Notes in Computer Science, vol. 8737. Springer.Google Scholar
Edmonds, Jack, and Fulkerson, Delbert R. 1965. Transversals and Matroid Partition. Defense Technical Information Center.Google Scholar
Eiben, Eduard, Kumar, Mithilesh, Mouawad, Amer E., Panolan, Fahad, and Siebertz, Sebastian. 2018. Lossy kernels for connected dominating set on sparse graphs. Pages 29:1–29:15 of: Proceedings of the 35th International Symposium on Theoretical Aspects of Computer Science (STACS). Leibniz International Proceedings in Informatics (LIPIcs), vol. 96. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.Google Scholar
Erdős, Paul, and Pósa, Louis. 1965. On independent circuits contained in a graph. Canadian Journal of Mathematics, 17, 347–352.Google Scholar
Erdős, Paul, and Rado, Richard. 1960. Intersection theorems for systems of sets. Journal of the London Mathematical Society, 35, 85–90.Google Scholar
Estivill-Castro, Vladimir, Fellows, Michael R., Langston, Michael A., and Rosamond, Frances A. 2005. FPT is P-Time Extremal Structure I. Pages 1–41 of: Proceedings of the First Workshop Algorithms and Complexity in Durham (ACID), vol. 4. Texts in Algorithmics 4, King’s College, London.Google Scholar
Feige, Uriel. 1998. A threshold of ln n for approximating set cover. Journal of ACM, 45(4), 634–652.Google Scholar
Feige, Uriel, Hajiaghayi, MohammadTaghi, and Lee, James R. 2008. Improved approximation algorithms for minimum weight vertex separators. SIAM Journal of Computing, 38(2), 629–657.Google Scholar
Fellows, Michael R. 2003. Blow-ups, win/win’s, and crown rules: Some new directions in FPT. In: Proceedings of the 29th Workshop on Graph-Theoretic Concepts in Computer Science (WG). Lecture Notes in Computer Science, vol. 2880. Springer.Google Scholar
Fellows, Michael R. 2006. The lost continent of polynomial time: Preprocessing and kernelization. Pages 276–277 of: Proceedings of the 2nd International Workshop on Parameterized and Exact Computation (IWPEC). Lecture Notes in Computer Science, vol. 4169. Springer.Google Scholar
Fellows, Michael R., and Langston, Michael A. 1989. On search, decision and the efficiency of polynomial time algorithms (extended abstract). Pages 501–512 of: Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC). ACM.Google Scholar
Fellows, Michael R., and Rosamond, Frances A. 2007. The complexity ecology of parameters: An illustration using bounded max leaf number. Pages 268–277 of: Proceedings of the 3rd Conference on Computability in Europe (CiE). Lecture Notes in Computer Science, vol. 4497. Springer.Google Scholar
Fellows, Michael R., Heggernes, Pinar, Rosamond, Frances A., Sloper, Christian, and Telle, Jan Arne. 2004. Finding k disjoint triangles in an arbitrary graph. Pages 235–244 of: Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG). Lecture Notes in Computer Science, vol. 3353. Springer.Google Scholar
Fellows, Michael R., Lokshtanov, Daniel, Misra, Neeldhara, Mnich, Matthias, Rosamond, Frances A., and Saurabh, Saket. 2009. The complexity ecology of parameters: An illustration using bounded max leaf number. Theory of Computing Systems, 45(4), 822–848.Google Scholar
Fellows, Michael R., Guo, Jiong, Moser, Hannes, and Niedermeier, Rolf. 2011. A generalization of Nemhauser and Trotters local optimization theorem. Journal of Computer and System Sciences, 77(6), 1141–1158.Google Scholar
Fellows, Michael R., Hermelin, Danny, Rosamond, Frances A., and Shachnai, Hadas. 2016. Tractable parameterizations for the minimum linear arrangement problem. ACM Transactions on Computation Theory, 8(2), 6:1–6:12.Google Scholar
Fellows, Michael R., Kulik, Ariel, Rosamond, Frances A., and Shachnai, Hadas. 2018. Parameterized approximation via fidelity preserving transformations. Journal of Computer and System Sciences, 93, 30–40.Google Scholar
Flum, Jörg, and Grohe, Martin. 2006. Parameterized Complexity Theory. Texts in Theoretical Computer Science: An EATCS Series. Springer-Verlag.Google Scholar
Fomin, Fedor V., and Saurabh, Saket. 2014. Kernelization methods for fixed-parameter tractability. Pages 260–282 of: Tractability. Cambridge University Press.Google Scholar
Fomin, Fedor V., and Strømme, Torstein. 2016. Vertex cover structural parameterization revisited. Pages 171–182 of: Proceedings of the 42nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG). Lecture Notes in Computer Science, vol. 9941. Springer.Google Scholar
Fomin, Fedor V., and Villanger, Yngve. 2012. Treewidth computation and extremal combinatorics. Combinatorica, 32(3), 289–308.Google Scholar
Fomin, Fedor V., Lokshtanov, Daniel, Saurabh, Saket, and Thilikos, Dimitrios M. 2010. Bidimensionality and kernels. Pages 503–510 of: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM.Google Scholar
Fomin, Fedor V., Lokshtanov, Daniel, Raman, Venkatesh, and Saurabh, Saket. 2011a. Bidimensionality and EPTAS. Pages 748–759 of: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM.Google Scholar
Fomin, Fedor V., Golovach, Petr A., and Thilikos, Dimitrios M. 2011b. Contraction obstructions for treewidth. Journal of Combinatorial Theory Series B, 101(5), 302–314.Google Scholar
Fomin, Fedor V., Lokshtanov, Daniel, Misra, Neeldhara, Philip, Geevarghese, and Saurabh, Saket. 2011c. Hitting forbidden minors: Approximation and Kernelization. Pages 189–200 of: Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science (STACS). Leibniz International Proceedings in Informatics (LIPIcs), vol. 9. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.Google Scholar
Fomin, Fedor V., Lokshtanov, Daniel, Saurabh, Saket, and Thilikos, Dimitrios M. 2012a. Linear kernels for (connected) dominating set on H-minor-free graphs. Pages 82–93 of: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM.Google Scholar
Fomin, Fedor V., Lokshtanov, Daniel, Misra, Neeldhara, and Saurabh, Saket. 2012b. Planar F-Deletion: Approximation, kernelization and optimal FPT algorithms. Pages 470–479 of: Proceedings of the 53rd Annual Symposium on Foundations of Computer Science (FOCS). IEEE.Google Scholar
Fomin, Fedor V., Gaspers, Serge, Saurabh, Saket, and Thomassé, Stéphan. 2013. A linear vertex kernel for maximum internal spanning tree. Journal of Computer and System Sciences, 79(1), 1–6.Google Scholar
Fomin, Fedor V., Jansen, Bart M. P., and Pilipczuk, Michał. 2014. Preprocessing subgraph and minor problems: When does a small vertex cover help? Journal of Computer and System Sciences, 80(2), 468–495.Google Scholar
Fomin, Fedor V., Todinca, Ioan, and Villanger, Yngve. 2015a. Large induced subgraphs via triangulations and CMSO. SIAM Journal on Computing, 44(1), 54–87.Google Scholar
Fomin, Fedor V., Lokshtanov, Daniel, Misra, Neeldhara, Ramanujan, M. S., and Saurabh, Saket. 2015b. Solving d-SAT via backdoors to small treewidth. Pages 630–641 of: Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM.Google Scholar
Fomin, Fedor V., Lokshtanov, Daniel, Saurabh, Saket, and Thilikos, Dimitrios M. 2016a. Bidimensionality and Kernels. CoRR, abs/1606.05689.Google Scholar
Fomin, Fedor V., Lokshtanov, Daniel, Panolan, Fahad, and Saurabh, Saket. 2016b. Efficient computation of representative families with applications in parameterized and exact algorithms. Journal of ACM, 63(4), 29:1–29:60.Google Scholar
Fomin, Fedor V., Lokshtanov, Daniel, Misra, Neeldhara, Philip, Geevarghese, and Saurabh, Saket. 2016c. Hitting forbidden minors: Approximation and kernelization. SIAM Journal on Discrete Mathematics, 30(1), 383–410.Google Scholar
Fomin, Fedor V., Lokshtanov, Daniel, Panolan, Fahad, and Saurabh, Saket. 2017. Representative families of product families. ACM Transactions on Algorithms, 13(3), 36:1–36:29.Google Scholar
Fomin, Fedor V., Lokshtanov, Daniel, and Saurabh, Saket. 2018. Excluded grid minors and efficient polynomial-time approximation schemes. Journal of ACM, 65(2), 10:1–10:44.Google Scholar
Ford, Lester R. Jr., and Fulkerson, Delbert R. 1956. Maximal flow through a network. Canadian Journal of Mathematics, 8, 399–404.Google Scholar
Fortnow, Lance, and Santhanam, Rahul. 2011. Infeasibility of instance compression and succinct PCPs for NP. Journal of Computer and System Sciences, 77(1), 91–106.Google Scholar
Frank, András, Király, Tamás, and Kriesell, Matthias. 2003. On decomposing a hypergraph into kconnected sub-hypergraphs. Discrete Applied Mathematics, 131(2), 373–383.Google Scholar
Frankl, Peter. 1982. An extremal problem for two families of sets. European Journal of Combinatorics, 3(2), 125–127.Google Scholar
Friggstad, Zachary, and Salavatipour, Mohammad R. 2011. Approximability of packing disjoint cycles. Algorithmica, 60(2), 395–400.Google Scholar
Gajarský, Jakub, Hlinený, Petr, Obdrzálek, Jan, Ordyniak, Sebastian, Reidl, Felix, Rossmanith, Peter, Villaamil, Fernando Sánchez, and Sikdar, Somnath. 2017. Kernelization using structural parameters on sparse graph classes. Journal of Computer and System Sciences, 84, 219–242.Google Scholar
Gall, François Le. 2014. Powers of tensors and fast matrix multiplication. Pages 296–303 of: Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC). ACM.Google Scholar
Gallai, Tibor. 1961. Maximum-minimum Sätze und verallgemeinerte Faktoren von Graphen. Acta Mathematica Academiae Scientiarum Hungaricae, 12(1–2), 131–173.Google Scholar
Gallai, Tibor. 1967. Transitiv orientierbare Graphen. Acta Mathematica Academiae Scientiarum Hungaricae, 18(1–2), 25–66.Google Scholar
Ganian, Robert, Slivovsky, Friedrich, and Szeider, Stefan. 2016. Meta-kernelization with structural parameters. Journal of Computer and System Sciences, 82(2), 333–346.Google Scholar
Garnero, Valentin, Paul, Christophe, Sau, Ignasi, and Thilikos, Dimitrios M. 2015. Explicit linear kernels via dynamic programming. SIAM Journal on Discrete Mathematics, 29(4), 1864–1894.Google Scholar
Gramm, Jens, Guo, Jiong, Hüffner, Falk, and Niedermeier, Rolf. 2005. Graph-modeled data clustering: Exact algorithms for clique generation. Theory of Computing Systems, 38(4), 373–392.Google Scholar
Gramm, Jens, Guo, Jiong, Hüffner, Falk, and Niedermeier, Rolf. 2008. Data reduction and exact algorithms for clique cover. ACM Journal of Experimental Algorithmics, 13, article 2.Google Scholar
Gu, Qian-Ping, and Tamaki, Hisao. 2012. Improved bounds on the planar branchwidth with respect to the largest grid minor size. Algorithmica, 64(3), 416–453.Google Scholar
Guillemot, Sylvain, Havet, Frédéric, Paul, Christophe, and Perez, Anthony. 2013. On the (non-) existence of polynomial kernels for P l -free edge modification problems. Algorithmica, 65(4), 900–926.Google Scholar
Guo, Jiong. 2007. Problem kernels for NP-complete edge deletion problems: Split and related graphs. Pages 915–926 of: Proceedings of the 18th International Symposium on Algorithms and Computation (ISAAC). Lecture Notes in Computer Science, vol. 4835. Springer.Google Scholar
Guo, Jiong. 2009. A more effective linear kernelization for cluster editing. Theoretical Computer Science, 410(8–10), 718–726.Google Scholar
Guo, Jiong, and Niedermeier, Rolf. 2007a. Invitation to data reduction and problem kernelization. SIGACT News, 38(1), 31–45.Google Scholar
Guo, Jiong, and Niedermeier, Rolf. 2007b. Linear problem kernels for NP-hard problems on planar graphs. Pages 375–386 of: Proceedings of the 34th International Colloquium of Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science, vol. 4596. Springer.Google Scholar
Guo, Jiong, Niedermeier, Rolf, and Wernicke, Sebastian. 2006. Fixed-parameter tractability results for full-degree spanning tree and its dual. Pages 203–214 of: Proceedings of the 2nd International Workshop on Parameterized and Exact Computation (IWPEC). Lecture Notes in Computer Science, vol. 4169. Springer.Google Scholar
Guo, Jiong, Niedermeier, Rolf, and Wernicke, Sebastian. 2007. Parameterized complexity of vertex cover variants. Theory of Computing Systems, 41(3), 501–520.Google Scholar
Gutin, Gregory, and Yeo, Anders. 2012. Constraint satisfaction problems parameterized above or below tight bounds: A survey. Pages 257–286 of: The Multivariate Algorithmic Revolution and Beyond. Springer.Google Scholar
Gutin, Gregory, and Yeo, Anders. 2017. Parameterized constraint satisfaction problems: A survey. Pages 179–203 of: Krokhin, Andrei A., and Zivny, Stanislav (eds.), The Constraint Satisfaction Problem: Complexity and Approximability. Dagstuhl Follow-Ups, vol. 7. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.Google Scholar
Gutin, Gregory, Jones, Mark, and Yeo, Anders. 2011a. Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems. Theoretical Computer Science, 412(41), 5744–5751.Google Scholar
Gutin, Gregory, Kim, Eun Jung, Szeider, Stefan, and Yeo, Anders. 2011b. A probabilistic approach to problems parameterized above or below tight bounds. Journal of Computer and System Sciences, 77(2), 422–429.Google Scholar
Gutin, Gregory, Kim, Eun Jung, Lampis, Michael, and Mitsou, Valia. 2011c. Vertex cover problem parameterized above and below tight bounds. Theory of Computing Systems, 48(2), 402–410.Google Scholar
Gutin, Gregory, van Iersel, Leo, Mnich, Matthias, and Yeo, Anders. 2012. Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables. Journal of Computer and System Sciences, 78(1), 151–163.Google Scholar
Gutin, Gregory, Rafiey, Arash, Szeider, Stefan, and Yeo, Anders. 2013a. Corrigendum: The linear arrangement problem parameterized above guaranteed value. Theory of Computing Systems, 53(4), 690–691.Google Scholar
Gutin, Gregory, Muciaccia, Gabriele, and Yeo, Anders. 2013b. (Non-)existence of polynomial kernels for the Test Cover problem. Information Processing Letters, 113(4), 123–126.Google Scholar
Gyárfás, András. 1990. A simple lower bound on edge coverings by cliques. Discrete Mathematics, 85(1), 103–104.Google Scholar
Habib, Michel, and Paul, Christophe. 2010. A survey of the algorithmic aspects of modular decomposition. Computer Science Review, 4(1), 41–59.Google Scholar
Hagerup, Torben. 2012. Kernels for edge dominating set: Simpler or smaller. Pages 491–502 of: Proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science (MFCS). Lecture Notes in Computer Science, vol. 7464. Springer.Google Scholar
Hall, Philip. 1935. On representatives of subsets. Journal of the London Mathematical Society, 10(1), 26–30.Google Scholar
Har-Peled, Sariel, Kaplan, Haim, Mulzer, Wolfgang, Roditty, Liam, Seiferth, Paul, Sharir, Micha, and Willert, Max. 2018. Stabbing pairwise intersecting disks by five points. CoRR, abs/1801.03158.Google Scholar
Heggernes, Pinar, Kratsch, Dieter, Lokshtanov, Daniel, Raman, Venkatesh, and Saurabh, Saket. 2013. Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization. Information and Computation, 231, 109–116.Google Scholar
Held, Michael, and Karp, Richard M. 1962. A dynamic programming approach to sequencing problems. Journal of SIAM, 10(1), 196–210.Google Scholar
Hermelin, Danny, and Wu, Xi. 2012. Weak compositions and their applications to polynomial lower bounds for kernelization. Pages 104–113 of: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM.Google Scholar
Hermelin, Danny, Kratsch, Stefan, Soltys, Karolina, Wahlström, Magnus, and Wu, Xi. 2015. A completeness theory for polynomial (turing) kernelization. Algorithmica, 71(3), 702–730.Google Scholar
Hochbaum, Dorit S. (ed). 1997. Approximation Algorithms for NP-Hard Problems. PWS Publishing Co.Google Scholar
Hols, Eva-Maria C., and Kratsch, Stefan. 2018. A randomized polynomial kernel for subset feedback vertex set. Theory of Computing Systems, 62(1), 63–92.Google Scholar
Hopcroft, John E., and Karp, Richard M. 1973. An n5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal of Computing, 2(3), 225–231.Google Scholar
Hopcroft, John E., and Tarjan, Robert E. 1973. Dividing a graph into triconnected components. SIAM Journal of Computing, 2(3), 135–158.Google Scholar
Hüffner, Falk, Niedermeier, Rolf, and Wernicke, Sebastian. 2008. Techniques for practical fixed-parameter algorithms. The Computer Journal, 51(1), 7–25.Google Scholar
Iwata, Yoichi. 2017 . Linear-time kernelization for feedback vertex set. Pages 68:1– 68:14 of: Proceedings of the 44th International Colloquium of Automata, Languages and Programming (ICALP). Leibniz International Proceedings in Informatics (LIPIcs), vol. 80. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.Google Scholar
Jansen, Bart M. P. 2012. Kernelization for maximum leaf spanning tree with positive vertex weights. Journal of Graph Algorithms and Applications, 16(4), 811–846.Google Scholar
Jansen, Bart M. P. 2013. The power of data reduction: Kernels for fundamental graph problems. Ph thesis, Utrecht University.Google Scholar
Jansen, Bart M. P. 2017. Turing kernelization for finding long paths and cycles in restricted graph classes. Journal of Computer and System Sciences, 85, 18–37.Google Scholar
Jansen, Bart M. P., and Bodlaender, Hans L. 2013. Vertex cover kernelization revisited: Upper and lower bounds for a refined parameter. Theory of Computing Systems, 53(2), 263–299.Google Scholar
Jansen, Bart M. P., and Marx, Dániel. 2015. Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels. Pages 616–629 of: Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM.Google Scholar
Jansen, Bart M. P., Lokshtanov, Daniel, and Saurabh, Saket. 2014. A Near-optimal planarization algorithm. Pages 1802–1811 of: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM.Google Scholar
Jansen, Bart M. P., Pilipczuk, Marcin, and Wrochna, Marcin. 2017. Turing kernelization for finding long paths in graph classes excluding a topological minor. CoRR, abs/1707.01797.Google Scholar
Jukna, Stasys. 2011. Extremal Combinatorics. 2nd ed. Texts in Theoretical Computer Science. An EATCS Series. Springer. Extremal Combinatorics: With Applications in Computer Science.Google Scholar
Kaibel, Volker, and Koch, Thorsten. 2006. Mathematik für den Volkssport. DMV Mitteilungen, 14(2), 93.Google Scholar
Kammer, Frank, and Tholey, Torsten. 2016. Approximate tree decompositions of planar graphs in linear time. Theoretical Computer Science, 645, 60–90.Google Scholar
Kanj, Iyad A., Pelsmajer, Michael J., Schaefer, Marcus, and Xia, Ge. 2011. On the induced matching problem. Journal of Computer and System Sciences, 77(6), 1058–1070.Google Scholar
Kaplan, Haim, Shamir, Ron, and Tarjan, Robert E. 1999. Tractability of parameterized completion problems on chordal, strongly chordal, and proper interval graphs. SIAM Journal of Computing, 28(5), 1906–1922.Google Scholar
Karzanov, Alexander V. 1974. The problem of finding the maximal flow in a network by the method of preflows. Dokl. Akad. Nauk SSSR, 215(1), 49–52.Google Scholar
Kawarabayashi, Ken-ichi, and Kobayashi, Yusuke. 2012. Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid. Pages 278–289 of: Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science (STACS). Leibniz International Proceedings in Informatics (LIPIcs), vol. 14. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.Google Scholar
Khot, Subhash, and Raman, Venkatesh. 2002. Parameterized complexity of finding subgraphs with hereditary properties. Theoretical Computer Science, 289(2), 997–1008.Google Scholar
Khot, Subhash, and Regev, Oded. 2008. Vertex cover might be hard to approximate to within 2-epsilon. Journal of Computer System Sciences, 74(3), 335–349.Google Scholar
Khuller, Samir. 2002. Algorithms column: The vertex cover problem. SIGACT News, 33(2), 31–33.Google Scholar
Kim, Eun Jung, and Kwon, O-joung. 2017. A polynomial kernel for block graph deletion. Algorithmica, 79(1), 251–270.Google Scholar
Kim, Eun Jung, and Williams, Ryan. 2012. Improved parameterized algorithms for above average constraint satisfaction. Pages 118–131 of: Proceedings of the 6th International Symposium on Parameterized and Exact Computation (IPEC). Lecture Notes in Computer Science, vol. 7112. Springer.Google Scholar
Kim, Eun Jung, Langer, Alexander, Paul, Christophe, Reidl, Felix, Rossmanith, Peter, Sau, Ignasi, and Sikdar, Somnath. 2016. Linear kernels and single-exponential algorithms via protrusion decompositions. ACM Transactions on Algorithms, 12(2), 21:1–21:41.Google Scholar
Kleitman, Daniel J., and West, Douglas. B. 1991. Spanning trees with many leaves. SIAM Journal of Discrete Mathematics, 4(1), 99–106.Google Scholar
Kőnig, Dénes. 1916. Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre. Mathematische Annalen, 77(4), 453–465.Google Scholar
Kratsch, Stefan. 2014. Co-nondeterminism in compositions: A kernelization lower bound for a ramsey-type problem. ACM Transactions on Algorithms, 10(4), 19:1– 19:16.Google Scholar
Kratsch, Stefan. 2016 . A randomized polynomial kernelization for Vertex Cover with a smaller parameter. Pages 59:1–59:17 of: Proceedings of the 24th Annual European Symposium on Algorithms (ESA). Leibniz International Proceedings in Informatics (LIPIcs), vol. 57. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.Google Scholar
Kratsch, Stefan, and Wahlström, Magnus. 2009. Two edge modification problems without polynomial kernels. Pages 264–275 of: Parameterized and Exact Computation, 4th International Workshop (IWPEC). Lecture Notes in Computer Science, vol. 5917. Springer.Google Scholar
Kratsch, Stefan, and Wahlström, Magnus. 2010. Preprocessing of min ones problems: A dichotomy. Pages 653–665 of: Proceedings of the 37th International Colloquium of Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science, vol. 6198. Springer.Google Scholar
Kratsch, Stefan, and Wahlström, Magnus. 2012. Representative sets and irrelevant vertices: New tools for kernelization. Pages 450–459 of: Proceedings of the 53rd Annual Symposium on Foundations of Computer Science (FOCS). IEEE.Google Scholar
Kratsch, Stefan, and Wahlström, Magnus. 2013. Two edge modification problems without polynomial kernels. Discrete Optimization, 10(3), 193–199.Google Scholar
Kratsch, Stefan, and Wahlström, Magnus. 2014. Compression via matroids: A randomized polynomial kernel for odd cycle transversal. ACM Transactions on Algorithms, 10(4), 20.Google Scholar
Kratsch, Stefan, Philip, Geevarghese, and Ray, Saurabh. 2016. Point line cover: The easy kernel is essentially tight. ACM Transactions on Algorithms, 12(3), 40:1– 40:16.Google Scholar
Krithika, R., Misra, Pranabendu, Rai, Ashutosh, , and Tale, Prafullkumar. 2016. Lossy kernels for graph contraction problems. Pages 23:1–23:14 of: Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS). Leibniz International Proceedings in Informatics (LIPIcs), vol. 65. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.Google Scholar
Kumar, Mithilesh, and Lokshtanov, Daniel. 2016. A 2lk kernel for l-component order connectivity. Pages 20:1–20:14 of: Proceedings of the 11th International Symposium on Parameterized and Exact Computation (IPEC). Leibniz International Proceedings in Informatics (LIPIcs), vol. 63. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.Google Scholar
Lampis, Michael. 2011. A kernel of order 2k − c log k for vertex cover. Information Processing Letters, 111(23–24), 1089–1091.Google Scholar
Lawler, Eugene L. 2001. Combinatorial Optimization: Networks and Matroids. Dover Books on Mathematics Series. Dover Publications.Google Scholar
Le, Tien-Nam, Lokshtanov, Daniel, Saurabh, Saket, Thomassé, Stéphan, and Zehavi, Meirav. 2018. Subquadratic kernels for Implicit 3-Hitting Set and 3-Set Packing problems. Pages 331–342 of: Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM.Google Scholar
Leaf, Alexander, and Seymour, Paul D. 2012 (manuscript). Treewidth and planar minors. https://web.math.princeton.edu/pds/papers/treewidth/paper.pdf.Google Scholar
Li, Wenjun, Cao, Yixin, Chen, Jianer, and Wang, Jianxin. 2017. Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree. Information and Computation, 252, 187–200.Google Scholar
Lokshtanov, Daniel. 2009. New methods in parameterized algorithms and complexity. Ph thesis, University of Bergen.Google Scholar
Lokshtanov, Daniel, and Saurabh, Saket. 2009. Even faster algorithm for set splitting! Pages 288–299 of: Proceedings of the 4th International Workshop on Parameterized and Exact Computation (IWPEC). Lecture Notes in Computer Science, vol. 5917. Springer.Google Scholar
Lokshtanov, Daniel, and Sloper, Christian. 2005. Fixed parameter set splitting, linear kernel and improved running time. Pages 105–113 of: Proceedings of the First Algorithms and Complexity in Durham Workshop (ACiD). Texts in Algorithmics, vol. 4. King’s College, London.Google Scholar
Lokshtanov, Daniel, Mnich, Matthias, and Saurabh, Saket. 2011a. A linear kernel for a planar connected dominating set. Theoretical Computer Science, 412(23), 2536–2543.Google Scholar
Lokshtanov, Daniel, Marx, Dániel, and Saurabh, Saket. 2011b. Lower bounds based on the Exponential Time Hypothesis. Bulletin of the EATCS, 105, 41–72.Google Scholar
Lokshtanov, Daniel, Narayanaswamy, N. S., Raman, Venkatesh, Ramanujan, M. S., and Saurabh, Saket. 2014. Faster parameterized algorithms using linear programming. ACM Transactions on Algorithms, 11(2), 15.Google Scholar
Lokshtanov, Daniel, Panolan, Fahad, Ramanujan, M. S., and Saurabh, Saket. 2017. Lossy kernelization. Pages 224–237 of: Proceedings of the 49th Annual ACM Symposium on Theory of Computing (STOC). ACM.Google Scholar
Lokshtanov, Daniel, Misra, Pranabendu, Panolan, Fahad, Saurabh, Saket, and Zehavi, Meirav. 2018. Quasipolynomial representation of transversal matroids with applications in parameterized complexity. Pages 32:1–32:13 of: 9th Innovations in Theoretical Computer Science Conference, ITCS 2018, January 11–14, 2018, Cambridge, MA.Google Scholar
Loréa, Michel. 1975. Hypergraphes et matroides. Cahiers du Centre d’tudes de Recherche Operationnelle, 17, 289–291.Google Scholar
Lovász, László. 1970. A generalization of Kőnig’s theorem. Acta Mathematica Academiae Scientiarum Hungaricae, 21(3–4), 443–446.Google Scholar
Lovász, László. 1977. Flats in matroids and geometric graphs. Pages 45–86 of: Combinatorial Surveys (Proceedings of the Sixth British Combinatorial Conference, Royal Holloway Coll., Egham). Academic Press.Google Scholar
Lovász, László, and Plummer, Michael D. 2009. Matching Theory. AMS Chelsea Publishing.Google Scholar
Mahajan, Meena, and Raman, Venkatesh. 1999. Parameterizing above guaranteed values: MaxSat and MaxCut. Journal of Algorithms, 31(2), 335–354.Google Scholar
Mahajan, Meena, Raman, Venkatesh, and Sikdar, Somnath. 2009. Parameterizing above or below guaranteed values. Journal of Computer and System Sciences, 75(2), 137–153.Google Scholar
Majumdar, Diptapriyo, Raman, Venkatesh, and Saurabh, Saket. 2015. Kernels for structural parameterizations of Vertex Cover-case of small degree modulators. Pages 331–342 of: Proceedings of the 10th International Symposium on Parameterized and Exact Computation (IPEC). Leibniz International Proceedings in Informatics (LIPIcs), vol. 43. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.Google Scholar
Makarychev, Konstantin, Makarychev, Yury, and Zhou, Yuan. 2015. Satisfiability of ordering CSPs above average is fixed-parameter tractable. Pages 975–993 of: Proceedings of the 56th Annual Symposium on Foundations of Computer Science (FOCS). IEEE.Google Scholar
Marx, Dániel. 2008. Parameterized complexity and approximation algorithms. The Computer Journal, 51(1), 60–78.Google Scholar
Marx, Dániel. 2009. A parameterized view on matroid optimization problems. Theoretical Computer Science, 410(44), 4471–4479.Google Scholar
Marx, Dániel. 2011. Important Separators and Parameterized Algorithms. Pages 5–10 of: Graph-Theoretic Concepts in Computer Science—37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21–24, 2011. Revised Papers.Google Scholar
Marx, Dániel, and Razgon, Igor. 2014. Fixed-parameter tractability of multicut parameterized by the size of the cutset. SIAM Journal on Computing, 43(2), 355–388.Google Scholar
McConnell, Ross M., and de Montgolfier, Fabien. 2005. Linear-time modular decomposition of directed graphs. Discrete Applied Mathematics, 145(2), 198–209.Google Scholar
McConnell, Ross M., and Spinrad, Jeremy P. 1999. Modular decomposition and transitive orientation. Discrete Mathematics, 201(1–3), 189–241.Google Scholar
McCuaig, William, and Shepherd, F. Bruce. 1989. Domination in graphs with minimum degree two. Journal of Graph Theory, 13(6), 749–762.Google Scholar
Misra, Neeldhara. 2010. Infeasibility of polynomial kernelization. MPhil thesis, Institute of Mathematical Sciences.Google Scholar
Misra, Neeldhara, Narayanaswamy, N. S., Raman, Venkatesh, and Shankar, Bal Sri. 2010. Solving Min Ones-2-SAT as Fast as Vertex Cover. Pages 549–555 of: Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science (MFCS). Lecture Notes in Computer Science, vol. 6281. Springer.Google Scholar
Misra, Neeldhara, Raman, Venkatesh, and Saurabh, Saket. 2011. Lower bounds on kernelization. Discrete Optimization, 8(1), 110–128.Google Scholar
Misra, Neeldhara, Philip, Geevarghese, Raman, Venkatesh, and Saurabh, Saket. 2012a. On parameterized independent feedback vertex set. Theoretical Computer Science, 461, 65–75.Google Scholar
Misra, Pranabendu, Raman, Venkatesh, Ramanujan, M. S., and Saurabh, Saket. 2012b. Parameterized algorithms for even cycle transversal. Pages 172–183 of: Proceedings of the 38th International Workshop on Graph-Theoretic Concepts in Computer Science (WG). Lecture Notes in Computer Science, vol. 7551. Springer.Google Scholar
Misra, Pranabendu, Raman, Venkatesh, Ramanujan, M. S., and Saurabh, Saket. 2013. A polynomial kernel for feedback arc set on bipartite tournaments. Theory of Computing Systems, 53(4), 609–620.Google Scholar
Möhring, R. H., and Radermacher, F. J. 1984. Substitution decomposition for discrete structures and connections with combinatorial optimization. Pages 257–355 of: Algebraic and Combinatorial Methods in Operations Research. North-Holland Math. Stud., vol. 95. North-Holland.Google Scholar
Monien, Burkhard. 1985. How to find long paths efficiently. Pages 239–254 of: Analysis and Design of Algorithms for Combinatorial Problems (Udine, 1982). North-Holland Math. Stud., vol. 109. North-Holland.Google Scholar
Moser, Hannes. 2009. A problem kernelization for graph packing. Pages 401–412 of: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM). Lecture Notes in Computer Science, vol. 5404. Springer.Google Scholar
Moser, Hannes, and Sikdar, Somnath. 2007. The parameterized complexity of the induced matching problem in planar graphs. Pages 325–336 of: Proceedings First Annual International Workshop: Frontiers in Algorithmics (FAW). Lecture Notes in Computer Science, vol. 4613. Springer.Google Scholar
Murota, Kazuo. 2000. Matrices and Matroids for Systems Analysis. Algorithms and Combinatorics, vol. 20. Springer-Verlag.Google Scholar
Narayanaswamy, N. S., Raman, Venkatesh, Ramanujan, M. S., and Saurabh, Saket. 2012. LP can be a cure for parameterized problems. Pages 338–349 of: Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science (STACS). Leibniz International Proceedings in Informatics (LIPIcs), vol. 14. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.Google Scholar
Nemhauser, George L., and Trotter, Leslie E. Jr. 1974. Properties of vertex packing and independence system polyhedra. Mathematical Programming, 6(1), 48–61.Google Scholar
Niedermeier, Rolf. 2006. Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and its Applications, vol. 31. Oxford University Press.Google Scholar
Niedermeier, Rolf. 2010. Reflections on multivariate algorithmics and problem parameterization. Pages 17–32 of: Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS). Leibniz International Proceedings in Informatics (LIPIcs), vol. 5. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.Google Scholar
Oxley, James G. 2010. Matroid Theory. 2nd ed. Oxford Graduate Texts in Mathematics, vol. 21. Oxford University Press.Google Scholar
Perfect, Hazel. 1968. Applications of Menger’s graph theorem. Journal of Mathematical Analysis and Applications, 22(1), 96 – 111.Google Scholar
Philip, Geevarghese, Raman, Venkatesh, and Sikdar, Somnath. 2012. Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond. ACM Transactions on Algorithms, 9(1), 11.Google Scholar
Pilipczuk, Marcin, Pilipczuk, Michał, Sankowski, Piotr, and van Leeuwen, Erik Jan. 2014. Network sparsification for steiner problems on planar and bounded-genus graphs. Pages 276–285 of: Proceedings of the 55th Annual Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society.Google Scholar
Prieto, Elena. 2005. Systematic kernelization in FPT algorithm design. Ph thesis, The University of Newcastle.Google Scholar
Prieto, Elena, and Sloper, Christian. 2003. Either/or: Using vertex cover structure in designing FPT-algorithms: The case of k-internal spanning tree. Pages 474–483 of: Proceedings of the 8th International Workshop on Algorithms and Data Structures (WADS 2003). Lecture Notes in Computer Science, vol. 2748. Springer.Google Scholar
Prieto, Elena, and Sloper, Christian. 2005. Reducing to independent set structure: The case of k-internal spanning tree. Nordic Journal of Computing, 12(June), 308–318.Google Scholar
Prieto, Elena, and Sloper, Christian. 2006. Looking at the stars. Theoretical Computer Science, 351(3), 437–445.Google Scholar
Raman, Venkatesh, and Saurabh, Saket. 2008. Short cycles make W-hard problems hard: FPT algorithms for W-hard problems in graphs with no short cycles. Algorithmica, 52(2), 203–225.Google Scholar
Raman, Venkatesh, Saurabh, Saket, and Subramanian, C. R. 2006. Faster fixed parameter tractable algorithms for finding feedback vertex sets. ACM Transactions on Algorithms, 2(3), 403–415.Google Scholar
Ramsey, Frank P. 1930. On a problem of formal logic. Proceedings of the London Mathematical Society, S2–30, 264–286.Google Scholar
Reed, Bruce A. 1997. Tree width and tangles: A new connectivity measure and some applications. Pages 87–162 of: Surveys in Combinatorics. London Mathematical Society Lecture Note Series, vol. 241. Cambridge University Press.Google Scholar
Reed, Bruce A., Smith, Kaleigh, and Vetta, Adrian. 2004. Finding odd cycle transversals. Operations Research Letters, 32(4), 299–301.Google Scholar
Robertson, Neil, and Seymour, Paul D. 1984. Graph minors. III. Planar tree-width. Journal of Combinatorial Theory Series B, 36(1), 49–64.Google Scholar
Robertson, Neil, and Seymour, Paul D. 1986a. Graph minors. II. Algorithmic aspects of tree-width. Journal of Algorithms, 7(3), 309–322.Google Scholar
Robertson, Neil, and Seymour, Paul D. 1986b. Graph minors. V. Excluding a planar graph. Journal of Combinatorial Theory Series B, 41(1), 92–114.Google Scholar
Robertson, Neil, Seymour, Paul D., and Thomas, Robin. 1994. Quickly excluding a planar graph. Journal of Combinatorial Theory Series B, 62(2), 323–348.Google Scholar
Salavatipour, Mohammad R., and Verstraëte, Jacques. 2005. Disjoint cycles: Integrality gap, hardness, and approximation. Pages 51–65 of: Proceedings of the 11th International Conference on Integer Programming and Combinatorial Optimization (IPCO), vol. 3509. Springer.Google Scholar
Saurabh, Saket, and Zehavi, Meirav. 2016. (k, n − k)-Max-Cut: An O∗ (2p )-time algorithm and a polynomial kernel. Pages 686–699 of: Proceedings of the 12th Latin American Theoretical Informatics Symposium (LATIN). Lecture Notes in Computer Science, vol. 9644. Springer.Google Scholar
Savage, Carla. 1982. Depth-first search and the vertex cover problem. Information Processing Letters, 14(5), 233–235.Google Scholar
Schrijver, Alexander. 2003. Combinatorial Optimization: Polyhedra and Efficiency. Vol. A. Springer-Verlag.Google Scholar
Schwartz, Jacob T. 1980. Fast probabilistic algorithms for verification of polynomial identities. Journal of ACM, 27(4), 701–717.Google Scholar
Seymour, Paul D., and Thomas, Robin. 1994. Call routing and the ratcatcher. Combinatorica, 14(2), 217–241.Google Scholar
Shamir, Ron, Sharan, Roded, and Tsur, Dekel. 2004. Cluster graph modification problems. Discrete Applied Mathematics, 144(1–2), 173–182.Google Scholar
Siebertz, Sebastian. 2017. Lossy kernels for connected distance-$r$ domination on nowhere dense graph classes. CoRR, abs/1707.09819.Google Scholar
Soleimanfallah, Arezou, and Yeo, Anders. 2011. A kernel of order 2k − c for Vertex Cover. Discrete Mathematics, 311(10–11), 892–895.Google Scholar
Telle, Jan Arne, and Villanger, Yngve. 2012. FPT algorithms for domination in biclique-free graphs. Pages 802–812 of: Proceedings of the 20th Annual European Symposium on Algorithms (ESA). Lecture Notes Computer Science, vol. 7501. Springer.Google Scholar
Thomassé, Stéphan. 2010. A quadratic kernel for feedback vertex set. ACM Transactions on Algorithms, 6(2), 32.1–32.8.Google Scholar
Tutte, William T. 1966. Connectivity in Graphs. Mathematical Expositions, No. 15. University of Toronto Press and Oxford University Press.Google Scholar
Tuza, Zsolt. 1994. Applications of the set-pair method in extremal hypergraph theory. Pages 479–514 of: Extremal Problems for Finite Sets (Visegrád, 1991). Bolyai Society Mathematical Studies, vol. 3. János Bolyai Mathematical Society.Google Scholar
Tuza, Zsolt. 1996. Applications of the set-pair method in extremal problems. II. Pages 459–490 of: Combinatorics, Paul Erdős is Eighty, Vol. 2 (Keszthely, 1993). Bolyai Society Mathematical Studies, vol. 2. János Bolyai Mathematical Society.Google Scholar
van Rooij, Johan M. M., Bodlaender, Hans L., and Rossmanith, Peter. 2009. Dynamic programming on tree decompositions using generalised fast subset convolution. Pages 566–577 of: Proceedings of the 17th Annual European Symposium on Algorithms (ESA). Lecture Notes in Computer Science, vol. 5757. Springer.Google Scholar
Wahlström, Magnus. 2013. Abusing the Tutte M=matrix: An algebraic instance compression for the K-set-cycle problem. Pages 341–352 of: Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science (STACS). Leibniz International Proceedings in Informatics (LIPIcs), vol. 20. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.Google Scholar
Wang, Jianxin, Ning, Dan, Feng, Qilong, and Chen, Jianer. 2010. An improved kernelization for P 2 -packing. Information Processing Letters, 110(5), 188–192.Google Scholar
Wang, Jianxin, Yang, Yongjie, Guo, Jiong, and Chen, Jianer. 2013. Planar graph vertex partition for linear problem kernels. Journal of Computer System Sciences, 79(5), 609–621.Google Scholar
Weller, Mathias. 2013. Aspects of preprocessing applied to combinatorial graph problems. Ph thesis, Universitatsverlag der TU Berlin.Google Scholar
Williams, Virginia Vassilevska. 2012. Multiplying matrices faster than Coppersmith-Winograd. Pages 887–898 of: Proceedings of the 44th Symposium on Theory of Computing Conference (STOC 2012). ACM.Google Scholar
Wu, Yu, Austrin, Per, Pitassi, Toniann, and Liu, David. 2014. Inapproximability of treewidth and related problems. Journal of Artificial Intelligence Research, 49, 569–600.Google Scholar
Xiao, Mingyu. 2014. A new linear kernel for undirected Planar Feedback Vertex Set: Smaller and simpler. Pages 288–298 of: Proceedings of the 10th International Conference on Algorithmic Aspects in Information and Managemen (AAIM). Lecture Notes in Computer Science, vol. 8546. Springer.Google Scholar
Xiao, Mingyu. 2017a. Linear kernels for separating a graph into components of bounded size. Journal of Computer System Sciences, 88, 260–270.Google Scholar
Xiao, Mingyu. 2017b. On a generalization of Nemhauser and Trotter’s local optimization theorem. Journal of Computer System Sciences, 84, 97–106.Google Scholar
Xiao, Mingyu, and Guo, Jiong. 2015. A quadratic vertex kernel for feedback arc set in bipartite tournaments. Algorithmica, 71(1), 87–97.Google Scholar
Xiao, Mingyu, and Kou, Shaowei. 2016. Almost induced matching: Linear kernels and parameterized algorithms. Pages 220–232 of: Proceedings of the 42nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG). Lecture Notes in Computer Science, vol. 9941. Springer.Google Scholar
Xiao, Mingyu, Kloks, Ton, and Poon, Sheung-Hung. 2013. New parameterized algorithms for the edge dominating set problem. Theoretical Computer Science, 511, 147–158.Google Scholar
Zippel, Richard. 1979. Probabilistic algorithms for sparse polynomials. Pages 216–226 of: Proceedings of the International Symposium on Symbolic and Algebraic Computation (EUROSAM). Lecture Notes in Computer Science, vol. 72. Springer.Google Scholar