References in zbMATH (referenced in 13 articles )

Showing results 1 to 13 of 13.
Sorted by year (citations)

  1. Kelk, Steven; Fischer, Mareike; Moulton, Vincent; Wu, Taoyang: Reduction rules for the maximum parsimony distance on phylogenetic trees (2016)
  2. Kelk, Steven; van Iersel, Leo; Scornavacca, Celine; Weller, Mathias: Phylogenetic incongruence through the lens of monadic second order logic (2016)
  3. Burton, Benjamin A.; Maria, Clément; Spreer, Jonathan: Algorithms and complexity for Turaev-Viro invariants (2015)
  4. Charwat, Günther; Dvořák, Wolfgang; Gaggl, Sarah A.; Wallner, Johannes P.; Woltran, Stefan: Methods for solving reasoning problems in abstract argumentation -- a survey (2015)
  5. Cornelissen, Gunther; Kato, Fumiharu; Kool, Janne: A combinatorial Li-Yau inequality and rational points on curves (2015)
  6. Fafianie, Stefan; Bodlaender, Hans; Nederlof, Jesper: Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions (2015)
  7. Grigoriev, Alexander; Kelk, Steven; Lekić, Nela: On low treewidth graphs and supertrees (2015)
  8. Klymko, Christine; Sullivan, Blair D.; Humble, Travis S.: Adiabatic quantum programming: minor embedding with hard faults (2014)
  9. Sviridenko, A.V.; Shcherbina, O.A.: Block local elimination algorithms for sparse discrete optimization problems (2013)
  10. Bodlaender, Hans L.; Koster, Arie M.C.A.: Treewidth computations. II. Lower bounds (2011)
  11. Bui-Xuan, Binh-Minh; Telle, Jan Arne; Vatshelle, Martin: Boolean-width of graphs (2011)
  12. Kneis, Joachim; Langer, Alexander; Rossmanith, Peter: Courcelle’s theorem -- a game-theoretic approach (2011)
  13. Bodlaender, Hans L.; Koster, Arie M.C.A.: Treewidth computations. I: Upper bounds (2010)