The following pages link to Andreas Björklund (Q262279):
Displaying 50 items.
- Constrained multilinear detection and generalized graph motifs (Q262282) (← links)
- Evaluation of permanents in rings and semirings (Q407582) (← links)
- Exact algorithms for exact satisfiability and number of perfect matchings (Q958212) (← links)
- Counting closed trails (Q1941684) (← links)
- Covering and packing in linear space (Q1944195) (← links)
- Trimmed Moebius inversion and graphs of bounded degree (Q1959390) (← links)
- Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants (Q2272599) (← links)
- Narrow sieves for parameterized paths and packings (Q2396725) (← links)
- Computing the permanent modulo a prime power (Q2628281) (← links)
- (Q2722009) (← links)
- Fast Witness Extraction Using a Decision Oracle (Q2921401) (← links)
- Probably optimal graph motifs (Q2957868) (← links)
- (Q3113740) (← links)
- The traveling salesman problem in bounded degree graphs (Q3189059) (← links)
- The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems (Q3448788) (← links)
- Spotting Trees with Few Leaves (Q3448789) (← links)
- The Travelling Salesman Problem in Bounded Degree Graphs (Q3521919) (← links)
- Fourier meets M\"{o}bius: fast subset convolution (Q3549598) (← links)
- Set Partitioning via Inclusion-Exclusion (Q3558013) (← links)
- Covering and Packing in Linear Space (Q3587422) (← links)
- Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings (Q3613789) (← links)
- Counting Paths and Packings in Halves (Q3639276) (← links)
- Finding a Path of Superlogarithmic Length (Q4429693) (← links)
- Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time (Q4554938) (← links)
- (Q4737225) (← links)
- (Q4778560) (← links)
- (Q4910710) (← links)
- Fast Zeta Transforms for Lattices with Few Irreducibles (Q4962203) (← links)
- Approximate Counting of <i>k</i> -Paths: Simpler, Deterministic, and in Polynomial Space (Q5032035) (← links)
- (Q5090992) (← links)
- (Q5091007) (← links)
- (Q5091009) (← links)
- Approximate Counting of k-Paths: Deterministic and in Polynomial Space (Q5091173) (← links)
- Computing permanents and counting Hamiltonian cycles by listing dissimilar vectors (Q5091174) (← links)
- (Q5091175) (← links)
- Directed Hamiltonicity and Out-Branchings via Generalized Laplacians (Q5111423) (← links)
- (Q5111865) (← links)
- Shortest Two Disjoint Paths in Polynomial Time (Q5167743) (← links)
- Listing Triangles (Q5167744) (← links)
- Engineering Motif Search for Large Graphs (Q5232527) (← links)
- Shortest Two Disjoint Paths in Polynomial Time (Q5244398) (← links)
- Spotting Trees with Few Leaves (Q5346548) (← links)
- How Proofs are Prepared at Camelot (Q5361961) (← links)
- (Q5369515) (← links)
- (Q5369519) (← links)
- Determinant Sums for Undirected Hamiltonicity (Q5419040) (← links)
- Automata, Languages and Programming (Q5466464) (← links)
- Algorithms – ESA 2005 (Q5475891) (← links)
- (Q5743447) (← links)
- (Q5743488) (← links)
