Anders Martinsson

43 papers A* 4A 2C 1Misc 1Journal 32Unranked 3

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