Anders Martinsson

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Mastermind with a linear number of queries.
Comb. Probab. Comput., March, 2024

Strengthening Hadwiger's conjecture for 4- and 5-chromatic graphs.
J. Comb. Theory B, January, 2024

Reconstructibility of the K-count from n - 1 cards.
Discret. Math., 2024

2023
Hat Guessing Numbers of Strongly Degenerate Graphs.
SIAM J. Discret. Math., June, 2023

Cycle lengths modulo k in expanders.
Eur. J. Comb., 2023

On the approximability of the burning number.
CoRR, 2023

Synchronizing random automata through repeated 'a' inputs.
CoRR, 2023

Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

On Connectivity in Random Graph Models with Limited Dependencies.
Proceedings of the Approximation, 2023

2022
Optimal schemes for combinatorial query problems with integer feedback.
CoRR, 2022

Solving Static Permutation Mastermind using $O(n \log n)$ Queries.
Electron. J. Comb., 2022

2021
Long cycles, heavy cycles and cycle decompositions in digraphs.
J. Comb. Theory B, 2021

Note on Long Paths in Eulerian Digraphs.
Electron. J. Comb., 2021

2020
Navigating an Infinite Space with Unreliable Movements.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

An Optimal Decentralized (Δ + 1)-Coloring Algorithm.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019
Most edge-orderings of Kn have maximal altitude.
Random Struct. Algorithms, 2019

A Linear Threshold for Uniqueness of Solutions to Random Jigsaw Puzzles.
Comb. Probab. Comput., 2019

Optimal Kronecker-Sum Approximation of Real Time Recurrent Learning.
Proceedings of the 36th International Conference on Machine Learning, 2019

Optimal Strategies for Patrolling Fences.
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).
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

When Does Hillclimbing Fail on Monotone Functions: An entropy compression argument.
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.
CoRR, 2018

Even Flying Cops Should Think Ahead.
Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

2016
Shotgun edge assembly of random jigsaw puzzles.
CoRR, 2016

When can multi-agent rendezvous be executed in time linear in the diameter of a plane configuration?
Proceedings of the 17th International Conference on Distributed Computing and Networking, 2016

2015
An improved energy argument for the Hegselmann-Krause model.
CoRR, 2015

Permutations Destroying Arithmetic Progressions in Finite Cyclic Groups.
Electron. J. Comb., 2015

2014
The Hegselmann-Krause dynamics on the circle converge.
CoRR, 2014

2013
Lovász ϑ function, SVMs and finding dense subgraphs.
J. Mach. Learn. Res., 2013

A variant of the multi-agent rendezvous problem.
CoRR, 2013

2012
"The Lovasz $\theta$ function, SVMs and finding large dense subgraphs".
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


  Loading...