×

Found 32 Documents (Results 1–32)

Exploiting \(c\)-closure in kernelization algorithms for graph problems. (English) Zbl 07651204

Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 65, 17 p. (2020).
MSC:  68Wxx
Full Text: DOI

On the complexity of broadcast domination and Multipacking in digraphs. (English) Zbl 1518.68263

Gąsieniec, Leszek (ed.) et al., Combinatorial algorithms. 31st international workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12126, 264-276 (2020).
Full Text: DOI

Dual parameterization of weighted coloring. (English) Zbl 1520.68106

Paul, Christophe (ed.) et al., 13th international symposium on parameterized and exact computation, IPEC 2018, August 22–24, 2018, Helsinki, Finland. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 115, Article 12, 14 p. (2019).
Full Text: DOI

Triangle packing in (sparse) tournaments: approximation and kernelization. (English) Zbl 1442.68160

Pruhs, Kirk (ed.) et al., 25th European symposium on algorithms, ESA 2017, Vienna, Austria, September 4–6, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 87, Article 14, 13 p. (2017).

Uniform kernelization complexity of hitting forbidden minors. (English) Zbl 1441.68107

Halldórsson, Magnús M. (ed.) et al., Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015. Proceedings. Part I. Berlin: Springer. Lect. Notes Comput. Sci. 9134, 629-641 (2015).
MSC:  68Q27 05C83

AND-compression of NP-complete problems: streamlined proof and minor observations. (English) Zbl 1341.68054

Cygan, Marek (ed.) et al., Parameterized and exact computation. 9th international symposium, IPEC 2014, Wroclaw, Poland, September 10–12, 2014. Revised selected papers. Cham: Springer (ISBN 978-3-319-13523-6/pbk; 978-3-319-13524-3/ebook). Lecture Notes in Computer Science 8894, 184-195 (2014).

Co-nondeterminism in compositions: a kernelization lower bound for a Ramsey-type problem. (English) Zbl 1423.68216

Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 114-122 (2012).

Weak compositions and their applications to polynomial lower bounds for kernelization. (English) Zbl 1421.68086

Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 104-113 (2012).
MSC:  68Q25 68Q17 68R10

Kernelization of packing problems. (English) Zbl 1421.68072

Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 68-81 (2012).

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field