BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Denmark
1 × Finland
1 × France
1 × Iceland
1 × Italy
1 × Japan
1 × Spain
1 × USA
Collaborated with:
T.Husfeldt P.Kaski M.Koivisto H.Dell S.Khanna V.Kamat L.Kowalik M.Zehavi R.Pagh V.V.Williams U.Zwick
Talks about:
path (3) problem (2) exact (2) time (2) superlogarithm (1) exponenti (1) algorithm (1) shortest (1) salesman (1) restrict (1)

Person: Andreas Björklund

DBLP DBLP: Bj=ouml=rklund:Andreas

Contributed to:

ICALP (1) 20152015
ICALP (1) 20142014
ICALP (1) 20102010
ICALP (1) 20082008
STOC 20072007
ICALP (1) 20062006
ICALP 20042004
ICALP 20022002

Wrote 10 papers:

ICALP-v1-2015-BjorklundDH #exponential #problem #random #set #strict
The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems (AB, HD, TH), pp. 231–242.
Spotting Trees with Few Leaves (AB, VK, LK, MZ), pp. 243–255.
ICALP-v1-2014-BjorklundH #polynomial
Shortest Two Disjoint Paths in Polynomial Time (AB, TH), pp. 211–222.
Listing Triangles (AB, RP, VVW, UZ), pp. 223–234.
ICALP-v1-2010-BjorklundHKK #linear
Covering and Packing in Linear Space (AB, TH, PK, MK), pp. 727–737.
ICALP-A-2008-BjorklundHKK #bound #graph #problem
The Travelling Salesman Problem in Bounded Degree Graphs (AB, TH, PK, MK), pp. 198–209.
STOC-2007-BjorklundHKK #fourier #performance #set
Fourier meets möbius: fast subset convolution (AB, TH, PK, MK), pp. 67–74.
ICALP-v1-2006-BjorklundH #algorithm #satisfiability
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings (AB, TH), pp. 548–559.
ICALP-2004-BjorklundHK #approximate
Approximating Longest Directed Paths and Cycles (AB, TH, SK), pp. 222–233.
Finding a Path of Superlogarithmic Length (AB, TH), pp. 985–992.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.