default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Markus Kröll
@article{DBLP:journals/pacmmod/GuoJKS0ASSRC0G23,
author = {Jinsong Guo and
Aditya Jami and
Markus Kr{\"{o}}ll and
Lukas Schweizer and
Sergey Paramonov and
Eric Aichinger and
Stefano Sferrazza and
Mattia Scaccia and
St{\'{e}}phane Reissfelder and
Eda Cicek and
Giovanni Grasso and
Georg Gottlob},
title = {When Automatic Filtering Comes to the Rescue: Pre-Computing Company
Competitor Pairs in Owler},
journal = {Proc. {ACM} Manag. Data},
volume = {1},
number = {2},
pages = {202:1--202:23},
year = {2023},
url = {https://doi.org/10.1145/3589787},
doi = {10.1145/3589787},
timestamp = {Fri, 07 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pacmmod/GuoJKS0ASSRC0G23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ism2/KrollC23,
author = {Markus Kr{\"{o}}ll and
Christian Cseh},
editor = {Francesco Longo and
Michael Affenzeller and
Antonio Padovano and
Weiming Shen},
title = {Implementation Model for Digital Retrofit for Sustainable Production},
booktitle = {Proceedings of the 4th International Conference on Industry 4.0 and
Smart Manufacturing {(ISM} 2023), Lisbon, Portugal, 22-24 November
2023},
series = {Procedia Computer Science},
volume = {217},
pages = {486--494},
publisher = {Elsevier},
year = {2023},
url = {https://doi.org/10.1016/j.procs.2022.12.244},
doi = {10.1016/J.PROCS.2022.12.244},
timestamp = {Wed, 17 Jan 2024 12:10:00 +0100},
biburl = {https://dblp.org/rec/conf/ism2/KrollC23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/datalog/GottlobGJKRSAS22,
author = {Georg Gottlob and
Jinsong Guo and
Aditya Jami and
Markus Kr{\"{o}}ll and
St{\'{e}}phane Reissfeldee and
Lukas Schweizer and
Eric Aichinger and
Stefano Sferrazza},
editor = {Mario Alviano and
Andreas Pieris},
title = {CompeGen: Computing Company Competitor Pairs By Knowledge Based Inference
Combined With Empirical Validation},
booktitle = {Proceedings of the 4th International Workshop on the Resurgence of
Datalog in Academia and Industry (Datalog-2.0 2022) co-located with
the 16th International Conference on Logic Programming and Nonmonotonic
Reasoning {(LPNMR} 2022), Genova-Nervi, Italy, September 5, 2022},
series = {{CEUR} Workshop Proceedings},
volume = {3203},
pages = {207--211},
publisher = {CEUR-WS.org},
year = {2022},
url = {https://ceur-ws.org/Vol-3203/short9.pdf},
timestamp = {Sun, 06 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/datalog/GottlobGJKRSAS22.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}
}
@article{DBLP:journals/tods/CarmeliK21,
author = {Nofar Carmeli and
Markus Kr{\"{o}}ll},
title = {On the Enumeration Complexity of Unions of Conjunctive Queries},
journal = {{ACM} Trans. Database Syst.},
volume = {46},
number = {2},
pages = {5:1--5:41},
year = {2021},
url = {https://doi.org/10.1145/3450263},
doi = {10.1145/3450263},
timestamp = {Sun, 06 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tods/CarmeliK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CarmeliK20,
author = {Nofar Carmeli and
Markus Kr{\"{o}}ll},
title = {Enumeration Complexity of Conjunctive Queries with Functional Dependencies},
journal = {Theory Comput. Syst.},
volume = {64},
number = {5},
pages = {828--860},
year = {2020},
url = {https://doi.org/10.1007/s00224-019-09937-9},
doi = {10.1007/S00224-019-09937-9},
timestamp = {Sun, 06 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/CarmeliK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CreignouKPSV19,
author = {Nadia Creignou and
Markus Kr{\"{o}}ll and
Reinhard Pichler and
Sebastian Skritek and
Heribert Vollmer},
title = {A complexity theory for hard enumeration problems},
journal = {Discret. Appl. Math.},
volume = {268},
pages = {191--209},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2019.02.025},
doi = {10.1016/J.DAM.2019.02.025},
timestamp = {Sun, 06 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/CreignouKPSV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/CarmeliK19,
author = {Nofar Carmeli and
Markus Kr{\"{o}}ll},
editor = {Dan Suciu and
Sebastian Skritek and
Christoph Koch},
title = {On the Enumeration Complexity of Unions of Conjunctive Queries},
booktitle = {Proceedings of the 38th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles
of Database Systems, {PODS} 2019, Amsterdam, The Netherlands, June
30 - July 5, 2019},
pages = {134--148},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3294052.3319700},
doi = {10.1145/3294052.3319700},
timestamp = {Sun, 06 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/pods/CarmeliK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/PeterfreundFKK19,
author = {Liat Peterfreund and
Dominik D. Freydenberger and
Benny Kimelfeld and
Markus Kr{\"{o}}ll},
editor = {Dan Suciu and
Sebastian Skritek and
Christoph Koch},
title = {Complexity Bounds for Relational Algebra over Document Spanners},
booktitle = {Proceedings of the 38th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles
of Database Systems, {PODS} 2019, Amsterdam, The Netherlands, June
30 - July 5, 2019},
pages = {320--334},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3294052.3319699},
doi = {10.1145/3294052.3319699},
timestamp = {Sun, 06 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/pods/PeterfreundFKK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-04182,
author = {Liat Peterfreund and
Dominik D. Freydenberger and
Benny Kimelfeld and
Markus Kr{\"{o}}ll},
title = {Complexity Bounds for Relational Algebra over Document Spanners},
journal = {CoRR},
volume = {abs/1901.04182},
year = {2019},
url = {http://arxiv.org/abs/1901.04182},
eprinttype = {arXiv},
eprint = {1901.04182},
timestamp = {Fri, 01 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1901-04182.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tods/BarceloKPS18,
author = {Pablo Barcel{\'{o}} and
Markus Kr{\"{o}}ll and
Reinhard Pichler and
Sebastian Skritek},
title = {Efficient Evaluation and Static Analysis for Well-Designed Pattern
Trees with Projection},
journal = {{ACM} Trans. Database Syst.},
volume = {43},
number = {2},
pages = {8:1--8:44},
year = {2018},
url = {https://doi.org/10.1145/3233983},
doi = {10.1145/3233983},
timestamp = {Sun, 06 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tods/BarceloKPS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdt/CarmeliK18,
author = {Nofar Carmeli and
Markus Kr{\"{o}}ll},
editor = {Benny Kimelfeld and
Yael Amsterdamer},
title = {Enumeration Complexity of Conjunctive Queries with Functional Dependencies},
booktitle = {21st International Conference on Database Theory, {ICDT} 2018, March
26-29, 2018, Vienna, Austria},
series = {LIPIcs},
volume = {98},
pages = {11:1--11:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ICDT.2018.11},
doi = {10.4230/LIPICS.ICDT.2018.11},
timestamp = {Sun, 06 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icdt/CarmeliK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1812-03831,
author = {Nofar Carmeli and
Markus Kr{\"{o}}ll},
title = {Enumeration Complexity of Unions of Conjunctive Queries},
journal = {CoRR},
volume = {abs/1812.03831},
year = {2018},
url = {http://arxiv.org/abs/1812.03831},
eprinttype = {arXiv},
eprint = {1812.03831},
timestamp = {Tue, 01 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1812-03831.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/KrollPW17,
author = {Markus Kr{\"{o}}ll and
Reinhard Pichler and
Stefan Woltran},
editor = {Carles Sierra},
title = {On the Complexity of Enumerating the Extensions of Abstract Argumentation
Frameworks},
booktitle = {Proceedings of the Twenty-Sixth International Joint Conference on
Artificial Intelligence, {IJCAI} 2017, Melbourne, Australia, August
19-25, 2017},
pages = {1145--1152},
publisher = {ijcai.org},
year = {2017},
url = {https://doi.org/10.24963/ijcai.2017/159},
doi = {10.24963/IJCAI.2017/159},
timestamp = {Sun, 06 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/KrollPW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lata/CreignouKPSV17,
author = {Nadia Creignou and
Markus Kr{\"{o}}ll and
Reinhard Pichler and
Sebastian Skritek and
Heribert Vollmer},
editor = {Frank Drewes and
Carlos Mart{\'{\i}}n{-}Vide and
Bianca Truthe},
title = {On the Complexity of Hard Enumeration Problems},
booktitle = {Language and Automata Theory and Applications - 11th International
Conference, {LATA} 2017, Ume{\aa}, Sweden, March 6-9, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10168},
pages = {183--195},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-53733-7\_13},
doi = {10.1007/978-3-319-53733-7\_13},
timestamp = {Mon, 16 Sep 2019 15:27:03 +0200},
biburl = {https://dblp.org/rec/conf/lata/CreignouKPSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1712-07880,
author = {Nofar Carmeli and
Markus Kr{\"{o}}ll},
title = {Enumeration Complexity of Conjunctive Queries with Functional Dependencies},
journal = {CoRR},
volume = {abs/1712.07880},
year = {2017},
url = {http://arxiv.org/abs/1712.07880},
eprinttype = {arXiv},
eprint = {1712.07880},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1712-07880.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/amw/KrollPS16,
author = {Markus Kr{\"{o}}ll and
Reinhard Pichler and
Sebastian Skritek},
editor = {Reinhard Pichler and
Altigran Soares da Silva},
title = {On the Complexity of Enumerating the Answers to Well-Designed Pattern
Trees},
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/paper14.pdf},
timestamp = {Sun, 06 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/amw/KrollPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/foiks/AhmetajFKPSS16,
author = {Shqiponja Ahmetaj and
Wolfgang Fischl and
Markus Kr{\"{o}}ll and
Reinhard Pichler and
Mantas Simkus and
Sebastian Skritek},
editor = {Marc Gyssens and
Guillermo Ricardo Simari},
title = {The Challenge of Optional Matching in {SPARQL}},
booktitle = {Foundations of Information and Knowledge Systems - 9th International
Symposium, FoIKS 2016, Linz, Austria, March 7-11, 2016. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9616},
pages = {169--190},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-30024-5\_10},
doi = {10.1007/978-3-319-30024-5\_10},
timestamp = {Sat, 09 Apr 2022 12:42:08 +0200},
biburl = {https://dblp.org/rec/conf/foiks/AhmetajFKPSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdt/KrollPS16,
author = {Markus Kr{\"{o}}ll and
Reinhard Pichler and
Sebastian Skritek},
editor = {Wim Martens and
Thomas Zeume},
title = {On the Complexity of Enumerating the Answers to Well-designed Pattern
Trees},
booktitle = {19th International Conference on Database Theory, {ICDT} 2016, Bordeaux,
France, March 15-18, 2016},
series = {LIPIcs},
volume = {48},
pages = {22:1--22:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ICDT.2016.22},
doi = {10.4230/LIPICS.ICDT.2016.22},
timestamp = {Sun, 06 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icdt/KrollPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CreignouKPSV16,
author = {Nadia Creignou and
Markus Kr{\"{o}}ll and
Reinhard Pichler and
Sebastian Skritek and
Heribert Vollmer},
title = {On the Complexity of Hard Enumeration Problems},
journal = {CoRR},
volume = {abs/1610.05493},
year = {2016},
url = {http://arxiv.org/abs/1610.05493},
eprinttype = {arXiv},
eprint = {1610.05493},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CreignouKPSV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
last updated on 2024-04-24 22:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
