BibTeX records: Batya Kenig

download as .bib file

@inproceedings{DBLP:conf/pods/KenigW23,
  author       = {Batya Kenig and
                  Nir Weinberger},
  editor       = {Floris Geerts and
                  Hung Q. Ngo and
                  Stavros Sintos},
  title        = {Quantifying the Loss of Acyclic Join Dependencies},
  booktitle    = {Proceedings of the 42nd {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles
                  of Database Systems, {PODS} 2023, Seattle, WA, USA, June 18-23, 2023},
  pages        = {329--338},
  publisher    = {{ACM}},
  year         = {2023},
  url          = {https://doi.org/10.1145/3584372.3588658},
  doi          = {10.1145/3584372.3588658},
  timestamp    = {Thu, 15 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/pods/KenigW23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2307-00604,
  author       = {Batya Kenig},
  title        = {Ranked Enumeration of Minimal Separators},
  journal      = {CoRR},
  volume       = {abs/2307.00604},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2307.00604},
  doi          = {10.48550/ARXIV.2307.00604},
  eprinttype    = {arXiv},
  eprint       = {2307.00604},
  timestamp    = {Mon, 10 Jul 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2307-00604.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2310-13942,
  author       = {Batya Kenig},
  title        = {Approximate Implication for Probabilistic Graphical Models},
  journal      = {CoRR},
  volume       = {abs/2310.13942},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2310.13942},
  doi          = {10.48550/ARXIV.2310.13942},
  eprinttype    = {arXiv},
  eprint       = {2310.13942},
  timestamp    = {Fri, 27 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2310-13942.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/lmcs/KenigS22,
  author       = {Batya Kenig and
                  Dan Suciu},
  title        = {Integrity Constraints Revisited: From Exact to Approximate Implication},
  journal      = {Log. Methods Comput. Sci.},
  volume       = {18},
  number       = {1},
  year         = {2022},
  url          = {https://doi.org/10.46298/lmcs-18(1:5)2022},
  doi          = {10.46298/LMCS-18(1:5)2022},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/lmcs/KenigS22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2210-14572,
  author       = {Batya Kenig and
                  Nir Weinberger},
  title        = {Quantifying the Loss of Acyclic Join Dependencies},
  journal      = {CoRR},
  volume       = {abs/2210.14572},
  year         = {2022},
  url          = {https://doi.org/10.48550/arXiv.2210.14572},
  doi          = {10.48550/ARXIV.2210.14572},
  eprinttype    = {arXiv},
  eprint       = {2210.14572},
  timestamp    = {Mon, 31 Oct 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2210-14572.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/CarmeliKKK21,
  author       = {Nofar Carmeli and
                  Batya Kenig and
                  Benny Kimelfeld and
                  Markus Kr{\"{o}}ll},
  title        = {Efficiently enumerating minimal triangulations},
  journal      = {Discret. Appl. Math.},
  volume       = {303},
  pages        = {216--236},
  year         = {2021},
  url          = {https://doi.org/10.1016/j.dam.2020.05.034},
  doi          = {10.1016/J.DAM.2020.05.034},
  timestamp    = {Sun, 06 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/CarmeliKKK21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/pods/KenigS21,
  author       = {Batya Kenig and
                  Dan Suciu},
  editor       = {Leonid Libkin and
                  Reinhard Pichler and
                  Paolo Guagliardo},
  title        = {A Dichotomy for the Generalized Model Counting Problem for Unions
                  of Conjunctive Queries},
  booktitle    = {PODS'21: Proceedings of the 40th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium
                  on Principles of Database Systems, Virtual Event, China, June 20-25,
                  2021},
  pages        = {312--324},
  publisher    = {{ACM}},
  year         = {2021},
  url          = {https://doi.org/10.1145/3452021.3458313},
  doi          = {10.1145/3452021.3458313},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/pods/KenigS21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/uai/Kenig21,
  author       = {Batya Kenig},
  editor       = {Cassio P. de Campos and
                  Marloes H. Maathuis and
                  Erik Quaeghebeur},
  title        = {Approximate implication with d-separation},
  booktitle    = {Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial
                  Intelligence, {UAI} 2021, Virtual Event, 27-30 July 2021},
  series       = {Proceedings of Machine Learning Research},
  volume       = {161},
  pages        = {301--311},
  publisher    = {{AUAI} Press},
  year         = {2021},
  url          = {https://proceedings.mlr.press/v161/kenig21a.html},
  timestamp    = {Fri, 17 Dec 2021 17:06:27 +0100},
  biburl       = {https://dblp.org/rec/conf/uai/Kenig21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2105-14463,
  author       = {Batya Kenig},
  title        = {Approximate Implication with d-Separation},
  journal      = {CoRR},
  volume       = {abs/2105.14463},
  year         = {2021},
  url          = {https://arxiv.org/abs/2105.14463},
  eprinttype    = {arXiv},
  eprint       = {2105.14463},
  timestamp    = {Wed, 02 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2105-14463.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icdt/KenigS20,
  author       = {Batya Kenig and
                  Dan Suciu},
  editor       = {Carsten Lutz and
                  Jean Christoph Jung},
  title        = {Integrity Constraints Revisited: From Exact to Approximate Implication},
  booktitle    = {23rd International Conference on Database Theory, {ICDT} 2020, March
                  30-April 2, 2020, Copenhagen, Denmark},
  series       = {LIPIcs},
  volume       = {155},
  pages        = {18:1--18:20},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2020},
  url          = {https://doi.org/10.4230/LIPIcs.ICDT.2020.18},
  doi          = {10.4230/LIPICS.ICDT.2020.18},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/icdt/KenigS20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sigmod/KenigMPSS20,
  author       = {Batya Kenig and
                  Pranay Mundra and
                  Guna Prasaad and
                  Babak Salimi and
                  Dan Suciu},
  editor       = {David Maier and
                  Rachel Pottinger and
                  AnHai Doan and
                  Wang{-}Chiew Tan and
                  Abdussalam Alawini and
                  Hung Q. Ngo},
  title        = {Mining Approximate Acyclic Schemes from Relations},
  booktitle    = {Proceedings of the 2020 International Conference on Management of
                  Data, {SIGMOD} Conference 2020, online conference [Portland, OR, USA],
                  June 14-19, 2020},
  pages        = {297--312},
  publisher    = {{ACM}},
  year         = {2020},
  url          = {https://doi.org/10.1145/3318464.3380573},
  doi          = {10.1145/3318464.3380573},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/sigmod/KenigMPSS20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2008-00896,
  author       = {Batya Kenig and
                  Dan Suciu},
  title        = {A Dichotomy for the Generalized Model Counting Problem for Unions
                  of Conjunctive Queries},
  journal      = {CoRR},
  volume       = {abs/2008.00896},
  year         = {2020},
  url          = {https://arxiv.org/abs/2008.00896},
  eprinttype    = {arXiv},
  eprint       = {2008.00896},
  timestamp    = {Fri, 07 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2008-00896.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/aaai/KenigK19,
  author       = {Batya Kenig and
                  Benny Kimelfeld},
  title        = {Approximate Inference of Outcomes in Probabilistic Elections},
  booktitle    = {The Thirty-Third {AAAI} Conference on Artificial Intelligence, {AAAI}
                  2019, The Thirty-First Innovative Applications of Artificial Intelligence
                  Conference, {IAAI} 2019, The Ninth {AAAI} Symposium on Educational
                  Advances in Artificial Intelligence, {EAAI} 2019, Honolulu, Hawaii,
                  USA, January 27 - February 1, 2019},
  pages        = {2061--2068},
  publisher    = {{AAAI} Press},
  year         = {2019},
  url          = {https://doi.org/10.1609/aaai.v33i01.33012061},
  doi          = {10.1609/AAAI.V33I01.33012061},
  timestamp    = {Mon, 04 Sep 2023 12:29:24 +0200},
  biburl       = {https://dblp.org/rec/conf/aaai/KenigK19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/atal/Kenig19,
  author       = {Batya Kenig},
  editor       = {Edith Elkind and
                  Manuela Veloso and
                  Noa Agmon and
                  Matthew E. Taylor},
  title        = {The Complexity of the Possible Winner Problem with Partitioned Preferences},
  booktitle    = {Proceedings of the 18th International Conference on Autonomous Agents
                  and MultiAgent Systems, {AAMAS} '19, Montreal, QC, Canada, May 13-17,
                  2019},
  pages        = {2051--2053},
  publisher    = {International Foundation for Autonomous Agents and Multiagent Systems},
  year         = {2019},
  url          = {http://dl.acm.org/citation.cfm?id=3332007},
  timestamp    = {Wed, 29 May 2019 16:36:58 +0200},
  biburl       = {https://dblp.org/rec/conf/atal/Kenig19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1911-12933,
  author       = {Batya Kenig and
                  Pranay Mundra and
                  Guna Prasaad and
                  Babak Salimi and
                  Dan Suciu},
  title        = {Mining Approximate Acyclic Schemes from Relations},
  journal      = {CoRR},
  volume       = {abs/1911.12933},
  year         = {2019},
  url          = {http://arxiv.org/abs/1911.12933},
  eprinttype    = {arXiv},
  eprint       = {1911.12933},
  timestamp    = {Fri, 05 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1911-12933.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/aaai/KenigIPKS18,
  author       = {Batya Kenig and
                  Lovro Ilijasic and
                  Haoyue Ping and
                  Benny Kimelfeld and
                  Julia Stoyanovich},
  editor       = {Sheila A. McIlraith and
                  Kilian Q. Weinberger},
  title        = {Probabilistic Inference Over Repeated Insertion Models},
  booktitle    = {Proceedings of the Thirty-Second {AAAI} Conference on Artificial Intelligence,
                  (AAAI-18), the 30th innovative Applications of Artificial Intelligence
                  (IAAI-18), and the 8th {AAAI} Symposium on Educational Advances in
                  Artificial Intelligence (EAAI-18), New Orleans, Louisiana, USA, February
                  2-7, 2018},
  pages        = {1897--1904},
  publisher    = {{AAAI} Press},
  year         = {2018},
  url          = {https://doi.org/10.1609/aaai.v32i1.11541},
  doi          = {10.1609/AAAI.V32I1.11541},
  timestamp    = {Mon, 04 Sep 2023 12:29:24 +0200},
  biburl       = {https://dblp.org/rec/conf/aaai/KenigIPKS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sigmod/CohenKPKS18,
  author       = {Uzi Cohen and
                  Batya Kenig and
                  Haoyue Ping and
                  Benny Kimelfeld and
                  Julia Stoyanovich},
  editor       = {Gautam Das and
                  Christopher M. Jermaine and
                  Philip A. Bernstein},
  title        = {A Query Engine for Probabilistic Preferences},
  booktitle    = {Proceedings of the 2018 International Conference on Management of
                  Data, {SIGMOD} Conference 2018, Houston, TX, USA, June 10-15, 2018},
  pages        = {1509--1524},
  publisher    = {{ACM}},
  year         = {2018},
  url          = {https://doi.org/10.1145/3183713.3196923},
  doi          = {10.1145/3183713.3196923},
  timestamp    = {Wed, 21 Nov 2018 12:44:08 +0100},
  biburl       = {https://dblp.org/rec/conf/sigmod/CohenKPKS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1802-09001,
  author       = {Batya Kenig},
  title        = {The Complexity of the Possible Winner Problem over Partitioned Preferences},
  journal      = {CoRR},
  volume       = {abs/1802.09001},
  year         = {2018},
  url          = {http://arxiv.org/abs/1802.09001},
  eprinttype    = {arXiv},
  eprint       = {1802.09001},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1802-09001.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1812-09987,
  author       = {Batya Kenig and
                  Dan Suciu},
  title        = {Integrity Constraints Revisited: From Exact to Approximate Implication},
  journal      = {CoRR},
  volume       = {abs/1812.09987},
  year         = {2018},
  url          = {http://arxiv.org/abs/1812.09987},
  eprinttype    = {arXiv},
  eprint       = {1812.09987},
  timestamp    = {Wed, 02 Jan 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1812-09987.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/amw/KenigKPS17,
  author       = {Batya Kenig and
                  Benny Kimelfeld and
                  Haoyue Ping and
                  Julia Stoyanovich},
  editor       = {Juan L. Reutter and
                  Divesh Srivastava},
  title        = {A Database Framework for Probabilistic Preferences},
  booktitle    = {Proceedings of the 11th Alberto Mendelzon International Workshop on
                  Foundations of Data Management and the Web, Montevideo, Uruguay, June
                  7-9, 2017},
  series       = {{CEUR} Workshop Proceedings},
  volume       = {1912},
  publisher    = {CEUR-WS.org},
  year         = {2017},
  url          = {https://ceur-ws.org/Vol-1912/paper1.pdf},
  timestamp    = {Fri, 10 Mar 2023 16:23:19 +0100},
  biburl       = {https://dblp.org/rec/conf/amw/KenigKPS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/pods/KenigKPS17,
  author       = {Batya Kenig and
                  Benny Kimelfeld and
                  Haoyue Ping and
                  Julia Stoyanovich},
  editor       = {Emanuel Sallinger and
                  Jan Van den Bussche and
                  Floris Geerts},
  title        = {Querying Probabilistic Preferences in Databases},
  booktitle    = {Proceedings of the 36th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles
                  of Database Systems, {PODS} 2017, Chicago, IL, USA, May 14-19, 2017},
  pages        = {21--36},
  publisher    = {{ACM}},
  year         = {2017},
  url          = {https://doi.org/10.1145/3034786.3056111},
  doi          = {10.1145/3034786.3056111},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/pods/KenigKPS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/pods/CarmeliKK17,
  author       = {Nofar Carmeli and
                  Batya Kenig and
                  Benny Kimelfeld},
  editor       = {Emanuel Sallinger and
                  Jan Van den Bussche and
                  Floris Geerts},
  title        = {Efficiently Enumerating Minimal Triangulations},
  booktitle    = {Proceedings of the 36th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles
                  of Database Systems, {PODS} 2017, Chicago, IL, USA, May 14-19, 2017},
  pages        = {273--287},
  publisher    = {{ACM}},
  year         = {2017},
  url          = {https://doi.org/10.1145/3034786.3056109},
  doi          = {10.1145/3034786.3056109},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/pods/CarmeliKK17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/aaai/KenigG16,
  author       = {Batya Kenig and
                  Avigdor Gal},
  editor       = {Adnan Darwiche},
  title        = {Exploiting the Hidden Structure of Junction Trees for {MPE}},
  booktitle    = {Beyond NP, Papers from the 2016 {AAAI} Workshop, Phoenix, Arizona,
                  USA, February 12, 2016},
  series       = {{AAAI} Technical Report},
  volume       = {{WS-16-05}},
  publisher    = {{AAAI} Press},
  year         = {2016},
  url          = {http://www.aaai.org/ocs/index.php/WS/AAAIW16/paper/view/12563},
  timestamp    = {Tue, 05 Sep 2023 08:59:27 +0200},
  biburl       = {https://dblp.org/rec/conf/aaai/KenigG16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/amw/CarmeliKK16,
  author       = {Nofar Carmeli and
                  Batya Kenig and
                  Benny Kimelfeld},
  editor       = {Reinhard Pichler and
                  Altigran Soares da Silva},
  title        = {On the Enumeration of Tree Decompositions},
  booktitle    = {Proceedings of the 10th Alberto Mendelzon International Workshop on
                  Foundations of Data Management, Panama City, Panama, May 8-10, 2016},
  series       = {{CEUR} Workshop Proceedings},
  volume       = {1644},
  publisher    = {CEUR-WS.org},
  year         = {2016},
  url          = {https://ceur-ws.org/Vol-1644/paper36.pdf},
  timestamp    = {Fri, 10 Mar 2023 16:23:19 +0100},
  biburl       = {https://dblp.org/rec/conf/amw/CarmeliKK16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/CarmeliKK16,
  author       = {Nofar Carmeli and
                  Batya Kenig and
                  Benny Kimelfeld},
  title        = {On the Enumeration of all Minimal Triangulations},
  journal      = {CoRR},
  volume       = {abs/1604.02833},
  year         = {2016},
  url          = {http://arxiv.org/abs/1604.02833},
  eprinttype    = {arXiv},
  eprint       = {1604.02833},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/CarmeliKK16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sum/KenigG15,
  author       = {Batya Kenig and
                  Avigdor Gal},
  editor       = {Christoph Beierle and
                  Alex Dekhtyar},
  title        = {On the Impact of Junction-Tree Topology on Weighted Model Counting},
  booktitle    = {Scalable Uncertainty Management - 9th International Conference, {SUM}
                  2015, Qu{\'{e}}bec City, QC, Canada, September 16-18, 2015. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {9310},
  pages        = {83--98},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-319-23540-0\_6},
  doi          = {10.1007/978-3-319-23540-0\_6},
  timestamp    = {Tue, 14 May 2019 10:00:52 +0200},
  biburl       = {https://dblp.org/rec/conf/sum/KenigG15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/is/KenigG13,
  author       = {Batya Kenig and
                  Avigdor Gal},
  title        = {MFIBlocks: An effective blocking algorithm for entity resolution},
  journal      = {Inf. Syst.},
  volume       = {38},
  number       = {6},
  pages        = {908--926},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.is.2012.11.008},
  doi          = {10.1016/J.IS.2012.11.008},
  timestamp    = {Sat, 20 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/is/KenigG13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sum/KenigGS13,
  author       = {Batya Kenig and
                  Avigdor Gal and
                  Ofer Strichman},
  editor       = {Weiru Liu and
                  V. S. Subrahmanian and
                  Jef Wijsen},
  title        = {A New Class of Lineage Expressions over Probabilistic Databases Computable
                  in P-Time},
  booktitle    = {Scalable Uncertainty Management - 7th International Conference, {SUM}
                  2013, Washington, DC, USA, September 16-18, 2013. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8078},
  pages        = {219--232},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-40381-1\_17},
  doi          = {10.1007/978-3-642-40381-1\_17},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/sum/KenigGS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/datamine/KenigT12,
  author       = {Batya Kenig and
                  Tamir Tassa},
  title        = {A practical approximation algorithm for optimal k-anonymity},
  journal      = {Data Min. Knowl. Discov.},
  volume       = {25},
  number       = {1},
  pages        = {134--168},
  year         = {2012},
  url          = {https://doi.org/10.1007/s10618-011-0235-9},
  doi          = {10.1007/S10618-011-0235-9},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/datamine/KenigT12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.