×

Found 35 Documents (Results 1–35)

On the complexity of finding large odd induced subgraphs and odd colorings. (English) Zbl 07636196

Adler, Isolde (ed.) et al., Graph-theoretic concepts in computer science. 46th international workshop, WG 2020, Leeds, UK, June 24–26, 2020. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12301, 67-79 (2020).
MSC:  68R10
PDFBibTeX XMLCite
Full Text: DOI

Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization. (English) Zbl 1516.68063

Jansen, Bart M. P. (ed.) et al., 14th international symposium on parameterized and exact computation, IPEC 2019, Munich, Germany, September 11–13, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 148, Article 19, 15 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI

Parameterized complexity of finding a spanning tree with minimum reload cost diameter. (English) Zbl 1443.68119

Lokshtanov, Daniel (ed.) et al., 12th international symposium on parameterized and exact computation, IPEC 2017, Vienna, Austria, September 6–8, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 89, Article 3, 12 p. (2018).
MSC:  68R10 68Q17 68Q27
PDFBibTeX XMLCite
Full Text: DOI arXiv

On the complexity of finding internally vertex-disjoint long directed paths. (English) Zbl 1485.68171

Bender, Michael A. (ed.) et al., Latin 2018: theoretical informatics. 13th Latin American symposium, Buenos Aires, Argentina, April 16–19, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10807, 66-79 (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Uniquely restricted matchings and edge colorings. (English) Zbl 1483.05171

Bodlaender, Hans L. (ed.) et al., Graph-theoretic concepts in computer science. 43rd international workshop, WG 2017, Eindhoven, The Netherlands, June 21–23, 2017. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10520, 100-112 (2017).
PDFBibTeX XMLCite
Full Text: DOI arXiv

On the (parameterized) complexity of recognizing well-covered \((r,\ell)\)-graphs. (English) Zbl 1483.68247

Chan, T-H. Hubert (ed.) et al., Combinatorial optimization and applications. 10th international conference, COCOA 2016, Hong Kong, China, December 16–18, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10043, 423-437 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. (English) Zbl 1417.68068

Heggernes, Pinar (ed.), Graph-theoretic concepts in computer science. 42nd international workshop, WG 2016, Istanbul, Turkey, June 22–24, 2016. Revised selected papers. Berlin: Springer. Lect. Notes Comput. Sci. 9941, 195-206 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees. (English) Zbl 1480.92142

Dondi, Riccardo (ed.) et al., Algorithmic aspects in information and management. 11th international conference, AAIM 2016, Bergamo, Italy, July 18–20, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9778, 53-64 (2016).
MSC:  92D15 05C90
PDFBibTeX XMLCite
Full Text: DOI arXiv

On the complexity of computing the \(k\)-restricted edge-connectivity of a graph. (English) Zbl 1417.68071

Mayr, Ernst W. (ed.), Graph-theoretic concepts in computer science. 41st international workshop, WG 2015, Garching, Germany, June 17–19, 2015. Revised papers. Berlin: Springer. Lect. Notes Comput. Sci. 9224, 219-233 (2016).
PDFBibTeX XMLCite
Full Text: DOI

Parameterized algorithms for MIN-MAX multiway cut and List digraph homomorphism. (English) Zbl 1378.68084

Husfeldt, Thore (ed.) et al., 10th international symposium on parameterized and exact computation, IPEC 2015, Patras, Greece, September 16–18, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-92-7). LIPIcs – Leibniz International Proceedings in Informatics 43, 78-89 (2015).
MSC:  68Q25 05C85 68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

An FPT 2-approximation for tree-cut decomposition. (English) Zbl 1386.68222

Sanità, Laura (ed.) et al., Approximation and online algorithms. 13th international workshop, WAOA 2015, Patras, Greece, September 17–18, 2015. Revised selected papers. Cham: Springer (ISBN 978-3-319-28683-9/pbk; 978-3-319-28684-6/ebook). Lecture Notes in Computer Science 9499, 35-46 (2015).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Improved FPT algorithms for weighted independent set in bull-free graphs. (English) Zbl 1456.68066

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. Lect. Notes Comput. Sci. 8894, 282-293 (2014).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Hitting and harvesting pumpkins. (English) Zbl 1346.68111

Demetrescu, Camil (ed.) et al., Algorithms – ESA 2011. 19th annual European symposium, Saarbrücken, Germany, September 5–9, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23718-8/pbk). Lecture Notes in Computer Science 6942, 394-407 (2011).
PDFBibTeX XMLCite
Full Text: DOI arXiv

On approximating the \(d\)-girth of a graph. (English) Zbl 1298.68297

Černá, Ivana (ed.) et al., SOFSEM 2011: Theory and practice of computer science. 37th conference on current trends in theory and practice of computer science, Nový Smokovec, Slovakia, January 22–28, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-18380-5/pbk). Lecture Notes in Computer Science 6543, 467-481 (2011).
MSC:  68W25 05C35 68Q17
PDFBibTeX XMLCite
Full Text: DOI

Subexponential parameterized algorithms for bounded-degree connected subgraph problems on planar graphs. (English) Zbl 1267.05271

Koster, Arie (ed.) et al., DIMAP workshop on algorithmic graph theory. Extended abstracts from the workshop held at the University of Warwick, Coventry, UK, March 23–25, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 32, 59-66 (2009).
MSC:  05C85
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

Software