×

Found 41 Documents (Results 1–41)

Proceedings of the 32nd annual ACM-SIAM symposium on discrete algorithms, SODA 2021, Alexandria, VA, USA, virtual, January 10–13, 2021. (English) Zbl 1466.68023

Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-61197-646-5/ebook). ix, 3041 p. (2021).
MSC:  68-06 68Wxx 00B25
PDFBibTeX XMLCite
Full Text: DOI

Chordless cycle packing is fixed-parameter tractable. (English) Zbl 07651210

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 71, 19 p. (2020).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

A tight lower bound for planar multiway cut with fixed number of terminals. (English) Zbl 1272.68147

Czumaj, Artur (ed.) et al., Automata, languages, and programming. 39th international colloquium, ICALP 2012, Warwick, UK, July 9–13, 2012. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-31593-0/pbk). Lecture Notes in Computer Science 7391, 677-688 (2012).
MSC:  68Q17 05C10 05C40
PDFBibTeX XMLCite
Full Text: DOI

What’s next? Future directions in parameterized complexity. (English) Zbl 1358.68143

Bodlaender, Hans L. (ed.) et al., The multivariate algorithmic revolution and beyond. Essays dedicated to Michael R. Fellows on the occasion of his 60th birthday. Berlin: Springer (ISBN 978-3-642-30890-1/pbk). Lecture Notes in Computer Science 7370, 469-496 (2012).
MSC:  68Q25 01A67
PDFBibTeX XMLCite
Full Text: DOI

Important separators and parameterized algorithms. (English) Zbl 1341.05212

Kolman, Petr (ed.) et al., Graph-theoretic concepts in computer science. 37th international workshop, WG 2011, Teplá Monastery, Czech Republic, June 21–24, 2011. Revised papers. Berlin: Springer (ISBN 978-3-642-25869-5/pbk). Lecture Notes in Computer Science 6986, 5-10 (2011).
PDFBibTeX XMLCite
Full Text: DOI

Tractable hypergraph properties for constraint satisfaction and conjunctive queries. (English) Zbl 1293.68171

Proceedings of the 42nd annual ACM symposium on theory of computing, STOC ’10. Cambridge, MA, USA, June 5–8, 2010. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-817-9). 735-744 (2010).
MSC:  68Q25 05C65
PDFBibTeX XMLCite
Full Text: DOI

Approximating fractional hypertree width. (English) Zbl 1423.05113

Mathieu, Claire (ed.), Proceedings of the 20th annual ACM-SIAM symposium on discrete algorithms, SODA 2009, New York, NY, USA, January 4–6, 2009. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 902-911 (2009).
PDFBibTeX XMLCite
Full Text: Link

Tractable structures for constraint satisfaction with truth tables. (English) Zbl 1236.68098

Albers, Susanne (ed.) et al., STACS 2009. 26th international symposium on theoretical aspects of computer science, Freiburg, Germany, February 26–28, 2009. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-09-5). LIPIcs – Leibniz International Proceedings in Informatics 3, 649-660, electronic only (2009).
MSC:  68Q17 05C65 05C83
PDFBibTeX XMLCite
Full Text: DOI Link

Precoloring extension on chordal graphs. (English) Zbl 1123.05041

Bondy, Adrian (ed.) et al., Graph theory in Paris. Proceedings of a conference, GT04, in memory of Claude Berge, Paris, France, July 2004. Basel: Birkhäuser (ISBN 3-7643-7228-1/hbk). Trends in Mathematics, 255-270 (2007).
MSC:  05C15 05C85
PDFBibTeX XMLCite

A parameterized view on matroid optimization problems. (English) Zbl 1223.05016

Bugliesi, Michele (ed.) et al., Automata, languages and programming. 33rd international colloquium, ICALP 2006, Venice, Italy, July 10–14, 2006. Proceedings, Part I. Berlin: Springer (ISBN 978-3-540-35904-3/pbk). Lecture Notes in Computer Science 4051, 655-666 (2006).
MSC:  05B35 68Q25 90C27
PDFBibTeX XMLCite
Full Text: DOI

Parameterized complexity of independence and domination on geometric graphs. (English) Zbl 1154.68431

Bodlaender, Hans L. (ed.) et al., Parameterized and exact computation. Second international workshop, IWPEC 2006, Zürich, Switzerland, September 13–15, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-39098-5/pbk). Lecture Notes in Computer Science 4169, 154-165 (2006).
MSC:  68Q25 05C62 05C69
PDFBibTeX XMLCite
Full Text: DOI

Minimum sum multicoloring on the edges of planar graphs and partial \(k\)-trees (extended abstract). (English) Zbl 1124.68374

Persiano, Giuseppe (ed.) et al., Approximation and online algorithms. Second international workshop, WAOA 2004, Bergen, Norway, September 14–16, 2004. Revised selected papers. Berlin: Springer (ISBN 3-540-24574-X/pbk). Lecture Notes in Computer Science 3351, 9-22 (2005).
MSC:  68Q25 05C85 68W25
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

Author

all top 5

Year of Publication

all top 3

Main Field

Software