Andreas Björklund

Researcher

Research areas and keywords

UKÄ subject classification

  • Computer Science

Research

I study worst case algorithms for computationally hard combinatorial problems, e.g., deciding Hamiltonicity and chromatic number in graphs, but also more general problems like satisfiability of polynomial equation systems.

Recent research outputs

Andreas Björklund, Lokshtanov, D., Saurabh, S. & Zehavi, M., 2019 Jul 1, 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019. Chatzigiannakis, I., Baier, C., Leonardi, S. & Flocchini, P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 132. 24

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

Andreas Björklund, Kaski, P. & Williams, R., 2019 Jul 1, 46th International Colloquium on Automata, Languages, and Programming: ICALP 2019. Chatzigiannakis, I., Baier, C., Leonardi, S. & Flocchini, P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 132. p. 26:1-26:13 26. (Leibniz International Proceedings in Informatics (LIPIcs)).

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

Andreas Björklund & Williams, R., 2019 Jul, 46th International Colloquium on Automata, Languages, and Programming: ICALP 2019. Chatzigiannakis, I., Baier, C., Leonardi, S. & Flocchini, P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 132. p. 25:1–25:14 14 p. 25. (Leibniz International Proceedings in Informatics (LIPIcs)).

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

View All (58)