References in zbMATH (referenced in 25 articles )

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

1 2 next

  1. Abseher, Michael; Musliu, Nysret; Woltran, Stefan: Htd - a free, open-source framework for (customized) tree decompositions and beyond (2017)
  2. Cifuentes, Diego; Parrilo, Pablo A.: Chordal networks of polynomial ideals (2017)
  3. Madani, Ramtin; Sojoudi, Somayeh; Fazelnia, Ghazal; Lavaei, Javad: Finding low-rank solutions of sparse linear matrix inequalities using convex optimization (2017)
  4. van Wersch, Rim; Kelk, Steven: ToTo: an open database for computation, storage and retrieval of tree decompositions (2017)
  5. Coudert, David; Mazauric, Dorian; Nisse, Nicolas: Experimental evaluation of a branch-and-bound algorithm for computing pathwidth and directed pathwidth (2016)
  6. Dibbelt, Julian; Strasser, Ben; Wagner, Dorothea: Customizable contraction hierarchies (2016)
  7. Kelk, Steven; Fischer, Mareike; Moulton, Vincent; Wu, Taoyang: Reduction rules for the maximum parsimony distance on phylogenetic trees (2016)
  8. Kelk, Steven; van Iersel, Leo; Scornavacca, Celine; Weller, Mathias: Phylogenetic incongruence through the lens of monadic second order logic (2016)
  9. Burton, Benjamin A.; Maria, Clément; Spreer, Jonathan: Algorithms and complexity for Turaev-Viro invariants (2015)
  10. 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)
  11. Cornelissen, Gunther; Kato, Fumiharu; Kool, Janne: A combinatorial Li-Yau inequality and rational points on curves (2015)
  12. 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)
  13. Grigoriev, Alexander; Kelk, Steven; Lekić, Nela: On low treewidth graphs and supertrees (2015)
  14. Keiren, Jeroen J.A.: Benchmarks for parity games (2015)
  15. Ogden, Helen E.: A sequential reduction method for inference in generalized linear mixed models (2015)
  16. Klymko, Christine; Sullivan, Blair D.; Humble, Travis S.: Adiabatic quantum programming: minor embedding with hard faults (2014)
  17. Sviridenko, A.V.; Shcherbina, O.A.: Block local elimination algorithms for sparse discrete optimization problems (2013) ioport
  18. Bodlaender, Hans L.: Fixed-parameter tractability of treewidth and pathwidth (2012)
  19. Hvidevold, Eivind Magnus; Sharmin, Sadia; Telle, Jan Arne; Vatshelle, Martin: Finding good decompositions for dynamic programming on dense graphs (2012)
  20. Bodlaender, Hans L.; Koster, Arie M.C.A.: Treewidth computations. II. Lower bounds (2011)

1 2 next