default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnders Martinsson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Anders Martinsson, Pascal Su
:
Mastermind with a linear number of queries. Comb. Probab. Comput. 33(2): 143-156 (2024)- [j11]Charlotte Knierim, Anders Martinsson:
Reconstructibility of the K-count from n - 1 cards. Discret. Math. 347(6): 113950 (2024) - [j10]Anders Martinsson, Raphael Steiner:
Strengthening Hadwiger's conjecture for 4- and 5-chromatic graphs. J. Comb. Theory B 164: 1-16 (2024) - 2023
- [j9]Anders Martinsson, Raphael Steiner:
Cycle lengths modulo k in expanders. Eur. J. Comb. 109: 103642 (2023) - [j8]Charlotte Knierim, Anders Martinsson, Raphael Steiner:
Hat Guessing Numbers of Strongly Degenerate Graphs. SIAM J. Discret. Math. 37(2): 1331-1347 (2023) - [c11]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: 30:1-30:22 - [c10]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: 321-334 - [i17]Anders Martinsson:
Synchronizing random automata through repeated 'a' inputs. CoRR abs/2306.09040 (2023) - [i16]Anders Martinsson:
On the approximability of the burning number. CoRR abs/2308.04390 (2023) - 2022
- [j7]Maxime Larcher, Anders Martinsson, Angelika Steger:
Solving Static Permutation Mastermind using $O(n \log n)$ Queries. Electron. J. Comb. 29(1) (2022) - [i15]Anders Martinsson:
Optimal schemes for combinatorial query problems with integer feedback. CoRR abs/2203.09496 (2022) - [i14]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 abs/2210.16351 (2022) - 2021
- [j6]Charlotte Knierim, Maxime Larcher, Anders Martinsson:
Note on Long Paths in Eulerian Digraphs. Electron. J. Comb. 28(2): 2 (2021) - [j5]Charlotte Knierim, Maxime Larcher, Anders Martinsson, Andreas Noever:
Long cycles, heavy cycles and cycle decompositions in digraphs. J. Comb. Theory B 148: 125-148 (2021) - 2020
- [c9]Daniel Bertschinger, Johannes Lengler, Anders Martinsson, Robert Meier, Angelika Steger, Milos Trujic, Emo Welzl:
An Optimal Decentralized (Δ + 1)-Coloring Algorithm. ESA 2020: 17:1-17:12 - [c8]Anders Martinsson, Jara Uitto:
Navigating an Infinite Space with Unreliable Movements. SODA 2020: 1170-1179 - [i13]Daniel Bertschinger, Johannes Lengler, Anders Martinsson, Robert Meier, Angelika Steger, Milos Trujic, Emo Welzl:
An Optimal Decentralized $(Δ+ 1)$-Coloring Algorithm. CoRR abs/2002.05121 (2020) - [i12]Anders Martinsson, Pascal Su:
Mastermind with a Linear Number of Queries. CoRR abs/2011.05921 (2020)
2010 – 2019
- 2019
- [j4]Anders Martinsson:
A Linear Threshold for Uniqueness of Solutions to Random Jigsaw Puzzles. Comb. Probab. Comput. 28(2): 287-302 (2019) - [j3]Anders Martinsson:
Most edge-orderings of Kn have maximal altitude. Random Struct. Algorithms 54(3): 559-585 (2019) - [c7]Johannes Lengler, Anders Martinsson, Angelika Steger:
When Does Hillclimbing Fail on Monotone Functions: An entropy compression argument. ANALCO 2019: 94-102 - [c6]Johannes Lengler, Anders Martinsson, Angelika Steger:
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). GECCO (Companion) 2019: 25-26 - [c5]Bernhard Haeupler, Fabian Kuhn, Anders Martinsson, Kalina Petrova, Pascal Pfister:
Optimal Strategies for Patrolling Fences. ICALP 2019: 144:1-144:13 - [c4]Frederik Benzing, Marcelo Matheus Gauy, Asier Mujika, Anders Martinsson, Angelika Steger:
Optimal Kronecker-Sum Approximation of Real Time Recurrent Learning. ICML 2019: 604-613 - [i11]Frederik Benzing, Marcelo Matheus Gauy, Asier Mujika, Anders Martinsson, Angelika Steger:
Optimal Kronecker-Sum Approximation of Real Time Recurrent Learning. CoRR abs/1902.03993 (2019) - [i10]Anders Martinsson, Jara Uitto:
Navigating an Infinite Space with Unreliable Movements. CoRR abs/1907.05935 (2019) - 2018
- [c3]Anders Martinsson, Florian Meier, Patrick Schnider, Angelika Steger:
Even Flying Cops Should Think Ahead. ISCO 2018: 326-337 - [i9]Anders Martinsson, Florian Meier, Patrick Schnider, Angelika Steger:
Even flying cops should think ahead. CoRR abs/1801.07193 (2018) - [i8]Peter Hegarty, Anders Martinsson, Edvin Wedin:
The "No Justice in the Universe" phenomenon: why honesty of effort may not be rewarded in tournaments. CoRR abs/1803.00823 (2018) - [i7]Johannes Lengler, Anders Martinsson, Angelika Steger:
When Does Hillclimbing Fail on Monotone Functions: An entropy compression argument. CoRR abs/1808.01137 (2018) - [i6]Bernhard Haeupler, Fabian Kuhn, Anders Martinsson, Kalina Petrova, Pascal Pfister:
Optimal strategies for patrolling fences. CoRR abs/1809.06727 (2018) - 2017
- [i5]Anders Martinsson:
A linear threshold for uniqueness of solutions to random jigsaw puzzles. CoRR abs/1701.04813 (2017) - 2016
- [c2]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: 2:1-2:8 - [i4]Anders Martinsson:
Shotgun edge assembly of random jigsaw puzzles. CoRR abs/1605.07151 (2016) - 2015
- [j2]Peter Hegarty, Anders Martinsson:
Permutations Destroying Arithmetic Progressions in Finite Cyclic Groups. Electron. J. Comb. 22(4): 4 (2015) - [i3]Anders Martinsson:
An improved energy argument for the Hegselmann-Krause model. CoRR abs/1501.02183 (2015) - 2014
- [i2]Peter Hegarty, Anders Martinsson, Edvin Wedin:
The Hegselmann-Krause dynamics on the circle converge. CoRR abs/1410.7330 (2014) - 2013
- [j1]Vinay Jethava, Anders Martinsson, Chiranjib Bhattacharyya, Devdatt P. Dubhashi:
Lovász ϑ function, SVMs and finding dense subgraphs. J. Mach. Learn. Res. 14(1): 3495-3536 (2013) - [i1]Peter Hegarty, Anders Martinsson, Dmitry Zhelezov:
A variant of the multi-agent rendezvous problem. CoRR abs/1306.5166 (2013) - 2012
- [c1]Vinay Jethava, Anders Martinsson, Chiranjib Bhattacharyya, Devdatt P. Dubhashi:
"The Lovasz $\theta$ function, SVMs and finding large dense subgraphs". NIPS 2012: 1169-1177
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
