Andreas Björklund

From MaRDI portal
Person:262279

Available identifiers

zbMath Open bjorklund.andreasMaRDI QIDQ262279

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61473942024-01-15Paper
The shortest even cycle problem is tractable2023-12-08Paper
https://portal.mardi4nfdi.de/entity/Q50909922022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50910072022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50910092022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50911732022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50911742022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50911752022-07-21Paper
Approximate Counting of k -Paths: Simpler, Deterministic, and in Polynomial Space2022-02-16Paper
Counting Short Vector Pairs by Inner Product and Relations to the Permanent2020-07-28Paper
https://portal.mardi4nfdi.de/entity/Q51114232020-05-27Paper
https://portal.mardi4nfdi.de/entity/Q51118652020-05-27Paper
Shortest Two Disjoint Paths in Polynomial Time2019-11-21Paper
Engineering Motif Search for Large Graphs2019-09-12Paper
Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants2019-09-10Paper
Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time2019-06-20Paper
https://portal.mardi4nfdi.de/entity/Q57434472019-05-10Paper
https://portal.mardi4nfdi.de/entity/Q57434882019-05-10Paper
https://portal.mardi4nfdi.de/entity/Q57435152019-05-10Paper
Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time2018-11-12Paper
Fast Zeta Transforms for Lattices with Few Irreducibles2018-10-30Paper
https://portal.mardi4nfdi.de/entity/Q53695152017-10-17Paper
https://portal.mardi4nfdi.de/entity/Q53695192017-10-17Paper
How Proofs are Prepared at Camelot2017-09-29Paper
Computing the permanent modulo a prime power2017-06-13Paper
Narrow sieves for parameterized paths and packings2017-05-24Paper
Spotting Trees with Few Leaves2017-05-24Paper
https://portal.mardi4nfdi.de/entity/Q29578682017-01-30Paper
Constrained multilinear detection and generalized graph motifs2016-03-29Paper
The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems2015-10-27Paper
Spotting Trees with Few Leaves2015-10-27Paper
Fast Witness Extraction Using a Decision Oracle2014-10-08Paper
The traveling salesman problem in bounded degree graphs2014-09-09Paper
Shortest Two Disjoint Paths in Polynomial Time2014-07-01Paper
Listing Triangles2014-07-01Paper
Determinant Sums for Undirected Hamiltonicity2014-06-04Paper
Covering and packing in linear space2013-04-04Paper
Counting closed trails2013-03-21Paper
https://portal.mardi4nfdi.de/entity/Q49107102013-03-19Paper
Evaluation of permanents in rings and semirings2012-03-27Paper
https://portal.mardi4nfdi.de/entity/Q31137402012-01-23Paper
Trimmed Moebius inversion and graphs of bounded degree2010-10-06Paper
Covering and Packing in Linear Space2010-09-07Paper
Set Partitioning via Inclusion-Exclusion2010-04-29Paper
Counting Paths and Packings in Halves2009-10-29Paper
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings2009-03-12Paper
Fourier meets M\"{o}bius: fast subset convolution2009-01-05Paper
Exact algorithms for exact satisfiability and number of perfect matchings2008-12-02Paper
The Travelling Salesman Problem in Bounded Degree Graphs2008-08-28Paper
Algorithms – ESA 20052006-06-27Paper
Automata, Languages and Programming2005-08-24Paper
https://portal.mardi4nfdi.de/entity/Q47372252004-08-11Paper
Finding a Path of Superlogarithmic Length2003-09-28Paper
https://portal.mardi4nfdi.de/entity/Q47785602002-11-18Paper
https://portal.mardi4nfdi.de/entity/Q27220092001-07-11Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Andreas Björklund