Researchers in this area have established important connections with mainstream areas of pure and applied mathematics, and research techniques are drawn from a range of fields, including algebra, topology, geometry, probability, analysis, and logic.

Upcoming Related Conferences

Upcoming Related Conferences

Symposium on Simplicity in Algorithms (SOSA20)

January 6 - 7, 2020 Salt Lake City, Utah, U.S. More Information

By Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, and Kunal Talwar SIAM Journal on Computing, Volume 48, Issue 3, Page 1120-1145, January 2019. We prove that any graph excluding $K_r$ as a minor can be partitioned into clusters of diameter...

By Jean-Daniel Boissonnat, Mael Rouxel-Labbé, and Mathijs H. M. J. Wintraecken SIAM Journal on Computing, Volume 48, Issue 3, Page 1046-1097, January 2019. The construction of anisotropic triangulations is desirable for various applications, such as the numerical solving of partial...

By Zoltán Füredi, Tao Jiang, Alexandr Kostochka, Dhruv Mubayi, and Jacques Verstraëte SIAM Journal on Discrete Mathematics, Volume 33, Issue 2, Page 862-873, January 2019. An $r$-uniform hypergraph is a tight $r$-tree if its edges can be ordered so that every...

By Hunter Spink SIAM Journal on Discrete Mathematics, Volume 33, Issue 2, Page 910-932, January 2019. In 1979, Shearer and Kleitman conjectured the existence of $\lfloor n/2 \rfloor+1$ orthogonal chain decompositions of...

By Therese Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, and Jeffrey Shallit SIAM Journal on Discrete Mathematics, Volume 33, Issue 2, Page 845-861, January 2019. A rollercoaster is a sequence of real numbers for which every maximal contiguous subsequence---increasing or decreasing---has...

By T. Karthick and Frédéric Maffray SIAM Journal on Discrete Mathematics, Volume 33, Issue 2, Page 874-909, January 2019. We elucidate the structure of $(P_6,C_4)$-free graphs by showing that every such graph either has a...

By Jess Banks, Robert Kleinberg, and Cristopher Moore SIAM Journal on Computing, Volume 48, Issue 3, Page 1098-1119, January 2019. We derive upper and lower bounds on the degree $d$ for which the Lovász $\vartheta$ function, or...

By Tomasz Schoen and Ilya D. Shkredov SIAM Journal on Discrete Mathematics, Volume 33, Issue 2, Page 837-844, January 2019. We prove that if $A\subseteq [N]$ does not contain any solution to the equation $x_1+\dots+x_k=y_1+\dots+y_k$ with...

By Hubie Chen, Matt Valeriote, and Yuichi Yoshida SIAM Journal on Computing, Volume 48, Issue 3, Page 1022-1045, January 2019. For each finite relational structure $A$, let $CSP(A)$ denote the CSP instances whose constraint relations are taken...

By Heng Guo and Mark Jerrum SIAM Journal on Computing, Volume 48, Issue 3, Page 964-978, January 2019. We give a fully polynomial-time randomized approximation scheme (FPRAS) for the all-terminal network reliability problem, which is...

By Dieter van Melkebeek and Gautam Prakriya SIAM Journal on Computing, Volume 48, Issue 3, Page 979-1021, January 2019. We study the possibility of deterministic and randomness-efficient isolation in space-bounded models of computation: Can one efficiently...

By Fedor V. Fomin, Petr Golovach, Fahad Panolan, and Saket Saurabh SIAM Journal on Discrete Mathematics, Volume 33, Issue 2, Page 795-836, January 2019. In the Edge Editing to Connected $f$-Degree Graph problem we are given a graph $G$, an...

By Boris Bukh and Xavier Goaoc SIAM Journal on Discrete Mathematics, Volume 33, Issue 2, Page 784-794, January 2019. We study how a single value of the shatter function of a set system restricts its...

By Gábor Ivanyos and Youming Qiao SIAM Journal on Computing, Volume 48, Issue 3, Page 926-963, January 2019. We consider two basic algorithmic problems concerning tuples of (skew-)symmetric matrices. The first problem asks us to...

