Michael Mitzenmacher blogs about SODA, SOSA, ALENEX, and ANALCO:

Michael was PC co-chair of SOSA (, which I was skeptical about (shouldn't all the best algorithms be simple?), but the session I attended favorably impressed me. Here's an example, a simple algorithm for 2-approximating maximum genus oriented graph embedding ( greedily remove 2-edge paths while preserving connectivity. ≤ max genus ≤ 2⋅.

Sign in to participate in the conversation

A Mastodon instance for maths people. The kind of people who make \(\pi z^2 \times a\) jokes.

Use \( and \) for inline LaTeX, and \[ and \] for display mode.