A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games H Björklund, S Vorobyov Discrete Applied Mathematics 155 (2), 210-229, 2007 | 160 | 2007 |

On notions of regularity for data languages H Björklund, T Schwentick Theoretical Computer Science 411 (4-5), 702-715, 2010 | 102 | 2010 |

A discrete subexponential algorithm for parity games H Björklund, S Sandberg, S Vorobyov Annual Symposium on Theoretical Aspects of Computer Science, 663-674, 2003 | 90 | 2003 |

Memoryless determinacy of parity and mean payoff games: a simple proof H Björklund, S Sandberg, S Vorobyov Theoretical Computer Science 310 (1-3), 365-378, 2004 | 63 | 2004 |

Conjunctive query containment over trees H Björklund, W Martens, T Schwentick Journal of Computer and System Sciences 77 (3), 450-472, 2011 | 58* | 2011 |

Optimizing conjunctive queries over trees using schema information H Björklund, W Martens, T Schwentick International Symposium on Mathematical Foundations of Computer Science, 132-143, 2008 | 54 | 2008 |

The tractability frontier for NFA minimization H Björklund, W Martens Journal of Computer and System Sciences 78 (1), 198-210, 2012 | 51* | 2012 |

Combinatorial structure and randomized subexponential algorithms for infinite games H Björklund, S Vorobyov Theoretical Computer Science 349 (3), 347-360, 2005 | 41 | 2005 |

Shuffled languages—representation and recognition M Berglund, H Björklund, J Björklund Theoretical Computer Science 489, 1-20, 2013 | 36* | 2013 |

Incremental xpath evaluation H Björklund, W Gelade, W Martens ACM Transactions on Database Systems (TODS) 35 (4), 1-43, 2010 | 31 | 2010 |

Shuffle expressions and words with nested data H Björklund, M Bojańczyk International Symposium on Mathematical Foundations of Computer Science, 750-761, 2007 | 28 | 2007 |

Optimization on completely unimodal hypercubes H BjЈorklund, S Sandberg, S Vorobyov | 24 | 2002 |

Between a rock and a hard place–uniform parsing for hyperedge replacement DAG grammars H Björklund, F Drewes, P Ericson Language and Automata Theory and Applications, 521-532, 2016 | 22 | 2016 |

Linear complementarity algorithms for mean payoff games H Björklund, O Svensson, S Vorobyov Technical Report DIMACS-2005-05, DIMACS: Center for Discrete Mathematics and …, 2005 | 21 | 2005 |

Complexity of model checking by iterative improvement: the pseudo-Boolean framework H Björklund, S Sandberg, S Vorobyov International Andrei Ershov Memorial Conference on Perspectives of System …, 2003 | 21 | 2003 |

Bounded depth data trees H Björklund, M Bojańczyk International Colloquium on Automata, Languages, and Programming, 862-874, 2007 | 17 | 2007 |

Randomized subexponential algorithms for parity games H BjЈorklund, S Sandberg, S Vorobyov | 15 | 2003 |

On combinatorial structure and algorithms for parity games H BjЈorklund, S Sandberg, S Vorobyov | 15 | 2003 |

Validity of tree pattern queries with respect to schema information H Björklund, W Martens, T Schwentick International Symposium on Mathematical Foundations of Computer Science, 171-182, 2013 | 14 | 2013 |

Efficient incremental evaluation of succinct regular expressions H Björklund, W Martens, T Timm Proceedings of the 24th ACM International on Conference on Information and …, 2015 | 12 | 2015 |