Anders Martinsson

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 34

Top Topics

Linear Threshold

Realistic Settings

Top Venues

Electron. J. Comb.

Comb. Probab. Comput.

J. Comb. Theory, Ser. B

Publications

Anders Martinsson, Raphael Steiner
Strengthening Hadwiger's conjecture for 4- and 5-chromatic graphs. J. Comb. Theory, Ser. B 164 (2024)
Charlotte Knierim, Anders Martinsson
Reconstructibility of the K-count from n - 1 cards. Discret. Math. 347 (6) (2024)
Anders Martinsson, Pascal Su
Mastermind with a linear number of queries. Comb. Probab. Comput. 33 (2) (2024)
Anders Martinsson
On the approximability of the burning number. CoRR (2023)
Václav Rozhon, Bernhard Haeupler, Anders Martinsson, Christoph Grunau, Goran Zuzic
Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances. STOC (2023)
Anders Martinsson
Synchronizing random automata through repeated 'a' inputs. CoRR (2023)
Anders Martinsson, Raphael Steiner
Cycle lengths modulo k in expanders. Eur. J. Comb. 109 (2023)
Johannes Lengler, Anders Martinsson, Kalina Petrova, Patrick Schnider, Raphael Steiner, Simon Weber, Emo Welzl
On Connectivity in Random Graph Models with Limited Dependencies. APPROX/RANDOM (2023)
Charlotte Knierim, Anders Martinsson, Raphael Steiner
Hat Guessing Numbers of Strongly Degenerate Graphs. SIAM J. Discret. Math. 37 (2) (2023)
Maxime Larcher, Anders Martinsson, Angelika Steger
Solving Static Permutation Mastermind using $O(n \log n)$ Queries. Electron. J. Comb. 29 (1) (2022)
Anders Martinsson
Optimal schemes for combinatorial query problems with integer feedback. CoRR (2022)
Václav Rozhon, Bernhard Haeupler, Anders Martinsson, Christoph Grunau, Goran Zuzic
Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances. CoRR (2022)
Charlotte Knierim, Maxime Larcher, Anders Martinsson, Andreas Noever
Long cycles, heavy cycles and cycle decompositions in digraphs. J. Comb. Theory, Ser. B 148 (2021)
Charlotte Knierim, Maxime Larcher, Anders Martinsson
Note on Long Paths in Eulerian Digraphs. Electron. J. Comb. 28 (2) (2021)
Daniel Bertschinger, Johannes Lengler, Anders Martinsson, Robert Meier, Angelika Steger, Milos Trujic, Emo Welzl
An Optimal Decentralized $(Δ+ 1)$-Coloring Algorithm. CoRR (2020)
Daniel Bertschinger, Johannes Lengler, Anders Martinsson, Robert Meier, Angelika Steger, Milos Trujic, Emo Welzl
An Optimal Decentralized (Δ + 1)-Coloring Algorithm. ESA (2020)
Anders Martinsson, Pascal Su
Mastermind with a Linear Number of Queries. CoRR (2020)
Anders Martinsson, Jara Uitto
Navigating an Infinite Space with Unreliable Movements. SODA (2020)
Frederik Benzing, Marcelo Matheus Gauy, Asier Mujika, Anders Martinsson, Angelika Steger
Optimal Kronecker-Sum Approximation of Real Time Recurrent Learning. ICML (2019)
Frederik Benzing, Marcelo Matheus Gauy, Asier Mujika, Anders Martinsson, Angelika Steger
Optimal Kronecker-Sum Approximation of Real Time Recurrent Learning. CoRR (2019)
Anders Martinsson
Most edge-orderings of Kn have maximal altitude. Random Struct. Algorithms 54 (3) (2019)
Bernhard Haeupler, Fabian Kuhn, Anders Martinsson, Kalina Petrova, Pascal Pfister
Optimal Strategies for Patrolling Fences. ICALP (2019)
Johannes Lengler, Anders Martinsson, Angelika Steger
is efficient on monotone functions: an entropy compression argument. (hot-off-the-press track at GECCO 2019). GECCO (Companion) (2019)
Anders Martinsson
A Linear Threshold for Uniqueness of Solutions to Random Jigsaw Puzzles. Comb. Probab. Comput. 28 (2) (2019)
Anders Martinsson, Jara Uitto
Navigating an Infinite Space with Unreliable Movements. CoRR (2019)
Johannes Lengler, Anders Martinsson, Angelika Steger
When Does Hillclimbing Fail on Monotone Functions: An entropy compression argument. ANALCO (2019)
Anders Martinsson, Florian Meier, Patrick Schnider, Angelika Steger
Even Flying Cops Should Think Ahead. ISCO (2018)
Bernhard Haeupler, Fabian Kuhn, Anders Martinsson, Kalina Petrova, Pascal Pfister
Optimal strategies for patrolling fences. CoRR (2018)
Peter Hegarty, Anders Martinsson, Edvin Wedin
The "No Justice in the Universe" phenomenon: why honesty of effort may not be rewarded in tournaments. CoRR (2018)
Anders Martinsson, Florian Meier, Patrick Schnider, Angelika Steger
Even flying cops should think ahead. CoRR (2018)
Johannes Lengler, Anders Martinsson, Angelika Steger
When Does Hillclimbing Fail on Monotone Functions: An entropy compression argument. CoRR (2018)
Anders Martinsson
A linear threshold for uniqueness of solutions to random jigsaw puzzles. CoRR (2017)
Peter Hegarty, Anders Martinsson, Dmitry Zhelezov
When can multi-agent rendezvous be executed in time linear in the diameter of a plane configuration? ICDCN (2016)
Anders Martinsson
Shotgun edge assembly of random jigsaw puzzles. CoRR (2016)
Anders Martinsson
An improved energy argument for the Hegselmann-Krause model. CoRR (2015)
Peter Hegarty, Anders Martinsson
Permutations Destroying Arithmetic Progressions in Finite Cyclic Groups. Electron. J. Comb. 22 (4) (2015)
Peter Hegarty, Anders Martinsson, Edvin Wedin
The Hegselmann-Krause dynamics on the circle converge. CoRR (2014)
Vinay Jethava, Anders Martinsson, Chiranjib Bhattacharyya, Devdatt P. Dubhashi
Lovász ϑ function, SVMs and finding dense subgraphs. J. Mach. Learn. Res. 14 (1) (2013)
Peter Hegarty, Anders Martinsson, Dmitry Zhelezov
A variant of the multi-agent rendezvous problem. CoRR (2013)
Vinay Jethava, Anders Martinsson, Chiranjib Bhattacharyya, Devdatt P. Dubhashi
"The Lovasz $\theta$ function, SVMs and finding large dense subgraphs". NIPS (2012)