×

Found 51 Documents (Results 1–51)

Eulertigs: minimum plain text representation of \(k\)-mer sets without repetitions in linear time. (English) Zbl 07896498

Boucher, Christina (ed.) et al., 22nd international workshop on algorithms in bioinformatics, WABI 2022, Potsdam, Germany, September 5–7, 2022. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 242, Article 2, 21 p. (2022).
MSC:  92D10 92-08 05C20
Full Text: DOI

Parameterized approximation algorithms for bidirected Steiner network problems. (English) Zbl 1522.68395

Azar, Yossi (ed.) et al., 26th annual European symposium on algorithms, ESA 2018, August 20–22, 2018, Helsinki, Finland. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 112, Article 20, 16 p. (2018).

Minimum clique cover in claw-free perfect graphs and the weak Edmonds-Johnson property. (English) Zbl 1346.05208

Goemans, Michel (ed.) et al., Integer programming and combinatorial optimization. 16th international conference, IPCO 2013, Valparaíso, Chile, March 18–20, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-36693-2/pbk). Lecture Notes in Computer Science 7801, 86-97 (2013).
Full Text: DOI

Matrices in the theory of signed simple graphs. (English) Zbl 1231.05120

Acharya, B. D. (ed.) et al., Advances in discrete mathematics and applications: Mysore, 2008. Proceedings of the international conference on discrete mathematics (ICDM 2008), Mysore, India, June 6–10, 2008. Mysore: Ramanujan Mathematical Society (ISBN 978-93-80416-03-8/hbk). Ramanujan Mathematical Society Lecture Notes Series 13, 207-229 (2010).

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software