Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology

Hecher, Markus; Thier, Patrick; Woltran, Stefan

doi:10.1007/978-3-030-51825-7_25

by Markus Hecher, Patrick Thier, Stefan Woltran

Reference:

Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database TechnologyMarkus Hecher, Patrick Thier, Stefan WoltranTheory and Applications of Satisfiability Testing - SAT 2020 - 23rd International Conference, Alghero, Italy, July 3-10, 2020, Proceedings (Luca Pulina, Martina Seidl, eds.), volume 12178 of Lecture Notes in Computer Science, pages 343–360, 2020, Springer Verlag.

Bibtex Entry:

@string{springer="Springer Verlag"}
@inproceedings{HecherTW20,
keywords = "reveal",
  author    = {Markus Hecher and Patrick Thier and Stefan Woltran},
  title     = {Taming High Treewidth with Abstraction, Nested Dynamic Programming,
               and Database Technology},
  booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2020 - 23rd
               International Conference, Alghero, Italy, July 3-10, 2020, Proceedings},
  pages     = {343--360},
  year      = {2020},
  xxxurl       = {https://doi.org/10.1007/978-3-030-51825-7\_25},
  doi       = {10.1007/978-3-030-51825-7\_25},
  editor    = {Luca Pulina and
               Martina Seidl},
  series    = {Lecture Notes in Computer Science},
  volume    = {12178},
  publisher = {Springer},
  year      = {2020},
  xxxurl       = {https://doi.org/10.1007/978-3-030-51825-7},
  xxxdoi       = {10.1007/978-3-030-51825-7},
  xxxisbn      = {978-3-030-51824-0},
}