default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoakim Blikstad
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c9]Joakim Blikstad
, Ola Svensson, Radu Vintan, David Wajc:
Simple and Asymptotically Optimal Online Bipartite Edge Coloring. SOSA 2024: 331-336- [c8]Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc:
Online Edge Coloring Is (Nearly) as Easy as Offline. STOC 2024: 36-46 - [c7]Mikkel Abrahamsen, Joakim Blikstad, André Nusser, Hanwen Zhang:
Minimum Star Partitions of Simple Polygons in Polynomial Time. STOC 2024: 904-910 - [i11]Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc:
Online Edge Coloring is (Nearly) as Easy as Offline. CoRR abs/2402.18339 (2024) - [i10]Aaron Bernstein, Joakim Blikstad, Thatchaphol Saranurak, Ta-Wei Tu:
Maximum Flow by Augmenting Paths in n2+o(1) Time. CoRR abs/2406.03648 (2024) - [i9]Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc:
Deterministic Online Bipartite Edge Coloring. CoRR abs/2408.03661 (2024) - 2023
- [c6]Joakim Blikstad, Peter Kiss:
Incremental (1-ε)-Approximate Dynamic Matching in O(poly(1/ε)) Update Time. ESA 2023: 22:1-22:19 - [c5]Joakim Blikstad, Sagnik Mukhopadhyay, Danupon Nanongkai, Ta-Wei Tu:
Fast Algorithms via Dynamic-Oracle Matroids. STOC 2023: 1229-1242 - [i8]Joakim Blikstad, Peter Kiss:
Incremental (1-ε)-approximate dynamic matching in O(poly(1/ε)) update time. CoRR abs/2302.08432 (2023) - [i7]Joakim Blikstad, Sagnik Mukhopadhyay, Danupon Nanongkai, Ta-Wei Tu:
Fast Algorithms via Dynamic-Oracle Matroids. CoRR abs/2302.09796 (2023) - [i6]Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc:
Simple and Asymptotically Optimal Online Bipartite Edge Coloring. CoRR abs/2311.04574 (2023) - [i5]Mikkel Abrahamsen, Joakim Blikstad, André Nusser, Hanwen Zhang:
Minimum Star Partitions of Simple Polygons in Polynomial Time. CoRR abs/2311.10631 (2023) - 2022
- [c4]Joakim Blikstad, Jan van den Brand, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai:
Nearly Optimal Communication and Query Complexity of Bipartite Matching. FOCS 2022: 1174-1185 - [c3]Joakim Blikstad:
Sublinear-Round Parallel Matroid Intersection. ICALP 2022: 25:1-25:17 - [i4]Joakim Blikstad, Jan van den Brand, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai:
Nearly Optimal Communication and Query Complexity of Bipartite Matching. CoRR abs/2208.02526 (2022) - 2021
- [c2]Joakim Blikstad:
Breaking O(nr) for Matroid Intersection. ICALP 2021: 31:1-31:17 - [c1]Joakim Blikstad, Jan van den Brand, Sagnik Mukhopadhyay, Danupon Nanongkai:
Breaking the quadratic barrier for matroid intersection. STOC 2021: 421-432 - [i3]Joakim Blikstad, Jan van den Brand, Sagnik Mukhopadhyay, Danupon Nanongkai:
Breaking the Quadratic Barrier for Matroid Intersection. CoRR abs/2102.05548 (2021) - [i2]Joakim Blikstad:
Breaking O(nr) for Matroid Intersection. CoRR abs/2105.05673 (2021) - 2020
- [j1]Joakim Blikstad:
On the longest common subsequence of Thue-Morse words. Inf. Process. Lett. 164: 106020 (2020)
2010 – 2019
- 2019
- [i1]Joakim Blikstad:
On the longest common subsequence of Thue-Morse words. CoRR abs/1904.00248 (2019)
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-09-15 00:42 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:
