"The Lovasz $ theta$ function, SVMs and finding large dense subgraphs". - Vinay Jethava; Anders Martinsson; Chiranjib Bhattacharyya; Devdatt P. Dubhashi (NIPS, 2012)

A variant of the multi-agent rendezvous problem. - Peter Hegarty; Anders Martinsson; Dmitry Zhelezov (CoRR, 2013)

Lovász ϑ function, SVMs and finding dense subgraphs. - Vinay Jethava; Anders Martinsson; Chiranjib Bhattacharyya; Devdatt P. Dubhashi (J. Mach. Learn. Res., 2013)

The Hegselmann-Krause dynamics on the circle converge. - Peter Hegarty; Anders Martinsson; Edvin Wedin (CoRR, 2014)

Permutations Destroying Arithmetic Progressions in Finite Cyclic Groups. - Peter Hegarty; Anders Martinsson (Electron. J. Comb., 2015)

An improved energy argument for the Hegselmann-Krause model. - Anders Martinsson (CoRR, 2015)

When can multi-agent rendezvous be executed in time linear in the diameter of a plane configuration? - Peter Hegarty; Anders Martinsson; Dmitry Zhelezov (ICDCN, 2016)

Shotgun edge assembly of random jigsaw puzzles. - Anders Martinsson (CoRR, 2016)

Even Flying Cops Should Think Ahead. - Anders Martinsson; Florian Meier 002; Patrick Schnider; Angelika Steger (ISCO, 2018)

The "No Justice in the Universe" phenomenon: why honesty of effort may not be rewarded in tournaments. - Peter Hegarty; Anders Martinsson; Edvin Wedin (CoRR, 2018)

When Does Hillclimbing Fail on Monotone Functions: An entropy compression argument. - Johannes Lengler; Anders Martinsson; Angelika Steger (ANALCO, 2019)

The (1 + 1)-EA with mutation rate (1 + ϵ)/n is efficient on monotone functions: an entropy compression argument. (hot-off-the-press track at GECCO 2019). - Johannes Lengler; Anders Martinsson; Angelika Steger (GECCO (Companion), 2019)

Optimal Strategies for Patrolling Fences. - Bernhard Haeupler; Fabian Kuhn; Anders Martinsson; Kalina Petrova; Pascal Pfister (ICALP, 2019)

Optimal Kronecker-Sum Approximation of Real Time Recurrent Learning. - Frederik Benzing; Marcelo Matheus Gauy; Asier Mujika; Anders Martinsson; Angelika Steger (ICML, 2019)

A Linear Threshold for Uniqueness of Solutions to Random Jigsaw Puzzles. - Anders Martinsson (Comb. Probab. Comput., 2019)

Most edge-orderings of Kn have maximal altitude. - Anders Martinsson (Random Struct. Algorithms, 2019)

An Optimal Decentralized (Δ + 1)-Coloring Algorithm. - Daniel Bertschinger; Johannes Lengler; Anders Martinsson; Robert Meier; Angelika Steger; Milos Trujic; Emo Welzl (ESA, 2020)

Navigating an Infinite Space with Unreliable Movements. - Anders Martinsson; Jara Uitto (SODA, 2020)

Note on Long Paths in Eulerian Digraphs. - Charlotte Knierim; Maxime Larcher; Anders Martinsson (Electron. J. Comb., 2021)

Long cycles, heavy cycles and cycle decompositions in digraphs. - Charlotte Knierim; Maxime Larcher; Anders Martinsson; Andreas Noever (J. Comb. Theory B, 2021)

Solving Static Permutation Mastermind using $O(n log n)$ Queries. - Maxime Larcher; Anders Martinsson; Angelika Steger (Electron. J. Comb., 2022)

Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances. - Václav Rozhon; Bernhard Haeupler; Anders Martinsson; Christoph Grunau; Goran Zuzic (STOC, 2023)

Optimal schemes for combinatorial query problems with integer feedback. - Anders Martinsson (Comb. Theory, 2023)

Synchronizing random automata through repeated 'a' inputs. - Anders Martinsson (CoRR, 2023)

On the approximability of the burning number. - Anders Martinsson (CoRR, 2023)

Cycle lengths modulo k in expanders. - Anders Martinsson; Raphael Steiner (Eur. J. Comb., 2023)

Hat Guessing Numbers of Strongly Degenerate Graphs. - Charlotte Knierim; Anders Martinsson; Raphael Steiner (SIAM J. Discret. Math., 2023)

Reconstructibility of the K-count from n - 1 cards. - Charlotte Knierim; Anders Martinsson (Discret. Math., 2024)

On connectivity in random graph models with limited dependencies. - Johannes Lengler; Anders Martinsson; Kalina Petrova; Patrick Schnider; Raphael Steiner; Simon Weber 001; Emo Welzl (Random Struct. Algorithms, 2024)

Strengthening Hadwiger's conjecture for 4- and 5-chromatic graphs. - Anders Martinsson; Raphael Steiner (J. Comb. Theory B, 2024)

Mastermind with a linear number of queries. - Anders Martinsson; Pascal Su (Comb. Probab. Comput., 2024)

Vertex-critical graphs far from edge-criticality. - Anders Martinsson; Raphael Steiner (Comb. Probab. Comput., 2025)