×

zbMATH — the first resource for mathematics

Found 64 Documents (Results 1–64)

100
MathJax
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 (ISBN 978-3-319-68704-9/pbk; 978-3-319-68705-6/ebook). Lecture Notes in Computer Science 10520, 88-99 (2017).
MSC:  68R10
PDF BibTeX XML Cite
Full Text: DOI
Bousquet-Mélou, Mireille (ed.) et al., Proceeding of the 25th international conference on probabilistic, combinatorial and asymptotic methods in the analysis of algorithms, AofA’14, UPMC-Jussieu, Paris, France, June 16–20, 2014. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science (DMTCS-HAL). Proceedings BA, 97-108 (2014).
MSC:  68P05
PDF BibTeX XML Cite
Full Text: Link
Drmota, Michael (ed.) et al., Proceeding of the 21st international meeting on probabilistic, combinatorial, and asymptotic methods in the analysis of algorithms (AofA’10), Vienna, Austria, June 28 – July 2, 2010. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science. Proceedings, 261-276 (2010).
MSC:  68P05
PDF BibTeX XML Cite
Full Text: Link
Aggarwal, Alok (ed.) et al., Algorithms and computation. 10th international symposium, ISAAC’ 99, Chennai, India, December 16-18, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1741, 347-356 (1999).
PDF BibTeX XML Cite
Hochbaum, Dorit (ed.) et al., Randomization, approximation, and combinatorial optimization. Algorithms and techniques. 3rd international workshop on randomization and approximation techniques in computer science, and 2nd international workshop on approximation algorithms for combinatorial optimization problems RANDOM-APPROX ’99. Berkeley, CA, USA, August 8-11, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1671, 73-84 (1999).
MSC:  05C15
PDF BibTeX XML Cite
Graham, Ronald L. (ed.) et al., Contemporary trends in discrete mathematics. From DIMACS and DIMATIA to the future. Proceedings of the DIMATIA-DIMACS conference, Štiřín Castle, Czech Republic, May 19–25, 1997. Providence, RI: American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 49, 143-158 (1999).
MSC:  05C85 03B15 90C39 05C70 68R10
PDF BibTeX XML Cite
Hromkovič, Juraj (ed.) et al., Graph-theoretic concepts in computer science. 24th international workshop, WG ’98, Smolenice Castle, Slovak Republic, June 18–20, 1998. Proceecdings. Berlin: Springer. Lect. Notes Comput. Sci. 1517, 100-113 (1998).
PDF BibTeX XML Cite
Jiang, Tao (ed.) et al., Computing and combinatorics. 3rd annual international conference, COCOON ’97. Shanghai, China. August 20–22, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1276, 212-221 (1997).
Reviewer: H.Müller (Jena)
PDF BibTeX XML Cite
Karlsson, Rolf (ed.) et al., Algorithm theory – SWAT ’96. 5th Scandinavian workshop on algorithm theory, Reykjavík, Iceland, July 3-5, 1996. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1097, 161-172 (1996).
MSC:  05C85 68R10 68Q25 05C05 05C70 03B15
PDF BibTeX XML Cite
Combinatorics, graph theory, and computing, Proc. 22nd Southeast Conf., Baton Rouge/LA (USA) 1991, Congr. Numerantium 85, 219-234 (1991).
MSC:  05C85 68Q25 68R10
PDF BibTeX XML Cite

Filter Results by …

Document Type
Reviewing State
all top 5
Author
all top 5
Year of Publication
all top 3
Classification
Software