Anders Martinsson

According to our database, Anders Martinsson authored at least 31 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Mastermind with a linear number of queries.

Anders Martinsson, Pascal Su

Comb. Probab. Comput., March, 2024

Strengthening Hadwiger's conjecture for 4- and 5-chromatic graphs.

Anders Martinsson, Raphael Steiner

J. Comb. Theory B, January, 2024

Reconstructibility of the K-count from n - 1 cards.

Charlotte Knierim, Anders Martinsson

Discret. Math., 2024

2023

Hat Guessing Numbers of Strongly Degenerate Graphs.

Charlotte Knierim, Anders Martinsson, Raphael Steiner

SIAM J. Discret. Math., June, 2023

Cycle lengths modulo k in expanders.

Anders Martinsson, Raphael Steiner

Eur. J. Comb., 2023

On the approximability of the burning number.

Anders Martinsson

CoRR, 2023

Synchronizing random automata through repeated 'a' inputs.

Anders Martinsson

CoRR, 2023

Optimal schemes for combinatorial query problems with integer feedback.

Anders Martinsson

Comb. Theory, 2023

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

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

On Connectivity in Random Graph Models with Limited Dependencies.

Johannes Lengler, Anders Martinsson, Kalina Petrova, Patrick Schnider, Raphael Steiner, Simon Weber, Emo Welzl

Proceedings of the Approximation, 2023

2022

Solving Static Permutation Mastermind using $O(n \log n)$ Queries.

Maxime Larcher, Anders Martinsson, Angelika Steger

Electron. J. Comb., 2022

2021

Long cycles, heavy cycles and cycle decompositions in digraphs.

Charlotte Knierim, Maxime Larcher, Anders Martinsson, Andreas Noever

J. Comb. Theory B, 2021

Note on Long Paths in Eulerian Digraphs.

Charlotte Knierim, Maxime Larcher, Anders Martinsson

Electron. J. Comb., 2021

2020

Navigating an Infinite Space with Unreliable Movements.

Anders Martinsson, Jara Uitto

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

An Optimal Decentralized (Δ + 1)-Coloring Algorithm.

Daniel Bertschinger, Johannes Lengler, Anders Martinsson, Robert Meier, Angelika Steger, Milos Trujic, Emo Welzl

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

Most edge-orderings of Kn have maximal altitude.

Anders Martinsson

Random Struct. Algorithms, 2019

A Linear Threshold for Uniqueness of Solutions to Random Jigsaw Puzzles.

Anders Martinsson

Comb. Probab. Comput., 2019

Optimal Kronecker-Sum Approximation of Real Time Recurrent Learning.

Frederik Benzing, Marcelo Matheus Gauy, Asier Mujika, Anders Martinsson, Angelika Steger

Proceedings of the 36th International Conference on Machine Learning, 2019

Optimal Strategies for Patrolling Fences.

Bernhard Haeupler, Fabian Kuhn, Anders Martinsson, Kalina Petrova, Pascal Pfister

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

The (1 + 1)-EA with mutation rate (1 + ϵ)/<i>n</i> is efficient on monotone functions: an entropy compression argument. (hot-off-the-press track at GECCO 2019).

Johannes Lengler, Anders Martinsson, Angelika Steger

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

When Does Hillclimbing Fail on Monotone Functions: An entropy compression argument.

Johannes Lengler, Anders Martinsson, Angelika Steger

Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, 2019

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

Even Flying Cops Should Think Ahead.

Anders Martinsson, Florian Meier, Patrick Schnider, Angelika Steger

Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

2016

Shotgun edge assembly of random jigsaw puzzles.

Anders Martinsson

CoRR, 2016

When can multi-agent rendezvous be executed in time linear in the diameter of a plane configuration?

Peter Hegarty, Anders Martinsson, Dmitry Zhelezov

Proceedings of the 17th International Conference on Distributed Computing and Networking, 2016

2015

An improved energy argument for the Hegselmann-Krause model.

Anders Martinsson

CoRR, 2015

Permutations Destroying Arithmetic Progressions in Finite Cyclic Groups.

Peter Hegarty, Anders Martinsson

Electron. J. Comb., 2015

2014

The Hegselmann-Krause dynamics on the circle converge.

Peter Hegarty, Anders Martinsson, Edvin Wedin

CoRR, 2014

2013

Lovász ϑ function, SVMs and finding dense subgraphs.

Vinay Jethava, Anders Martinsson, Chiranjib Bhattacharyya, Devdatt P. Dubhashi

J. Mach. Learn. Res., 2013

A variant of the multi-agent rendezvous problem.

Peter Hegarty, Anders Martinsson, Dmitry Zhelezov

CoRR, 2013

2012

"The Lovasz $\theta$ function, SVMs and finding large dense subgraphs".

Vinay Jethava, Anders Martinsson, Chiranjib Bhattacharyya, Devdatt P. Dubhashi

Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012