| 2023 | FCT | Parsing Unranked Tree Languages, Folded Once. | Martin Berglund, Henrik Bjrklund, Johanna Bjrklund |
| 2016 | LATA | Between a Rock and a Hard Place - Uniform Parsing for Hyperedge Replacement DAG Grammars. | Henrik Bjrklund, Frank Drewes, Petter Ericson |
| 2015 | CIKM | Efficient Incremental Evaluation of Succinct Regular Expressions. | Henrik Bjrklund, Wim Martens, Thomas Timm |
| 2013 | DLT | Cuts in Regular Expressions. | Martin Berglund, Henrik Bjrklund, Frank Drewes, Brink van der Merwe, Bruce W. Watson |
| 2013 | ICDT | On optimum left-to-right strategies for active context-free games. | Henrik Bjrklund, Martin Schuster, Thomas Schwentick, Joscha Kulbatzki |
| 2013 | MFCS | Validity of Tree Pattern Queries with Respect to Schema Information. | Henrik Bjrklund, Wim Martens, Thomas Schwentick |
| 2011 | LATA | Recognizing Shuffled Languages. | Martin Berglund, Henrik Bjrklund, Johanna Hgberg |
| 2010 | DLT | Algorithmic Properties of Millstream Systems. | Suna Bensch, Henrik Bjrklund, Frank Drewes |
| 2009 | ICDT | Incremental XPath evaluation. | Henrik Bjrklund, Wouter Gelade, Marcel Marquardt, Wim Martens |
| 2008 | ICALP | The Tractability Frontier for NFA Minimization. | Henrik Bjrklund, Wim Martens |
| 2008 | MFCS | Optimizing Conjunctive Queries over Trees Using Schema Information. | Henrik Bjrklund, Wim Martens, Thomas Schwentick |
| 2007 | FCT | On Notions of Regularity for Data Languages. | Henrik Bjrklund, Thomas Schwentick |
| 2007 | ICALP | Bounded Depth Data Trees. | Henrik Bjrklund, Mikolaj Bojanczyk |
| 2007 | MFCS | Shuffle Expressions and Words with Nested Data. | Henrik Bjrklund, Mikolaj Bojanczyk |
| 2004 | MFCS | A Combinatorial Strongly Subexponential Strategy Improvement Algorithm for Mean Payoff Games. | Henrik Bjrklund, Sven Sandberg, Sergei G. Vorobyov |
| 2003 | STACS | A Discrete Subexponential Algorithm for Parity Games. | Henrik Bjrklund, Sven Sandberg, Sergei G. Vorobyov |