The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andreas Björklund: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Andreas Björklund
    Approximating Integer Quadratic Programs and MAXCUT in Subdense Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:839-849 [Conf]
  2. Andreas Björklund, Thore Husfeldt
    Inclusion--Exclusion Algorithms for Counting Set Partitions. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:575-582 [Conf]
  3. Andreas Björklund, Thore Husfeldt
    Finding a Path of Superlogarithmic Length. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:985-992 [Conf]
  4. Andreas Björklund, Thore Husfeldt
    Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:548-559 [Conf]
  5. Andreas Björklund, Thore Husfeldt, Sanjeev Khanna
    Approximating Longest Directed Paths and Cycles. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:222-233 [Conf]
  6. Andreas Björklund
    Optimal Adaptive Fault Diagnosis of Hypercubes. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:527-534 [Conf]
  7. Andreas Björklund, Andrzej Lingas
    Fast Boolean Matrix Multiplication for Highly Clustered Data. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:258-263 [Conf]
  8. Andreas Björklund, Thore Husfeldt, Sanjeev Khanna
    Approximating Longest Directed Path [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:032, pp:- [Journal]
  9. Andreas Björklund, Thore Husfeldt
    Finding a Path of Superlogarithmic Length. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:6, pp:1395-1402 [Journal]
  10. Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
    Fourier meets möbius: fast subset convolution. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:67-74 [Conf]
  11. Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
    Fourier meets Möbius: fast subset convolution [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  12. Counting Paths and Packings in Halves. [Citation Graph (, )][DBLP]


  13. Computing the Tutte Polynomial in Vertex-Exponential Time. [Citation Graph (, )][DBLP]


  14. The Travelling Salesman Problem in Bounded Degree Graphs. [Citation Graph (, )][DBLP]


  15. Covering and Packing in Linear Space. [Citation Graph (, )][DBLP]


  16. Trimmed Moebius Inversion and Graphs of Bounded Degree. [Citation Graph (, )][DBLP]


  17. Exact Covers via Determinants. [Citation Graph (, )][DBLP]


  18. Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings. [Citation Graph (, )][DBLP]


  19. Computing the Tutte polynomial in vertex-exponential time [Citation Graph (, )][DBLP]


  20. Trimmed Moebius Inversion and Graphs of Bounded Degree [Citation Graph (, )][DBLP]


  21. The fast intersection transform with applications to counting paths [Citation Graph (, )][DBLP]


  22. Counting Paths and Packings in Halves [Citation Graph (, )][DBLP]


  23. On evaluation of permanents [Citation Graph (, )][DBLP]


  24. Exact Covers via Determinants [Citation Graph (, )][DBLP]


  25. Narrow sieves for parameterized paths and packings [Citation Graph (, )][DBLP]


  26. Determinant Sums for Undirected Hamiltonicity [Citation Graph (, )][DBLP]


  27. Inclusion-Exclusion Based Algorithms for Graph Colouring. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002