By Mahya Ghandehari and Jeannette Janssen SIAM Journal on Discrete Mathematics, Volume 33, Issue 2, Page 712-730, January 2019. A square symmetric matrix is a Robinson similarity matrix if entries in its rows and columns...

By Hirotada Kobayashi, François Le Gall, and Harumichi Nishimura SIAM Journal on Computing, Volume 48, Issue 3, Page 865-902, January 2019. This paper investigates the role of interaction and coins in quantum Arthur--Merlin games (also called public-coin quantum...

By Yury Polyanskiy SIAM Journal on Discrete Mathematics, Volume 33, Issue 2, Page 731-754, January 2019. Consider the linear space of functions on the binary hypercube and the linear operator $S_\delta$ acting...

By Amitabh Basu, Santanu S. Dey, and Joseph Paat SIAM Journal on Discrete Mathematics, Volume 33, Issue 2, Page 755-783, January 2019. We explore the lifting question in the context of cut-generating functions. Most of the prior literature...

By Srinivasan Arunachalam, Jop Briët, and Carlos Palazuelos SIAM Journal on Computing, Volume 48, Issue 3, Page 903-925, January 2019. We prove a characterization of $t$-query quantum algorithms in terms of the unit ball of a space...

By Boaz Barak, Samuel Hopkins, Jonathan Kelner, Pravesh K. Kothari, Ankur Moitra, and Aaron Potechin SIAM Journal on Computing, Volume 48, Issue 2, Page 687-735, January 2019. We prove that with high probability over the choice of a random graph $G$ from the Erdös--Rényi...

By Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, and Kunal Talwar SIAM Journal on Computing, Volume 48, Issue 3, Page 1120-1145, January 2019. We prove that any graph excluding $K_r$ as a minor can be partitioned into clusters of diameter...

By Jean-Daniel Boissonnat, Mael Rouxel-Labbé, and Mathijs H. M. J. Wintraecken SIAM Journal on Computing, Volume 48, Issue 3, Page 1046-1097, January 2019. The construction of anisotropic triangulations is desirable for various applications, such as the numerical solving of partial...

By Zoltán Füredi, Tao Jiang, Alexandr Kostochka, Dhruv Mubayi, and Jacques Verstraëte SIAM Journal on Discrete Mathematics, Volume 33, Issue 2, Page 862-873, January 2019. An $r$-uniform hypergraph is a tight $r$-tree if its edges can be ordered so that every...

By Hunter Spink SIAM Journal on Discrete Mathematics, Volume 33, Issue 2, Page 910-932, January 2019. In 1979, Shearer and Kleitman conjectured the existence of $\lfloor n/2 \rfloor+1$ orthogonal chain decompositions of...

By Therese Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, and Jeffrey Shallit SIAM Journal on Discrete Mathematics, Volume 33, Issue 2, Page 845-861, January 2019. A rollercoaster is a sequence of real numbers for which every maximal contiguous subsequence---increasing or decreasing---has...

By T. Karthick and Frédéric Maffray SIAM Journal on Discrete Mathematics, Volume 33, Issue 2, Page 874-909, January 2019. We elucidate the structure of $(P_6,C_4)$-free graphs by showing that every such graph either has a...

By Jess Banks, Robert Kleinberg, and Cristopher Moore SIAM Journal on Computing, Volume 48, Issue 3, Page 1098-1119, January 2019. We derive upper and lower bounds on the degree $d$ for which the Lovász $\vartheta$ function, or...

By Tomasz Schoen and Ilya D. Shkredov SIAM Journal on Discrete Mathematics, Volume 33, Issue 2, Page 837-844, January 2019. We prove that if $A\subseteq [N]$ does not contain any solution to the equation $x_1+\dots+x_k=y_1+\dots+y_k$ with...

By Hubie Chen, Matt Valeriote, and Yuichi Yoshida SIAM Journal on Computing, Volume 48, Issue 3, Page 1022-1045, January 2019. For each finite relational structure $A$, let $CSP(A)$ denote the CSP instances whose constraint relations are taken...

By Heng Guo and Mark Jerrum SIAM Journal on Computing, Volume 48, Issue 3, Page 964-978, January 2019. We give a fully polynomial-time randomized approximation scheme (FPRAS) for the all-terminal network reliability problem, which is...

By Dieter van Melkebeek and Gautam Prakriya SIAM Journal on Computing, Volume 48, Issue 3, Page 979-1021, January 2019. We study the possibility of deterministic and randomness-efficient isolation in space-bounded models of computation: Can one efficiently...

By Fedor V. Fomin, Petr Golovach, Fahad Panolan, and Saket Saurabh SIAM Journal on Discrete Mathematics, Volume 33, Issue 2, Page 795-836, January 2019. In the Edge Editing to Connected $f$-Degree Graph problem we are given a graph $G$, an...

By Boris Bukh and Xavier Goaoc SIAM Journal on Discrete Mathematics, Volume 33, Issue 2, Page 784-794, January 2019. We study how a single value of the shatter function of a set system restricts its...

By Gábor Ivanyos and Youming Qiao SIAM Journal on Computing, Volume 48, Issue 3, Page 926-963, January 2019. We consider two basic algorithmic problems concerning tuples of (skew-)symmetric matrices. The first problem asks us to...

By Mahya Ghandehari and Jeannette Janssen SIAM Journal on Discrete Mathematics, Volume 33, Issue 2, Page 712-730, January 2019. A square symmetric matrix is a Robinson similarity matrix if entries in its rows and columns...

By Hirotada Kobayashi, François Le Gall, and Harumichi Nishimura SIAM Journal on Computing, Volume 48, Issue 3, Page 865-902, January 2019. This paper investigates the role of interaction and coins in quantum Arthur--Merlin games (also called public-coin quantum...

By Yury Polyanskiy SIAM Journal on Discrete Mathematics, Volume 33, Issue 2, Page 731-754, January 2019. Consider the linear space of functions on the binary hypercube and the linear operator $S_\delta$ acting...

By Amitabh Basu, Santanu S. Dey, and Joseph Paat SIAM Journal on Discrete Mathematics, Volume 33, Issue 2, Page 755-783, January 2019. We explore the lifting question in the context of cut-generating functions. Most of the prior literature...

By Srinivasan Arunachalam, Jop Briët, and Carlos Palazuelos SIAM Journal on Computing, Volume 48, Issue 3, Page 903-925, January 2019. We prove a characterization of $t$-query quantum algorithms in terms of the unit ball of a space...

By Boaz Barak, Samuel Hopkins, Jonathan Kelner, Pravesh K. Kothari, Ankur Moitra, and Aaron Potechin SIAM Journal on Computing, Volume 48, Issue 2, Page 687-735, January 2019. We prove that with high probability over the choice of a random graph $G$ from the Erdös--Rényi...

By Nikhil Bansal, Daniel Dadush, and Shashwat Garg SIAM Journal on Computing, Volume 48, Issue 2, Page 534-553, January 2019. We consider the problem of finding a low discrepancy coloring for sparse set systems where each element...

By Charilaos Efthymiou, Thomas P. Hayes, Daniel Štefankovič, Eric Vigoda, and Yitong Yin SIAM Journal on Computing, Volume 48, Issue 2, Page 581-643, January 2019. We study the hard-core (gas) model defined on independent sets of an input graph where the independent...

By Shiteng Chen and Periklis A. Papakonstantinou SIAM Journal on Computing, Volume 48, Issue 2, Page 668-686, January 2019. We show that every circuit with ${AND},{OR},{NOT}$, and ${MOD}_m$ gates, $m\in\mathbb{Z}^+$, of polynomial size and depth...

By W. T. Gowers and Emanuele Viola SIAM Journal on Computing, Volume 48, Issue 2, Page 554-580, January 2019. Let $G$ be the special linear group ${SL}(2,q)$. We show that if $(a_1,\ldots,a_t)$ and $(b_1,\ldots,b_t)$ are...

By Mathias Bæk Tejs Knudsen SIAM Journal on Computing, Volume 48, Issue 2, Page 736-741, January 2019. We consider the hash function $h(x) = ((ax+b)mod p)mod n$ where $a,b$ are chosen uniformly at random...

By Zachary Friggstad, Mohsen Rezapour, and Mohammad R. Salavatipour SIAM Journal on Computing, Volume 48, Issue 2, Page 452-480, January 2019. The most well-known and ubiquitous clustering problem encountered in nearly every branch of science is undoubtedly $k$-means:...

By Vincent Cohen-Addad, Philip N. Klein, and Claire Mathieu SIAM Journal on Computing, Volume 48, Issue 2, Page 644-667, January 2019. We give the first polynomial-time approximation schemes (PTASs) for the following problems: (1) uniform facility location in...

By Zihan Tan and Liwei Zeng SIAM Journal on Discrete Mathematics, Volume 33, Issue 2, Page 694-711, January 2019. We study the following geometry problem: given a $2^n-1$ dimensional vector $\pi=\{\pi_S\}_{S\subseteq [n], S\ne \emptyset}$, is...

By Ilias Diakonikolas, Gautam Kamath, Daniel Kane, Jerry Li, Ankur Moitra, and Alistair Stewart SIAM Journal on Computing, Volume 48, Issue 2, Page 742-864, January 2019. We study high-dimensional distribution learning in an agnostic setting where an adversary is allowed to arbitrarily corrupt...

By Yijia Chen and Bingkai Lin SIAM Journal on Computing, Volume 48, Issue 2, Page 513-533, January 2019. A set $D$ of vertices of a graph $G$ is a dominating set if every vertex of...

By Karl Bringmann, Fabrizio Grandoni, Barna Saha, and Virginia Vassilevska Williams SIAM Journal on Computing, Volume 48, Issue 2, Page 481-512, January 2019. It is a major open problem whether the $(\min,+)$-product of two $n\times n$ matrices has a truly...

By Irit Dinur, Or Meir, and Swastik Kopparty SIAM Journal on Computing, Volume 48, Issue 2, Page 451-451, January 2019. This special section comprises eleven fully refereed papers whose extended abstracts were presented at the 57th Annual...

By Nir Weinberger and Ofer Shayevitz SIAM Journal on Discrete Mathematics, Volume 33, Issue 2, Page 665-693, January 2019. A Boolean function $g$ is said to be an optimal predictor for another Boolean function $f$...

By Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, and Saket Saurabh SIAM Journal on Computing, Volume 48, Issue 2, Page 417-450, January 2019. In the classic Minimum Bisection problem we are given as input an undirected graph $G$ and an...

By Václav Rozhoň SIAM Journal on Discrete Mathematics, Volume 33, Issue 2, Page 643-664, January 2019. A famous conjecture of Erd\Hos and Sós states that every graph with average degree more than...

By Jing Chen, Bo Li, and Yingkai Li SIAM Journal on Computing, Volume 48, Issue 2, Page 373-416, January 2019. The dispersion problem has been widely studied in computational geometry and facility location and is closely related...

By Noga Alon and Nadav Sherman SIAM Journal on Discrete Mathematics, Volume 33, Issue 2, Page 629-642, January 2019. We prove that the minimum number of vertices of a hypergraph that contains every $d$-uniform hypergraph...

By Daniel W. Cranston SIAM Journal on Discrete Mathematics, Volume 33, Issue 2, Page 614-628, January 2019. An acyclic edge-coloring of a graph $G$ is a proper edge-coloring of $G$ such that the...

By Alessio Conte, Roberto Grossi, Andrea Marino, and Luca Versari SIAM Journal on Discrete Mathematics, Volume 33, Issue 2, Page 587-613, January 2019. Algorithms for listing the subgraphs satisfying a given property (e.g., being a clique, a cut, a...

By Flavio Chierichetti, Ravi Kumar, Alessandro Panconesi, and Erisa Terolli SIAM Journal on Computing, Volume 48, Issue 2, Page 350-372, January 2019. Given a notion of pairwise similarity between objects, locality sensitive hashing (LSH) aims to construct a hash...

By Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, and Daniel Štefankovič SIAM Journal on Computing, Volume 48, Issue 2, Page 279-349, January 2019. Approximate counting via correlation decay is the core algorithmic technique used in the sharp delineation of the...

By Jaehoon Kim, Younjin Kim, and Hong Liu SIAM Journal on Discrete Mathematics, Volume 33, Issue 1, Page 564-586, January 2019. Given graphs $H_1,\ldots, H_k$, a graph $G$ is $(H_1,\ldots, H_k)$-free if there is a $k$-edge-coloring $\phi:E(G)\rightarrow...

By Arnold Filtser SIAM Journal on Computing, Volume 48, Issue 2, Page 249-278, January 2019. In the Steiner point removal problem, we are given a weighted graph $G=(V,E)$ and a set of...

By Ittai Abraham and Ofer Neiman SIAM Journal on Computing, Volume 48, Issue 2, Page 227-248, January 2019. We prove that any weighted graph $G=(V,E,w)$ with $n$ points and $m$ edges has a spanning tree...

By Roee David, Karthik C. S., and Bundit Laekhanukit SIAM Journal on Discrete Mathematics, Volume 33, Issue 1, Page 509-527, January 2019. Every graph $G$ can be represented by a collection of equi-radii spheres in a $d$-dimensional metric...

By Michael Anastos and Alan Frieze SIAM Journal on Discrete Mathematics, Volume 33, Issue 1, Page 528-545, January 2019. We consider the existence of patterned Hamilton cycles in randomly colored random graphs. Given a string...

By David G. Harris SIAM Journal on Discrete Mathematics, Volume 33, Issue 1, Page 546-563, January 2019. A variety of powerful extremal results have been shown for the chromatic number of triangle-free graphs....

By Béla Csaba and Judit Nagy-György SIAM Journal on Discrete Mathematics, Volume 33, Issue 1, Page 474-508, January 2019. Let $H$ and $G$ be graphs on $n$ vertices, where $n$ is sufficiently large. We prove...

By Anastasios Sidiropoulos, Mihai Badoiu, Kedar Dhamdhere, Anupam Gupta, Piotr Indyk, Yuri Rabinovich, Harald Racke, and R. Ravi SIAM Journal on Discrete Mathematics, Volume 33, Issue 1, Page 454-473, January 2019. We present several approximation algorithms for the problem of embedding metric spaces into a line, and...

By Nathan Keller and Noam Lifshitz SIAM Journal on Discrete Mathematics, Volume 33, Issue 1, Page 398-401, January 2019. A family ${\cal F}$ of graphs on a fixed set of $n$ vertices is called triangle-intersecting...

By Giacomo Micheli and Violetta Weger SIAM Journal on Discrete Mathematics, Volume 33, Issue 1, Page 425-437, January 2019. Let $n$ and $m$ be positive integers such that $n

By Carlos Hoppen, Roberto F. Parente, and Cristiane M. Sato SIAM Journal on Discrete Mathematics, Volume 33, Issue 1, Page 438-453, January 2019. We study the problem of packing arborescences in the random digraph $\mathcal D(n,p)$, where each possible...

By Ishay Haviv SIAM Journal on Discrete Mathematics, Volume 33, Issue 1, Page 402-424, January 2019. A set of integers is sum-free if it contains no solution to the equation $x+y=z$. We...

By András Gyárfás SIAM Journal on Discrete Mathematics, Volume 33, Issue 1, Page 383-392, January 2019. A Berge-K_4 in a triple system is a configuration with four vertices $v_1,v_2,v_3,v_4$ and six distinct...

By Rotem Arnon-Friedman, Renato Renner, and Thomas Vidick SIAM Journal on Computing, Volume 48, Issue 1, Page 181-225, January 2019. Device-independent security is the gold standard for quantum cryptography: not only is security based entirely on the...

By Mrinal Kumar and Ramprasad Saptharishi SIAM Journal on Computing, Volume 48, Issue 1, Page 144-180, January 2019. Surprising and beautiful depth reduction results show that sufficiently strong lower bounds for bounded-depth arithmetic circuits imply...

By Nick Brettell, Rutger Campbell, Deborah Chun, Kevin Grace, and Geoff Whittle SIAM Journal on Discrete Mathematics, Volume 33, Issue 1, Page 358-372, January 2019. We consider matroids with the property that every subset of the ground set of size $t$...

By Peter Nelson and Jorn van der Pol SIAM Journal on Discrete Mathematics, Volume 33, Issue 1, Page 373-382, January 2019. A biased graph is a graph $G$, together with a distinguished subset $\mathcal{B}$ of its cycles,...

By Daniel Weißauer SIAM Journal on Discrete Mathematics, Volume 33, Issue 1, Page 346-357, January 2019. A $k$-block in a graph $G$ is a maximal set of at least $k$ vertices no...

By Shiping Liu, Florentin Münch, and Norbert Peyerimhoff SIAM Journal on Discrete Mathematics, Volume 33, Issue 1, Page 257-305, January 2019. We study the eigenvalues of the connection Laplacian on a graph with an orthogonal group or...

By Carolina Medina, Jorge Ramírez-Alfonsín, and Gelasio Salazar SIAM Journal on Discrete Mathematics, Volume 33, Issue 1, Page 306-326, January 2019. Let $D$ be a knot diagram, and let ${\mathcal D}$ denote the set of diagrams that...

By Fedor V. Fomin, Petteri Kaski, Daniel Lokshtanov, Fahad Panolan, and Saket Saurabh SIAM Journal on Discrete Mathematics, Volume 33, Issue 1, Page 327-345, January 2019. In the Steiner Tree problem, we are given as input a connected $n$-vertex graph with edge...

By Yi-Jun Chang, Tsvi Kopelowitz, and Seth Pettie SIAM Journal on Computing, Volume 48, Issue 1, Page 122-143, January 2019. Over the past 30 years numerous algorithms have been designed for symmetry breaking problems in the LOCAL...

By Deng Tang, Selçuk Kavut, Bimal Mandal, and Subhamoy Maitra SIAM Journal on Discrete Mathematics, Volume 33, Issue 1, Page 238-256, January 2019. Very recently, a class of cryptographically significant Boolean functions were constructed by Tang and Maitra [IEEE...

By Hao Huang and Jie Ma SIAM Journal on Discrete Mathematics, Volume 33, Issue 1, Page 230-237, January 2019. A tight $k$-uniform $\ell$-cycle, denoted by $TC_\ell^k$, is a $k$-uniform hypergraph whose vertex set is $v_0,...

By Yeow Meng Chee, Fei Gao, Han Mao Kiah, Alan Chi Hung Ling, Hui Zhang, and Xiande Zhang SIAM Journal on Discrete Mathematics, Volume 33, Issue 1, Page 209-229, January 2019. We demonstrate that certain Johnson-type bounds are asymptotically exact for a variety of classes of codes,...

By G. O. Mota SIAM Journal on Discrete Mathematics, Volume 33, Issue 1, Page 197-208, January 2019. We estimate the 3-color bipartite Ramsey number for balanced bipartite graphs $H$ with small bandwidth and...

By Neil J. Y. Fan, Peter L. Guo, and Sophie C. C. Sun SIAM Journal on Discrete Mathematics, Volume 33, Issue 1, Page 189-196, January 2019. Barely set-valued tableaux were introduced by Reiner, Tenner, and Yong in their study of the probability...

By James Oxley SIAM Journal on Discrete Mathematics, Volume 33, Issue 1, Page 138-152, January 2019. Adding elements to matroids can be fraught with difficulty. In the Vámos matroid $V_8$, there are...

By Stephen Alstrup, Haim Kaplan, Mikkel Thorup, and Uri Zwick SIAM Journal on Discrete Mathematics, Volume 33, Issue 1, Page 116-137, January 2019. We describe a way of assigning labels to the vertices of any undirected graph on up...

By Robert Hancock, Katherine Staden, and Andrew Treglown SIAM Journal on Discrete Mathematics, Volume 33, Issue 1, Page 153-188, January 2019. Many important problems in combinatorics and other related areas can be phrased in the language of...

By Thomas Kalinowski, Nina Kamčev, and Benny Sudakov SIAM Journal on Discrete Mathematics, Volume 33, Issue 1, Page 95-115, January 2019. A subset $S$ of initially infected vertices of a graph $G$ is called zero forcing if...

By Sungjin Im, Nathaniel Kell, Janardhan Kulkarni, and Debmalya Panigrahi SIAM Journal on Computing, Volume 48, Issue 1, Page 93-121, January 2019. Modern data centers face a key challenge of effectively serving user requests that arrive online. Such requests...

By Suryajith Chillara, Nutan Limaye, and Srikanth Srinivasan SIAM Journal on Computing, Volume 48, Issue 1, Page 70-92, January 2019. The complexity of Iterated Matrix Multiplication (IMM) is a central theme in Computational Complexity theory, as the...

By Robert Hancock SIAM Journal on Discrete Mathematics, Volume 33, Issue 1, Page 68-94, January 2019. Given an integer-valued matrix $A$ of dimension $\ell \times k$ and an integer-valued vector $b$ of...

By Kevin Grace and Stefan H. M. van Zwam SIAM Journal on Discrete Mathematics, Volume 33, Issue 1, Page 26-67, January 2019. The classes of even-cycle matroids, even-cycle matroids with a blocking pair, and even-cut matroids each have...

By Yi-Jun Chang and Seth Pettie SIAM Journal on Computing, Volume 48, Issue 1, Page 33-69, January 2019. The celebrated time hierarchy theorem for Turing machines states, informally, that more problems can be solved given...

By Hagit Attiya, Armando Castan͂eda, Maurice Herlihy, and Ami Paz SIAM Journal on Computing, Volume 48, Issue 1, Page 1-32, January 2019. The $M(n)$-renaming task requires $n+1$ processes, each starting with a unique input name (from an arbitrary large...

By Sean Kafer, Kanstantsin Pashkovich, and Laura Sanità SIAM Journal on Discrete Mathematics, Volume 33, Issue 1, Page 1-25, January 2019. The combinatorial diameter of a polytope $P$ is the maximum value of a shortest path between...

The JPBM Communications Award is given annually to reward and encourage communicators who, on a sustained basis, bring mathematical ideas and information to non-mathematical audiences. The prize may be awarded in two categories: For Public Outreach and For Expository and Popular Books. Nominations can be submitted via the AMS website.

Established in 1959, the prize honors John von Neumann, a founder of modern computing. The lecture is awarded annually for distinguished contributions to applied mathematics and for the effective communication of these ideas to the community.

The prize, established in 1985 and originally intended to be awarded periodically, is now awarded annually for contributions to the advancement of applied mathematics on the national or international level.

Established in 2007, the prize honors Dénes König, a pioneer of discrete mathematics still influencing the field. It is awarded for outstanding research by an individual in their early career, based on publication in peer-reviewed journals.

This prize is intended to emphasize applications of combinatorics and is funded by the estate of Stella Pólya in memory of her husband George. The prize will first be awarded in 2020, and is a modification of the older George Pólya Prize in Combinatorics, originally established as the George Pólya Prize in 1969.

The prize was established in 1986 in memory of Richard C. DiPrima, who served SIAM for many years and in 1979–1980 as SIAM President. It aims to recognize an early career researcher in applied mathematics and is based on the doctoral dissertation.

This joint prize was established in 2002 to honor Sonia Kovalevsky and her work on the theory of differential equations. It is awarded to anyone in the scientific or engineering community whose work highlights the achievements of women in applied and computational mathematics. Nominations can be submitted via the AWM website.

The Pioneer Prize is awarded every four years at the International Council for Industrial and Applied Mathematics (ICIAM) Congress to one individual for pioneering work introducing applied mathematical methods and scientific computing techniques to an industrial problem area or a new scientific field of applications. Nominations can be submitted via the ICIAM website.

Established in 1967, the prize honors Norbert Wiener, a founder of the field of cybernetics. The prize is awarded every three years by SIAM and the American Mathematical Society (AMS) for an outstanding contribution to applied mathematics. Nominations can be submitted via the AMS website.

This prize was created in 2013 to emphasize George Pólya’s legacy of communicating mathematics effectively. It joins two long-standing Pólya prizes SIAM has awarded in combinatorics and other fields beginning in 1969.

Through the generosity and inspiration of Gerald and Judith Porter, the Mathematical Association of America (MAA), American Mathematical Society (AMS), and SIAM offer this annual lecture at the Joint Mathematics Meetings. The lecture, first awarded in 2010, is given on a mathematical topic accessible to the broader community.

Named in honor of I. E. Block, a co-founder and the first managing director of SIAM, this lecture is open to the public at the SIAM Annual Meeting. It is intended to encourage public appreciation of applied mathematics and computational science by reaching out to the local community.

Established in 1998 in memory of Ralph E. Kleinman, the prize recognizes contributions that bridge the gap between high-level mathematics and engineering problems. The award is based on the quality and impact of the mathematics.

The prize recognizes students for outstanding solutions to real world math problems. It is awarded to two of the teams judged "Outstanding" in the Mathematical Contest in Modeling (MCM) administered annually by the Consortium for Mathematics and Its Applications (COMAP). Registration is accepted via the COMAP website.

The SIAM Outstanding Paper Prizes bring attention to papers published in SIAM journals. Three awards are made each year to the authors of papers deemed by SIAM journal editors-in-chief worthy of particular attention.

The SIAM Student Paper Prize is awarded annually to the student author(s) of the most outstanding paper(s) accepted by SIAM journals within the three years preceding the nomination deadline. Starting with the 2018 award, the focus of the prize is to recognize outstanding scholarship by students in SIAM journals.

This activity group focuses on unifying pure discrete mathematics and areas of applied research such as computer science, operations research, combinatorics, and the social sciences. Other areas the group focuses on include combinatorics, graph theory, cryptography, discrete optimization, mathematical programming, coding theory, information theory, game theory, and theoretical computer science, including algorithms, complexity, circuit design, robotics, and parallel processing.

SIAM Journal On Discrete Mathematics (SIDMA) publishes research articles on a broad range of topics from pure and applied mathematics, including combinatorics and graph theory, discrete optimization and operations research, to theoretical computer science, and coding and communication theory.

SIAM Journal on Computing (SICOMP) aims to provide coverage of the most significant work going on in the mathematical and formal aspects of computer science and nonnumerical computing. Submissions must be clearly written and make a significant technical contribution.

Multiscale Modeling & Simulation
SIAM J. on Applied Algebra and Geometry
SIAM J. on Applied Dynamical Systems
SIAM J. on Applied Mathematics
SIAM J. on Computing
SIAM J. on Control and Optimization
SIAM J. on Discrete Mathematics
SIAM J. on Financial Mathematics
SIAM J. on Imaging Sciences
SIAM J. on Mathematical Analysis
SIAM J. on Matrix Analysis and Applications
SIAM J. on Numerical Analysis
SIAM J. on Optimization
SIAM J. on Scientific Computing
SIAM/ASA J. on Uncertainty Quantification
SIAM Review
Theory of Probability & Its Applications

General Opportunities

We know it can be overwhelming to keep track of career opportunities that may be relevant to you as a member of the SIAM community. So, we’ve compiled lists of some of our favorite fellowship, internship, and research opportunities. Check ‘em out!

Fellowships

Looking for financial support to further your research? Fellowships often provide funding plus experiential learning opportunities to young researchers. Learn more about fellowship opportunities.

Internships allow you to network and forge connections for future job possibilities, while also exploring possible areas of interest. Look at this list of companies who offer valuable opportunities.

Our community is founded on igniting groundbreaking developments in applied math and computational science. Take a deeper dive into your area of study with one of these opportunities.