| 0 | -- | 0 | Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood. Planar Graphs Have Bounded Queue-Number |
| 0 | -- | 0 | Nima Anari, Vijay V. Vazirani. Planar Graph Perfect Matching Is in NC |
| 0 | -- | 0 | Daniel Gaina. Forcing and Calculi for Hybrid Logics |
| 0 | -- | 0 | Arkadev Chattopadhyay, Nikhil S. Mande, Suhail Sherif. The Log-Approximate-Rank Conjecture Is False |
| 0 | -- | 0 | Moshe Babaioff, Nicole Immorlica, Brendan Lucier, S. Matthew Weinberg. A Simple and Approximately Optimal Mechanism for an Additive Buyer |
| 0 | -- | 0 | Arnaud de Mesmay, Yo'av Rieck, Eric Sedgwick, Martin Tancer. 3 is NP-hard |
| 0 | -- | 0 | Jeroen Chua, Pedro F. Felzenszwalb. Scene Grammars, Factor Graphs, and Belief Propagation |