Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Bj{\"o}rklund, Andreas"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Shortest two disjoint paths in polynomial time
Andreas Björklund
,
Thore Husfeldt
Lecture Notes in Computer Science
8572
, 2014, pp. 211-222
Fast witness extraction using a decision oracle
Andreas Björklund
,
Petteri Kaski
,
Łukasz Kowalik
Lecture Notes in Computer Science
8737
, 2014, pp. 149-160
Listing triangles
Andreas Björklund
,
Rasmus Pagh
,
Virginia Vassilevska Williams
,
Uri Zwick
Lecture Notes in Computer Science
8572
, 2014, pp. 223-234
Determinant sums for undirected hamiltonicity
Andreas Björklund
SIAM Journal on Computing
43
(1), 2014, pp. 280-299
Probably optimal graph motifs
Andreas Björklund
,
Petteri Kaski
,
Lukasz Kowalik
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 20-31
Counting closed trails
Andreas Björklund
,
Petteri Kaski
Information Processing Letters
113
(1-2), 2013, pp. 1-3
Covering and packing in linear space
Andreas Björklund
,
Thore Husfeldt
,
Petteri Kaski
,
Mikko Koivisto
Information Processing Letters
111
(21-22), 2011, pp. 1033-1036
Evaluation of permanents in rings and semirings
Andreas Björklund
,
Thore Husfeldt
,
Petteri Kaski
,
Mikko Koivisto
Information Processing Letters
110
(20), 2010, pp. 867-870
Covering and packing in linear space
Andreas Björklund
,
Thore Husfeldt
,
Petteri Kaski
,
Mikko Koivisto
Lecture Notes in Computer Science
6198
, 2010, pp. 727-737
Trimmed Moebius inversion and graphs of bounded degree
Andreas Björklund
,
Thore Husfeldt
,
Petteri Kaski
,
Mikko Kolvisto
Theory of Computing Systems
47
(3), 2010, pp. 637-654
Counting paths and packings in halves
Andreas Björklund
,
Thore Husfeldt
,
Petteri Kaski
,
Mikko Koivisto
Lecture Notes in Computer Science
5757
, 2009, pp. 578-586
Set partitioning via inclusion-exclusion
Andreas Björklund
,
Thore Husfeldt
,
Mikko Koivisto
SIAM Journal on Computing
39
(2), 2009, pp. 546-563
The Travelling Salesman Problem in bounded degree graphs
Andreas Björklund
,
Thore Husfeldt
,
Petteri Kaski
,
Mikko Koivisto
Lecture Notes in Computer Science
5125
, 2008, pp. 198-209
Trimmed Moebius inversion and graphs of bounded degree
Andreas Björklund
,
Thore Husfeldt
,
Petteri Kaski
,
Mikko Koivisto
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 85-96
Exact algorithms for exact satisfiability and number of perfect matchings
Andreas Björklund
,
Thore Husfeldt
Algorithmica
52
(2), 2008, pp. 226-249
Exact algorithms for exact satisfiability and number of perfect matchings
Andreas Björklund
,
Thore Husfeldt
Lecture Notes in Computer Science
4051
, 2006, pp. 548-559
Approximating integer quadratic programs and MAXCUT in subdense graphs
Andreas Björklund
Lecture Notes in Computer Science
3669
, 2005, pp. 839-849
Approximating longest directed paths and cycles
Andreas Björklund
,
Thore Husfeldt
,
Sanjeev Khanna
Lecture Notes in Computer Science
3142
, 2004, pp. 222-233
Finding a path of superlogarithmic length
Andreas Björklund
,
Thore Husfeldt
Lecture Notes in Computer Science
2380
, 2002, pp. 985-992
Optimal adaptive fault diagnosis of hypercubes
Andreas Björklund
Lecture Notes in Computer Science
1851
, 2000, pp. 527-534