Andreas Björklund
Artificial Intelligence · 2006–2009
A researcher in the Science corpus: 2 papers; trusts 1 researcher and is trusted by 0 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 5 citations into it
Whom Andreas Björklund trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Andreas Björklund overall
- Daniel Lokshtanov
- Xin Cao
- Felix Brandt
- Marek Cygan
- Ryan Williams
- Daniel Marx
- Gao Cong
- Vincent Conitzer
Papers from Andreas Björklund's perspective
Ordered by how strongly the researchers Andreas Björklund trusts endorse each paper. Same corpus, a different order for every researcher.
- A dynamic programming approach to sequencing problems
- Exact Algorithms for NP-Hard Problems: A Survey (Combinatorial Optimization)
- On the Foundations of Combinatorial Theory
- Faster integer multiplication (Symposium on the Theory of Computing)
- Linear degree extractors and the inapproximability of max clique and chromatic number (Symposium on the Theory of Computing)
- The Design and Analysis of Computer Algorithms
- Random Graph Isomorphism
- Graph isomorphism problem
- The Art of Computer Programming
- Isomorphism of graphs of bounded valence can be tested in polynomial time
Their papers
- Fourier meets möbius: fast subset convolution (2006) — 354 citations
- Set Partitioning via Inclusion-Exclusion (2009) — 423 citations