Andreas Björklund

Available identifiers

zbMath Open bjorklund.andreasMaRDI QIDQ262279

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6147394	2024-01-15	Paper
The shortest even cycle problem is tractable	2023-12-08	Paper
https://portal.mardi4nfdi.de/entity/Q5090992	2022-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5091007	2022-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5091009	2022-07-21	Paper
Approximate Counting of k-Paths: Deterministic and in Polynomial Space	2022-07-21	Paper
Computing permanents and counting Hamiltonian cycles by listing dissimilar vectors	2022-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5091175	2022-07-21	Paper
Approximate Counting of k -Paths: Simpler, Deterministic, and in Polynomial Space	2022-02-16	Paper
Counting Short Vector Pairs by Inner Product and Relations to the Permanent	2020-07-28	Paper
Directed Hamiltonicity and Out-Branchings via Generalized Laplacians	2020-05-27	Paper
https://portal.mardi4nfdi.de/entity/Q5111865	2020-05-27	Paper
Shortest Two Disjoint Paths in Polynomial Time	2019-11-21	Paper
Engineering Motif Search for Large Graphs	2019-09-12	Paper
Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants	2019-09-10	Paper
Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time	2019-06-20	Paper
https://portal.mardi4nfdi.de/entity/Q5743447	2019-05-10	Paper
https://portal.mardi4nfdi.de/entity/Q5743488	2019-05-10	Paper
https://portal.mardi4nfdi.de/entity/Q5743515	2019-05-10	Paper
Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time	2018-11-12	Paper
Fast Zeta Transforms for Lattices with Few Irreducibles	2018-10-30	Paper
https://portal.mardi4nfdi.de/entity/Q5369515	2017-10-17	Paper
https://portal.mardi4nfdi.de/entity/Q5369519	2017-10-17	Paper
How Proofs are Prepared at Camelot	2017-09-29	Paper
Computing the permanent modulo a prime power	2017-06-13	Paper
Narrow sieves for parameterized paths and packings	2017-05-24	Paper
Spotting Trees with Few Leaves	2017-05-24	Paper
Probably optimal graph motifs	2017-01-30	Paper
Constrained multilinear detection and generalized graph motifs	2016-03-29	Paper
The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems	2015-10-27	Paper
Spotting Trees with Few Leaves	2015-10-27	Paper
Fast Witness Extraction Using a Decision Oracle	2014-10-08	Paper
The traveling salesman problem in bounded degree graphs	2014-09-09	Paper
Shortest Two Disjoint Paths in Polynomial Time	2014-07-01	Paper
Listing Triangles	2014-07-01	Paper
Determinant Sums for Undirected Hamiltonicity	2014-06-04	Paper
Covering and packing in linear space	2013-04-04	Paper
Counting closed trails	2013-03-21	Paper
https://portal.mardi4nfdi.de/entity/Q4910710	2013-03-19	Paper
Evaluation of permanents in rings and semirings	2012-03-27	Paper
https://portal.mardi4nfdi.de/entity/Q3113740	2012-01-23	Paper
Trimmed Moebius inversion and graphs of bounded degree	2010-10-06	Paper
Covering and Packing in Linear Space	2010-09-07	Paper
Set Partitioning via Inclusion-Exclusion	2010-04-29	Paper
Counting Paths and Packings in Halves	2009-10-29	Paper
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings	2009-03-12	Paper
Fourier meets M\"{o}bius: fast subset convolution	2009-01-05	Paper
Exact algorithms for exact satisfiability and number of perfect matchings	2008-12-02	Paper
The Travelling Salesman Problem in Bounded Degree Graphs	2008-08-28	Paper
Algorithms – ESA 2005	2006-06-27	Paper
Automata, Languages and Programming	2005-08-24	Paper
https://portal.mardi4nfdi.de/entity/Q4737225	2004-08-11	Paper
Finding a Path of Superlogarithmic Length	2003-09-28	Paper
https://portal.mardi4nfdi.de/entity/Q4778560	2002-11-18	Paper
https://portal.mardi4nfdi.de/entity/Q2722009	2001-07-11	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Andreas Björklund