×

zbMATH — the first resource for mathematics

Found 203 Documents (Results 1–100)

100
MathJax
Du, Ding-Zhu (ed.) et al., Computing and combinatorics. 25th international conference, COCOON 2019, Xi’an, China, July 29–31, 2019. Proceedings. Cham: Springer (ISBN 978-3-030-26175-7/pbk; 978-3-030-26176-4/ebook). Lecture Notes in Computer Science 11653, 437-444 (2019).
MSC:  68Rxx
PDF BibTeX XML Cite
Full Text: DOI
Sirakov, Boyan (ed.) et al., Proceedings of the international congress of mathematicians 2018, ICM 2018, Rio de Janeiro, Brazil, August 1–9, 2018. Volume III. Invited lectures. Hackensack, NJ: World Scientific; Rio de Janeiro: Sociedade Brasileira de Matemática (SBM) (ISBN 978-981-327-292-7/hbk; 978-981-327-287-3/hbk-set; 978-981-3272-89-7/ebook-set). 1713-1731 (2018).
Reviewer: K. P. Hart (Delft)
PDF BibTeX XML Cite
Full Text: DOI
Drmota, Michael (ed.) et al., Extended abstracts of the ninth European conference on combinatorics, graph theory and applications, EuroComb 2017, Vienna, Austria, August 28 – September 1, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 61, 163-168 (2017).
MSC:  05C70 05C83
PDF BibTeX XML Cite
Full Text: DOI
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).
PDF BibTeX XML Cite
Full Text: DOI
Dürr, Christoph (ed.) et al., STACS 2012. 29th international symposium on theoretical aspects of computer science, Paris, France, February 29th – March 3rd, 2012. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-35-4). LIPIcs – Leibniz International Proceedings in Informatics 14, 206-217, electronic only (2012).
PDF BibTeX XML Cite
Full Text: DOI
Bonomo, Flavia (ed.) et al., LAGOS’11 – VI Latin-American algorithms, graphs, and optimization symposium. Extended abstracts from the symposium, Bariloche, Argentina, March 28–April 1, 2011. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 37, 333-338 (2011).
MSC:  05C70
PDF BibTeX XML Cite
Full Text: DOI
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, 11-22 (2011).
MSC:  05C69 05C70 68Q17
PDF BibTeX XML Cite
Full Text: DOI
Charikar, Moses (ed.), Proceedings of the 21st annual ACM-SIAM symposium on discrete algorithms, SODA 2010, Austin, TX, USA, January 17–19, 2010. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-0-89871-698-6/CD-ROM). 365-378 (2010).
PDF BibTeX XML Cite
Haouari, M. (ed.) et al., ISCO 2010. International symposium on combinatorial optimization. Papers based on the presentations at the symposium, Hammamet, Tunesia, March 24–26, 2010. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 36, 287-294 (2010).
MSC:  52C40 05B35
PDF BibTeX XML Cite
Full Text: DOI
Proceedings of the 41st annual ACM symposium on theory of computing, STOC ’09. Bethesda, MD, USA, May 31 – June 2, 2009. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-613-7). 225-234 (2009).
MSC:  05C70 05C85 68W25
PDF BibTeX XML Cite
Full Text: DOI
Miller, Mirka (ed.) et al., Proceedings of the 19th international workshop on combinatorial algorithms, IWOCA 2008, Nagoya, Japan, September 12–15, 2008. London: College Publications (ISBN 978-1-904987-74-1/pbk). Texts in Algorithmics 12, 63-74 (2009).
PDF BibTeX XML Cite

Filter Results by …

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