×

Found 34 Documents (Results 1–34)

Algorithmic data science (Invited Talk). (English) Zbl 07559112

Niedermeier, Rolf (ed.) et al., 36th international symposium on theoretical aspects of computer science, STACS 2019, March 13–16, 2019, Berlin, Germany. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 126, Article 3, 15 p. (2019).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

GreedyMAX-type algorithms for the maximum independent set problem. (English) Zbl 1298.05298

Č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, 146-156 (2011).
MSC:  05C85 05C69
PDFBibTeX XMLCite
Full Text: DOI

An improved SAT algorithm in terms of formula length. (English) Zbl 1253.68166

Dehne, Frank (ed.) et al., Algorithms and data structures. 11th international symposium, WADS 2009, Banff, Canada, August 21–23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03366-7/pbk). Lecture Notes in Computer Science 5664, 144-155 (2009).
MSC:  68Q25 68T20
PDFBibTeX XMLCite
Full Text: DOI

Convex recoloring revisited: complexity and exact algorithms. (English) Zbl 1248.05201

Ngo, Hung Q. (ed.), Computing and combinatorics. 15th annual international conference, COCOON 2009, Niagara Falls, NY, USA, July 13–15, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02881-6/pbk). Lecture Notes in Computer Science 5609, 388-397 (2009).
PDFBibTeX XMLCite
Full Text: DOI

Iterative compression and exact algorithms. (English) Zbl 1173.68537

Ochmański, Edward (ed.) et al., Mathematical foundations of computer science 2008. 33rd international symposium, MFCS 2008, Toruń Poland, August 25–29, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85237-7/pbk). Lecture Notes in Computer Science 5162, 335-346 (2008).
MSC:  68Q25 68W05
PDFBibTeX XMLCite
Full Text: DOI

On independent sets and bicliques in graphs. (English) Zbl 1202.05096

Broersma, Hajo (ed.) et al., Graph-theoretic concepts in computer science. 34th international workshop, WG 2008, Durham, UK, June 30–July 2, 2008. Revised papers. Berlin: Springer (ISBN 978-3-540-92247-6/pbk). Lecture Notes in Computer Science 5344, 171-182 (2008).
MSC:  05C69 05C85 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Faster Steiner tree computation in polynomial-space. (English) Zbl 1158.68429

Halperin, Dan (ed.) et al., Algorithms – ESA 2008. 16th annual European symposium, Karlsruhe, Germany, September 15–17, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-87743-1/pbk). Lecture Notes in Computer Science 5193, 430-441 (2008).
MSC:  68R10 68Q25 90C35
PDFBibTeX XMLCite
Full Text: DOI

A moderately exponential time algorithm for full degree spanning tree. (English) Zbl 1139.68391

Agrawal, Manindra (ed.) et al., Theory and applications of models of computation. 5th international conference, TAMC 2008, Xi’an, China, April 25–29, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-79227-7/pbk). Lecture Notes in Computer Science 4978, 479-489 (2008).
MSC:  68R10 05C85 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software