@Proceedings{yi_et_al:LIPIcs.ICDT.2021,
title = {{LIPIcs, Volume 186, ICDT 2021, Complete Volume}},
booktitle = {24th International Conference on Database Theory (ICDT 2021)},
pages = {1--438},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-179-5},
ISSN = {1868-8969},
year = {2021},
volume = {186},
editor = {Yi, Ke and Wei, Zhewei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021},
URN = {urn:nbn:de:0030-drops-137076},
doi = {10.4230/LIPIcs.ICDT.2021},
annote = {Keywords: LIPIcs, Volume 186, ICDT 2021, Complete Volume}
}
@InProceedings{yi_et_al:LIPIcs.ICDT.2021.0,
author = {Yi, Ke and Wei, Zhewei},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {24th International Conference on Database Theory (ICDT 2021)},
pages = {0:i--0:xvi},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-179-5},
ISSN = {1868-8969},
year = {2021},
volume = {186},
editor = {Yi, Ke and Wei, Zhewei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.0},
URN = {urn:nbn:de:0030-drops-137086},
doi = {10.4230/LIPIcs.ICDT.2021.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{barcelo:LIPIcs.ICDT.2021.1,
author = {Barcel\'{o}, Pablo},
title = {{Explainability Queries for ML Models and its Connections with Data Management Problems}},
booktitle = {24th International Conference on Database Theory (ICDT 2021)},
pages = {1:1--1:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-179-5},
ISSN = {1868-8969},
year = {2021},
volume = {186},
editor = {Yi, Ke and Wei, Zhewei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.1},
URN = {urn:nbn:de:0030-drops-137091},
doi = {10.4230/LIPIcs.ICDT.2021.1},
annote = {Keywords: ML models, Explainability, Shapley values, decision trees, OBDDs, deterministic and decomposable Boolean circuits}
}
@InProceedings{stoyanovich:LIPIcs.ICDT.2021.2,
author = {Stoyanovich, Julia},
title = {{Comparing Apples and Oranges: Fairness and Diversity in Ranking}},
booktitle = {24th International Conference on Database Theory (ICDT 2021)},
pages = {2:1--2:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-179-5},
ISSN = {1868-8969},
year = {2021},
volume = {186},
editor = {Yi, Ke and Wei, Zhewei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.2},
URN = {urn:nbn:de:0030-drops-137104},
doi = {10.4230/LIPIcs.ICDT.2021.2},
annote = {Keywords: fairness, diversity, ranking, set selection, responsible data management}
}
@InProceedings{alway_et_al:LIPIcs.ICDT.2021.3,
author = {Alway, Kaleb and Blais, Eric and Salihoglu, Semih},
title = {{Box Covers and Domain Orderings for Beyond Worst-Case Join Processing}},
booktitle = {24th International Conference on Database Theory (ICDT 2021)},
pages = {3:1--3:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-179-5},
ISSN = {1868-8969},
year = {2021},
volume = {186},
editor = {Yi, Ke and Wei, Zhewei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.3},
URN = {urn:nbn:de:0030-drops-137114},
doi = {10.4230/LIPIcs.ICDT.2021.3},
annote = {Keywords: Beyond worst-case join algorithms, Tetris, Box covers, Domain orderings}
}
@InProceedings{schmid_et_al:LIPIcs.ICDT.2021.4,
author = {Schmid, Markus L. and Schweikardt, Nicole},
title = {{A Purely Regular Approach to Non-Regular Core Spanners}},
booktitle = {24th International Conference on Database Theory (ICDT 2021)},
pages = {4:1--4:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-179-5},
ISSN = {1868-8969},
year = {2021},
volume = {186},
editor = {Yi, Ke and Wei, Zhewei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.4},
URN = {urn:nbn:de:0030-drops-137124},
doi = {10.4230/LIPIcs.ICDT.2021.4},
annote = {Keywords: Document spanners, regular expressions with backreferences}
}
@InProceedings{deep_et_al:LIPIcs.ICDT.2021.5,
author = {Deep, Shaleen and Koutris, Paraschos},
title = {{Ranked Enumeration of Conjunctive Query Results}},
booktitle = {24th International Conference on Database Theory (ICDT 2021)},
pages = {5:1--5:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-179-5},
ISSN = {1868-8969},
year = {2021},
volume = {186},
editor = {Yi, Ke and Wei, Zhewei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.5},
URN = {urn:nbn:de:0030-drops-137139},
doi = {10.4230/LIPIcs.ICDT.2021.5},
annote = {Keywords: Query result enumeration, joins, ranking}
}
@InProceedings{lu_et_al:LIPIcs.ICDT.2021.6,
author = {Lu, Shangqi and Tao, Yufei},
title = {{Towards Optimal Dynamic Indexes for Approximate (and Exact) Triangle Counting}},
booktitle = {24th International Conference on Database Theory (ICDT 2021)},
pages = {6:1--6:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-179-5},
ISSN = {1868-8969},
year = {2021},
volume = {186},
editor = {Yi, Ke and Wei, Zhewei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.6},
URN = {urn:nbn:de:0030-drops-137146},
doi = {10.4230/LIPIcs.ICDT.2021.6},
annote = {Keywords: Triangle Counting, Data Structures, Lower Bounds, Graph Algorithms}
}
@InProceedings{peterfreund:LIPIcs.ICDT.2021.7,
author = {Peterfreund, Liat},
title = {{Grammars for Document Spanners}},
booktitle = {24th International Conference on Database Theory (ICDT 2021)},
pages = {7:1--7:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-179-5},
ISSN = {1868-8969},
year = {2021},
volume = {186},
editor = {Yi, Ke and Wei, Zhewei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.7},
URN = {urn:nbn:de:0030-drops-137154},
doi = {10.4230/LIPIcs.ICDT.2021.7},
annote = {Keywords: Information Extraction, Document Spanners, Context-Free Grammars, Constant-Delay Enumeration, Regular Expressions, Pushdown Automata}
}
@InProceedings{aamer_et_al:LIPIcs.ICDT.2021.8,
author = {Aamer, Heba and Van den Bussche, Jan},
title = {{Input-Output Disjointness for Forward Expressions in the Logic of Information Flows}},
booktitle = {24th International Conference on Database Theory (ICDT 2021)},
pages = {8:1--8:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-179-5},
ISSN = {1868-8969},
year = {2021},
volume = {186},
editor = {Yi, Ke and Wei, Zhewei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.8},
URN = {urn:nbn:de:0030-drops-137167},
doi = {10.4230/LIPIcs.ICDT.2021.8},
annote = {Keywords: Composition, expressive power, variable substitution}
}
@InProceedings{tencate_et_al:LIPIcs.ICDT.2021.9,
author = {ten Cate, Balder and Dalmau, Victor},
title = {{Conjunctive Queries: Unique Characterizations and Exact Learnability}},
booktitle = {24th International Conference on Database Theory (ICDT 2021)},
pages = {9:1--9:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-179-5},
ISSN = {1868-8969},
year = {2021},
volume = {186},
editor = {Yi, Ke and Wei, Zhewei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.9},
URN = {urn:nbn:de:0030-drops-137172},
doi = {10.4230/LIPIcs.ICDT.2021.9},
annote = {Keywords: Conjunctive Queries, Homomorphisms, Frontiers, Unique Characterizations, Exact Learnability, Schema Mappings, Description Logic}
}
@InProceedings{doleschal_et_al:LIPIcs.ICDT.2021.10,
author = {Doleschal, Johannes and Bratman, Noa and Kimelfeld, Benny and Martens, Wim},
title = {{The Complexity of Aggregates over Extractions by Regular Expressions}},
booktitle = {24th International Conference on Database Theory (ICDT 2021)},
pages = {10:1--10:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-179-5},
ISSN = {1868-8969},
year = {2021},
volume = {186},
editor = {Yi, Ke and Wei, Zhewei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.10},
URN = {urn:nbn:de:0030-drops-137181},
doi = {10.4230/LIPIcs.ICDT.2021.10},
annote = {Keywords: Information extraction, document spanners, regular expressions, aggregation functions}
}
@InProceedings{feier_et_al:LIPIcs.ICDT.2021.11,
author = {Feier, Cristina and Lutz, Carsten and Przyby{\l}ko, Marcin},
title = {{Answer Counting Under Guarded TGDs}},
booktitle = {24th International Conference on Database Theory (ICDT 2021)},
pages = {11:1--11:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-179-5},
ISSN = {1868-8969},
year = {2021},
volume = {186},
editor = {Yi, Ke and Wei, Zhewei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.11},
URN = {urn:nbn:de:0030-drops-137195},
doi = {10.4230/LIPIcs.ICDT.2021.11},
annote = {Keywords: Ontology-Mediated Querying, Querying under Constraints, Answer Counting, Parameterized Complexity}
}
@InProceedings{mcgregor_et_al:LIPIcs.ICDT.2021.12,
author = {McGregor, Andrew and Tench, David and Vu, Hoa T.},
title = {{Maximum Coverage in the Data Stream Model: Parameterized and Generalized}},
booktitle = {24th International Conference on Database Theory (ICDT 2021)},
pages = {12:1--12:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-179-5},
ISSN = {1868-8969},
year = {2021},
volume = {186},
editor = {Yi, Ke and Wei, Zhewei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.12},
URN = {urn:nbn:de:0030-drops-137208},
doi = {10.4230/LIPIcs.ICDT.2021.12},
annote = {Keywords: Data streams, maximum coverage, maximum unique coverage, set cover}
}
@InProceedings{moumoulidou_et_al:LIPIcs.ICDT.2021.13,
author = {Moumoulidou, Zafeiria and McGregor, Andrew and Meliou, Alexandra},
title = {{Diverse Data Selection under Fairness Constraints}},
booktitle = {24th International Conference on Database Theory (ICDT 2021)},
pages = {13:1--13:25},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-179-5},
ISSN = {1868-8969},
year = {2021},
volume = {186},
editor = {Yi, Ke and Wei, Zhewei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.13},
URN = {urn:nbn:de:0030-drops-137216},
doi = {10.4230/LIPIcs.ICDT.2021.13},
annote = {Keywords: data selection, diversity maximization, fairness constraints, approximation algorithms}
}
@InProceedings{deep_et_al:LIPIcs.ICDT.2021.14,
author = {Deep, Shaleen and Hu, Xiao and Koutris, Paraschos},
title = {{Enumeration Algorithms for Conjunctive Queries with Projection}},
booktitle = {24th International Conference on Database Theory (ICDT 2021)},
pages = {14:1--14:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-179-5},
ISSN = {1868-8969},
year = {2021},
volume = {186},
editor = {Yi, Ke and Wei, Zhewei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.14},
URN = {urn:nbn:de:0030-drops-137229},
doi = {10.4230/LIPIcs.ICDT.2021.14},
annote = {Keywords: Query result enumeration, joins, ranking}
}
@InProceedings{livshits_et_al:LIPIcs.ICDT.2021.15,
author = {Livshits, Ester and Kimelfeld, Benny},
title = {{The Shapley Value of Inconsistency Measures for Functional Dependencies}},
booktitle = {24th International Conference on Database Theory (ICDT 2021)},
pages = {15:1--15:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-179-5},
ISSN = {1868-8969},
year = {2021},
volume = {186},
editor = {Yi, Ke and Wei, Zhewei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.15},
URN = {urn:nbn:de:0030-drops-137230},
doi = {10.4230/LIPIcs.ICDT.2021.15},
annote = {Keywords: Shapley value, inconsistent databases, functional dependencies, database repairs}
}
@InProceedings{carmeli_et_al:LIPIcs.ICDT.2021.16,
author = {Carmeli, Nofar and Grohe, Martin and Kimelfeld, Benny and Livshits, Ester and Tibi, Muhammad},
title = {{Database Repairing with Soft Functional Dependencies}},
booktitle = {24th International Conference on Database Theory (ICDT 2021)},
pages = {16:1--16:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-179-5},
ISSN = {1868-8969},
year = {2021},
volume = {186},
editor = {Yi, Ke and Wei, Zhewei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.16},
URN = {urn:nbn:de:0030-drops-137245},
doi = {10.4230/LIPIcs.ICDT.2021.16},
annote = {Keywords: Database inconsistency, database repairs, integrity constraints, soft constraints, functional dependencies}
}
@InProceedings{amarilli_et_al:LIPIcs.ICDT.2021.17,
author = {Amarilli, Antoine and Kimelfeld, Benny},
title = {{Uniform Reliability of Self-Join-Free Conjunctive Queries}},
booktitle = {24th International Conference on Database Theory (ICDT 2021)},
pages = {17:1--17:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-179-5},
ISSN = {1868-8969},
year = {2021},
volume = {186},
editor = {Yi, Ke and Wei, Zhewei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.17},
URN = {urn:nbn:de:0030-drops-137252},
doi = {10.4230/LIPIcs.ICDT.2021.17},
annote = {Keywords: Hierarchical conjunctive queries, query reliability, tuple-independent database, counting problems, #P-hardness}
}
@InProceedings{pagh_et_al:LIPIcs.ICDT.2021.18,
author = {Pagh, Rasmus and Stausholm, Nina Mesing},
title = {{Efficient Differentially Private F₀ Linear Sketching}},
booktitle = {24th International Conference on Database Theory (ICDT 2021)},
pages = {18:1--18:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-179-5},
ISSN = {1868-8969},
year = {2021},
volume = {186},
editor = {Yi, Ke and Wei, Zhewei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.18},
URN = {urn:nbn:de:0030-drops-137264},
doi = {10.4230/LIPIcs.ICDT.2021.18},
annote = {Keywords: Differential Privacy, Linear Sketches, Weighted F0 Estimation}
}
@InProceedings{casel_et_al:LIPIcs.ICDT.2021.19,
author = {Casel, Katrin and Schmid, Markus L.},
title = {{Fine-Grained Complexity of Regular Path Queries}},
booktitle = {24th International Conference on Database Theory (ICDT 2021)},
pages = {19:1--19:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-179-5},
ISSN = {1868-8969},
year = {2021},
volume = {186},
editor = {Yi, Ke and Wei, Zhewei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.19},
URN = {urn:nbn:de:0030-drops-137277},
doi = {10.4230/LIPIcs.ICDT.2021.19},
annote = {Keywords: Graph Databases, Regular Path Queries, Enumeration, Fine-Grained Complexity}
}
@InProceedings{bourhis_et_al:LIPIcs.ICDT.2021.20,
author = {Bourhis, Pierre and Grez, Alejandro and Jachiet, Louis and Riveros, Cristian},
title = {{Ranked Enumeration of MSO Logic on Words}},
booktitle = {24th International Conference on Database Theory (ICDT 2021)},
pages = {20:1--20:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-179-5},
ISSN = {1868-8969},
year = {2021},
volume = {186},
editor = {Yi, Ke and Wei, Zhewei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.20},
URN = {urn:nbn:de:0030-drops-137286},
doi = {10.4230/LIPIcs.ICDT.2021.20},
annote = {Keywords: Persistent data structures, Query evaluation, Enumeration algorithms}
}
@InProceedings{mccauley:LIPIcs.ICDT.2021.21,
author = {McCauley, Samuel},
title = {{Approximate Similarity Search Under Edit Distance Using Locality-Sensitive Hashing}},
booktitle = {24th International Conference on Database Theory (ICDT 2021)},
pages = {21:1--21:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-179-5},
ISSN = {1868-8969},
year = {2021},
volume = {186},
editor = {Yi, Ke and Wei, Zhewei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.21},
URN = {urn:nbn:de:0030-drops-137299},
doi = {10.4230/LIPIcs.ICDT.2021.21},
annote = {Keywords: edit distance, approximate pattern matching, approximate nearest neighbor, similarity search, locality-sensitive hashing}
}
@InProceedings{sundarmurthy_et_al:LIPIcs.ICDT.2021.22,
author = {Sundarmurthy, Bruhathi and Koutris, Paraschos and Naughton, Jeffrey},
title = {{Locality-Aware Distribution Schemes}},
booktitle = {24th International Conference on Database Theory (ICDT 2021)},
pages = {22:1--22:25},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-179-5},
ISSN = {1868-8969},
year = {2021},
volume = {186},
editor = {Yi, Ke and Wei, Zhewei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.22},
URN = {urn:nbn:de:0030-drops-137302},
doi = {10.4230/LIPIcs.ICDT.2021.22},
annote = {Keywords: partitioning, parallel correctness, join queries}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing