{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:51:37Z","timestamp":1773481897182,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,14]],"date-time":"2020-06-14T00:00:00Z","timestamp":1592092800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["412400621"],"award-info":[{"award-number":["412400621"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001742","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1295\/15, 768\/19"],"award-info":[{"award-number":["1295\/15, 768\/19"]}],"id":[{"id":"10.13039\/501100001742","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Israel Cyber Bureau"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,14]]},"DOI":"10.1145\/3375395.3387664","type":"proceedings-article","created":{"date-parts":[[2020,5,29]],"date-time":"2020-05-29T15:10:29Z","timestamp":1590765029000},"page":"285-297","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["The Impact of Negation on the Complexity of the Shapley Value in Conjunctive Queries"],"prefix":"10.1145","author":[{"given":"Alon","family":"Reshef","sequence":"first","affiliation":[{"name":"Technion - Israel Institute of Technology, Haifa, Israel"}]},{"given":"Benny","family":"Kimelfeld","sequence":"additional","affiliation":[{"name":"Technion - Israel Institute of Technology, Haifa, Israel"}]},{"given":"Ester","family":"Livshits","sequence":"additional","affiliation":[{"name":"Technion - Israel Institute of Technology, Haifa, Israel"}]}],"member":"320","published-online":{"date-parts":[[2020,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/3176764.3176785"},{"key":"e_1_3_2_1_2_1","volume-title":"WG (WG '02)","author":"Berry Anne","unstructured":"Anne Berry , Jean R. S. Blair , and Pinar Heggernes . 2002. Maximum Cardinality Search for Computing Minimal Triangulations . In WG (WG '02) . Springer-Verlag , London, UK , UK, 1--12. Anne Berry, Jean R. S. Blair, and Pinar Heggernes. 2002. Maximum Cardinality Search for Computing Minimal Triangulations. In WG (WG '02). Springer-Verlag, London, UK, UK, 1--12."},{"key":"e_1_3_2_1_3_1","volume-title":"Jean Paul Bordat, and Olivier Cogis","author":"Berry Anne","year":"1999","unstructured":"Anne Berry , Jean Paul Bordat, and Olivier Cogis . 1999 . Generating All the Minimal Separators of a Graph. In WG (LNCS), Vol. 1665 . Springer , 167--172. Anne Berry, Jean Paul Bordat, and Olivier Cogis. 1999. Generating All the Minimal Separators of a Graph. In WG (LNCS), Vol. 1665. Springer, 167--172."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1140411.1712370"},{"key":"e_1_3_2_1_5_1","volume-title":"Graph theory and sparse matrix computation","author":"Blair Jean RS","unstructured":"Jean RS Blair and Barry Peyton . 1993. An introduction to chordal graphs and clique trees . In Graph theory and sparse matrix computation . Springer , 1--29. Jean RS Blair and Barry Peyton. 1993. An introduction to chordal graphs and clique trees. In Graph theory and sparse matrix computation. Springer, 1--29."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793251219"},{"key":"e_1_3_2_1_7_1","volume-title":"STACS (Lecture Notes in Computer Science)","author":"Bouchitt\u00e9 Vincent","unstructured":"Vincent Bouchitt\u00e9 and Ioan Todinca . 1999. Treewidth and Minimum Fill-in of Weakly Triangulated Graphs . In STACS (Lecture Notes in Computer Science) , Vol. 1563 . Springer , 197--206. Vincent Bouchitt\u00e9 and Ioan Todinca. 1999. Treewidth and Minimum Fill-in of Weakly Triangulated Graphs. In STACS (Lecture Notes in Computer Science), Vol. 1563. Springer, 197--206."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799359683"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00007-X"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Nofar Carmeli Batya Kenig and Benny Kimelfeld. 2017. Efficiently Enumerating Minimal Triangulations. In PODS. ACM 273--287.  Nofar Carmeli Batya Kenig and Benny Kimelfeld. 2017. Efficiently Enumerating Minimal Triangulations. In PODS. ACM 273--287.","DOI":"10.1145\/3034786.3056109"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2008.04.003"},{"key":"e_1_3_2_1_12_1","volume-title":"Rosamond","author":"Dell Holger","year":"2017","unstructured":"Holger Dell , Thore Husfeldt , Bart M. P. Jansen , Petteri Kaski , Christian Komusiewicz , and Frances A . Rosamond . 2017 . The First Parameterized Algorithms and Computational Experiments Challenge. In IPEC (Leibniz International Proceedings in Informatics (LIPIcs)) , Vol. 63 . 30:1--30:9. Holger Dell, Thore Husfeldt, Bart M. P. Jansen, Petteri Kaski, Christian Komusiewicz, and Frances A. Rosamond. 2017. The First Parameterized Algorithms and Computational Experiments Challenge. In IPEC (Leibniz International Proceedings in Informatics (LIPIcs)), Vol. 63. 30:1--30:9."},{"key":"e_1_3_2_1_13_1","volume-title":"Fellows","author":"Downey Rodney G.","year":"1999","unstructured":"Rodney G. Downey and Michael R . Fellows . 1999 . Parameterized Complexity .Springer. Rodney G. Downey and Michael R. Fellows. 1999. Parameterized Complexity .Springer."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/140964801"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.03.013"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402739"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622519.1622530"},{"key":"e_1_3_2_1_18_1","volume-title":"WG (LNCS)","author":"Gottlob Georg","unstructured":"Georg Gottlob , Martin Grohe , Nysret Musliu , Marko Samer , and Francesco Scarcello . 2005 b. Hypertree Decompositions: Structure, Algorithms, and Applications . In WG (LNCS) , Vol. 3787 . Springer , 1--15. Georg Gottlob, Martin Grohe, Nysret Musliu, Marko Samer, and Francesco Scarcello. 2005 b. Hypertree Decompositions: Structure, Algorithms, and Applications. In WG (LNCS), Vol. 3787. Springer, 1--15."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1809"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1568318.1568320"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2636918"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90065-8"},{"key":"e_1_3_2_1_23_1","unstructured":"Oren Kalinsky Yoav Etsion and Benny Kimelfeld. 2017. Flexible Caching in Trie Joins. In EDBT. OpenProceedings.org 282--293.  Oren Kalinsky Yoav Etsion and Benny Kimelfeld. 2017. Flexible Caching in Trie Joins. In EDBT. OpenProceedings.org 282--293."},{"key":"e_1_3_2_1_24_1","volume-title":"SUM (LNCS)","author":"Kenig Batya","unstructured":"Batya Kenig and Avigdor Gal . 2015. On the Impact of Junction-Tree Topology on Weighted Model Counting . In SUM (LNCS) , Vol. 9310 . Springer , 83--98. Batya Kenig and Avigdor Gal. 2015. On the Impact of Junction-Tree Topology on Weighted Model Counting. In SUM (LNCS), Vol. 9310. Springer, 83--98."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(96)00206-X"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2000.1713"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"S. Lauritzen and D. J. Spiegelhalter. 1988. Local Computations with Probabilities on Graphical Structures and Their Application to Expert Systems. Journal of the Royal Statistical Society Vol. B 50 2 (1988) 157--224.  S. Lauritzen and D. J. Spiegelhalter. 1988. Local Computations with Probabilities on Graphical Structures and Their Application to Expert Systems. Journal of the Royal Statistical Society Vol. B 50 2 (1988) 157--224.","DOI":"10.1111\/j.2517-6161.1988.tb01721.x"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.18.7.401"},{"key":"e_1_3_2_1_29_1","first-page":"499","article-title":"Beyond Classes of Graphs with \"Few","volume":"9224","author":"Liedloff Mathieu","year":"2015","unstructured":"Mathieu Liedloff , Pedro Montealegre , and Ioan Todinca . 2015 . Beyond Classes of Graphs with \"Few \" Minimal Separators: FPT Results Through Potential Maximal Cliques. In WG (LNCS) , Vol. 9224. Spring er, 499 -- 512 . Mathieu Liedloff, Pedro Montealegre, and Ioan Todinca. 2015. Beyond Classes of Graphs with \"Few\" Minimal Separators: FPT Results Through Potential Maximal Cliques. In WG (LNCS), Vol. 9224. Springer, 499--512.","journal-title":"Minimal Separators: FPT Results Through Potential Maximal Cliques. In WG (LNCS)"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1721837.1721845"},{"key":"e_1_3_2_1_32_1","first-page":"183","article-title":"On Distance-d Independent Set and Other Problems in Graphs with \"few","volume":"9941","author":"Montealegre Pedro","year":"2016","unstructured":"Pedro Montealegre and Ioan Todinca . 2016 . On Distance-d Independent Set and Other Problems in Graphs with \"few \" Minimal Separators. In WG (LNCS) , Vol. 9941. 183 -- 194 . Pedro Montealegre and Ioan Todinca. 2016. On Distance-d Independent Set and Other Problems in Graphs with \"few\" Minimal Separators. In WG (LNCS), Vol. 9941. 183--194.","journal-title":"Minimal Separators. In WG (LNCS)"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.16.3.682"},{"key":"e_1_3_2_1_34_1","volume-title":"SWAT (LNCS)","author":"Otachi Yota","unstructured":"Yota Otachi and Pascal Schweitzer . 2014. Reduction Techniques for Graph Isomorphism in the Context of Width Parameters . In SWAT (LNCS) , Vol. 8503 . Springer , 368--379. Yota Otachi and Pascal Schweitzer. 2014. Reduction Techniques for Graph Isomorphism in the Context of Width Parameters. In SWAT (LNCS), Vol. 8503. Springer, 368--379."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(97)00041-3"},{"key":"e_1_3_2_1_36_1","volume-title":"Ranked Enumeration of Minimal Triangulations. CoRR","author":"Ravid Noam","year":"2017","unstructured":"Noam Ravid , Dori Medini , and Benny Kimelfeld . 2017. Ranked Enumeration of Minimal Triangulations. CoRR , Vol. abs\/ 1709 .10254 ( 2017 ). Noam Ravid, Dori Medini, and Benny Kimelfeld. 2017. Ranked Enumeration of Minimal Triangulations. CoRR, Vol. abs\/1709.10254 (2017)."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(70)90282-9"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/0213035"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2764946"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Jizhen Zhao Russell L. Malmberg and Liming Cai. 2006. Rapid ab initio RNA Folding Including Pseudoknots Via Graph Tree Decomposition. In WABI. 262--273.  Jizhen Zhao Russell L. Malmberg and Liming Cai. 2006. Rapid ab initio RNA Folding Including Pseudoknots Via Graph Tree Decomposition. In WABI. 262--273.","DOI":"10.1007\/11851561_25"}],"event":{"name":"SIGMOD\/PODS '20: International Conference on Management of Data","location":"Portland OR USA","acronym":"SIGMOD\/PODS '20","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3375395.3387664","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3375395.3387664","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:32:49Z","timestamp":1750199569000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3375395.3387664"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,14]]},"references-count":39,"alternative-id":["10.1145\/3375395.3387664","10.1145\/3375395"],"URL":"https:\/\/doi.org\/10.1145\/3375395.3387664","relation":{},"subject":[],"published":{"date-parts":[[2020,6,14]]},"assertion":[{"value":"2020-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}