Published in: LIPIcs, Volume 198, 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)
Antoine Mottet, Tomáš Nagy, Michael Pinsker, and Michał Wrona. Smooth Approximations and Relational Width Collapses. In 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 198, pp. 138:1-138:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{mottet_et_al:LIPIcs.ICALP.2021.138, author = {Mottet, Antoine and Nagy, Tom\'{a}\v{s} and Pinsker, Michael and Wrona, Micha{\l}}, title = {{Smooth Approximations and Relational Width Collapses}}, booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)}, pages = {138:1--138:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-195-5}, ISSN = {1868-8969}, year = {2021}, volume = {198}, editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.138}, URN = {urn:nbn:de:0030-drops-142075}, doi = {10.4230/LIPIcs.ICALP.2021.138}, annote = {Keywords: local consistency, bounded width, constraint satisfaction problems, polymorphisms, smooth approximations} }
Published in: LIPIcs, Volume 154, 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)
Michał Wrona. Relational Width of First-Order Expansions of Homogeneous Graphs with Bounded Strict Width. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 39:1-39:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{wrona:LIPIcs.STACS.2020.39, author = {Wrona, Micha{\l}}, title = {{Relational Width of First-Order Expansions of Homogeneous Graphs with Bounded Strict Width}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {39:1--39:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.39}, URN = {urn:nbn:de:0030-drops-119000}, doi = {10.4230/LIPIcs.STACS.2020.39}, annote = {Keywords: Constraint Satisfaction, Homogeneous Graphs, Bounded Width, Strict Width, Relational Width, Computational Complexity} }
Published in: LIPIcs, Volume 23, Computer Science Logic 2013 (CSL 2013)
Johannes Schmidt and Michał Wrona. The Complexity of Abduction for Equality Constraint Languages. In Computer Science Logic 2013 (CSL 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 23, pp. 615-633, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{schmidt_et_al:LIPIcs.CSL.2013.615, author = {Schmidt, Johannes and Wrona, Micha{\l}}, title = {{The Complexity of Abduction for Equality Constraint Languages}}, booktitle = {Computer Science Logic 2013 (CSL 2013)}, pages = {615--633}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-60-6}, ISSN = {1868-8969}, year = {2013}, volume = {23}, editor = {Ronchi Della Rocca, Simona}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2013.615}, URN = {urn:nbn:de:0030-drops-42229}, doi = {10.4230/LIPIcs.CSL.2013.615}, annote = {Keywords: Abduction, infinite structures, equality constraint languages, computational complexity, algebraic approach} }
Published in: LIPIcs, Volume 16, Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL (2012)
Manuel Bodirsky and Michal Wrona. Equivalence Constraint Satisfaction Problems. In Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 16, pp. 122-136, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2012)
@InProceedings{bodirsky_et_al:LIPIcs.CSL.2012.122, author = {Bodirsky, Manuel and Wrona, Michal}, title = {{Equivalence Constraint Satisfaction Problems}}, booktitle = {Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL}, pages = {122--136}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-42-2}, ISSN = {1868-8969}, year = {2012}, volume = {16}, editor = {C\'{e}gielski, Patrick and Durand, Arnaud}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.122}, URN = {urn:nbn:de:0030-drops-36689}, doi = {10.4230/LIPIcs.CSL.2012.122}, annote = {Keywords: Constraint satisfaction problems, universal algebra, model theory, Ram- sey theory, temporal reasoning, computational complexity} }
Feedback for Dagstuhl Publishing