default search action
BibTeX records: Stefan Szeider
@article{DBLP:journals/ai/OrdyniakPRS26,
author = {Sebastian Ordyniak and
Giacomo Paesani and
Mateusz Rychlicki and
Stefan Szeider},
title = {A General Theoretical Framework for Learning Smallest Interpretable
Models},
journal = {Artif. Intell.},
volume = {350},
pages = {104441},
year = {2026},
url = {https://doi.org/10.1016/j.artint.2025.104441},
doi = {10.1016/J.ARTINT.2025.104441},
timestamp = {Thu, 13 Nov 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ai/OrdyniakPRS26.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/JanotaKPS25,
author = {Mikol{\'{a}}s Janota and
Markus Kirchweger and
Tom{\'{a}}s Peitl and
Stefan Szeider},
editor = {Toby Walsh and
Julie Shah and
Zico Kolter},
title = {Breaking Symmetries in Quantified Graph Search: {A} Comparative Study},
booktitle = {AAAI-25, Sponsored by the Association for the Advancement of Artificial
Intelligence, February 25 - March 4, 2025, Philadelphia, PA, {USA}},
pages = {11246--11254},
publisher = {{AAAI} Press},
year = {2025},
url = {https://doi.org/10.1609/aaai.v39i11.33223},
doi = {10.1609/AAAI.V39I11.33223},
timestamp = {Thu, 17 Apr 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/JanotaKPS25.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cp/VoborilRS25,
author = {Florentina Voboril and
Vaidyanathan Peruvemba Ramaswamy and
Stefan Szeider},
editor = {Maria Garcia de la Banda},
title = {Balancing Latin Rectangles with LLM-Generated Streamliners},
booktitle = {31st International Conference on Principles and Practice of Constraint
Programming, {CP} 2025, August 10-15, 2025, Glasgow, Scotland},
series = {LIPIcs},
volume = {340},
pages = {36:1--36:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2025},
url = {https://doi.org/10.4230/LIPIcs.CP.2025.36},
doi = {10.4230/LIPICS.CP.2025.36},
timestamp = {Mon, 18 Aug 2025 15:30:40 +0200},
biburl = {https://dblp.org/rec/conf/cp/VoborilRS25.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cp/ZhangS25,
author = {Tianwei Zhang and
Stefan Szeider},
editor = {Maria Garcia de la Banda},
title = {The 3-Decomposition Conjecture: {A} SAT-Based Approach with Specialized
Propagators},
booktitle = {31st International Conference on Principles and Practice of Constraint
Programming, {CP} 2025, August 10-15, 2025, Glasgow, Scotland},
series = {LIPIcs},
volume = {340},
pages = {39:1--39:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2025},
url = {https://doi.org/10.4230/LIPIcs.CP.2025.39},
doi = {10.4230/LIPICS.CP.2025.39},
timestamp = {Mon, 18 Aug 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cp/ZhangS25.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iccS/AnsoteguiRSX25,
author = {Carlos Ans{\'{o}}tegui and
Vaidyanathan Peruvemba Ramaswamy and
Stefan Szeider and
Hai Xia},
editor = {Michael H. Lees and
Wentong Cai and
Siew Ann Cheong and
Yi Su and
David Abramson and
Jack J. Dongarra and
Peter M. A. Sloot},
title = {Uncovering and Verifying Optimal Community Structure in Complex Networks:
{A} MaxSAT Approach},
booktitle = {Computational Science - {ICCS} 2025 - 25th International Conference,
Singapore, July 7-9, 2025, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {15904},
pages = {35--49},
publisher = {Springer},
year = {2025},
url = {https://doi.org/10.1007/978-3-031-97629-2\_3},
doi = {10.1007/978-3-031-97629-2\_3},
timestamp = {Tue, 05 Aug 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iccS/AnsoteguiRSX25.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icse/VoborilRS25,
author = {Florentina Voboril and
Vaidyanathan Peruvemba Ramaswamy and
Stefan Szeider},
title = {StreamLLM: Enhancing Constraint Programming with Large Language Model-Generated
Streamliners},
booktitle = {1st {IEEE/ACM} International Workshop on Neuro-Symbolic Software Engineering,
NSE@ICSE 2025, Ottawa, ON, Canada, May 3, 2025},
pages = {17--22},
publisher = {{IEEE}},
year = {2025},
url = {https://doi.org/10.1109/NSE66660.2025.00010},
doi = {10.1109/NSE66660.2025.00010},
timestamp = {Sun, 02 Nov 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icse/VoborilRS25.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/SchidlerS25,
author = {Andr{\'{e}} Schidler and
Stefan Szeider},
editor = {Jeremias Berg and
Jakob Nordstr{\"{o}}m},
title = {Analyzing Reformulation Performance in Core-Guided MaxSAT Solving},
booktitle = {28th International Conference on Theory and Applications of Satisfiability
Testing, {SAT} 2025, August 12-15, 2025, Glasgow, Scotland},
series = {LIPIcs},
volume = {341},
pages = {26:1--26:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2025},
url = {https://doi.org/10.4230/LIPIcs.SAT.2025.26},
doi = {10.4230/LIPICS.SAT.2025.26},
timestamp = {Sat, 06 Sep 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/SchidlerS25.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/Szeider25,
author = {Stefan Szeider},
editor = {Jeremias Berg and
Jakob Nordstr{\"{o}}m},
title = {Bridging Language Models and Symbolic Solvers via the Model Context
Protocol},
booktitle = {28th International Conference on Theory and Applications of Satisfiability
Testing, {SAT} 2025, August 12-15, 2025, Glasgow, Scotland},
series = {LIPIcs},
volume = {341},
pages = {30:1--30:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2025},
url = {https://doi.org/10.4230/LIPIcs.SAT.2025.30},
doi = {10.4230/LIPICS.SAT.2025.30},
timestamp = {Mon, 18 Aug 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/Szeider25.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@misc{DBLP:data/11/PeitlSKX25,
author = {Tom{\'{a}}s Peitl and
Stefan Szeider and
Markus Kirchweger and
Hai Xia},
title = {Supplementary material for Smart Cubing for Graph Search: {A} Comparative
Study (Version 1)},
publisher = {Zenodo},
year = {2025},
month = jan,
howpublished = {\url{https://doi.org/10.5281/zenodo.14746543}},
note = {Accessed on YYYY-MM-DD.},
url = {https://doi.org/10.5281/zenodo.14746543},
doi = {10.5281/ZENODO.14746543},
timestamp = {Wed, 20 Aug 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/data/11/PeitlSKX25.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@misc{DBLP:data/11/SchidlerS25,
author = {Andr{\'{e}} Schidler and
Stefan Szeider},
title = {Extracting Problem Structure with LLMs for Optimized {SAT} Local Search
(Version 1)},
publisher = {Zenodo},
year = {2025},
month = jan,
howpublished = {\url{https://doi.org/10.5281/zenodo.14732109}},
note = {Accessed on YYYY-MM-DD.},
url = {https://doi.org/10.5281/zenodo.14732109},
doi = {10.5281/ZENODO.14732109},
timestamp = {Tue, 19 Aug 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/data/11/SchidlerS25.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@misc{DBLP:data/11/VoborilRS25,
author = {Florentina Voboril and
Vaidyanathan Peruvemba Ramaswamy and
Stefan Szeider},
title = {Code and Instances for the Paper - StreamLLM: Enhancing Constraint
Programming with Large Language Model-Generated Streamliners (Version
1)},
publisher = {Zenodo},
year = {2025},
month = feb,
howpublished = {\url{https://doi.org/10.5281/zenodo.14795920}},
note = {Accessed on YYYY-MM-DD.},
url = {https://doi.org/10.5281/zenodo.14795920},
doi = {10.5281/ZENODO.14795920},
timestamp = {Wed, 20 Aug 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/data/11/VoborilRS25.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@misc{DBLP:data/11/VoborilRS25a,
author = {Florentina Voboril and
Vaidyanathan Peruvemba Ramaswamy and
Stefan Szeider},
title = {Supplementary Material for Paper - Balancing Latin Rectangles with
LLM-generated Streamliners (Version 1)},
publisher = {Zenodo},
year = {2025},
month = jun,
howpublished = {\url{https://doi.org/10.5281/zenodo.15616074}},
note = {Accessed on YYYY-MM-DD.},
url = {https://doi.org/10.5281/zenodo.15616074},
doi = {10.5281/ZENODO.15616074},
timestamp = {Thu, 06 Nov 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/data/11/VoborilRS25a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@misc{DBLP:data/11/VoborilVS25,
author = {Florentina Voboril and
P. R. Vaidyanathan and
Stefan Szeider},
title = {Code and Instances for the Paper: Generating Streamlining Constraints
with Large Language Models (Version Significantly updated and extended
compared to the first version)},
publisher = {Zenodo},
year = {2025},
month = jan,
howpublished = {\url{https://doi.org/10.5281/zenodo.14757597}},
note = {Accessed on YYYY-MM-DD.},
url = {https://doi.org/10.5281/zenodo.14757597},
doi = {10.5281/ZENODO.14757597},
timestamp = {Wed, 20 Aug 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/data/11/VoborilVS25.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2501-00539,
author = {Stefan Szeider},
title = {MCP-Solver: Integrating Language Models with Constraint Programming
Systems},
journal = {CoRR},
volume = {abs/2501.00539},
year = {2025},
url = {https://doi.org/10.48550/arXiv.2501.00539},
doi = {10.48550/ARXIV.2501.00539},
eprinttype = {arXiv},
eprint = {2501.00539},
timestamp = {Thu, 06 Feb 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2501-00539.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2501-14630,
author = {Andr{\'{e}} Schilder and
Stefan Szeider},
title = {Extracting Problem Structure with LLMs for Optimized {SAT} Local Search},
journal = {CoRR},
volume = {abs/2501.14630},
year = {2025},
url = {https://doi.org/10.48550/arXiv.2501.14630},
doi = {10.48550/ARXIV.2501.14630},
eprinttype = {arXiv},
eprint = {2501.14630},
timestamp = {Wed, 26 Feb 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2501-14630.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2501-17201,
author = {Markus Kirchweger and
Hai Xia and
Tom{\'{a}}s Peitl and
Stefan Szeider},
title = {Smart Cubing for Graph Search: {A} Comparative Study},
journal = {CoRR},
volume = {abs/2501.17201},
year = {2025},
url = {https://doi.org/10.48550/arXiv.2501.17201},
doi = {10.48550/ARXIV.2501.17201},
eprinttype = {arXiv},
eprint = {2501.17201},
timestamp = {Wed, 26 Feb 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2501-17201.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2502-00434,
author = {Alexis de Colnet and
Stefan Szeider and
Tianwei Zhang},
title = {Compilation and Fast Model Counting beyond {CNF}},
journal = {CoRR},
volume = {abs/2502.00434},
year = {2025},
url = {https://doi.org/10.48550/arXiv.2502.00434},
doi = {10.48550/ARXIV.2502.00434},
eprinttype = {arXiv},
eprint = {2502.00434},
timestamp = {Fri, 07 Mar 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2502-00434.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2502-15078,
author = {Mikol{\'{a}}s Janota and
Markus Kirchweger and
Tom{\'{a}}s Peitl and
Stefan Szeider},
title = {Breaking Symmetries in Quantified Graph Search: {A} Comparative Study},
journal = {CoRR},
volume = {abs/2502.15078},
year = {2025},
url = {https://doi.org/10.48550/arXiv.2502.15078},
doi = {10.48550/ARXIV.2502.15078},
eprinttype = {arXiv},
eprint = {2502.15078},
timestamp = {Thu, 20 Mar 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2502-15078.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2503-03576,
author = {Juha Harviainen and
Frank Sommer and
Manuel Sorge and
Stefan Szeider},
title = {Optimal Decision Tree Pruning Revisited: Algorithms and Complexity},
journal = {CoRR},
volume = {abs/2503.03576},
year = {2025},
url = {https://doi.org/10.48550/arXiv.2503.03576},
doi = {10.48550/ARXIV.2503.03576},
eprinttype = {arXiv},
eprint = {2503.03576},
timestamp = {Fri, 11 Apr 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2503-03576.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2508-07468,
author = {Stefan Szeider},
title = {CP-Agent: Agentic Constraint Programming},
journal = {CoRR},
volume = {abs/2508.07468},
year = {2025},
url = {https://doi.org/10.48550/arXiv.2508.07468},
doi = {10.48550/ARXIV.2508.07468},
eprinttype = {arXiv},
eprint = {2508.07468},
timestamp = {Sat, 13 Sep 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2508-07468.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2509-21224,
author = {Stefan Szeider},
title = {What Do {LLM} Agents Do When Left Alone? Evidence of Spontaneous Meta-Cognitive
Patterns},
journal = {CoRR},
volume = {abs/2509.21224},
year = {2025},
url = {https://doi.org/10.48550/arXiv.2509.21224},
doi = {10.48550/ARXIV.2509.21224},
eprinttype = {arXiv},
eprint = {2509.21224},
timestamp = {Mon, 20 Oct 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2509-21224.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/SchidlerS24,
author = {Andr{\'{e}} Schidler and
Stefan Szeider},
title = {SAT-based Decision Tree Learning for Large Data Sets},
journal = {J. Artif. Intell. Res.},
volume = {80},
pages = {875--918},
year = {2024},
url = {https://doi.org/10.1613/jair.1.15956},
doi = {10.1613/JAIR.1.15956},
timestamp = {Fri, 19 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jair/SchidlerS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/FazekasNPKSB24,
author = {Katalin Fazekas and
Aina Niemetz and
Mathias Preiner and
Markus Kirchweger and
Stefan Szeider and
Armin Biere},
title = {Satisfiability Modulo User Propagators},
journal = {J. Artif. Intell. Res.},
volume = {81},
pages = {989--1017},
year = {2024},
url = {https://doi.org/10.1613/jair.1.16163},
doi = {10.1613/JAIR.1.16163},
timestamp = {Sun, 05 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jair/FazekasNPKSB24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/DreierOS24,
author = {Jan Dreier and
Sebastian Ordyniak and
Stefan Szeider},
title = {{SAT} backdoors: Depth beats size},
journal = {J. Comput. Syst. Sci.},
volume = {142},
pages = {103520},
year = {2024},
url = {https://doi.org/10.1016/j.jcss.2024.103520},
doi = {10.1016/J.JCSS.2024.103520},
timestamp = {Sun, 19 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/DreierOS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/OrdyniakSS24,
author = {Sebastian Ordyniak and
Andr{\'{e}} Schidler and
Stefan Szeider},
title = {Backdoor DNFs},
journal = {J. Comput. Syst. Sci.},
volume = {144},
pages = {103547},
year = {2024},
url = {https://doi.org/10.1016/j.jcss.2024.103547},
doi = {10.1016/J.JCSS.2024.103547},
timestamp = {Thu, 01 May 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/OrdyniakSS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tocl/KirchwegerS24,
author = {Markus Kirchweger and
Stefan Szeider},
title = {{SAT} Modulo Symmetries for Graph Generation and Enumeration},
journal = {{ACM} Trans. Comput. Log.},
volume = {25},
number = {3},
pages = {1--30},
year = {2024},
url = {https://doi.org/10.1145/3670405},
doi = {10.1145/3670405},
timestamp = {Sun, 19 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tocl/KirchwegerS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/ChewCSS24,
author = {Leroy Chew and
Alexis de Colnet and
Friedrich Slivovsky and
Stefan Szeider},
editor = {Michael J. Wooldridge and
Jennifer G. Dy and
Sriraam Natarajan},
title = {Hardness of Random Reordered Encodings of Parity for Resolution and
{CDCL}},
booktitle = {Thirty-Eighth {AAAI} Conference on Artificial Intelligence, {AAAI}
2024, Thirty-Sixth Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2024, Fourteenth Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2014, February 20-27, 2024, Vancouver,
Canada},
pages = {7978--7986},
publisher = {{AAAI} Press},
year = {2024},
url = {https://doi.org/10.1609/aaai.v38i8.28635},
doi = {10.1609/AAAI.V38I8.28635},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/ChewCSS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/XiaS24,
author = {Hai Xia and
Stefan Szeider},
editor = {Michael J. Wooldridge and
Jennifer G. Dy and
Sriraam Natarajan},
title = {SAT-Based Tree Decomposition with Iterative Cascading Policy Selection},
booktitle = {Thirty-Eighth {AAAI} Conference on Artificial Intelligence, {AAAI}
2024, Thirty-Sixth Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2024, Fourteenth Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2014, February 20-27, 2024, Vancouver,
Canada},
pages = {8191--8199},
publisher = {{AAAI} Press},
year = {2024},
url = {https://doi.org/10.1609/aaai.v38i8.28659},
doi = {10.1609/AAAI.V38I8.28659},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/XiaS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/DabrowskiEOPS24,
author = {Konrad K. Dabrowski and
Eduard Eiben and
Sebastian Ordyniak and
Giacomo Paesani and
Stefan Szeider},
editor = {Michael J. Wooldridge and
Jennifer G. Dy and
Sriraam Natarajan},
title = {Learning Small Decision Trees for Data of Low Rank-Width},
booktitle = {Thirty-Eighth {AAAI} Conference on Artificial Intelligence, {AAAI}
2024, Thirty-Sixth Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2024, Fourteenth Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2014, February 20-27, 2024, Vancouver,
Canada},
pages = {10476--10483},
publisher = {{AAAI} Press},
year = {2024},
url = {https://doi.org/10.1609/aaai.v38i9.28916},
doi = {10.1609/AAAI.V38I9.28916},
timestamp = {Tue, 14 Oct 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/DabrowskiEOPS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/OrdyniakPRS24,
author = {Sebastian Ordyniak and
Giacomo Paesani and
Mateusz Rychlicki and
Stefan Szeider},
editor = {Michael J. Wooldridge and
Jennifer G. Dy and
Sriraam Natarajan},
title = {A General Theoretical Framework for Learning Smallest Interpretable
Models},
booktitle = {Thirty-Eighth {AAAI} Conference on Artificial Intelligence, {AAAI}
2024, Thirty-Sixth Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2024, Fourteenth Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2014, February 20-27, 2024, Vancouver,
Canada},
pages = {10662--10669},
publisher = {{AAAI} Press},
year = {2024},
url = {https://doi.org/10.1609/aaai.v38i9.28937},
doi = {10.1609/AAAI.V38I9.28937},
timestamp = {Tue, 14 Oct 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/OrdyniakPRS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cmsc/Szeider24,
author = {Stefan Szeider},
editor = {Henning Fernau and
Inge Schwank and
Jacqueline Staub},
title = {Large and Parallel Human Sorting Networks},
booktitle = {Creative Mathematical Sciences Communication: 7th International Conference,
{CMSC} 2024, Trier, Germany, October 7-10, 2024, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {15229},
pages = {194--204},
publisher = {Springer},
year = {2024},
url = {https://doi.org/10.1007/978-3-031-73257-7\_16},
doi = {10.1007/978-3-031-73257-7\_16},
timestamp = {Mon, 09 Dec 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cmsc/Szeider24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cp/SchidlerS24,
author = {Andr{\'{e}} Schidler and
Stefan Szeider},
editor = {Paul Shaw},
title = {Structure-Guided Local Improvement for Maximum Satisfiability},
booktitle = {30th International Conference on Principles and Practice of Constraint
Programming, {CP} 2024, September 2-6, 2024, Girona, Spain},
series = {LIPIcs},
volume = {307},
pages = {26:1--26:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.CP.2024.26},
doi = {10.4230/LIPICS.CP.2024.26},
timestamp = {Thu, 01 May 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cp/SchidlerS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cp/KirchwegerS24,
author = {Markus Kirchweger and
Stefan Szeider},
editor = {Paul Shaw},
title = {Computing Small Rainbow Cycle Numbers with {SAT} Modulo Symmetries
(Short Paper)},
booktitle = {30th International Conference on Principles and Practice of Constraint
Programming, {CP} 2024, September 2-6, 2024, Girona, Spain},
series = {LIPIcs},
volume = {307},
pages = {37:1--37:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.CP.2024.37},
doi = {10.4230/LIPICS.CP.2024.37},
timestamp = {Fri, 30 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cp/KirchwegerS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictai/RamaswamyS024,
author = {Vaidyanathan Peruvemba Ramaswamy and
Stefan Szeider and
Hai Xia},
title = {The Power of Collaboration: Learning Large Bayesian Networks at Scale},
booktitle = {36th {IEEE} International Conference on Tools with Artificial Intelligence,
{ICTAI} 2024, Herndon, VA, USA, October 28-30, 2024},
pages = {371--378},
publisher = {{IEEE}},
year = {2024},
url = {https://doi.org/10.1109/ICTAI62512.2024.00061},
doi = {10.1109/ICTAI62512.2024.00061},
timestamp = {Mon, 03 Mar 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ictai/RamaswamyS024.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/ColnetSZ24,
author = {Alexis de Colnet and
Stefan Szeider and
Tianwei Zhang},
title = {Compilation and Fast Model Counting beyond {CNF}},
booktitle = {Proceedings of the Thirty-Third International Joint Conference on
Artificial Intelligence, {IJCAI} 2024, Jeju, South Korea, August 3-9,
2024},
pages = {3315--3323},
publisher = {ijcai.org},
year = {2024},
url = {https://www.ijcai.org/proceedings/2024/367},
timestamp = {Fri, 18 Oct 2024 10:53:17 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/ColnetSZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/GanianKS24,
author = {Robert Ganian and
Viktoriia Korchemna and
Stefan Szeider},
title = {Revisiting Causal Discovery from a Complexity-Theoretic Perspective},
booktitle = {Proceedings of the Thirty-Third International Joint Conference on
Artificial Intelligence, {IJCAI} 2024, Jeju, South Korea, August 3-9,
2024},
pages = {3377--3385},
publisher = {ijcai.org},
year = {2024},
url = {https://www.ijcai.org/proceedings/2024/374},
timestamp = {Fri, 18 Oct 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/GanianKS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kr/ChewCS24,
author = {Leroy Chew and
Alexis de Colnet and
Stefan Szeider},
editor = {Pierre Marquis and
Magdalena Ortiz and
Maurice Pagnucco},
title = {{ASP-QRAT:} {A} Conditionally Optimal Dual Proof System for {ASP}},
booktitle = {Proceedings of the 21st International Conference on Principles of
Knowledge Representation and Reasoning, {KR} 2024, Hanoi, Vietnam.
November 2-8, 2024},
year = {2024},
url = {https://doi.org/10.24963/kr.2024/24},
doi = {10.24963/KR.2024/24},
timestamp = {Wed, 18 Dec 2024 13:51:42 +0100},
biburl = {https://dblp.org/rec/conf/kr/ChewCS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kr/OrdyniakPRS24,
author = {Sebastian Ordyniak and
Giacomo Paesani and
Mateusz Rychlicki and
Stefan Szeider},
editor = {Pierre Marquis and
Magdalena Ortiz and
Maurice Pagnucco},
title = {Explaining Decisions in {ML} Models: {A} Parameterized Complexity
Analysis},
booktitle = {Proceedings of the 21st International Conference on Principles of
Knowledge Representation and Reasoning, {KR} 2024, Hanoi, Vietnam.
November 2-8, 2024},
year = {2024},
url = {https://doi.org/10.24963/kr.2024/53},
doi = {10.24963/KR.2024/53},
timestamp = {Tue, 14 Oct 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/kr/OrdyniakPRS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/ReichlSS24,
author = {Franz{-}Xaver Reichl and
Friedrich Slivovsky and
Stefan Szeider},
editor = {Supratik Chakraborty and
Jie{-}Hong Roland Jiang},
title = {eSLIM: Circuit Minimization with {SAT} Based Local Improvement},
booktitle = {27th International Conference on Theory and Applications of Satisfiability
Testing, {SAT} 2024, August 21-24, 2024, Pune, India},
series = {LIPIcs},
volume = {305},
pages = {23:1--23:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.SAT.2024.23},
doi = {10.4230/LIPICS.SAT.2024.23},
timestamp = {Mon, 03 Mar 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sat/ReichlSS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/ZhangPS24,
author = {Tianwei Zhang and
Tom{\'{a}}s Peitl and
Stefan Szeider},
editor = {Supratik Chakraborty and
Jie{-}Hong Roland Jiang},
title = {Small Unsatisfiable k-CNFs with Bounded Literal Occurrence},
booktitle = {27th International Conference on Theory and Applications of Satisfiability
Testing, {SAT} 2024, August 21-24, 2024, Pune, India},
series = {LIPIcs},
volume = {305},
pages = {31:1--31:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.SAT.2024.31},
doi = {10.4230/LIPICS.SAT.2024.31},
timestamp = {Wed, 21 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/ZhangPS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@misc{DBLP:data/10/OrdyniakSS24,
author = {Sebastian Ordyniak and
Andr{\'{e}} Schidler and
Stefan Szeider},
title = {Backdoor DNFs Results and Source Code (Version 1)},
publisher = {Zenodo},
year = {2024},
month = may,
howpublished = {\url{https://doi.org/10.5281/zenodo.11259842}},
note = {Accessed on YYYY-MM-DD.},
url = {https://doi.org/10.5281/zenodo.11259842},
doi = {10.5281/ZENODO.11259842},
timestamp = {Fri, 19 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/data/10/OrdyniakSS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@misc{DBLP:data/10/SchidlerS24,
author = {Andr{\'{e}} Schidler and
Stefan Szeider},
title = {SAT-based Decision Tree Learning for Large Data Sets - Results and
Source code (Version 1)},
publisher = {Zenodo},
year = {2024},
month = may,
howpublished = {\url{https://doi.org/10.5281/zenodo.11314227}},
note = {Accessed on YYYY-MM-DD.},
url = {https://doi.org/10.5281/zenodo.11314227},
doi = {10.5281/ZENODO.11314227},
timestamp = {Fri, 19 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/data/10/SchidlerS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@misc{DBLP:data/11/FazekasNPKSB24,
author = {Katalin Fazekas and
Aina Niemetz and
Mathias Preiner and
Markus Kirchweger and
Stefan Szeider and
Armin Biere},
title = {Supplementary material of "Satisfiability modulo User Propagators"
(Version 1)},
publisher = {Zenodo},
year = {2024},
month = sep,
howpublished = {\url{https://doi.org/10.5281/zenodo.13710465}},
note = {Accessed on YYYY-MM-DD.},
url = {https://doi.org/10.5281/zenodo.13710465},
doi = {10.5281/ZENODO.13710465},
timestamp = {Mon, 30 Jun 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/data/11/FazekasNPKSB24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@misc{DBLP:data/11/PeitlKJS24,
author = {Tom{\'{a}}s Peitl and
Markus Kirchweger and
Mikol{\'{a}}s Janota and
Stefan Szeider},
title = {Supplementary Material for Breaking Symmetries in Quantified Graph
Search: {A} Comparative Study (Version 1)},
publisher = {Zenodo},
year = {2024},
month = dec,
howpublished = {\url{https://doi.org/10.5281/zenodo.14530908}},
note = {Accessed on YYYY-MM-DD.},
url = {https://doi.org/10.5281/zenodo.14530908},
doi = {10.5281/ZENODO.14530908},
timestamp = {Fri, 08 Aug 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/data/11/PeitlKJS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@misc{DBLP:data/11/RamaswamySX24,
author = {Vaidyanathan Peruvemba Ramaswamy and
Stefan Szeider and
Hai Xia},
title = {collab-bn-slim (Version 1)},
publisher = {Zenodo},
year = {2024},
howpublished = {\url{https://doi.org/10.5281/zenodo.13861588}},
note = {Accessed on YYYY-MM-DD.},
url = {https://doi.org/10.5281/zenodo.13861588},
doi = {10.5281/ZENODO.13861588},
timestamp = {Wed, 02 Jul 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/data/11/RamaswamySX24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@misc{DBLP:data/11/ReichlSS24,
author = {Franz{-}Xaver Reichl and
Friedrich Slivovsky and
Stefan Szeider},
title = {eSLIM},
publisher = {{DROPS} Artifacts},
year = {2024},
month = nov,
howpublished = {\url{https://doi.org/10.4230/artifacts.22464}},
note = {Accessed on YYYY-MM-DD.},
url = {https://doi.org/10.4230/artifacts.22464},
doi = {10.4230/ARTIFACTS.22464},
timestamp = {Wed, 15 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/data/11/ReichlSS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@misc{DBLP:data/11/SchidlerS24,
author = {Andr{\'{e}} Schidler and
Stefan Szeider},
title = {Structure-guided Local Improvement for Maximum Satisfiability Supplementary
(Version 1)},
publisher = {Zenodo},
year = {2024},
month = jun,
howpublished = {\url{https://doi.org/10.5281/zenodo.12516816}},
note = {Accessed on YYYY-MM-DD.},
url = {https://doi.org/10.5281/zenodo.12516816},
doi = {10.5281/ZENODO.12516816},
timestamp = {Mon, 17 Mar 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/data/11/SchidlerS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@misc{DBLP:data/11/VoborilVS24,
author = {Florentina Voboril and
P. R. Vaidyanathan and
Stefan Szeider},
title = {Code and Instances for the Paper Realtime Generation of Streamliners
with Large Language Models (Version This is the first version, as
referenced by the first version of the arXiv submission)},
publisher = {Zenodo},
year = {2024},
month = aug,
howpublished = {\url{https://doi.org/10.5281/zenodo.13331049}},
note = {Accessed on YYYY-MM-DD.},
url = {https://doi.org/10.5281/zenodo.13331049},
doi = {10.5281/ZENODO.13331049},
timestamp = {Wed, 20 Aug 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/data/11/VoborilVS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-00542,
author = {Leroy Chew and
Alexis de Colnet and
Friedrich Slivovsky and
Stefan Szeider},
title = {Hardness of Random Reordered Encodings of Parity for Resolution and
{CDCL}},
journal = {CoRR},
volume = {abs/2402.00542},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.00542},
doi = {10.48550/ARXIV.2402.00542},
eprinttype = {arXiv},
eprint = {2402.00542},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-00542.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2405-16149,
author = {Tianwei Zhang and
Tom{\'{a}}s Peitl and
Stefan Szeider},
title = {Small unsatisfiable k-CNFs with bounded literal occurrence},
journal = {CoRR},
volume = {abs/2405.16149},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2405.16149},
doi = {10.48550/ARXIV.2405.16149},
eprinttype = {arXiv},
eprint = {2405.16149},
timestamp = {Tue, 18 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2405-16149.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2407-10699,
author = {Eduard Eiben and
Robert Ganian and
Iyad Kanj and
Sebastian Ordyniak and
Stefan Szeider},
title = {From Data Completion to Problems on Hypercubes: {A} Parameterized
Analysis of the Independent Set Problem},
journal = {CoRR},
volume = {abs/2407.10699},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2407.10699},
doi = {10.48550/ARXIV.2407.10699},
eprinttype = {arXiv},
eprint = {2407.10699},
timestamp = {Thu, 15 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2407-10699.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2407-15780,
author = {Sebastian Ordyniak and
Giacomo Paesani and
Mateusz Rychlicki and
Stefan Szeider},
title = {Explaining Decisions in {ML} Models: a Parameterized Complexity Analysis},
journal = {CoRR},
volume = {abs/2407.15780},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2407.15780},
doi = {10.48550/ARXIV.2407.15780},
eprinttype = {arXiv},
eprint = {2407.15780},
timestamp = {Mon, 03 Mar 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2407-15780.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2408-10268,
author = {Florentina Voboril and
Vaidyanathan Peruvemba Ramaswamy and
Stefan Szeider},
title = {Realtime Generation of Streamliners with Large Language Models},
journal = {CoRR},
volume = {abs/2408.10268},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2408.10268},
doi = {10.48550/ARXIV.2408.10268},
eprinttype = {arXiv},
eprint = {2408.10268},
timestamp = {Tue, 24 Sep 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2408-10268.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ai/SchidlerS23,
author = {Andr{\'{e}} Schidler and
Stefan Szeider},
title = {Computing optimal hypertree decompositions with {SAT}},
journal = {Artif. Intell.},
volume = {325},
pages = {104015},
year = {2023},
url = {https://doi.org/10.1016/j.artint.2023.104015},
doi = {10.1016/J.ARTINT.2023.104015},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ai/SchidlerS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cacm/FichteBHS23,
author = {Johannes Klaus Fichte and
Daniel Le Berre and
Markus Hecher and
Stefan Szeider},
title = {The Silent (R)evolution of {SAT}},
journal = {Commun. {ACM}},
volume = {66},
number = {6},
pages = {64--72},
year = {2023},
url = {https://doi.org/10.1145/3560469},
doi = {10.1145/3560469},
timestamp = {Mon, 03 Mar 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cacm/FichteBHS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/constraints/DreierOS23,
author = {Jan Dreier and
Sebastian Ordyniak and
Stefan Szeider},
title = {{CSP} beyond tractable constraint languages},
journal = {Constraints An Int. J.},
volume = {28},
number = {3},
pages = {450--471},
year = {2023},
url = {https://doi.org/10.1007/s10601-023-09362-3},
doi = {10.1007/S10601-023-09362-3},
timestamp = {Sat, 08 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/constraints/DreierOS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/PeitlS23,
author = {Tom{\'{a}}s Peitl and
Stefan Szeider},
title = {Are hitting formulas hard for resolution?},
journal = {Discret. Appl. Math.},
volume = {337},
pages = {173--184},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.05.003},
doi = {10.1016/J.DAM.2023.05.003},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/PeitlS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/EibenGKOS23,
author = {Eduard Eiben and
Robert Ganian and
Iyad Kanj and
Sebastian Ordyniak and
Stefan Szeider},
title = {On the parameterized complexity of clustering problems for incomplete
data},
journal = {J. Comput. Syst. Sci.},
volume = {134},
pages = {1--19},
year = {2023},
url = {https://doi.org/10.1016/j.jcss.2022.12.001},
doi = {10.1016/J.JCSS.2022.12.001},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/EibenGKOS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/SchidlerS23,
author = {Andr{\'{e}} Schidler and
Stefan Szeider},
title = {SAT-boosted Tabu Search for Coloring Massive Graphs},
journal = {{ACM} J. Exp. Algorithmics},
volume = {28},
pages = {1.5:1--1.5:19},
year = {2023},
url = {https://doi.org/10.1145/3603112},
doi = {10.1145/3603112},
timestamp = {Sun, 17 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/SchidlerS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/ReichlSS23,
author = {Franz{-}Xaver Reichl and
Friedrich Slivovsky and
Stefan Szeider},
editor = {Brian Williams and
Yiling Chen and
Jennifer Neville},
title = {Circuit Minimization with QBF-Based Exact Synthesis},
booktitle = {Thirty-Seventh {AAAI} Conference on Artificial Intelligence, {AAAI}
2023, Thirty-Fifth Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2023, Thirteenth Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2023, Washington, DC, USA, February
7-14, 2023},
pages = {4087--4094},
publisher = {{AAAI} Press},
year = {2023},
url = {https://doi.org/10.1609/aaai.v37i4.25524},
doi = {10.1609/AAAI.V37I4.25524},
timestamp = {Sun, 06 Oct 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/ReichlSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/FichteHS23,
author = {Johannes Klaus Fichte and
Markus Hecher and
Stefan Szeider},
editor = {Brian Williams and
Yiling Chen and
Jennifer Neville},
title = {Inconsistent Cores for {ASP:} The Perks and Perils of Non-monotonicity},
booktitle = {Thirty-Seventh {AAAI} Conference on Artificial Intelligence, {AAAI}
2023, Thirty-Fifth Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2023, Thirteenth Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2023, Washington, DC, USA, February
7-14, 2023},
pages = {6363--6371},
publisher = {{AAAI} Press},
year = {2023},
url = {https://doi.org/10.1609/aaai.v37i5.25783},
doi = {10.1609/AAAI.V37I5.25783},
timestamp = {Mon, 03 Mar 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/aaai/FichteHS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cp/ZhangS23,
author = {Tianwei Zhang and
Stefan Szeider},
editor = {Roland H. C. Yap},
title = {Searching for Smallest Universal Graphs and Tournaments with {SAT}},
booktitle = {29th International Conference on Principles and Practice of Constraint
Programming, {CP} 2023, August 27-31, 2023, Toronto, Canada},
series = {LIPIcs},
volume = {280},
pages = {39:1--39:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CP.2023.39},
doi = {10.4230/LIPICS.CP.2023.39},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/cp/ZhangS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cp/RamaswamyS23,
author = {Vaidyanathan Peruvemba Ramaswamy and
Stefan Szeider},
editor = {Roland H. C. Yap},
title = {Proven Optimally-Balanced Latin Rectangles with {SAT} (Short Paper)},
booktitle = {29th International Conference on Principles and Practice of Constraint
Programming, {CP} 2023, August 27-31, 2023, Toronto, Canada},
series = {LIPIcs},
volume = {280},
pages = {48:1--48:10},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CP.2023.48},
doi = {10.4230/LIPICS.CP.2023.48},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cp/RamaswamyS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/EibenGKOS23,
author = {Eduard Eiben and
Robert Ganian and
Iyad A. Kanj and
Sebastian Ordyniak and
Stefan Szeider},
editor = {Andreas Krause and
Emma Brunskill and
Kyunghyun Cho and
Barbara Engelhardt and
Sivan Sabato and
Jonathan Scarlett},
title = {The Computational Complexity of Concise Hypersphere Classification},
booktitle = {International Conference on Machine Learning, {ICML} 2023, 23-29 July
2023, Honolulu, Hawaii, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {202},
pages = {9060--9070},
publisher = {{PMLR}},
year = {2023},
url = {https://proceedings.mlr.press/v202/eiben23a.html},
timestamp = {Mon, 28 Aug 2023 17:23:08 +0200},
biburl = {https://dblp.org/rec/conf/icml/EibenGKOS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/KirchwegerPS23,
author = {Markus Kirchweger and
Tom{\'{a}}s Peitl and
Stefan Szeider},
title = {Co-Certificate Learning with {SAT} Modulo Symmetries},
booktitle = {Proceedings of the Thirty-Second International Joint Conference on
Artificial Intelligence, {IJCAI} 2023, 19th-25th August 2023, Macao,
SAR, China},
pages = {1944--1953},
publisher = {ijcai.org},
year = {2023},
url = {https://doi.org/10.24963/ijcai.2023/216},
doi = {10.24963/IJCAI.2023/216},
timestamp = {Tue, 15 Oct 2024 16:43:28 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/KirchwegerPS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/SchidlerS23,
author = {Andr{\'{e}} Schidler and
Stefan Szeider},
title = {Computing Twin-width with {SAT} and Branch {\&} Bound},
booktitle = {Proceedings of the Thirty-Second International Joint Conference on
Artificial Intelligence, {IJCAI} 2023, 19th-25th August 2023, Macao,
SAR, China},
pages = {2013--2021},
publisher = {ijcai.org},
year = {2023},
url = {https://doi.org/10.24963/ijcai.2023/224},
doi = {10.24963/IJCAI.2023/224},
timestamp = {Thu, 01 May 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/SchidlerS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/EibenOPS23,
author = {Eduard Eiben and
Sebastian Ordyniak and
Giacomo Paesani and
Stefan Szeider},
title = {Learning Small Decision Trees with Large Domain},
booktitle = {Proceedings of the Thirty-Second International Joint Conference on
Artificial Intelligence, {IJCAI} 2023, 19th-25th August 2023, Macao,
SAR, China},
pages = {3184--3192},
publisher = {ijcai.org},
year = {2023},
url = {https://doi.org/10.24963/ijcai.2023/355},
doi = {10.24963/IJCAI.2023/355},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/EibenOPS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/OrdyniakPS23,
author = {Sebastian Ordyniak and
Giacomo Paesani and
Stefan Szeider},
title = {The Parameterized Complexity of Finding Concise Local Explanations},
booktitle = {Proceedings of the Thirty-Second International Joint Conference on
Artificial Intelligence, {IJCAI} 2023, 19th-25th August 2023, Macao,
SAR, China},
pages = {3312--3320},
publisher = {ijcai.org},
year = {2023},
url = {https://doi.org/10.24963/ijcai.2023/369},
doi = {10.24963/IJCAI.2023/369},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/OrdyniakPS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/EibenGKOS23,
author = {Eduard Eiben and
Robert Ganian and
Iyad Kanj and
Sebastian Ordyniak and
Stefan Szeider},
editor = {Neeldhara Misra and
Magnus Wahlstr{\"{o}}m},
title = {From Data Completion to Problems on Hypercubes: {A} Parameterized
Analysis of the Independent Set Problem},
booktitle = {18th International Symposium on Parameterized and Exact Computation,
{IPEC} 2023, September 6-8, 2023, Amsterdam, The Netherlands},
series = {LIPIcs},
volume = {285},
pages = {16:1--16:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2023.16},
doi = {10.4230/LIPICS.IPEC.2023.16},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/EibenGKOS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/FazekasNPKSB23,
author = {Katalin Fazekas and
Aina Niemetz and
Mathias Preiner and
Markus Kirchweger and
Stefan Szeider and
Armin Biere},
editor = {Meena Mahajan and
Friedrich Slivovsky},
title = {{IPASIR-UP:} User Propagators for {CDCL}},
booktitle = {26th International Conference on Theory and Applications of Satisfiability
Testing, {SAT} 2023, July 4-8, 2023, Alghero, Italy},
series = {LIPIcs},
volume = {271},
pages = {8:1--8:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.SAT.2023.8},
doi = {10.4230/LIPICS.SAT.2023.8},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/FazekasNPKSB23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/KirchwegerPS23,
author = {Markus Kirchweger and
Tom{\'{a}}s Peitl and
Stefan Szeider},
editor = {Meena Mahajan and
Friedrich Slivovsky},
title = {A {SAT} Solver's Opinion on the Erd{\H{o}}s-Faber-Lov{\'{a}}sz
Conjecture},
booktitle = {26th International Conference on Theory and Applications of Satisfiability
Testing, {SAT} 2023, July 4-8, 2023, Alghero, Italy},
series = {LIPIcs},
volume = {271},
pages = {13:1--13:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.SAT.2023.13},
doi = {10.4230/LIPICS.SAT.2023.13},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/KirchwegerPS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/KirchwegerSS23,
author = {Markus Kirchweger and
Manfred Scheucher and
Stefan Szeider},
editor = {Meena Mahajan and
Friedrich Slivovsky},
title = {SAT-Based Generation of Planar Graphs},
booktitle = {26th International Conference on Theory and Applications of Satisfiability
Testing, {SAT} 2023, July 4-8, 2023, Alghero, Italy},
series = {LIPIcs},
volume = {271},
pages = {14:1--14:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.SAT.2023.14},
doi = {10.4230/LIPICS.SAT.2023.14},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/KirchwegerSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@misc{DBLP:data/10/ChewCSS23,
author = {Leroy Chew and
Alexis de Colnet and
Friedrich Slivovsky and
Stefan Szeider},
title = {Dataset of Random Reordered Encodings of Parity Problems (Version
1)},
publisher = {Zenodo},
year = {2023},
month = dec,
howpublished = {\url{https://doi.org/10.5281/zenodo.10391790}},
note = {Accessed on YYYY-MM-DD.},
url = {https://doi.org/10.5281/zenodo.10391790},
doi = {10.5281/ZENODO.10391790},
timestamp = {Fri, 19 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/data/10/ChewCSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@misc{DBLP:data/10/FazekasNPKSB23,
author = {Katalin Fazekas and
Aina Niemetz and
Mathias Preiner and
Markus Kirchweger and
Stefan Szeider and
Armin Biere},
title = {Supplementary material of submission "IPASIR-UP: User Propagators
for CDCL" (Version 1)},
publisher = {Zenodo},
year = {2023},
month = jun,
howpublished = {\url{https://doi.org/10.5281/zenodo.8003683}},
note = {Accessed on YYYY-MM-DD.},
url = {https://doi.org/10.5281/zenodo.8003683},
doi = {10.5281/ZENODO.8003683},
timestamp = {Fri, 19 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/data/10/FazekasNPKSB23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@misc{DBLP:data/10/RamaswamyS23,
author = {Vaidyanathan Peruvemba Ramaswamy and
Stefan Szeider},
title = {Supplementary Material for Proven optimally-balanced Latin rectangles
with {SAT} (Version 1.0)},
publisher = {Zenodo},
year = {2023},
month = jul,
howpublished = {\url{https://doi.org/10.5281/zenodo.8150639}},
note = {Accessed on YYYY-MM-DD.},
url = {https://doi.org/10.5281/zenodo.8150639},
doi = {10.5281/ZENODO.8150639},
timestamp = {Fri, 16 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/data/10/RamaswamyS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@misc{DBLP:data/10/RamaswamyS23a,
author = {Vaidyanathan Peruvemba Ramaswamy and
Stefan Szeider},
title = {Supplementary Material for Proven optimally-balanced Latin rectangles
with {SAT} (Version 1.1)},
publisher = {Zenodo},
year = {2023},
month = jul,
howpublished = {\url{https://doi.org/10.5281/zenodo.8151905}},
note = {Accessed on YYYY-MM-DD.},
url = {https://doi.org/10.5281/zenodo.8151905},
doi = {10.5281/ZENODO.8151905},
timestamp = {Fri, 16 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/data/10/RamaswamyS23a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@misc{DBLP:data/10/SchidlerS23,
author = {Andr{\'{e}} Schidler and
Stefan Szeider},
title = {SAT-Boosted Tabu Search for Coloring Massive Graphs - Experiments
(Version 1)},
publisher = {Zenodo},
year = {2023},
month = mar,
howpublished = {\url{https://doi.org/10.5281/zenodo.7787294}},
note = {Accessed on YYYY-MM-DD.},
url = {https://doi.org/10.5281/zenodo.7787294},
doi = {10.5281/ZENODO.7787294},
timestamp = {Fri, 19 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/data/10/SchidlerS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@misc{DBLP:data/10/SchidlerS23a,
author = {Andr{\'{e}} Schidler and
Stefan Szeider},
title = {Computing twin-width with {SAT} and branch {\&} bound - Results
(Version 1)},
publisher = {Zenodo},
year = {2023},
month = may,
howpublished = {\url{https://doi.org/10.5281/zenodo.7944391}},
note = {Accessed on YYYY-MM-DD.},
url = {https://doi.org/10.5281/zenodo.7944391},
doi = {10.5281/ZENODO.7944391},
timestamp = {Fri, 19 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/data/10/SchidlerS23a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@misc{DBLP:data/10/SchidlerS23b,
author = {Andr{\'{e}} Schidler and
Stefan Szeider},
title = {Computing twin-width with {SAT} and branch {\&} bound (Version
1)},
publisher = {Zenodo},
year = {2023},
month = may,
howpublished = {\url{https://doi.org/10.5281/zenodo.7944399}},
note = {Accessed on YYYY-MM-DD.},
url = {https://doi.org/10.5281/zenodo.7944399},
doi = {10.5281/ZENODO.7944399},
timestamp = {Fri, 19 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/data/10/SchidlerS23b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@misc{DBLP:data/10/SchidlerS23c,
author = {Andr{\'{e}} Schidler and
Stefan Szeider},
title = {SAT-Boosted Tabu Search for Coloring Massive Graphs - Code (Version
1)},
publisher = {Zenodo},
year = {2023},
month = may,
howpublished = {\url{https://doi.org/10.5281/zenodo.7947477}},
note = {Accessed on YYYY-MM-DD.},
url = {https://doi.org/10.5281/zenodo.7947477},
doi = {10.5281/ZENODO.7947477},
timestamp = {Fri, 19 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/data/10/SchidlerS23c.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@misc{DBLP:data/10/SchidlerS23d,
author = {Andr{\'{e}} Schidler and
Stefan Szeider},
title = {Computing twin-width with branch {\&} bound - {PACE} Submission
(Version 1)},
publisher = {Zenodo},
year = {2023},
month = jun,
howpublished = {\url{https://doi.org/10.5281/zenodo.8033459}},
note = {Accessed on YYYY-MM-DD.},
url = {https://doi.org/10.5281/zenodo.8033459},
doi = {10.5281/ZENODO.8033459},
timestamp = {Fri, 19 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/data/10/SchidlerS23d.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@misc{DBLP:data/10/SchidlerS23e,
author = {Andr{\'{e}} Schidler and
Stefan Szeider},
title = {MaxSLIM Anytime MaxSAT Solver (Version 1)},
publisher = {Zenodo},
year = {2023},
month = dec,
howpublished = {\url{https://doi.org/10.5281/zenodo.10362710}},
note = {Accessed on YYYY-MM-DD.},
url = {https://doi.org/10.5281/zenodo.10362710},
doi = {10.5281/ZENODO.10362710},
timestamp = {Fri, 19 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/data/10/SchidlerS23e.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-10427,
author = {Markus Kirchweger and
Tom{\'{a}}s Peitl and
Stefan Szeider},
title = {Co-Certificate Learning with {SAT} Modulo Symmetries},
journal = {CoRR},
volume = {abs/2306.10427},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.10427},
doi = {10.48550/ARXIV.2306.10427},
eprinttype = {arXiv},
eprint = {2306.10427},
timestamp = {Fri, 23 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-10427.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-07103,
author = {Eduard Eiben and
Robert Ganian and
Iyad Kanj and
Sebastian Ordyniak and
Stefan Szeider},
title = {The Computational Complexity of Concise Hypersphere Classification},
journal = {CoRR},
volume = {abs/2312.07103},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.07103},
doi = {10.48550/ARXIV.2312.07103},
eprinttype = {arXiv},
eprint = {2312.07103},
timestamp = {Thu, 04 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-07103.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-07628,
author = {Eduard Eiben and
Robert Ganian and
Iyad Kanj and
Sebastian Ordyniak and
Stefan Szeider},
title = {Finding a Cluster in Incomplete Data},
journal = {CoRR},
volume = {abs/2312.07628},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.07628},
doi = {10.48550/ARXIV.2312.07628},
eprinttype = {arXiv},
eprint = {2312.07628},
timestamp = {Thu, 04 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-07628.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/HeuleLSS23,
author = {Marijn J. H. Heule and
In{\^{e}}s Lynce and
Stefan Szeider and
Andr{\'{e}} Schidler},
title = {{SAT} Encodings and Beyond (Dagstuhl Seminar 23261)},
journal = {Dagstuhl Reports},
volume = {13},
number = {6},
pages = {106--122},
year = {2023},
url = {https://doi.org/10.4230/DagRep.13.6.106},
doi = {10.4230/DAGREP.13.6.106},
timestamp = {Thu, 14 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/HeuleLSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GanianKS22,
author = {Robert Ganian and
Jan Kratochv{\'{\i}}l and
Stefan Szeider},
title = {Preface: Ninth workshop on graph classes, optimization, and Width
Parameters, Vienna, Austria},
journal = {Discret. Appl. Math.},
volume = {312},
pages = {1--2},
year = {2022},
url = {https://doi.org/10.1016/j.dam.2022.02.009},
doi = {10.1016/J.DAM.2022.02.009},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/GanianKS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/Ganian0SS22,
author = {Robert Ganian and
Eun Jung Kim and
Friedrich Slivovsky and
Stefan Szeider},
title = {Sum-of-Products with Default Values: Algorithms and Complexity Results},
journal = {J. Artif. Intell. Res.},
volume = {73},
pages = {535--552},
year = {2022},
url = {https://doi.org/10.1613/jair.1.12370},
doi = {10.1613/JAIR.1.12370},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jair/Ganian0SS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/GanianSSS22,
author = {Robert Ganian and
Andr{\'{e}} Schidler and
Manuel Sorge and
Stefan Szeider},
title = {Threshold Treewidth and Hypertree Width},
journal = {J. Artif. Intell. Res.},
volume = {74},
pages = {1687--1713},
year = {2022},
url = {https://doi.org/10.1613/jair.1.13661},
doi = {10.1613/JAIR.1.13661},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jair/GanianSSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GanianKS22,
author = {Robert Ganian and
Eun Jung Kim and
Stefan Szeider},
title = {Algorithmic Applications of Tree-Cut Width},
journal = {{SIAM} J. Discret. Math.},
volume = {36},
number = {4},
pages = {2635--2666},
year = {2022},
url = {https://doi.org/10.1137/20m137478x},
doi = {10.1137/20M137478X},
timestamp = {Sat, 11 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/GanianKS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/DvorakH0SSW22,
author = {Wolfgang Dvor{\'{a}}k and
Markus Hecher and
Matthias K{\"{o}}nig and
Andr{\'{e}} Schidler and
Stefan Szeider and
Stefan Woltran},
title = {Tractable Abstract Argumentation via Backdoor-Treewidth},
booktitle = {Thirty-Sixth {AAAI} Conference on Artificial Intelligence, {AAAI}
2022, Thirty-Fourth Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2022, The Twelveth Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2022 Virtual Event, February 22
- March 1, 2022},
pages = {5608--5615},
publisher = {{AAAI} Press},
year = {2022},
url = {https://doi.org/10.1609/aaai.v36i5.20501},
doi = {10.1609/AAAI.V36I5.20501},
timestamp = {Mon, 03 Mar 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/aaai/DvorakH0SSW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/SchidlerS22,
author = {Andr{\'{e}} Schidler and
Stefan Szeider},
editor = {Cynthia A. Phillips and
Bettina Speckmann},
title = {A {SAT} Approach to Twin-Width},
booktitle = {Proceedings of the Symposium on Algorithm Engineering and Experiments,
{ALENEX} 2022, Alexandria, VA, USA, January 9-10, 2022},
pages = {67--77},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977042.6},
doi = {10.1137/1.9781611977042.6},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/SchidlerS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cp/DreierOS22,
author = {Jan Dreier and
Sebastian Ordyniak and
Stefan Szeider},
editor = {Christine Solnon},
title = {{CSP} Beyond Tractable Constraint Languages},
booktitle = {28th International Conference on Principles and Practice of Constraint
Programming, {CP} 2022, July 31 to August 8, 2022, Haifa, Israel},
series = {LIPIcs},
volume = {235},
pages = {20:1--20:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CP.2022.20},
doi = {10.4230/LIPICS.CP.2022.20},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/cp/DreierOS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/DreierOS22,
author = {Jan Dreier and
Sebastian Ordyniak and
Stefan Szeider},
editor = {Shiri Chechik and
Gonzalo Navarro and
Eva Rotenberg and
Grzegorz Herman},
title = {{SAT} Backdoors: Depth Beats Size},
booktitle = {30th Annual European Symposium on Algorithms, {ESA} 2022, September
5-9, 2022, Berlin/Potsdam, Germany},
series = {LIPIcs},
volume = {244},
pages = {46:1--46:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ESA.2022.46},
doi = {10.4230/LIPICS.ESA.2022.46},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/DreierOS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/EibenGKOS22,
author = {Eduard Eiben and
Robert Ganian and
Iyad Kanj and
Sebastian Ordyniak and
Stefan Szeider},
editor = {Shiri Chechik and
Gonzalo Navarro and
Eva Rotenberg and
Grzegorz Herman},
title = {Finding a Cluster in Incomplete Data},
booktitle = {30th Annual European Symposium on Algorithms, {ESA} 2022, September
5-9, 2022, Berlin/Potsdam, Germany},
series = {LIPIcs},
volume = {244},
pages = {47:1--47:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ESA.2022.47},
doi = {10.4230/LIPICS.ESA.2022.47},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/EibenGKOS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/KirchwegerSS22,
author = {Markus Kirchweger and
Manfred Scheucher and
Stefan Szeider},
editor = {Kuldeep S. Meel and
Ofer Strichman},
title = {A {SAT} Attack on Rota's Basis Conjecture},
booktitle = {25th International Conference on Theory and Applications of Satisfiability
Testing, {SAT} 2022, August 2-5, 2022, Haifa, Israel},
series = {LIPIcs},
volume = {236},
pages = {4:1--4:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SAT.2022.4},
doi = {10.4230/LIPICS.SAT.2022.4},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/KirchwegerSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/GanianPSSS22,
author = {Robert Ganian and
Filip Pokr{\'{y}}vka and
Andr{\'{e}} Schidler and
Kirill Simonov and
Stefan Szeider},
editor = {Kuldeep S. Meel and
Ofer Strichman},
title = {Weighted Model Counting with Twin-Width},
booktitle = {25th International Conference on Theory and Applications of Satisfiability
Testing, {SAT} 2022, August 2-5, 2022, Haifa, Israel},
series = {LIPIcs},
volume = {236},
pages = {15:1--15:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SAT.2022.15},
doi = {10.4230/LIPICS.SAT.2022.15},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/GanianPSSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/uai/RamaswamyS22,
author = {Vaidyanathan Peruvemba Ramaswamy and
Stefan Szeider},
editor = {James Cussens and
Kun Zhang},
title = {Learning large Bayesian networks with expert constraints},
booktitle = {Uncertainty in Artificial Intelligence, Proceedings of the Thirty-Eighth
Conference on Uncertainty in Artificial Intelligence, {UAI} 2022,
1-5 August 2022, Eindhoven, The Netherlands},
series = {Proceedings of Machine Learning Research},
volume = {180},
pages = {1592--1601},
publisher = {{PMLR}},
year = {2022},
url = {https://proceedings.mlr.press/v180/peruvemba-ramaswamy22a.html},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/uai/RamaswamyS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/mfcs/2022,
editor = {Stefan Szeider and
Robert Ganian and
Alexandra Silva},
title = {47th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2022, August 22-26, 2022, Vienna, Austria},
series = {LIPIcs},
volume = {241},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://www.dagstuhl.de/dagpub/978-3-95977-256-3},
isbn = {978-3-95977-256-3},
timestamp = {Wed, 21 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/2022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@misc{DBLP:data/10/GanianPSSS22,
author = {Robert Ganian and
Filip Pokr{\'{y}}vka and
Andr{\'{e}} Schidler and
Kirill Simonov and
Stefan Szeider},
title = {Weighted Model Counting with Twin-Width: Experimental Results (Version
1)},
publisher = {Zenodo},
year = {2022},
month = jun,
howpublished = {\url{https://doi.org/10.5281/zenodo.6610819}},
note = {Accessed on YYYY-MM-DD.},
url = {https://doi.org/10.5281/zenodo.6610819},
doi = {10.5281/ZENODO.6610819},
timestamp = {Fri, 19 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/data/10/GanianPSSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@misc{DBLP:data/10/SchidlerS22,
author = {Andr{\'{e}} Schidler and
Stefan Szeider},
title = {Computing Optimal Hypertree Decompositions with {SAT} - Results (Version
1)},
publisher = {Zenodo},
year = {2022},
month = jul,
howpublished = {\url{https://doi.org/10.5281/zenodo.6832106}},
note = {Accessed on YYYY-MM-DD.},
url = {https://doi.org/10.5281/zenodo.6832106},
doi = {10.5281/ZENODO.6832106},
timestamp = {Fri, 19 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/data/10/SchidlerS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-08326,
author = {Jan Dreier and
Sebastian Ordyniak and
Stefan Szeider},
title = {{SAT} Backdoors: Depth Beats Size},
journal = {CoRR},
volume = {abs/2202.08326},
year = {2022},
url = {https://arxiv.org/abs/2202.08326},
eprinttype = {arXiv},
eprint = {2202.08326},
timestamp = {Tue, 01 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-08326.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2206-00752,
author = {Robert Ganian and
Eun Jung Kim and
Stefan Szeider},
title = {Algorithmic Applications of Tree-Cut Width},
journal = {CoRR},
volume = {abs/2206.00752},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2206.00752},
doi = {10.48550/ARXIV.2206.00752},
eprinttype = {arXiv},
eprint = {2206.00752},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2206-00752.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2206-01706,
author = {Robert Ganian and
Filip Pokr{\'{y}}vka and
Andr{\'{e}} Schidler and
Kirill Simonov and
Stefan Szeider},
title = {Weighted Model Counting with Twin-Width},
journal = {CoRR},
volume = {abs/2206.01706},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2206.01706},
doi = {10.48550/ARXIV.2206.01706},
eprinttype = {arXiv},
eprint = {2206.01706},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2206-01706.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2206-15225,
author = {Tom{\'{a}}s Peitl and
Stefan Szeider},
title = {Are Hitting Formulas Hard for Resolution?},
journal = {CoRR},
volume = {abs/2206.15225},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2206.15225},
doi = {10.48550/ARXIV.2206.15225},
eprinttype = {arXiv},
eprint = {2206.15225},
timestamp = {Mon, 04 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2206-15225.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-07040,
author = {Andr{\'{e}} Schidler and
Robert Ganian and
Manuel Sorge and
Stefan Szeider},
title = {Threshold Treewidth and Hypertree Width},
journal = {CoRR},
volume = {abs/2210.07040},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.07040},
doi = {10.48550/ARXIV.2210.07040},
eprinttype = {arXiv},
eprint = {2210.07040},
timestamp = {Tue, 18 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-07040.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ai/GanianS21,
author = {Robert Ganian and
Stefan Szeider},
title = {New width parameters for {SAT} and {\#}SAT},
journal = {Artif. Intell.},
volume = {295},
pages = {103460},
year = {2021},
url = {https://doi.org/10.1016/j.artint.2021.103460},
doi = {10.1016/J.ARTINT.2021.103460},
timestamp = {Sun, 16 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ai/GanianS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/PeitlS21,
author = {Tom{\'{a}}s Peitl and
Stefan Szeider},
title = {Finding the Hardest Formulas for Resolution},
journal = {J. Artif. Intell. Res.},
volume = {72},
pages = {69--97},
year = {2021},
url = {https://doi.org/10.1613/jair.1.12589},
doi = {10.1613/JAIR.1.12589},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jair/PeitlS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/RamaswamyS21,
author = {Vaidyanathan Peruvemba Ramaswamy and
Stefan Szeider},
title = {Turbocharging Treewidth-Bounded Bayesian Network Structure Learning},
booktitle = {Thirty-Fifth {AAAI} Conference on Artificial Intelligence, {AAAI}
2021, Thirty-Third Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2021, The Eleventh Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2021, Virtual Event, February 2-9,
2021},
pages = {3895--3903},
publisher = {{AAAI} Press},
year = {2021},
url = {https://doi.org/10.1609/aaai.v35i5.16508},
doi = {10.1609/AAAI.V35I5.16508},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/RamaswamyS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/SchidlerS21,
author = {Andr{\'{e}} Schidler and
Stefan Szeider},
title = {SAT-based Decision Tree Learning for Large Data Sets},
booktitle = {Thirty-Fifth {AAAI} Conference on Artificial Intelligence, {AAAI}
2021, Thirty-Third Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2021, The Eleventh Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2021, Virtual Event, February 2-9,
2021},
pages = {3904--3912},
publisher = {{AAAI} Press},
year = {2021},
url = {https://doi.org/10.1609/aaai.v35i5.16509},
doi = {10.1609/AAAI.V35I5.16509},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/SchidlerS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/OrdyniakS21,
author = {Sebastian Ordyniak and
Stefan Szeider},
title = {Parameterized Complexity of Small Decision Tree Learning},
booktitle = {Thirty-Fifth {AAAI} Conference on Artificial Intelligence, {AAAI}
2021, Thirty-Third Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2021, The Eleventh Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2021, Virtual Event, February 2-9,
2021},
pages = {6454--6462},
publisher = {{AAAI} Press},
year = {2021},
url = {https://doi.org/10.1609/aaai.v35i7.16800},
doi = {10.1609/AAAI.V35I7.16800},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/OrdyniakS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/EibenGKOS21,
author = {Eduard Eiben and
Robert Ganian and
Iyad Kanj and
Sebastian Ordyniak and
Stefan Szeider},
title = {The Parameterized Complexity of Clustering Incomplete Data},
booktitle = {Thirty-Fifth {AAAI} Conference on Artificial Intelligence, {AAAI}
2021, Thirty-Third Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2021, The Eleventh Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2021, Virtual Event, February 2-9,
2021},
pages = {7296--7304},
publisher = {{AAAI} Press},
year = {2021},
url = {https://doi.org/10.1609/aaai.v35i8.16896},
doi = {10.1609/AAAI.V35I8.16896},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/EibenGKOS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cp/KirchwegerS21,
author = {Markus Kirchweger and
Stefan Szeider},
editor = {Laurent D. Michel},
title = {{SAT} Modulo Symmetries for Graph Generation},
booktitle = {27th International Conference on Principles and Practice of Constraint
Programming, {CP} 2021, Montpellier, France (Virtual Conference),
October 25-29, 2021},
series = {LIPIcs},
volume = {210},
pages = {34:1--34:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CP.2021.34},
doi = {10.4230/LIPICS.CP.2021.34},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/cp/KirchwegerS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/OrdyniakSS21,
author = {Sebastian Ordyniak and
Andr{\'{e}} Schidler and
Stefan Szeider},
editor = {Zhi{-}Hua Zhou},
title = {Backdoor DNFs},
booktitle = {Proceedings of the Thirtieth International Joint Conference on Artificial
Intelligence, {IJCAI} 2021, Virtual Event / Montreal, Canada, 19-27
August 2021},
pages = {1403--1409},
publisher = {ijcai.org},
year = {2021},
url = {https://doi.org/10.24963/ijcai.2021/194},
doi = {10.24963/IJCAI.2021/194},
timestamp = {Tue, 15 Oct 2024 16:43:28 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/OrdyniakSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/SchidlerS21,
author = {Andr{\'{e}} Schidler and
Stefan Szeider},
editor = {Zhi{-}Hua Zhou},
title = {Computing Optimal Hypertree Decompositions with {SAT}},
booktitle = {Proceedings of the Thirtieth International Joint Conference on Artificial
Intelligence, {IJCAI} 2021, Virtual Event / Montreal, Canada, 19-27
August 2021},
pages = {1418--1424},
publisher = {ijcai.org},
year = {2021},
url = {https://doi.org/10.24963/ijcai.2021/196},
doi = {10.24963/IJCAI.2021/196},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/SchidlerS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/PeitlS21,
author = {Tom{\'{a}}s Peitl and
Stefan Szeider},
editor = {Zhi{-}Hua Zhou},
title = {Finding the Hardest Formulas for Resolution (Extended Abstract)},
booktitle = {Proceedings of the Thirtieth International Joint Conference on Artificial
Intelligence, {IJCAI} 2021, Virtual Event / Montreal, Canada, 19-27
August 2021},
pages = {4814--4818},
publisher = {ijcai.org},
year = {2021},
url = {https://doi.org/10.24963/ijcai.2021/657},
doi = {10.24963/IJCAI.2021/657},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/PeitlS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/RamaswamyS21,
author = {Vaidyanathan Peruvemba Ramaswamy and
Stefan Szeider},
editor = {Marc'Aurelio Ranzato and
Alina Beygelzimer and
Yann N. Dauphin and
Percy Liang and
Jennifer Wortman Vaughan},
title = {Learning Fast-Inference Bayesian Networks},
booktitle = {Advances in Neural Information Processing Systems 34: Annual Conference
on Neural Information Processing Systems 2021, NeurIPS 2021, December
6-14, 2021, virtual},
pages = {17852--17863},
year = {2021},
url = {https://proceedings.neurips.cc/paper/2021/hash/94e70705efae423efda1088614128d0b-Abstract.html},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/nips/RamaswamyS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/ReichlSS21,
author = {Franz{-}Xaver Reichl and
Friedrich Slivovsky and
Stefan Szeider},
editor = {Chu{-}Min Li and
Felip Many{\`{a}}},
title = {Certified {DQBF} Solving by Definition Extraction},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2021 - 24th
International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12831},
pages = {499--517},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-80223-3\_34},
doi = {10.1007/978-3-030-80223-3\_34},
timestamp = {Mon, 21 Oct 2024 15:07:23 +0200},
biburl = {https://dblp.org/rec/conf/sat/ReichlSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:series/faia/SamerS21,
author = {Marko Samer and
Stefan Szeider},
editor = {Armin Biere and
Marijn Heule and
Hans van Maaren and
Toby Walsh},
title = {Fixed-Parameter Tractability},
booktitle = {Handbook of Satisfiability - Second Edition},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {336},
pages = {693--736},
publisher = {{IOS} Press},
year = {2021},
url = {https://doi.org/10.3233/FAIA201000},
doi = {10.3233/FAIA201000},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/series/faia/SamerS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@misc{DBLP:data/10/RamaswamyS21,
author = {Vaidyanathan Peruvemba Ramaswamy and
Stefan Szeider},
title = {aditya95sriram/bn-slim: NeurIPS 2021 (Version nips21)},
publisher = {Zenodo},
year = {2021},
month = oct,
howpublished = {\url{https://doi.org/10.5281/zenodo.5598257}},
note = {Accessed on YYYY-MM-DD.},
url = {https://doi.org/10.5281/zenodo.5598257},
doi = {10.5281/ZENODO.5598257},
timestamp = {Fri, 19 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/data/10/RamaswamyS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@misc{DBLP:data/10/SchidlerS21,
author = {Andr{\'{e}} Schidler and
Stefan Szeider},
title = {{DT-SLIM} Results (Version 1)},
publisher = {Zenodo},
year = {2021},
month = mar,
howpublished = {\url{https://doi.org/10.5281/zenodo.4571571}},
note = {Accessed on YYYY-MM-DD.},
url = {https://doi.org/10.5281/zenodo.4571571},
doi = {10.5281/ZENODO.4571571},
timestamp = {Fri, 19 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/data/10/SchidlerS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@misc{DBLP:data/10/SchidlerS21a,
author = {Andr{\'{e}} Schidler and
Stefan Szeider},
title = {{DT-SLIM:} SAT-based Decision Tree Learning for Large Data Sets (Version
1)},
publisher = {Zenodo},
year = {2021},
month = mar,
howpublished = {\url{https://doi.org/10.5281/zenodo.4575724}},
note = {Accessed on YYYY-MM-DD.},
url = {https://doi.org/10.5281/zenodo.4575724},
doi = {10.5281/ZENODO.4575724},
timestamp = {Fri, 19 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/data/10/SchidlerS21a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@misc{DBLP:data/10/SchidlerS21b,
author = {Andr{\'{e}} Schidler and
Stefan Szeider},
title = {HtdLEO Results (Version 1)},
publisher = {Zenodo},
year = {2021},
month = may,
howpublished = {\url{https://doi.org/10.5281/zenodo.4742070}},
note = {Accessed on YYYY-MM-DD.},
url = {https://doi.org/10.5281/zenodo.4742070},
doi = {10.5281/ZENODO.4742070},
timestamp = {Fri, 19 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/data/10/SchidlerS21b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@misc{DBLP:data/10/SchidlerS21c,
author = {Andr{\'{e}} Schidler and
Stefan Szeider},
title = {HtdLEO source code (Version 1)},
publisher = {Zenodo},
year = {2021},
month = may,
howpublished = {\url{https://doi.org/10.5281/zenodo.4742100}},
note = {Accessed on YYYY-MM-DD.},
url = {https://doi.org/10.5281/zenodo.4742100},
doi = {10.5281/ZENODO.4742100},
timestamp = {Fri, 19 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/data/10/SchidlerS21c.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@misc{DBLP:data/10/SchidlerS21d,
author = {Andr{\'{e}} Schidler and
Stefan Szeider},
title = {A {SAT} Approach to Twin-Width (Version 1)},
publisher = {Zenodo},
year = {2021},
month = oct,
howpublished = {\url{https://doi.org/10.5281/zenodo.5564192}},
note = {Accessed on YYYY-MM-DD.},
url = {https://doi.org/10.5281/zenodo.5564192},
doi = {10.5281/ZENODO.5564192},
timestamp = {Fri, 19 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/data/10/SchidlerS21d.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-03607,
author = {Laura Kov{\'{a}}cs and
Hanna Lachnitt and
Stefan Szeider},
title = {Formalizing Graph Trail Properties in Isabelle/HOL},
journal = {CoRR},
volume = {abs/2103.03607},
year = {2021},
url = {https://arxiv.org/abs/2103.03607},
eprinttype = {arXiv},
eprint = {2103.03607},
timestamp = {Mon, 15 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-03607.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-02550,
author = {Franz{-}Xaver Reichl and
Friedrich Slivovsky and
Stefan Szeider},
title = {Certified {DQBF} Solving by Definition Extraction},
journal = {CoRR},
volume = {abs/2106.02550},
year = {2021},
url = {https://arxiv.org/abs/2106.02550},
eprinttype = {arXiv},
eprint = {2106.02550},
timestamp = {Thu, 10 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-02550.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2110-06146,
author = {Andr{\'{e}} Schidler and
Stefan Szeider},
title = {A {SAT} Approach to Twin-Width},
journal = {CoRR},
volume = {abs/2110.06146},
year = {2021},
url = {https://arxiv.org/abs/2110.06146},
eprinttype = {arXiv},
eprint = {2110.06146},
timestamp = {Fri, 22 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2110-06146.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/GanianHKS20,
author = {Robert Ganian and
Ronald de Haan and
Iyad Kanj and
Stefan Szeider},
title = {On Existential {MSO} and Its Relation to {ETH}},
journal = {{ACM} Trans. Comput. Theory},
volume = {12},
number = {4},
pages = {22:1--22:32},
year = {2020},
url = {https://doi.org/10.1145/3417759},
doi = {10.1145/3417759},
timestamp = {Sun, 19 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/toct/GanianHKS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/GanianKOS20,
author = {Robert Ganian and
Iyad Kanj and
Sebastian Ordyniak and
Stefan Szeider},
title = {On the Parameterized Complexity of Clustering Incomplete Data into
Subspaces of Small Rank},
booktitle = {The Thirty-Fourth {AAAI} Conference on Artificial Intelligence, {AAAI}
2020, The Thirty-Second Innovative Applications of Artificial Intelligence
Conference, {IAAI} 2020, The Tenth {AAAI} Symposium on Educational
Advances in Artificial Intelligence, {EAAI} 2020, New York, NY, USA,
February 7-12, 2020},
pages = {3906--3913},
publisher = {{AAAI} Press},
year = {2020},
url = {https://doi.org/10.1609/aaai.v34i04.5804},
doi = {10.1609/AAAI.V34I04.5804},
timestamp = {Mon, 04 Sep 2023 12:29:24 +0200},
biburl = {https://dblp.org/rec/conf/aaai/GanianKOS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/SchidlerS20,
author = {Andr{\'{e}} Schidler and
Stefan Szeider},
editor = {Guy E. Blelloch and
Irene Finocchi},
title = {Computing Optimal Hypertree Decompositions},
booktitle = {Proceedings of the Symposium on Algorithm Engineering and Experiments,
{ALENEX} 2020, Salt Lake City, UT, USA, January 5-6, 2020},
pages = {1--11},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611976007.1},
doi = {10.1137/1.9781611976007.1},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/SchidlerS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cp/FichteHS20,
author = {Johannes Klaus Fichte and
Markus Hecher and
Stefan Szeider},
editor = {Helmut Simonis},
title = {A Time Leap Challenge for SAT-Solving},
booktitle = {Principles and Practice of Constraint Programming - 26th International
Conference, {CP} 2020, Louvain-la-Neuve, Belgium, September 7-11,
2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12333},
pages = {267--285},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-58475-7\_16},
doi = {10.1007/978-3-030-58475-7\_16},
timestamp = {Sat, 19 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cp/FichteHS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cp/FichteHS20a,
author = {Johannes Klaus Fichte and
Markus Hecher and
Stefan Szeider},
editor = {Helmut Simonis},
title = {Breaking Symmetries with RootClique and LexTopSort},
booktitle = {Principles and Practice of Constraint Programming - 26th International
Conference, {CP} 2020, Louvain-la-Neuve, Belgium, September 7-11,
2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12333},
pages = {286--303},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-58475-7\_17},
doi = {10.1007/978-3-030-58475-7\_17},
timestamp = {Sat, 19 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cp/FichteHS20a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cp/RamaswamyS20,
author = {Vaidyanathan Peruvemba Ramaswamy and
Stefan Szeider},
editor = {Helmut Simonis},
title = {MaxSAT-Based Postprocessing for Treedepth},
booktitle = {Principles and Practice of Constraint Programming - 26th International
Conference, {CP} 2020, Louvain-la-Neuve, Belgium, September 7-11,
2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12333},
pages = {478--495},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-58475-7\_28},
doi = {10.1007/978-3-030-58475-7\_28},
timestamp = {Sat, 19 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cp/RamaswamyS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cp/PeitlS20,
author = {Tom{\'{a}}s Peitl and
Stefan Szeider},
editor = {Helmut Simonis},
title = {Finding the Hardest Formulas for Resolution},
booktitle = {Principles and Practice of Constraint Programming - 26th International
Conference, {CP} 2020, Louvain-la-Neuve, Belgium, September 7-11,
2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12333},
pages = {514--530},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-58475-7\_30},
doi = {10.1007/978-3-030-58475-7\_30},
timestamp = {Sat, 19 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cp/PeitlS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/GanianSSS20,
author = {Robert Ganian and
Andr{\'{e}} Schidler and
Manuel Sorge and
Stefan Szeider},
editor = {Christian Bessiere},
title = {Threshold Treewidth and Hypertree Width},
booktitle = {Proceedings of the Twenty-Ninth International Joint Conference on
Artificial Intelligence, {IJCAI} 2020},
pages = {1898--1904},
publisher = {ijcai.org},
year = {2020},
url = {https://doi.org/10.24963/ijcai.2020/263},
doi = {10.24963/IJCAI.2020/263},
timestamp = {Tue, 15 Oct 2024 16:43:28 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/GanianSSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kr/GanianPSS20,
author = {Robert Ganian and
Tom{\'{a}}s Peitl and
Friedrich Slivovsky and
Stefan Szeider},
editor = {Diego Calvanese and
Esra Erdem and
Michael Thielscher},
title = {Fixed-Parameter Tractability of Dependency {QBF} with Structural Parameters},
booktitle = {Proceedings of the 17th International Conference on Principles of
Knowledge Representation and Reasoning, {KR} 2020, Rhodes, Greece,
September 12-18, 2020},
pages = {392--402},
year = {2020},
url = {https://doi.org/10.24963/kr.2020/40},
doi = {10.24963/KR.2020/40},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/kr/GanianPSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mkm/KovacsLS20,
author = {Laura Kov{\'{a}}cs and
Hanna Lachnitt and
Stefan Szeider},
editor = {Christoph Benzm{\"{u}}ller and
Bruce R. Miller},
title = {Formalizing Graph Trail Properties in Isabelle/HOL},
booktitle = {Intelligent Computer Mathematics - 13th International Conference,
{CICM} 2020, Bertinoro, Italy, July 26-31, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12236},
pages = {190--205},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-53518-6\_12},
doi = {10.1007/978-3-030-53518-6\_12},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mkm/KovacsLS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/SlivovskyS20,
author = {Friedrich Slivovsky and
Stefan Szeider},
editor = {Luca Pulina and
Martina Seidl},
title = {A Faster Algorithm for Propositional Model Counting Parameterized
by Incidence Treewidth},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2020 - 23rd
International Conference, Alghero, Italy, July 3-10, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12178},
pages = {267--276},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-51825-7\_19},
doi = {10.1007/978-3-030-51825-7\_19},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/SlivovskyS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/ShuklaSS20,
author = {Ankit Shukla and
Friedrich Slivovsky and
Stefan Szeider},
editor = {Luca Pulina and
Martina Seidl},
title = {Short Q-Resolution Proofs with Homomorphisms},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2020 - 23rd
International Conference, Alghero, Italy, July 3-10, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12178},
pages = {412--428},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-51825-7\_29},
doi = {10.1007/978-3-030-51825-7\_29},
timestamp = {Wed, 27 Aug 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/ShuklaSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-13843,
author = {P. R. Vaidyanathan and
Stefan Szeider},
title = {Turbocharging Treewidth-Bounded Bayesian Network Structure Learning},
journal = {CoRR},
volume = {abs/2006.13843},
year = {2020},
url = {https://arxiv.org/abs/2006.13843},
eprinttype = {arXiv},
eprint = {2006.13843},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-13843.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-02215,
author = {Johannes Klaus Fichte and
Markus Hecher and
Stefan Szeider},
title = {A Time Leap Challenge for {SAT} Solving},
journal = {CoRR},
volume = {abs/2008.02215},
year = {2020},
url = {https://arxiv.org/abs/2008.02215},
eprinttype = {arXiv},
eprint = {2008.02215},
timestamp = {Fri, 07 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-02215.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/HaanS19,
author = {Ronald de Haan and
Stefan Szeider},
title = {A Compendium of Parameterized Problems at Higher Levels of the Polynomial
Hierarchy},
journal = {Algorithms},
volume = {12},
number = {9},
pages = {188},
year = {2019},
url = {https://doi.org/10.3390/a12090188},
doi = {10.3390/A12090188},
timestamp = {Thu, 04 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithms/HaanS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PaulusmaS19,
author = {Dani{\"{e}}l Paulusma and
Stefan Szeider},
title = {On the parameterized complexity of (\emph{k}, \emph{s})-SAT},
journal = {Inf. Process. Lett.},
volume = {143},
pages = {34--36},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.11.005},
doi = {10.1016/J.IPL.2018.11.005},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PaulusmaS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/PeitlSS19,
author = {Tom{\'{a}}s Peitl and
Friedrich Slivovsky and
Stefan Szeider},
title = {Dependency Learning for {QBF}},
journal = {J. Artif. Intell. Res.},
volume = {65},
pages = {180--208},
year = {2019},
url = {https://doi.org/10.1613/jair.1.11529},
doi = {10.1613/JAIR.1.11529},
timestamp = {Sun, 19 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jair/PeitlSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jar/PeitlSS19,
author = {Tom{\'{a}}s Peitl and
Friedrich Slivovsky and
Stefan Szeider},
title = {Long-Distance Q-Resolution with Dependency Schemes},
journal = {J. Autom. Reason.},
volume = {63},
number = {1},
pages = {127--155},
year = {2019},
url = {https://doi.org/10.1007/s10817-018-9467-3},
doi = {10.1007/S10817-018-9467-3},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jar/PeitlSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/PeitlSS19,
author = {Tom{\'{a}}s Peitl and
Friedrich Slivovsky and
Stefan Szeider},
title = {Qute in the {QBF} Evaluation 2018},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {11},
number = {1},
pages = {261--272},
year = {2019},
url = {https://doi.org/10.3233/SAT190124},
doi = {10.3233/SAT190124},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsat/PeitlSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tocl/LodhaOS19,
author = {Neha Lodha and
Sebastian Ordyniak and
Stefan Szeider},
title = {A {SAT} Approach to Branchwidth},
journal = {{ACM} Trans. Comput. Log.},
volume = {20},
number = {3},
pages = {15:1--15:24},
year = {2019},
url = {https://doi.org/10.1145/3326159},
doi = {10.1145/3326159},
timestamp = {Sun, 19 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tocl/LodhaOS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/GanianLOS19,
author = {Robert Ganian and
Neha Lodha and
Sebastian Ordyniak and
Stefan Szeider},
editor = {Stephen G. Kobourov and
Henning Meyerhenke},
title = {SAT-Encodings for Treecut Width and Treedepth},
booktitle = {Proceedings of the Twenty-First Workshop on Algorithm Engineering
and Experiments, {ALENEX} 2019, San Diego, CA, USA, January 7-8, 2019},
pages = {117--129},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975499.10},
doi = {10.1137/1.9781611975499.10},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/GanianLOS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cp/GanianOS19,
author = {Robert Ganian and
Sebastian Ordyniak and
Stefan Szeider},
editor = {Thomas Schiex and
Simon de Givry},
title = {A Join-Based Hybrid Parameter for Constraint Satisfaction},
booktitle = {Principles and Practice of Constraint Programming - 25th International
Conference, {CP} 2019, Stamford, CT, USA, September 30 - October 4,
2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11802},
pages = {195--212},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-30048-7\_12},
doi = {10.1007/978-3-030-30048-7\_12},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cp/GanianOS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/EibenGKS19,
author = {Eduard Eiben and
Robert Ganian and
Iyad Kanj and
Stefan Szeider},
editor = {Hanna M. Wallach and
Hugo Larochelle and
Alina Beygelzimer and
Florence d'Alch{\'{e}}{-}Buc and
Emily B. Fox and
Roman Garnett},
title = {The Parameterized Complexity of Cascading Portfolio Scheduling},
booktitle = {Advances in Neural Information Processing Systems 32: Annual Conference
on Neural Information Processing Systems 2019, NeurIPS 2019, December
8-14, 2019, Vancouver, BC, Canada},
pages = {7666--7676},
year = {2019},
url = {https://proceedings.neurips.cc/paper/2019/hash/8ce1a43fb75e779c6b794ba4d255cf6d-Abstract.html},
timestamp = {Mon, 16 May 2022 15:41:51 +0200},
biburl = {https://dblp.org/rec/conf/nips/EibenGKS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/PeitlSS19,
author = {Tom{\'{a}}s Peitl and
Friedrich Slivovsky and
Stefan Szeider},
editor = {Mikol{\'{a}}s Janota and
In{\^{e}}s Lynce},
title = {Combining Resolution-Path Dependencies with Dependency Learning},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2019 - 22nd
International Conference, {SAT} 2019, Lisbon, Portugal, July 9-12,
2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11628},
pages = {306--318},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-24258-9\_22},
doi = {10.1007/978-3-030-24258-9\_22},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/PeitlSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/PeitlSS19a,
author = {Tom{\'{a}}s Peitl and
Friedrich Slivovsky and
Stefan Szeider},
editor = {Mikol{\'{a}}s Janota and
In{\^{e}}s Lynce},
title = {Proof Complexity of Fragments of Long-Distance Q-Resolution},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2019 - 22nd
International Conference, {SAT} 2019, Lisbon, Portugal, July 9-12,
2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11628},
pages = {319--335},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-24258-9\_23},
doi = {10.1007/978-3-030-24258-9\_23},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/PeitlSS19a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-12335,
author = {Robert Ganian and
Sebastian Ordyniak and
Stefan Szeider},
title = {A Join-Based Hybrid Parameter for Constraint Satisfaction},
journal = {CoRR},
volume = {abs/1907.12335},
year = {2019},
url = {http://arxiv.org/abs/1907.12335},
eprinttype = {arXiv},
eprint = {1907.12335},
timestamp = {Thu, 01 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-12335.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-01465,
author = {Eduard Eiben and
Robert Ganian and
Iyad Kanj and
Sebastian Ordyniak and
Stefan Szeider},
title = {On Clustering Incomplete Data},
journal = {CoRR},
volume = {abs/1911.01465},
year = {2019},
url = {http://arxiv.org/abs/1911.01465},
eprinttype = {arXiv},
eprint = {1911.01465},
timestamp = {Mon, 11 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-01465.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-12995,
author = {Robert Ganian and
Neha Lodha and
Sebastian Ordyniak and
Stefan Szeider},
title = {SAT-Encodings for Treecut Width and Treedepth},
journal = {CoRR},
volume = {abs/1911.12995},
year = {2019},
url = {http://arxiv.org/abs/1911.12995},
eprinttype = {arXiv},
eprint = {1911.12995},
timestamp = {Wed, 08 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-12995.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EibenGS18,
author = {Eduard Eiben and
Robert Ganian and
Stefan Szeider},
title = {Solving Problems on Graphs of High Rank-Width},
journal = {Algorithmica},
volume = {80},
number = {2},
pages = {742--771},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0290-8},
doi = {10.1007/S00453-017-0290-8},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/EibenGS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/EibenGS18,
author = {Eduard Eiben and
Robert Ganian and
Stefan Szeider},
title = {Meta-kernelization using well-structured modulators},
journal = {Discret. Appl. Math.},
volume = {248},
pages = {153--167},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2017.09.018},
doi = {10.1016/J.DAM.2017.09.018},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/EibenGS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cp/FichteHLS18,
author = {Johannes Klaus Fichte and
Markus Hecher and
Neha Lodha and
Stefan Szeider},
editor = {John N. Hooker},
title = {An {SMT} Approach to Fractional Hypertree Width},
booktitle = {Principles and Practice of Constraint Programming - 24th International
Conference, {CP} 2018, Lille, France, August 27-31, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11008},
pages = {109--127},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-98334-9\_8},
doi = {10.1007/978-3-319-98334-9\_8},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cp/FichteHLS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cp/HoosPSS18,
author = {Holger H. Hoos and
Tom{\'{a}}s Peitl and
Friedrich Slivovsky and
Stefan Szeider},
editor = {John N. Hooker},
title = {Portfolio-Based Algorithm Selection for Circuit QBFs},
booktitle = {Principles and Practice of Constraint Programming - 24th International
Conference, {CP} 2018, Lille, France, August 27-31, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11008},
pages = {195--209},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-98334-9\_13},
doi = {10.1007/978-3-319-98334-9\_13},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cp/HoosPSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/GanianKOS18,
author = {Robert Ganian and
Iyad A. Kanj and
Sebastian Ordyniak and
Stefan Szeider},
editor = {Jennifer G. Dy and
Andreas Krause},
title = {Parameterized Algorithms for the Matrix Completion Problem},
booktitle = {Proceedings of the 35th International Conference on Machine Learning,
{ICML} 2018, Stockholmsm{\"{a}}ssan, Stockholm, Sweden, July
10-15, 2018},
series = {Proceedings of Machine Learning Research},
volume = {80},
pages = {1642--1651},
publisher = {{PMLR}},
year = {2018},
url = {http://proceedings.mlr.press/v80/ganian18a.html},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icml/GanianKOS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictai/Ganian0SS18,
author = {Robert Ganian and
Eun Jung Kim and
Friedrich Slivovsky and
Stefan Szeider},
editor = {Lefteri H. Tsoukalas and
{\'{E}}ric Gr{\'{e}}goire and
Miltiadis Alamaniotis},
title = {Sum-of-Products with Default Values: Algorithms and Complexity Results},
booktitle = {{IEEE} 30th International Conference on Tools with Artificial Intelligence,
{ICTAI} 2018, 5-7 November 2018, Volos, Greece},
pages = {733--737},
publisher = {{IEEE}},
year = {2018},
url = {https://doi.org/10.1109/ICTAI.2018.00115},
doi = {10.1109/ICTAI.2018.00115},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ictai/Ganian0SS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/PeitlSS18,
author = {Tom{\'{a}}s Peitl and
Friedrich Slivovsky and
Stefan Szeider},
editor = {Olaf Beyersdorff and
Christoph M. Wintersteiger},
title = {Polynomial-Time Validation of {QCDCL} Certificates},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2018 - 21st
International Conference, {SAT} 2018, Held as Part of the Federated
Logic Conference, FloC 2018, Oxford, UK, July 9-12, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10929},
pages = {253--269},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-94144-8\_16},
doi = {10.1007/978-3-319-94144-8\_16},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/PeitlSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-03423,
author = {Robert Ganian and
Iyad A. Kanj and
Sebastian Ordyniak and
Stefan Szeider},
title = {Parameterized Algorithms for the Matrix Completion Problem},
journal = {CoRR},
volume = {abs/1804.03423},
year = {2018},
url = {http://arxiv.org/abs/1804.03423},
eprinttype = {arXiv},
eprint = {1804.03423},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-03423.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/MullerS17,
author = {Moritz M{\"{u}}ller and
Stefan Szeider},
title = {The treewidth of proofs},
journal = {Inf. Comput.},
volume = {255},
pages = {147--164},
year = {2017},
url = {https://doi.org/10.1016/j.ic.2017.05.005},
doi = {10.1016/J.IC.2017.05.005},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/MullerS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GaspersMOSZ17,
author = {Serge Gaspers and
Neeldhara Misra and
Sebastian Ordyniak and
Stefan Szeider and
Stanislav Zivn{\'{y}}},
title = {Backdoors into heterogeneous classes of {SAT} and {CSP}},
journal = {J. Comput. Syst. Sci.},
volume = {85},
pages = {38--56},
year = {2017},
url = {https://doi.org/10.1016/j.jcss.2016.10.007},
doi = {10.1016/J.JCSS.2016.10.007},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/GaspersMOSZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/HaanS17,
author = {Ronald de Haan and
Stefan Szeider},
title = {Parameterized complexity classes beyond para-NP},
journal = {J. Comput. Syst. Sci.},
volume = {87},
pages = {16--57},
year = {2017},
url = {https://doi.org/10.1016/j.jcss.2017.02.002},
doi = {10.1016/J.JCSS.2017.02.002},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/HaanS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GanianRS17,
author = {Robert Ganian and
M. S. Ramanujan and
Stefan Szeider},
title = {Discovering Archipelagos of Tractability for Constraint Satisfaction
and Counting},
journal = {{ACM} Trans. Algorithms},
volume = {13},
number = {2},
pages = {29:1--29:32},
year = {2017},
url = {https://doi.org/10.1145/3014587},
doi = {10.1145/3014587},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/GanianRS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tocl/HaanKS17,
author = {Ronald de Haan and
Iyad A. Kanj and
Stefan Szeider},
title = {On the Parameterized Complexity of Finding Small Unsatisfiable Subsets
of {CNF} Formulas and {CSP} Instances},
journal = {{ACM} Trans. Comput. Log.},
volume = {18},
number = {3},
pages = {21:1--21:46},
year = {2017},
url = {https://doi.org/10.1145/3091528},
doi = {10.1145/3091528},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tocl/HaanKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/RamanujanS17,
author = {M. S. Ramanujan and
Stefan Szeider},
editor = {Satinder Singh and
Shaul Markovitch},
title = {Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable},
booktitle = {Proceedings of the Thirty-First {AAAI} Conference on Artificial Intelligence,
February 4-9, 2017, San Francisco, California, {USA}},
pages = {3929--3935},
publisher = {{AAAI} Press},
year = {2017},
url = {https://doi.org/10.1609/aaai.v31i1.11132},
doi = {10.1609/AAAI.V31I1.11132},
timestamp = {Mon, 04 Sep 2023 14:40:32 +0200},
biburl = {https://dblp.org/rec/conf/aaai/RamanujanS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/LodhaOS17,
author = {Neha Lodha and
Sebastian Ordyniak and
Stefan Szeider},
editor = {Carles Sierra},
title = {A {SAT} Approach to Branchwidth},
booktitle = {Proceedings of the Twenty-Sixth International Joint Conference on
Artificial Intelligence, {IJCAI} 2017, Melbourne, Australia, August
19-25, 2017},
pages = {4894--4898},
publisher = {ijcai.org},
year = {2017},
url = {https://doi.org/10.24963/ijcai.2017/689},
doi = {10.24963/IJCAI.2017/689},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/LodhaOS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lpnmr/FichteS17,
author = {Johannes Klaus Fichte and
Stefan Szeider},
editor = {Bart Bogaerts and
Amelia Harrison},
title = {Backdoor Trees for Answer Set Programming},
booktitle = {Proceedings of the 10th Workshop on Answer Set Programming and Other
Computing Paradigms co-located with the 14th International Conference
on Logic Programming and Nonmonotonic Reasoning, ASPOCP@LPNMR 2017,
Espoo, Finland, July 3, 2017},
series = {{CEUR} Workshop Proceedings},
volume = {1868},
publisher = {CEUR-WS.org},
year = {2017},
url = {https://ceur-ws.org/Vol-1868/p9.pdf},
timestamp = {Fri, 10 Mar 2023 16:23:44 +0100},
biburl = {https://dblp.org/rec/conf/lpnmr/FichteS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/BovaS17,
author = {Simone Bova and
Stefan Szeider},
editor = {Emanuel Sallinger and
Jan Van den Bussche and
Floris Geerts},
title = {Circuit Treewidth, Sentential Decision, and Query Compilation},
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 = {233--246},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3034786.3034787},
doi = {10.1145/3034786.3034787},
timestamp = {Sun, 19 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pods/BovaS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/GanianRS17,
author = {Robert Ganian and
M. S. Ramanujan and
Stefan Szeider},
editor = {Serge Gaspers and
Toby Walsh},
title = {Backdoor Treewidth for {SAT}},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2017 - 20th
International Conference, Melbourne, VIC, Australia, August 28 - September
1, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10491},
pages = {20--37},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-66263-3\_2},
doi = {10.1007/978-3-319-66263-3\_2},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/GanianRS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/GanianS17,
author = {Robert Ganian and
Stefan Szeider},
editor = {Serge Gaspers and
Toby Walsh},
title = {New Width Parameters for Model Counting},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2017 - 20th
International Conference, Melbourne, VIC, Australia, August 28 - September
1, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10491},
pages = {38--52},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-66263-3\_3},
doi = {10.1007/978-3-319-66263-3\_3},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/GanianS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/PeitlSS17,
author = {Tom{\'{a}}s Peitl and
Friedrich Slivovsky and
Stefan Szeider},
editor = {Serge Gaspers and
Toby Walsh},
title = {Dependency Learning for {QBF}},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2017 - 20th
International Conference, Melbourne, VIC, Australia, August 28 - September
1, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10491},
pages = {298--313},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-66263-3\_19},
doi = {10.1007/978-3-319-66263-3\_19},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/PeitlSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/FichteLS17,
author = {Johannes Klaus Fichte and
Neha Lodha and
Stefan Szeider},
editor = {Serge Gaspers and
Toby Walsh},
title = {SAT-Based Local Improvement for Finding Tree Decompositions of Small
Width},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2017 - 20th
International Conference, Melbourne, VIC, Australia, August 28 - September
1, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10491},
pages = {401--411},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-66263-3\_25},
doi = {10.1007/978-3-319-66263-3\_25},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/FichteLS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/LodhaOS17,
author = {Neha Lodha and
Sebastian Ordyniak and
Stefan Szeider},
editor = {Serge Gaspers and
Toby Walsh},
title = {SAT-Encodings for Special Treewidth and Pathwidth},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2017 - 20th
International Conference, Melbourne, VIC, Australia, August 28 - September
1, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10491},
pages = {429--445},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-66263-3\_27},
doi = {10.1007/978-3-319-66263-3\_27},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/LodhaOS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GanianRS17,
author = {Robert Ganian and
M. S. Ramanujan and
Stefan Szeider},
editor = {Heribert Vollmer and
Brigitte Vall{\'{e}}e},
title = {Combining Treewidth and Backdoors for {CSP}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science, {STACS}
2017, March 8-11, 2017, Hannover, Germany},
series = {LIPIcs},
volume = {66},
pages = {36:1--36:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.STACS.2017.36},
doi = {10.4230/LIPICS.STACS.2017.36},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/GanianRS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:conf/dagstuhl/GaspersOS17,
author = {Serge Gaspers and
Sebastian Ordyniak and
Stefan Szeider},
editor = {Andrei A. Krokhin and
Stanislav Zivn{\'{y}}},
title = {Backdoor Sets for {CSP}},
booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability},
series = {Dagstuhl Follow-Ups},
volume = {7},
pages = {137--157},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/DFU.Vol7.15301.5},
doi = {10.4230/DFU.VOL7.15301.5},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/GaspersOS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BovaS17,
author = {Simone Bova and
Stefan Szeider},
title = {Circuit Treewidth, Sentential Decision, and Query Compilation},
journal = {CoRR},
volume = {abs/1701.04626},
year = {2017},
url = {http://arxiv.org/abs/1701.04626},
eprinttype = {arXiv},
eprint = {1701.04626},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BovaS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/DarwicheMSS17,
author = {Adnan Darwiche and
Pierre Marquis and
Dan Suciu and
Stefan Szeider},
title = {Recent Trends in Knowledge Compilation (Dagstuhl Seminar 17381)},
journal = {Dagstuhl Reports},
volume = {7},
number = {9},
pages = {62--85},
year = {2017},
url = {https://doi.org/10.4230/DagRep.7.9.62},
doi = {10.4230/DAGREP.7.9.62},
timestamp = {Mon, 12 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/DarwicheMSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GaspersORSS16,
author = {Serge Gaspers and
Sebastian Ordyniak and
M. S. Ramanujan and
Saket Saurabh and
Stefan Szeider},
title = {Backdoors to q-Horn},
journal = {Algorithmica},
volume = {74},
number = {1},
pages = {540--557},
year = {2016},
url = {https://doi.org/10.1007/s00453-014-9958-5},
doi = {10.1007/S00453-014-9958-5},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GaspersORSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PaulusmaSS16,
author = {Dani{\"{e}}l Paulusma and
Friedrich Slivovsky and
Stefan Szeider},
title = {Model Counting for {CNF} Formulas of Bounded Modular Treewidth},
journal = {Algorithmica},
volume = {76},
number = {1},
pages = {168--194},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0030-x},
doi = {10.1007/S00453-015-0030-X},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/PaulusmaSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jar/SlivovskyS16,
author = {Friedrich Slivovsky and
Stefan Szeider},
title = {Quantifier Reordering for {QBF}},
journal = {J. Autom. Reason.},
volume = {56},
number = {4},
pages = {459--477},
year = {2016},
url = {https://doi.org/10.1007/s10817-015-9353-1},
doi = {10.1007/S10817-015-9353-1},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jar/SlivovskyS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GanianSS16,
author = {Robert Ganian and
Friedrich Slivovsky and
Stefan Szeider},
title = {Meta-kernelization with structural parameters},
journal = {J. Comput. Syst. Sci.},
volume = {82},
number = {2},
pages = {333--346},
year = {2016},
url = {https://doi.org/10.1016/j.jcss.2015.08.003},
doi = {10.1016/J.JCSS.2015.08.003},
timestamp = {Sun, 19 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/GanianSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SlivovskyS16,
author = {Friedrich Slivovsky and
Stefan Szeider},
title = {Soundness of Q-resolution with dependency schemes},
journal = {Theor. Comput. Sci.},
volume = {612},
pages = {83--101},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2015.10.020},
doi = {10.1016/J.TCS.2015.10.020},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/SlivovskyS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BovaGS16,
author = {Simone Bova and
Robert Ganian and
Stefan Szeider},
title = {Quantified conjunctive queries on partially ordered sets},
journal = {Theor. Comput. Sci.},
volume = {618},
pages = {72--84},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2016.01.010},
doi = {10.1016/J.TCS.2016.01.010},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BovaGS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tocl/BovaGS16,
author = {Simone Bova and
Robert Ganian and
Stefan Szeider},
title = {Model Checking Existential Logic on Partially Ordered Sets},
journal = {{ACM} Trans. Comput. Log.},
volume = {17},
number = {2},
pages = {10},
year = {2016},
url = {https://doi.org/10.1145/2814937},
doi = {10.1145/2814937},
timestamp = {Sun, 19 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tocl/BovaGS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cp/GanianRS16,
author = {Robert Ganian and
M. S. Ramanujan and
Stefan Szeider},
editor = {Michel Rueher},
title = {Backdoors to Tractable Valued {CSP}},
booktitle = {Principles and Practice of Constraint Programming - 22nd International
Conference, {CP} 2016, Toulouse, France, September 5-9, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9892},
pages = {233--250},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-44953-1\_16},
doi = {10.1007/978-3-319-44953-1\_16},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cp/GanianRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/GanianKST16,
author = {Robert Ganian and
Martin Kalany and
Stefan Szeider and
Jesper Larsson Tr{\"{a}}ff},
title = {Polynomial-Time Construction of Optimal {MPI} Derived Datatype Trees},
booktitle = {2016 {IEEE} International Parallel and Distributed Processing Symposium,
{IPDPS} 2016, Chicago, IL, USA, May 23-27, 2016},
pages = {638--647},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/IPDPS.2016.13},
doi = {10.1109/IPDPS.2016.13},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipps/GanianKST16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kr/HaanS16,
author = {Ronald de Haan and
Stefan Szeider},
editor = {Chitta Baral and
James P. Delgrande and
Frank Wolter},
title = {Parameterized Complexity Results for Symbolic Model Checking of Temporal
Logics},
booktitle = {Principles of Knowledge Representation and Reasoning: Proceedings
of the Fifteenth International Conference, {KR} 2016, Cape Town, South
Africa, April 25-29, 2016},
pages = {453--462},
publisher = {{AAAI} Press},
year = {2016},
url = {http://www.aaai.org/ocs/index.php/KR/KR16/paper/view/12864},
timestamp = {Tue, 09 Feb 2021 08:33:50 +0100},
biburl = {https://dblp.org/rec/conf/kr/HaanS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GanianHKS16,
author = {Robert Ganian and
Ronald de Haan and
Iyad A. Kanj and
Stefan Szeider},
editor = {Piotr Faliszewski and
Anca Muscholl and
Rolf Niedermeier},
title = {On Existential {MSO} and its Relation to {ETH}},
booktitle = {41st International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2016, August 22-26, 2016 - Krak{\'{o}}w, Poland},
series = {LIPIcs},
volume = {58},
pages = {42:1--42:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2016.42},
doi = {10.4230/LIPICS.MFCS.2016.42},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/GanianHKS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/LodhaOS16,
author = {Neha Lodha and
Sebastian Ordyniak and
Stefan Szeider},
editor = {Nadia Creignou and
Daniel Le Berre},
title = {A {SAT} Approach to Branchwidth},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2016 - 19th
International Conference, Bordeaux, France, July 5-8, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9710},
pages = {179--195},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-40970-2\_12},
doi = {10.1007/978-3-319-40970-2\_12},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/LodhaOS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/PeitlSS16,
author = {Tom{\'{a}}s Peitl and
Friedrich Slivovsky and
Stefan Szeider},
editor = {Nadia Creignou and
Daniel Le Berre},
title = {Long Distance Q-Resolution with Dependency Schemes},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2016 - 19th
International Conference, Bordeaux, France, July 5-8, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9710},
pages = {500--518},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-40970-2\_31},
doi = {10.1007/978-3-319-40970-2\_31},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/PeitlSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GanianRS16,
author = {Robert Ganian and
M. S. Ramanujan and
Stefan Szeider},
editor = {Robert Krauthgamer},
title = {Discovering Archipelagos of Tractability for Constraint Satisfaction
and Counting},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {1670--1681},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch114},
doi = {10.1137/1.9781611974331.CH114},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/GanianRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Szeider16,
author = {Stefan Szeider},
title = {Parameterized {SAT}},
booktitle = {Encyclopedia of Algorithms},
pages = {1530--1532},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_283},
doi = {10.1007/978-1-4939-2864-4\_283},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Szeider16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GanianRS16,
author = {Robert Ganian and
M. S. Ramanujan and
Stefan Szeider},
title = {Combining Treewidth and Backdoors for {CSP}},
journal = {CoRR},
volume = {abs/1610.03298},
year = {2016},
url = {http://arxiv.org/abs/1610.03298},
eprinttype = {arXiv},
eprint = {1610.03298},
timestamp = {Tue, 03 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/GanianRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GanianRS16a,
author = {Robert Ganian and
M. S. Ramanujan and
Stefan Szeider},
title = {Backdoors to Tractable Valued {CSP}},
journal = {CoRR},
volume = {abs/1612.05733},
year = {2016},
url = {http://arxiv.org/abs/1612.05733},
eprinttype = {arXiv},
eprint = {1612.05733},
timestamp = {Tue, 03 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/GanianRS16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ai/FichteS15,
author = {Johannes Klaus Fichte and
Stefan Szeider},
title = {Backdoors to tractable answer set programming},
journal = {Artif. Intell.},
volume = {220},
pages = {64--103},
year = {2015},
url = {https://doi.org/10.1016/j.artint.2014.12.001},
doi = {10.1016/J.ARTINT.2014.12.001},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ai/FichteS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GutinS15,
author = {Gregory Z. Gutin and
Stefan Szeider},
title = {Guest Editorial: Special Issue on Parameterized and Exact Computation},
journal = {Algorithmica},
volume = {71},
number = {3},
pages = {539--540},
year = {2015},
url = {https://doi.org/10.1007/s00453-014-9960-y},
doi = {10.1007/S00453-014-9960-Y},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GutinS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/HaanKS15,
author = {Ronald de Haan and
Iyad A. Kanj and
Stefan Szeider},
title = {On the Subexponential-Time Complexity of {CSP}},
journal = {J. Artif. Intell. Res.},
volume = {52},
pages = {203--234},
year = {2015},
url = {https://doi.org/10.1613/jair.4540},
doi = {10.1613/JAIR.4540},
timestamp = {Sun, 19 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jair/HaanKS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BackstromJOS15,
author = {Christer B{\"{a}}ckstr{\"{o}}m and
Peter Jonsson and
Sebastian Ordyniak and
Stefan Szeider},
title = {A complete parameterized complexity analysis of bounded planning},
journal = {J. Comput. Syst. Sci.},
volume = {81},
number = {7},
pages = {1311--1332},
year = {2015},
url = {https://doi.org/10.1016/j.jcss.2015.04.002},
doi = {10.1016/J.JCSS.2015.04.002},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/BackstromJOS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GaspersKLOS15,
author = {Serge Gaspers and
Mikko Koivisto and
Mathieu Liedloff and
Sebastian Ordyniak and
Stefan Szeider},
title = {On finding optimal polytrees},
journal = {Theor. Comput. Sci.},
volume = {592},
pages = {49--58},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.05.012},
doi = {10.1016/J.TCS.2015.05.012},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/GaspersKLOS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KanjS15,
author = {Iyad A. Kanj and
Stefan Szeider},
title = {Parameterized and subexponential-time complexity of satisfiability
problems and applications},
journal = {Theor. Comput. Sci.},
volume = {607},
pages = {282--295},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.08.029},
doi = {10.1016/J.TCS.2015.08.029},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/KanjS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tocl/HeuleS15,
author = {Marijn Heule and
Stefan Szeider},
title = {A {SAT} Approach to Clique-Width},
journal = {{ACM} Trans. Comput. Log.},
volume = {16},
number = {3},
pages = {24:1--24:27},
year = {2015},
url = {https://doi.org/10.1145/2736696},
doi = {10.1145/2736696},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tocl/HeuleS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tocl/FichteS15,
author = {Johannes Klaus Fichte and
Stefan Szeider},
title = {Backdoors to Normality for Disjunctive Logic Programs},
journal = {{ACM} Trans. Comput. Log.},
volume = {17},
number = {1},
pages = {7},
year = {2015},
url = {https://doi.org/10.1145/2818646},
doi = {10.1145/2818646},
timestamp = {Sun, 19 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tocl/FichteS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/EndrissHS15,
author = {Ulle Endriss and
Ronald de Haan and
Stefan Szeider},
editor = {Gerhard Weiss and
Pinar Yolum and
Rafael H. Bordini and
Edith Elkind},
title = {Parameterized Complexity Results for Agenda Safety in Judgment Aggregation},
booktitle = {Proceedings of the 2015 International Conference on Autonomous Agents
and Multiagent Systems, {AAMAS} 2015, Istanbul, Turkey, May 4-8, 2015},
pages = {127--136},
publisher = {{ACM}},
year = {2015},
url = {http://dl.acm.org/citation.cfm?id=2772898},
timestamp = {Tue, 08 Mar 2022 10:12:47 +0100},
biburl = {https://dblp.org/rec/conf/atal/EndrissHS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/EibenGS15,
author = {Eduard Eiben and
Robert Ganian and
Stefan Szeider},
editor = {Thore Husfeldt and
Iyad A. Kanj},
title = {Meta-kernelization using Well-structured Modulators},
booktitle = {10th International Symposium on Parameterized and Exact Computation,
{IPEC} 2015, September 16-18, 2015, Patras, Greece},
series = {LIPIcs},
volume = {43},
pages = {114--126},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2015.114},
doi = {10.4230/LIPICS.IPEC.2015.114},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/EibenGS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Ganian0S15,
author = {Robert Ganian and
Eun Jung Kim and
Stefan Szeider},
editor = {Giuseppe F. Italiano and
Giovanni Pighizzini and
Donald Sannella},
title = {Algorithmic Applications of Tree-Cut Width},
booktitle = {Mathematical Foundations of Computer Science 2015 - 40th International
Symposium, {MFCS} 2015, Milan, Italy, August 24-28, 2015, Proceedings,
Part {II}},
series = {Lecture Notes in Computer Science},
volume = {9235},
pages = {348--360},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48054-0\_29},
doi = {10.1007/978-3-662-48054-0\_29},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Ganian0S15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/GanianS15,
author = {Robert Ganian and
Stefan Szeider},
editor = {Marijn Heule and
Sean A. Weaver},
title = {Community Structure Inspired Algorithms for {SAT} and {\#}SAT},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2015 - 18th
International Conference, Austin, TX, USA, September 24-27, 2015,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9340},
pages = {223--237},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-24318-4\_17},
doi = {10.1007/978-3-319-24318-4\_17},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/GanianS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/HaanS15,
author = {Ronald de Haan and
Stefan Szeider},
editor = {Giuseppe F. Italiano and
Tiziana Margaria{-}Steffen and
Jaroslav Pokorn{\'{y}} and
Jean{-}Jacques Quisquater and
Roger Wattenhofer},
title = {Machine Characterizations for Parameterized Complexity Classes Beyond
Para-NP},
booktitle = {{SOFSEM} 2015: Theory and Practice of Computer Science - 41st International
Conference on Current Trends in Theory and Practice of Computer Science,
Pec pod Sn{\v{e}}{\v{z}}kou, Czech Republic, January 24-29, 2015.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8939},
pages = {217--229},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-46078-8\_18},
doi = {10.1007/978-3-662-46078-8\_18},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/HaanS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/EibenGS15,
author = {Eduard Eiben and
Robert Ganian and
Stefan Szeider},
editor = {Frank Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Ulrike Stege},
title = {Solving Problems on Graphs of High Rank-Width},
booktitle = {Algorithms and Data Structures - 14th International Symposium, {WADS}
2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9214},
pages = {314--326},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-21840-3\_26},
doi = {10.1007/978-3-319-21840-3\_26},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/EibenGS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GanianKST15,
author = {Robert Ganian and
Martin Kalany and
Stefan Szeider and
Jesper Larsson Tr{\"{a}}ff},
title = {Polynomial-time Construction of Optimal Tree-structured Communication
Data Layout Descriptions},
journal = {CoRR},
volume = {abs/1506.09100},
year = {2015},
url = {http://arxiv.org/abs/1506.09100},
eprinttype = {arXiv},
eprint = {1506.09100},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GanianKST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GanianRS15,
author = {Robert Ganian and
M. S. Ramanujan and
Stefan Szeider},
title = {Discovering Archipelagos of Tractability for Constraint Satisfaction
and Counting},
journal = {CoRR},
volume = {abs/1507.02479},
year = {2015},
url = {http://arxiv.org/abs/1507.02479},
eprinttype = {arXiv},
eprint = {1507.02479},
timestamp = {Tue, 03 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/GanianRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EibenGS15,
author = {Eduard Eiben and
Robert Ganian and
Stefan Szeider},
title = {Solving Problems on Graphs of High Rank-Width},
journal = {CoRR},
volume = {abs/1507.05463},
year = {2015},
url = {http://arxiv.org/abs/1507.05463},
eprinttype = {arXiv},
eprint = {1507.05463},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EibenGS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EibenGS15a,
author = {Eduard Eiben and
Robert Ganian and
Stefan Szeider},
title = {Meta-Kernelization using Well-Structured Modulators},
journal = {CoRR},
volume = {abs/1507.05544},
year = {2015},
url = {http://arxiv.org/abs/1507.05544},
eprinttype = {arXiv},
eprint = {1507.05544},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EibenGS15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GaspersMOSZ15,
author = {Serge Gaspers and
Neeldhara Misra and
Sebastian Ordyniak and
Stefan Szeider and
Stanislav Zivn{\'{y}}},
title = {Backdoors into Heterogeneous Classes of {SAT} and {CSP}},
journal = {CoRR},
volume = {abs/1509.05725},
year = {2015},
url = {http://arxiv.org/abs/1509.05725},
eprinttype = {arXiv},
eprint = {1509.05725},
timestamp = {Mon, 03 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GaspersMOSZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ai/GaspersS14,
author = {Serge Gaspers and
Stefan Szeider},
title = {Guarantees and limits of preprocessing in constraint satisfaction
and reasoning},
journal = {Artif. Intell.},
volume = {216},
pages = {1--19},
year = {2014},
url = {https://doi.org/10.1016/j.artint.2014.06.006},
doi = {10.1016/J.ARTINT.2014.06.006},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ai/GaspersS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tplp/PichlerRSW14,
author = {Reinhard Pichler and
Stefan R{\"{u}}mmele and
Stefan Szeider and
Stefan Woltran},
title = {Tractable answer-set programming with weight constraints: bounded
treewidth is not enough},
journal = {Theory Pract. Log. Program.},
volume = {14},
number = {2},
pages = {141--164},
year = {2014},
url = {https://doi.org/10.1017/S1471068412000099},
doi = {10.1017/S1471068412000099},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tplp/PichlerRSW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/GaspersMOSZ14,
author = {Serge Gaspers and
Neeldhara Misra and
Sebastian Ordyniak and
Stefan Szeider and
Stanislav Zivn{\'{y}}},
editor = {Carla E. Brodley and
Peter Stone},
title = {Backdoors into Heterogeneous Classes of {SAT} and {CSP}},
booktitle = {Proceedings of the Twenty-Eighth {AAAI} Conference on Artificial Intelligence,
July 27 -31, 2014, Qu{\'{e}}bec City, Qu{\'{e}}bec, Canada},
pages = {2652--2658},
publisher = {{AAAI} Press},
year = {2014},
url = {https://doi.org/10.1609/aaai.v28i1.9111},
doi = {10.1609/AAAI.V28I1.9111},
timestamp = {Tue, 19 Nov 2024 15:59:16 +0100},
biburl = {https://dblp.org/rec/conf/aaai/GaspersMOSZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/KanjS14,
author = {Iyad A. Kanj and
Stefan Szeider},
editor = {Zhao Zhang and
Lidong Wu and
Wen Xu and
Ding{-}Zhu Du},
title = {Parameterized and Subexponential-Time Complexity of Satisfiability
Problems and Applications},
booktitle = {Combinatorial Optimization and Applications - 8th International Conference,
{COCOA} 2014, Wailea, Maui, HI, USA, December 19-21, 2014, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8881},
pages = {637--651},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-12691-3\_48},
doi = {10.1007/978-3-319-12691-3\_48},
timestamp = {Wed, 07 Aug 2024 10:33:49 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/KanjS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cp/HaanKS14,
author = {Ronald de Haan and
Iyad A. Kanj and
Stefan Szeider},
editor = {Barry O'Sullivan},
title = {Subexponential Time Complexity of {CSP} with Global Constraints},
booktitle = {Principles and Practice of Constraint Programming - 20th International
Conference, {CP} 2014, Lyon, France, September 8-12, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8656},
pages = {272--288},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-10428-7\_21},
doi = {10.1007/978-3-319-10428-7\_21},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cp/HaanKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/BovaGS14,
author = {Simone Bova and
Robert Ganian and
Stefan Szeider},
editor = {Thomas A. Henzinger and
Dale Miller},
title = {Model checking existential logic on partially ordered sets},
booktitle = {Joint Meeting of the Twenty-Third {EACSL} Annual Conference on Computer
Science Logic {(CSL)} and the Twenty-Ninth Annual {ACM/IEEE} Symposium
on Logic in Computer Science (LICS), {CSL-LICS} '14, Vienna, Austria,
July 14 - 18, 2014},
pages = {21:1--21:10},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2603088.2603110},
doi = {10.1145/2603088.2603110},
timestamp = {Sun, 19 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/csl/BovaGS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictai/HaanKS14,
author = {Ronald de Haan and
Iyad A. Kanj and
Stefan Szeider},
title = {Small Unsatisfiable Subsets in Constraint Satisfaction},
booktitle = {26th {IEEE} International Conference on Tools with Artificial Intelligence,
{ICTAI} 2014, Limassol, Cyprus, November 10-12, 2014},
pages = {429--436},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/ICTAI.2014.72},
doi = {10.1109/ICTAI.2014.72},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ictai/HaanKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BovaGS14,
author = {Simone Bova and
Robert Ganian and
Stefan Szeider},
editor = {Marek Cygan and
Pinar Heggernes},
title = {Quantified Conjunctive Queries on Partially Ordered Sets},
booktitle = {Parameterized and Exact Computation - 9th International Symposium,
{IPEC} 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {8894},
pages = {122--134},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-13524-3\_11},
doi = {10.1007/978-3-319-13524-3\_11},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/BovaGS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kr/HaanS14,
author = {Ronald de Haan and
Stefan Szeider},
editor = {Chitta Baral and
Giuseppe De Giacomo and
Thomas Eiter},
title = {The Parameterized Complexity of Reasoning Problems Beyond {NP}},
booktitle = {Principles of Knowledge Representation and Reasoning: Proceedings
of the Fourteenth International Conference, {KR} 2014, Vienna, Austria,
July 20-24, 2014},
publisher = {{AAAI} Press},
year = {2014},
url = {http://www.aaai.org/ocs/index.php/KR/KR14/paper/view/7987},
timestamp = {Tue, 09 Feb 2021 08:33:43 +0100},
biburl = {https://dblp.org/rec/conf/kr/HaanS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/HaanS14,
author = {Ronald de Haan and
Stefan Szeider},
editor = {Carsten Sinz and
Uwe Egly},
title = {Fixed-Parameter Tractable Reductions to {SAT}},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2014 - 17th
International Conference, Held as Part of the Vienna Summer of Logic,
{VSL} 2014, Vienna, Austria, July 14-17, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8561},
pages = {85--102},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-09284-3\_8},
doi = {10.1007/978-3-319-09284-3\_8},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/HaanS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/SlivovskyS14,
author = {Friedrich Slivovsky and
Stefan Szeider},
editor = {Carsten Sinz and
Uwe Egly},
title = {Variable Dependencies and Q-Resolution},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2014 - 17th
International Conference, Held as Part of the Vienna Summer of Logic,
{VSL} 2014, Vienna, Austria, July 14-17, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8561},
pages = {269--284},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-09284-3\_21},
doi = {10.1007/978-3-319-09284-3\_21},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/SlivovskyS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/OrdyniakS14,
author = {Sebastian Ordyniak and
Stefan Szeider},
title = {Parameterized Complexity Results for Exact Bayesian Network Structure
Learning},
journal = {CoRR},
volume = {abs/1402.0558},
year = {2014},
url = {http://arxiv.org/abs/1402.0558},
eprinttype = {arXiv},
eprint = {1402.0558},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/OrdyniakS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/0002OS14,
author = {Eun Jung Kim and
Sebastian Ordyniak and
Stefan Szeider},
title = {The Complexity of Repairing, Adjusting, and Aggregating of Extensions
in Abstract Argumentation},
journal = {CoRR},
volume = {abs/1402.6109},
year = {2014},
url = {http://arxiv.org/abs/1402.6109},
eprinttype = {arXiv},
eprint = {1402.6109},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/0002OS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BovaGS14,
author = {Simone Bova and
Robert Ganian and
Stefan Szeider},
title = {Model Checking Existential Logic on Partially Ordered Sets},
journal = {CoRR},
volume = {abs/1405.2891},
year = {2014},
url = {http://arxiv.org/abs/1405.2891},
eprinttype = {arXiv},
eprint = {1405.2891},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BovaGS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GaspersS14a,
author = {Serge Gaspers and
Stefan Szeider},
title = {Guarantees and Limits of Preprocessing in Constraint Satisfaction
and Reasoning},
journal = {CoRR},
volume = {abs/1406.3124},
year = {2014},
url = {http://arxiv.org/abs/1406.3124},
eprinttype = {arXiv},
eprint = {1406.3124},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GaspersS14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BovaGS14a,
author = {Simone Bova and
Robert Ganian and
Stefan Szeider},
title = {Quantified Conjunctive Queries on Partially Ordered Sets},
journal = {CoRR},
volume = {abs/1408.4263},
year = {2014},
url = {http://arxiv.org/abs/1408.4263},
eprinttype = {arXiv},
eprint = {1408.4263},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BovaGS14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/SlivovskyS14,
author = {Friedrich Slivovsky and
Stefan Szeider},
title = {Model Counting for Formulas of Bounded Clique-Width},
journal = {CoRR},
volume = {abs/1409.8464},
year = {2014},
url = {http://arxiv.org/abs/1409.8464},
eprinttype = {arXiv},
eprint = {1409.8464},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/SlivovskyS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HaanS14,
author = {Ronald de Haan and
Stefan Szeider},
title = {Compendium of Parameterized Problems at Higher Levels of the Polynomial
Hierarchy},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-143}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/143},
eprinttype = {ECCC},
eprint = {TR14-143},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HaanS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/CiabattoniFKPS13,
author = {Agata Ciabattoni and
Rusins Freivalds and
Anton{\'{\i}}n Kucera and
Igor Potapov and
Stefan Szeider},
title = {Preface},
journal = {Fundam. Informaticae},
volume = {123},
number = {1},
year = {2013},
url = {https://doi.org/10.3233/FI-2013-796},
doi = {10.3233/FI-2013-796},
timestamp = {Tue, 05 Aug 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fuin/CiabattoniFKPS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/OrdyniakS13,
author = {Sebastian Ordyniak and
Stefan Szeider},
title = {Parameterized Complexity Results for Exact Bayesian Network Structure
Learning},
journal = {J. Artif. Intell. Res.},
volume = {46},
pages = {263--302},
year = {2013},
url = {https://doi.org/10.1613/jair.3744},
doi = {10.1613/JAIR.3744},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jair/OrdyniakS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GutinRSY13,
author = {Gregory Z. Gutin and
Arash Rafiey and
Stefan Szeider and
Anders Yeo},
title = {Corrigendum. The Linear Arrangement Problem Parameterized Above Guaranteed
Value},
journal = {Theory Comput. Syst.},
volume = {53},
number = {4},
pages = {690--691},
year = {2013},
url = {https://doi.org/10.1007/s00224-007-9037-2},
doi = {10.1007/S00224-007-9037-2},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/GutinRSY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/OrdyniakPS13,
author = {Sebastian Ordyniak and
Dani{\"{e}}l Paulusma and
Stefan Szeider},
title = {Satisfiability of acyclic and almost acyclic {CNF} formulas},
journal = {Theor. Comput. Sci.},
volume = {481},
pages = {85--99},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2012.12.039},
doi = {10.1016/J.TCS.2012.12.039},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/OrdyniakPS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/HaanRS13,
author = {Ronald de Haan and
Anna Roub{\'{\i}}ckov{\'{a}} and
Stefan Szeider},
editor = {Marie desJardins and
Michael L. Littman},
title = {Parameterized Complexity Results for Plan Reuse},
booktitle = {Proceedings of the Twenty-Seventh {AAAI} Conference on Artificial
Intelligence, July 14-18, 2013, Bellevue, Washington, {USA}},
pages = {224--231},
publisher = {{AAAI} Press},
year = {2013},
url = {https://doi.org/10.1609/aaai.v27i1.8655},
doi = {10.1609/AAAI.V27I1.8655},
timestamp = {Mon, 04 Sep 2023 15:56:33 +0200},
biburl = {https://dblp.org/rec/conf/aaai/HaanRS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/FichteS13,
author = {Johannes Klaus Fichte and
Stefan Szeider},
editor = {Marie desJardins and
Michael L. Littman},
title = {Backdoors to Normality for Disjunctive Logic Programs},
booktitle = {Proceedings of the Twenty-Seventh {AAAI} Conference on Artificial
Intelligence, July 14-18, 2013, Bellevue, Washington, {USA}},
pages = {320--327},
publisher = {{AAAI} Press},
year = {2013},
url = {https://doi.org/10.1609/aaai.v27i1.8624},
doi = {10.1609/AAAI.V27I1.8624},
timestamp = {Mon, 04 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/FichteS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/KanjS13,
author = {Iyad A. Kanj and
Stefan Szeider},
editor = {Marie desJardins and
Michael L. Littman},
title = {On the Subexponential Time Complexity of {CSP}},
booktitle = {Proceedings of the Twenty-Seventh {AAAI} Conference on Artificial
Intelligence, July 14-18, 2013, Bellevue, Washington, {USA}},
pages = {459--465},
publisher = {{AAAI} Press},
year = {2013},
url = {https://doi.org/10.1609/aaai.v27i1.8609},
doi = {10.1609/AAAI.V27I1.8609},
timestamp = {Mon, 04 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/KanjS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BackstromJOS13,
author = {Christer B{\"{a}}ckstr{\"{o}}m and
Peter Jonsson and
Sebastian Ordyniak and
Stefan Szeider},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {Parameterized Complexity and Kernel Bounds for Hard Planning Problems},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {13--24},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_2},
doi = {10.1007/978-3-642-38233-8\_2},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BackstromJOS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GaspersS13,
author = {Serge Gaspers and
Stefan Szeider},
title = {Strong Backdoors to Bounded Treewidth {SAT}},
booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2013, Berkeley, CA, USA, October, 26-29, 2013},
pages = {489--498},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/FOCS.2013.59},
doi = {10.1109/FOCS.2013.59},
timestamp = {Tue, 08 Jul 2025 16:37:30 +0200},
biburl = {https://dblp.org/rec/conf/focs/GaspersS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictai/Szeider13,
author = {Stefan Szeider},
title = {Capturing Structure in Hard Combinatorial Problems},
booktitle = {25th {IEEE} International Conference on Tools with Artificial Intelligence,
{ICTAI} 2013, Herndon, VA, USA, November 4-6, 2013},
pages = {897--898},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/ICTAI.2013.136},
doi = {10.1109/ICTAI.2013.136},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ictai/Szeider13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/PfandlerRS13,
author = {Andreas Pfandler and
Stefan R{\"{u}}mmele and
Stefan Szeider},
editor = {Francesca Rossi},
title = {Backdoors to Abduction},
booktitle = {{IJCAI} 2013, Proceedings of the 23rd International Joint Conference
on Artificial Intelligence, Beijing, China, August 3-9, 2013},
pages = {1046--1052},
publisher = {{IJCAI/AAAI}},
year = {2013},
url = {http://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/paper/view/6912},
timestamp = {Tue, 23 Jan 2024 13:25:46 +0100},
biburl = {https://dblp.org/rec/conf/ijcai/PfandlerRS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/SlivovskyS13,
author = {Friedrich Slivovsky and
Stefan Szeider},
editor = {Leizhen Cai and
Siu{-}Wing Cheng and
Tak Wah Lam},
title = {Model Counting for Formulas of Bounded Clique-Width},
booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC}
2013, Hong Kong, China, December 16-18, 2013, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8283},
pages = {677--687},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45030-3\_63},
doi = {10.1007/978-3-642-45030-3\_63},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/SlivovskyS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GanianSS13,
author = {Robert Ganian and
Friedrich Slivovsky and
Stefan Szeider},
editor = {Krishnendu Chatterjee and
Jir{\'{\i}} Sgall},
title = {Meta-kernelization with Structural Parameters},
booktitle = {Mathematical Foundations of Computer Science 2013 - 38th International
Symposium, {MFCS} 2013, Klosterneuburg, Austria, August 26-30, 2013.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8087},
pages = {457--468},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40313-2\_41},
doi = {10.1007/978-3-642-40313-2\_41},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/GanianSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/MullerS13,
author = {Moritz M{\"{u}}ller and
Stefan Szeider},
editor = {Krishnendu Chatterjee and
Jir{\'{\i}} Sgall},
title = {Revisiting Space in Proof Complexity: Treewidth and Pathwidth},
booktitle = {Mathematical Foundations of Computer Science 2013 - 38th International
Symposium, {MFCS} 2013, Klosterneuburg, Austria, August 26-30, 2013.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8087},
pages = {704--716},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40313-2\_62},
doi = {10.1007/978-3-642-40313-2\_62},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/MullerS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/HeuleS13,
author = {Marijn Heule and
Stefan Szeider},
editor = {Matti J{\"{a}}rvisalo and
Allen Van Gelder},
title = {A {SAT} Approach to Clique-Width},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2013 - 16th
International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7962},
pages = {318--334},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39071-5\_24},
doi = {10.1007/978-3-642-39071-5\_24},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/HeuleS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/HaanKS13,
author = {Ronald de Haan and
Iyad A. Kanj and
Stefan Szeider},
editor = {Matti J{\"{a}}rvisalo and
Allen Van Gelder},
title = {Local Backbones},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2013 - 16th
International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7962},
pages = {377--393},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39071-5\_28},
doi = {10.1007/978-3-642-39071-5\_28},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/HaanKS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/MisraORS13,
author = {Neeldhara Misra and
Sebastian Ordyniak and
Venkatesh Raman and
Stefan Szeider},
editor = {Matti J{\"{a}}rvisalo and
Allen Van Gelder},
title = {Upper and Lower Bounds for Weak Backdoor Set Detection},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2013 - 16th
International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7962},
pages = {394--402},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39071-5\_29},
doi = {10.1007/978-3-642-39071-5\_29},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/MisraORS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/PaulusmaSS13,
author = {Dani{\"{e}}l Paulusma and
Friedrich Slivovsky and
Stefan Szeider},
editor = {Natacha Portier and
Thomas Wilke},
title = {Model Counting for {CNF} Formulas of Bounded Modular Treewidth},
booktitle = {30th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2013, February 27 - March 2, 2013, Kiel, Germany},
series = {LIPIcs},
volume = {20},
pages = {55--66},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2013},
url = {https://doi.org/10.4230/LIPIcs.STACS.2013.55},
doi = {10.4230/LIPICS.STACS.2013.55},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/PaulusmaSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GaspersORSS13,
author = {Serge Gaspers and
Sebastian Ordyniak and
M. S. Ramanujan and
Saket Saurabh and
Stefan Szeider},
editor = {Natacha Portier and
Thomas Wilke},
title = {Backdoors to q-Horn},
booktitle = {30th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2013, February 27 - March 2, 2013, Kiel, Germany},
series = {LIPIcs},
volume = {20},
pages = {67--79},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2013},
url = {https://doi.org/10.4230/LIPIcs.STACS.2013.67},
doi = {10.4230/LIPICS.STACS.2013.67},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/GaspersORSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tafa/0002OS13,
author = {Eun Jung Kim and
Sebastian Ordyniak and
Stefan Szeider},
editor = {Elizabeth Black and
Sanjay Modgil and
Nir Oren},
title = {The Complexity of Repairing, Adjusting, and Aggregating of Extensions
in Abstract Argumentation},
booktitle = {Theory and Applications of Formal Argumentation - Second International
Workshop, {TAFA} 2013, Beijing, China, August 3-5, 2013, Revised Selected
papers},
series = {Lecture Notes in Computer Science},
volume = {8306},
pages = {158--175},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-54373-9\_11},
doi = {10.1007/978-3-642-54373-9\_11},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tafa/0002OS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/iwpec/2013,
editor = {Gregory Z. Gutin and
Stefan Szeider},
title = {Parameterized and Exact Computation - 8th International Symposium,
{IPEC} 2013, Sophia Antipolis, France, September 4-6, 2013, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8246},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-03898-8},
doi = {10.1007/978-3-319-03898-8},
isbn = {978-3-319-03897-1},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/2013.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1301-1391,
author = {Johannes Klaus Fichte and
Stefan Szeider},
title = {Backdoors to Normality for Disjunctive Logic Programs},
journal = {CoRR},
volume = {abs/1301.1391},
year = {2013},
url = {http://arxiv.org/abs/1301.1391},
eprinttype = {arXiv},
eprint = {1301.1391},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1301-1391.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1303-1786,
author = {Robert Ganian and
Friedrich Slivovsky and
Stefan Szeider},
title = {Meta-Kernelization with Structural Parameters},
journal = {CoRR},
volume = {abs/1303.1786},
year = {2013},
url = {http://arxiv.org/abs/1303.1786},
eprinttype = {arXiv},
eprint = {1303.1786},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1303-1786.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-1996,
author = {Iyad A. Kanj and
Stefan Szeider},
title = {On the Subexponential Time Complexity of {CSP}},
journal = {CoRR},
volume = {abs/1304.1996},
year = {2013},
url = {http://arxiv.org/abs/1304.1996},
eprinttype = {arXiv},
eprint = {1304.1996},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-1996.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-5479,
author = {Ronald de Haan and
Iyad A. Kanj and
Stefan Szeider},
title = {Local Backbones},
journal = {CoRR},
volume = {abs/1304.5479},
year = {2013},
url = {http://arxiv.org/abs/1304.5479},
eprinttype = {arXiv},
eprint = {1304.5479},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-5479.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-5498,
author = {Marijn Heule and
Stefan Szeider},
title = {A {SAT} Approach to Clique-Width},
journal = {CoRR},
volume = {abs/1304.5498},
year = {2013},
url = {http://arxiv.org/abs/1304.5498},
eprinttype = {arXiv},
eprint = {1304.5498},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-5498.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-5518,
author = {Neeldhara Misra and
Sebastian Ordyniak and
Venkatesh Raman and
Stefan Szeider},
title = {Upper and Lower Bounds for Weak Backdoor Set Detection},
journal = {CoRR},
volume = {abs/1304.5518},
year = {2013},
url = {http://arxiv.org/abs/1304.5518},
eprinttype = {arXiv},
eprint = {1304.5518},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-5518.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-5961,
author = {Andreas Pfandler and
Stefan R{\"{u}}mmele and
Stefan Szeider},
title = {Backdoors to Abduction},
journal = {CoRR},
volume = {abs/1304.5961},
year = {2013},
url = {http://arxiv.org/abs/1304.5961},
eprinttype = {arXiv},
eprint = {1304.5961},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-5961.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HaanRS13,
author = {Ronald de Haan and
Anna Roub{\'{\i}}ckov{\'{a}} and
Stefan Szeider},
title = {Parameterized Complexity Results for Plan Reuse},
journal = {CoRR},
volume = {abs/1307.4440},
year = {2013},
url = {http://arxiv.org/abs/1307.4440},
eprinttype = {arXiv},
eprint = {1307.4440},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HaanRS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BaeckstroemJOS13,
author = {Christer B{\"{a}}ckstr{\"{o}}m and
Peter Jonsson and
Sebastian Ordyniak and
Stefan Szeider},
title = {A Complete Parameterized Complexity Analysis of Bounded Planning},
journal = {CoRR},
volume = {abs/1310.7828},
year = {2013},
url = {http://arxiv.org/abs/1310.7828},
eprinttype = {arXiv},
eprint = {1310.7828},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BaeckstroemJOS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HaanS13,
author = {Ronald de Haan and
Stefan Szeider},
title = {The Parameterized Complexity of Reasoning Problems Beyond {NP}},
journal = {CoRR},
volume = {abs/1312.1672},
year = {2013},
url = {http://arxiv.org/abs/1312.1672},
eprinttype = {arXiv},
eprint = {1312.1672},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HaanS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/MullerS13,
author = {Moritz M{\"{u}}ller and
Stefan Szeider},
title = {Revisiting Space in Proof Complexity: Treewidth and Pathwidth},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-113}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/113},
eprinttype = {ECCC},
eprint = {TR13-113},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/MullerS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ai/DvorakOS12,
author = {Wolfgang Dvor{\'{a}}k and
Sebastian Ordyniak and
Stefan Szeider},
title = {Augmenting tractable fragments of abstract argumentation},
journal = {Artif. Intell.},
volume = {186},
pages = {157--173},
year = {2012},
url = {https://doi.org/10.1016/j.artint.2012.03.002},
doi = {10.1016/J.ARTINT.2012.03.002},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ai/DvorakOS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GutinKSSY12,
author = {Gregory Z. Gutin and
Eun Jung Kim and
Arezou Soleimanfallah and
Stefan Szeider and
Anders Yeo},
title = {Parameterized Complexity Results for General Factors in Bipartite
Graphs with an Application to Constraint Programming},
journal = {Algorithmica},
volume = {64},
number = {1},
pages = {112--125},
year = {2012},
url = {https://doi.org/10.1007/s00453-011-9548-8},
doi = {10.1007/S00453-011-9548-8},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GutinKSSY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HofKPST12,
author = {Pim van 't Hof and
Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Stefan Szeider and
Dimitrios M. Thilikos},
title = {On graph contractions and induced minors},
journal = {Discret. Appl. Math.},
volume = {160},
number = {6},
pages = {799--809},
year = {2012},
url = {https://doi.org/10.1016/j.dam.2010.05.005},
doi = {10.1016/J.DAM.2010.05.005},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/HofKPST12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/MathiesonS12,
author = {Luke Mathieson and
Stefan Szeider},
title = {Editing graphs to satisfy degree constraints: {A} parameterized approach},
journal = {J. Comput. Syst. Sci.},
volume = {78},
number = {1},
pages = {179--191},
year = {2012},
url = {https://doi.org/10.1016/j.jcss.2011.02.001},
doi = {10.1016/J.JCSS.2011.02.001},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/MathiesonS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/GaspersKOSS12,
author = {Serge Gaspers and
Eun Jung Kim and
Sebastian Ordyniak and
Saket Saurabh and
Stefan Szeider},
editor = {J{\"{o}}rg Hoffmann and
Bart Selman},
title = {Don't Be Strict in Local Search!},
booktitle = {Proceedings of the Twenty-Sixth {AAAI} Conference on Artificial Intelligence,
July 22-26, 2012, Toronto, Ontario, Canada},
pages = {486--492},
publisher = {{AAAI} Press},
year = {2012},
url = {https://doi.org/10.1609/aaai.v26i1.8128},
doi = {10.1609/AAAI.V26I1.8128},
timestamp = {Mon, 04 Sep 2023 15:56:47 +0200},
biburl = {https://dblp.org/rec/conf/aaai/GaspersKOSS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/GaspersKLOS12,
author = {Serge Gaspers and
Mikko Koivisto and
Mathieu Liedloff and
Sebastian Ordyniak and
Stefan Szeider},
editor = {J{\"{o}}rg Hoffmann and
Bart Selman},
title = {On Finding Optimal Polytrees},
booktitle = {Proceedings of the Twenty-Sixth {AAAI} Conference on Artificial Intelligence,
July 22-26, 2012, Toronto, Ontario, Canada},
pages = {750--756},
publisher = {{AAAI} Press},
year = {2012},
url = {https://doi.org/10.1609/aaai.v26i1.8217},
doi = {10.1609/AAAI.V26I1.8217},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/GaspersKLOS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/BackstromCJOS12,
author = {Christer B{\"{a}}ckstr{\"{o}}m and
Yue Chen and
Peter Jonsson and
Sebastian Ordyniak and
Stefan Szeider},
editor = {J{\"{o}}rg Hoffmann and
Bart Selman},
title = {The Complexity of Planning Revisited - {A} Parameterized Analysis},
booktitle = {Proceedings of the Twenty-Sixth {AAAI} Conference on Artificial Intelligence,
July 22-26, 2012, Toronto, Ontario, Canada},
pages = {1735--1741},
publisher = {{AAAI} Press},
year = {2012},
url = {https://doi.org/10.1609/aaai.v26i1.8361},
doi = {10.1609/AAAI.V26I1.8361},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/BackstromCJOS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/GaspersS12,
author = {Serge Gaspers and
Stefan Szeider},
editor = {Hans L. Bodlaender and
Rod Downey and
Fedor V. Fomin and
D{\'{a}}niel Marx},
title = {Backdoors to Satisfaction},
booktitle = {The Multivariate Algorithmic Revolution and Beyond - Essays Dedicated
to Michael R. Fellows on the Occasion of His 60th Birthday},
series = {Lecture Notes in Computer Science},
volume = {7370},
pages = {287--317},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-30891-8\_15},
doi = {10.1007/978-3-642-30891-8\_15},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/birthday/GaspersS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GaspersS12,
author = {Serge Gaspers and
Stefan Szeider},
editor = {Artur Czumaj and
Kurt Mehlhorn and
Andrew M. Pitts and
Roger Wattenhofer},
title = {Backdoors to Acyclic {SAT}},
booktitle = {Automata, Languages, and Programming - 39th International Colloquium,
{ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7391},
pages = {363--374},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31594-7\_31},
doi = {10.1007/978-3-642-31594-7\_31},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GaspersS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/FominGGSSLVV12,
author = {Fedor V. Fomin and
Serge Gaspers and
Petr A. Golovach and
Karol Suchan and
Stefan Szeider and
Erik Jan van Leeuwen and
Martin Vatshelle and
Yngve Villanger},
editor = {David Fern{\'{a}}ndez{-}Baca},
title = {k-Gap Interval Graphs},
booktitle = {{LATIN} 2012: Theoretical Informatics - 10th Latin American Symposium,
Arequipa, Peru, April 16-20, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7256},
pages = {350--361},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-29344-3\_30},
doi = {10.1007/978-3-642-29344-3\_30},
timestamp = {Sat, 06 Sep 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/latin/FominGGSSLVV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/SlivovskyS12,
author = {Friedrich Slivovsky and
Stefan Szeider},
editor = {Alessandro Cimatti and
Roberto Sebastiani},
title = {Computing Resolution-Path Dependencies in Linear Time ,},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2012 - 15th
International Conference, Trento, Italy, June 17-20, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7317},
pages = {58--71},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31612-8\_6},
doi = {10.1007/978-3-642-31612-8\_6},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/SlivovskyS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/GaspersS12,
author = {Serge Gaspers and
Stefan Szeider},
editor = {Alessandro Cimatti and
Roberto Sebastiani},
title = {Strong Backdoors to Nested Satisfiability},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2012 - 15th
International Conference, Trento, Italy, June 17-20, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7317},
pages = {72--85},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31612-8\_7},
doi = {10.1007/978-3-642-31612-8\_7},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/GaspersS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sum/DvorakSW12,
author = {Wolfgang Dvor{\'{a}}k and
Stefan Szeider and
Stefan Woltran},
editor = {Eyke H{\"{u}}llermeier and
Sebastian Link and
Thomas Fober and
Bernhard Seeger},
title = {Abstract Argumentation via Monadic Second Order Logic},
booktitle = {Scalable Uncertainty Management - 6th International Conference, {SUM}
2012, Marburg, Germany, September 17-19, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7520},
pages = {85--98},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33362-0\_7},
doi = {10.1007/978-3-642-33362-0\_7},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sum/DvorakSW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/comma/2012,
editor = {Bart Verheij and
Stefan Szeider and
Stefan Woltran},
title = {Computational Models of Argument - Proceedings of {COMMA} 2012, Vienna,
Austria, September 10-12, 2012},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {245},
publisher = {{IOS} Press},
year = {2012},
url = {http://www.booksonline.iospress.nl/Content/View.aspx?piid=32171},
isbn = {978-1-61499-110-6},
timestamp = {Thu, 06 Sep 2012 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/comma/2012.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-3097,
author = {Friedrich Slivovsky and
Stefan Szeider},
title = {Computing Resolution-Path Dependencies in Linear Time},
journal = {CoRR},
volume = {abs/1202.3097},
year = {2012},
url = {http://arxiv.org/abs/1202.3097},
eprinttype = {arXiv},
eprint = {1202.3097},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-3097.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-4331,
author = {Serge Gaspers and
Stefan Szeider},
title = {Strong Backdoors to Nested Satisfiability},
journal = {CoRR},
volume = {abs/1202.4331},
year = {2012},
url = {http://arxiv.org/abs/1202.4331},
eprinttype = {arXiv},
eprint = {1202.4331},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-4331.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1203-3501,
author = {Sebastian Ordyniak and
Stefan Szeider},
title = {Algorithms and Complexity Results for Exact Bayesian Structure Learning},
journal = {CoRR},
volume = {abs/1203.3501},
year = {2012},
url = {http://arxiv.org/abs/1203.3501},
eprinttype = {arXiv},
eprint = {1203.3501},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1203-3501.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1204-3040,
author = {Reinhard Pichler and
Stefan R{\"{u}}mmele and
Stefan Szeider and
Stefan Woltran},
title = {Tractable Answer-Set Programming with Weight Constraints: Bounded
Treewidth is not Enough},
journal = {CoRR},
volume = {abs/1204.3040},
year = {2012},
url = {http://arxiv.org/abs/1204.3040},
eprinttype = {arXiv},
eprint = {1204.3040},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1204-3040.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1204-6233,
author = {Serge Gaspers and
Stefan Szeider},
title = {Strong Backdoors to Bounded Treewidth {SAT}},
journal = {CoRR},
volume = {abs/1204.6233},
year = {2012},
url = {http://arxiv.org/abs/1204.6233},
eprinttype = {arXiv},
eprint = {1204.6233},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1204-6233.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1208-1688,
author = {Serge Gaspers and
Eun Jung Kim and
Sebastian Ordyniak and
Saket Saurabh and
Stefan Szeider},
title = {Don't Be Strict in Local Search!},
journal = {CoRR},
volume = {abs/1208.1688},
year = {2012},
url = {http://arxiv.org/abs/1208.1688},
eprinttype = {arXiv},
eprint = {1208.1688},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1208-1688.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1208-1692,
author = {Serge Gaspers and
Mikko Koivisto and
Mathieu Liedloff and
Sebastian Ordyniak and
Stefan Szeider},
title = {On Finding Optimal Polytrees},
journal = {CoRR},
volume = {abs/1208.1692},
year = {2012},
url = {http://arxiv.org/abs/1208.1692},
eprinttype = {arXiv},
eprint = {1208.1692},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1208-1692.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1208-2566,
author = {Christer B{\"{a}}ckstr{\"{o}}m and
Yue Chen and
Peter Jonsson and
Sebastian Ordyniak and
Stefan Szeider},
title = {The Complexity of Planning Revisited - {A} Parameterized Analysis},
journal = {CoRR},
volume = {abs/1208.2566},
year = {2012},
url = {http://arxiv.org/abs/1208.2566},
eprinttype = {arXiv},
eprint = {1208.2566},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1208-2566.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1211-0479,
author = {Christer B{\"{a}}ckstr{\"{o}}m and
Peter Jonsson and
Sebastian Ordyniak and
Stefan Szeider},
title = {Parameterized Complexity and Kernel Bounds for Hard Planning Problems},
journal = {CoRR},
volume = {abs/1211.0479},
year = {2012},
url = {http://arxiv.org/abs/1211.0479},
eprinttype = {arXiv},
eprint = {1211.0479},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1211-0479.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ai/KimOS11,
author = {Eun Jung Kim and
Sebastian Ordyniak and
Stefan Szeider},
title = {Algorithms and complexity results for persuasive argumentation},
journal = {Artif. Intell.},
volume = {175},
number = {9-10},
pages = {1722--1736},
year = {2011},
url = {https://doi.org/10.1016/j.artint.2011.03.001},
doi = {10.1016/J.ARTINT.2011.03.001},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ai/KimOS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlonGKSY11,
author = {Noga Alon and
Gregory Z. Gutin and
Eun Jung Kim and
Stefan Szeider and
Anders Yeo},
title = {Solving MAX-\emph{r}-SAT Above a Tight Lower Bound},
journal = {Algorithmica},
volume = {61},
number = {3},
pages = {638--655},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9428-7},
doi = {10.1007/S00453-010-9428-7},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AlonGKSY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/DantchevMS11,
author = {Stefan S. Dantchev and
Barnaby Martin and
Stefan Szeider},
title = {Parameterized Proof Complexity},
journal = {Comput. Complex.},
volume = {20},
number = {1},
pages = {51--85},
year = {2011},
url = {https://doi.org/10.1007/s00037-010-0001-1},
doi = {10.1007/S00037-010-0001-1},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/DantchevMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/constraints/SamerS11,
author = {Marko Samer and
Stefan Szeider},
title = {Tractable cases of the extended global cardinality constraint},
journal = {Constraints An Int. J.},
volume = {16},
number = {1},
pages = {1--24},
year = {2011},
url = {https://doi.org/10.1007/s10601-009-9079-y},
doi = {10.1007/S10601-009-9079-Y},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/constraints/SamerS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/Szeider11,
author = {Stefan Szeider},
title = {The parameterized complexity of k-flip local search for {SAT} and
{MAX} {SAT}},
journal = {Discret. Optim.},
volume = {8},
number = {1},
pages = {139--145},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2010.07.003},
doi = {10.1016/J.DISOPT.2010.07.003},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/disopt/Szeider11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/FellowsFLRSST11,
author = {Michael R. Fellows and
Fedor V. Fomin and
Daniel Lokshtanov and
Frances A. Rosamond and
Saket Saurabh and
Stefan Szeider and
Carsten Thomassen},
title = {On the complexity of some colorful problems parameterized by treewidth},
journal = {Inf. Comput.},
volume = {209},
number = {2},
pages = {143--153},
year = {2011},
url = {https://doi.org/10.1016/j.ic.2010.11.026},
doi = {10.1016/J.IC.2010.11.026},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/FellowsFLRSST11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GutinKSY11,
author = {Gregory Z. Gutin and
Eun Jung Kim and
Stefan Szeider and
Anders Yeo},
title = {A probabilistic approach to problems parameterized above or below
tight bounds},
journal = {J. Comput. Syst. Sci.},
volume = {77},
number = {2},
pages = {422--429},
year = {2011},
url = {https://doi.org/10.1016/j.jcss.2010.06.001},
doi = {10.1016/J.JCSS.2010.06.001},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/GutinKSY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tocl/Szeider11,
author = {Stefan Szeider},
title = {Monadic second order logic on graphs with local cardinality constraints},
journal = {{ACM} Trans. Comput. Log.},
volume = {12},
number = {2},
pages = {12:1--12:21},
year = {2011},
url = {https://doi.org/10.1145/1877714.1877718},
doi = {10.1145/1877714.1877718},
timestamp = {Sun, 19 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tocl/Szeider11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/Szeider11,
author = {Stefan Szeider},
editor = {Wolfram Burgard and
Dan Roth},
title = {Limits of Preprocessing},
booktitle = {Proceedings of the Twenty-Fifth {AAAI} Conference on Artificial Intelligence,
{AAAI} 2011, San Francisco, California, USA, August 7-11, 2011},
pages = {93--98},
publisher = {{AAAI} Press},
year = {2011},
url = {https://doi.org/10.1609/aaai.v25i1.7816},
doi = {10.1609/AAAI.V25I1.7816},
timestamp = {Tue, 09 Sep 2025 12:23:38 +0200},
biburl = {https://dblp.org/rec/conf/aaai/Szeider11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cp/GaspersS11,
author = {Serge Gaspers and
Stefan Szeider},
editor = {Jimmy Ho{-}Man Lee},
title = {The Parameterized Complexity of Local Consistency},
booktitle = {Principles and Practice of Constraint Programming - {CP} 2011 - 17th
International Conference, {CP} 2011, Perugia, Italy, September 12-16,
2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6876},
pages = {302--316},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-23786-7\_24},
doi = {10.1007/978-3-642-23786-7\_24},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cp/GaspersS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/GaspersS11,
author = {Serge Gaspers and
Stefan Szeider},
editor = {Toby Walsh},
title = {Kernels for Global Constraints},
booktitle = {{IJCAI} 2011, Proceedings of the 22nd International Joint Conference
on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22,
2011},
pages = {540--545},
publisher = {{IJCAI/AAAI}},
year = {2011},
url = {https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-098},
doi = {10.5591/978-1-57735-516-8/IJCAI11-098},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/GaspersS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/FichteS11,
author = {Johannes Klaus Fichte and
Stefan Szeider},
editor = {Toby Walsh},
title = {Backdoors to Tractable Answer-Set Programming},
booktitle = {{IJCAI} 2011, Proceedings of the 22nd International Joint Conference
on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22,
2011},
pages = {863--868},
publisher = {{IJCAI/AAAI}},
year = {2011},
url = {https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-150},
doi = {10.5591/978-1-57735-516-8/IJCAI11-150},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/FichteS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/OrdyniakS11,
author = {Sebastian Ordyniak and
Stefan Szeider},
editor = {Toby Walsh},
title = {Augmenting Tractable Fragments of Abstract Argumentation},
booktitle = {{IJCAI} 2011, Proceedings of the 22nd International Joint Conference
on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22,
2011},
pages = {1033--1038},
publisher = {{IJCAI/AAAI}},
year = {2011},
url = {https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-177},
doi = {10.5591/978-1-57735-516-8/IJCAI11-177},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/OrdyniakS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/inap/Szeider11,
author = {Stefan Szeider},
editor = {Hans Tompits and
Salvador Abreu and
Johannes Oetsch and
J{\"{o}}rg P{\"{u}}hrer and
Dietmar Seipel and
Masanobu Umeda and
Armin Wolf},
title = {The Parameterized Complexity of Constraint Satisfaction and Reasoning},
booktitle = {Applications of Declarative Programming and Knowledge Management -
19th International Conference, {INAP} 2011, and 25th Workshop on Logic
Programming, {WLP} 2011, Vienna, Austria, September 28-30, 2011, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7773},
pages = {27--37},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-41524-1\_2},
doi = {10.1007/978-3-642-41524-1\_2},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/inap/Szeider11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/OrdyniakPS11,
author = {Sebastian Ordyniak and
Dani{\"{e}}l Paulusma and
Stefan Szeider},
editor = {Karem A. Sakallah and
Laurent Simon},
title = {Satisfiability of Acyclic and almost Acyclic {CNF} Formulas {(II)}},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2011 - 14th
International Conference, {SAT} 2011, Ann Arbor, MI, USA, June 19-22,
2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6695},
pages = {47--60},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-21581-0\_6},
doi = {10.1007/978-3-642-21581-0\_6},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/OrdyniakPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-2541,
author = {Serge Gaspers and
Stefan Szeider},
title = {Kernels for Global Constraints},
journal = {CoRR},
volume = {abs/1104.2541},
year = {2011},
url = {http://arxiv.org/abs/1104.2541},
eprinttype = {arXiv},
eprint = {1104.2541},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-2541.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-2788,
author = {Johannes Klaus Fichte and
Stefan Szeider},
title = {Backdoors to Tractable Answer-Set Programming},
journal = {CoRR},
volume = {abs/1104.2788},
year = {2011},
url = {http://arxiv.org/abs/1104.2788},
eprinttype = {arXiv},
eprint = {1104.2788},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-2788.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-2842,
author = {Sebastian Ordyniak and
Stefan Szeider},
title = {Augmenting Tractable Fragments of Abstract Argumentation},
journal = {CoRR},
volume = {abs/1104.2842},
year = {2011},
url = {http://arxiv.org/abs/1104.2842},
eprinttype = {arXiv},
eprint = {1104.2842},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-2842.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-4279,
author = {Sebastian Ordyniak and
Dani{\"{e}}l Paulusma and
Stefan Szeider},
title = {Satisfiability of Acyclic and Almost Acyclic {CNF} Formulas {(II)}},
journal = {CoRR},
volume = {abs/1104.4279},
year = {2011},
url = {http://arxiv.org/abs/1104.4279},
eprinttype = {arXiv},
eprint = {1104.4279},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-4279.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-4290,
author = {Eun Jung Kim and
Sebastian Ordyniak and
Stefan Szeider},
title = {Algorithms and Complexity Results for Persuasive Argumentation},
journal = {CoRR},
volume = {abs/1104.4290},
year = {2011},
url = {http://arxiv.org/abs/1104.4290},
eprinttype = {arXiv},
eprint = {1104.4290},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-4290.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-5566,
author = {Stefan Szeider},
title = {Limits of Preprocessing},
journal = {CoRR},
volume = {abs/1104.5566},
year = {2011},
url = {http://arxiv.org/abs/1104.5566},
eprinttype = {arXiv},
eprint = {1104.5566},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-5566.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1106-3527,
author = {Gregory Z. Gutin and
Eun Jung Kim and
Arezou Soleimanfallah and
Stefan Szeider and
Anders Yeo},
title = {Parameterized Complexity Results for General Factors in Bipartite
Graphs with an Application to Constraint Programming},
journal = {CoRR},
volume = {abs/1106.3527},
year = {2011},
url = {http://arxiv.org/abs/1106.3527},
eprinttype = {arXiv},
eprint = {1106.3527},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1106-3527.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1107-1177,
author = {Stefan Szeider},
title = {Not So Easy Problems for Tree Decomposable Graphs},
journal = {CoRR},
volume = {abs/1107.1177},
year = {2011},
url = {http://arxiv.org/abs/1107.1177},
eprinttype = {arXiv},
eprint = {1107.1177},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1107-1177.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1110-6384,
author = {Serge Gaspers and
Stefan Szeider},
title = {Backdoors to Acyclic {SAT}},
journal = {CoRR},
volume = {abs/1110.6384},
year = {2011},
url = {http://arxiv.org/abs/1110.6384},
eprinttype = {arXiv},
eprint = {1110.6384},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1110-6384.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1110-6387,
author = {Serge Gaspers and
Stefan Szeider},
title = {Backdoors to Satisfaction},
journal = {CoRR},
volume = {abs/1110.6387},
year = {2011},
url = {http://arxiv.org/abs/1110.6387},
eprinttype = {arXiv},
eprint = {1110.6387},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1110-6387.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1112-3244,
author = {Fedor V. Fomin and
Serge Gaspers and
Petr A. Golovach and
Karol Suchan and
Stefan Szeider and
Erik Jan van Leeuwen and
Martin Vatshelle and
Yngve Villanger},
title = {k-Gap Interval Graphs},
journal = {CoRR},
volume = {abs/1112.3244},
year = {2011},
url = {http://arxiv.org/abs/1112.3244},
eprinttype = {arXiv},
eprint = {1112.3244},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1112-3244.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GaspersS11,
author = {Serge Gaspers and
Stefan Szeider},
title = {The Parameterized Complexity of Local Consistency},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-071}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/071},
eprinttype = {ECCC},
eprint = {TR11-071},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GaspersS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/SamerS10,
author = {Marko Samer and
Stefan Szeider},
title = {Constraint satisfaction with bounded treewidth revisited},
journal = {J. Comput. Syst. Sci.},
volume = {76},
number = {2},
pages = {103--114},
year = {2010},
url = {https://doi.org/10.1016/j.jcss.2009.04.003},
doi = {10.1016/J.JCSS.2009.04.003},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/SamerS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/SamerS10,
author = {Marko Samer and
Stefan Szeider},
title = {Algorithms for propositional model counting},
journal = {J. Discrete Algorithms},
volume = {8},
number = {1},
pages = {50--64},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2009.06.002},
doi = {10.1016/J.JDA.2009.06.002},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/SamerS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BroersmaDJS10,
author = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {Editorial},
journal = {J. Discrete Algorithms},
volume = {8},
number = {2},
pages = {101},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2009.07.003},
doi = {10.1016/J.JDA.2009.07.003},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/BroersmaDJS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/comma/DvorakSW10,
author = {Wolfgang Dvor{\'{a}}k and
Stefan Szeider and
Stefan Woltran},
editor = {Pietro Baroni and
Federico Cerutti and
Massimiliano Giacomin and
Guillermo Ricardo Simari},
title = {Reasoning in Argumentation Frameworks of Bounded Clique-Width},
booktitle = {Computational Models of Argument: Proceedings of {COMMA} 2010, Desenzano
del Garda, Italy, September 8-10, 2010},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {216},
pages = {219--230},
publisher = {{IOS} Press},
year = {2010},
url = {https://doi.org/10.3233/978-1-60750-619-5-219},
doi = {10.3233/978-1-60750-619-5-219},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/comma/DvorakSW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/comma/KimOS10,
author = {Eun Jung Kim and
Sebastian Ordyniak and
Stefan Szeider},
editor = {Pietro Baroni and
Federico Cerutti and
Massimiliano Giacomin and
Guillermo Ricardo Simari},
title = {Algorithms and Complexity Results for Persuasive Argumentation},
booktitle = {Computational Models of Argument: Proceedings of {COMMA} 2010, Desenzano
del Garda, Italy, September 8-10, 2010},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {216},
pages = {311--322},
publisher = {{IOS} Press},
year = {2010},
url = {https://doi.org/10.3233/978-1-60750-619-5-311},
doi = {10.3233/978-1-60750-619-5-311},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/comma/KimOS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/OrdyniakPS10,
author = {Sebastian Ordyniak and
Dani{\"{e}}l Paulusma and
Stefan Szeider},
editor = {Kamal Lodaya and
Meena Mahajan},
title = {Satisfiability of Acyclic and Almost Acyclic {CNF} Formulas},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2010, December 15-18, 2010,
Chennai, India},
series = {LIPIcs},
volume = {8},
pages = {84--95},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2010},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2010.84},
doi = {10.4230/LIPICS.FSTTCS.2010.84},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/OrdyniakPS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/GutinKSSY10,
author = {Gregory Z. Gutin and
Eun Jung Kim and
Arezou Soleimanfallah and
Stefan Szeider and
Anders Yeo},
editor = {Venkatesh Raman and
Saket Saurabh},
title = {Parameterized Complexity Results for General Factors in Bipartite
Graphs with an Application to Constraint Programming},
booktitle = {Parameterized and Exact Computation - 5th International Symposium,
{IPEC} 2010, Chennai, India, December 13-15, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6478},
pages = {158--169},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-17493-3\_16},
doi = {10.1007/978-3-642-17493-3\_16},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/GutinKSSY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kr/PichlerRSW10,
author = {Reinhard Pichler and
Stefan R{\"{u}}mmele and
Stefan Szeider and
Stefan Woltran},
editor = {Fangzhen Lin and
Ulrike Sattler and
Miroslaw Truszczynski},
title = {Tractable Answer-Set Programming with Weight Constraints: Bounded
Treewidth Is not Enough},
booktitle = {Principles of Knowledge Representation and Reasoning: Proceedings
of the Twelfth International Conference, {KR} 2010, Toronto, Ontario,
Canada, May 9-13, 2010},
publisher = {{AAAI} Press},
year = {2010},
url = {http://aaai.org/ocs/index.php/KR/KR2010/paper/view/1368},
timestamp = {Tue, 08 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/kr/PichlerRSW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AlonGKSY10,
author = {Noga Alon and
Gregory Z. Gutin and
Eun Jung Kim and
Stefan Szeider and
Anders Yeo},
editor = {Moses Charikar},
title = {Solving MAX-r-SAT Above a Tight Lower Bound},
booktitle = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010},
pages = {511--517},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973075.44},
doi = {10.1137/1.9781611973075.44},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/AlonGKSY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/HofKPST10,
author = {Pim van 't Hof and
Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Stefan Szeider and
Dimitrios M. Thilikos},
editor = {Jan van Leeuwen and
Anca Muscholl and
David Peleg and
Jaroslav Pokorn{\'{y}} and
Bernhard Rumpe},
title = {On Contracting Graphs to Fixed Pattern Graphs},
booktitle = {{SOFSEM} 2010: Theory and Practice of Computer Science, 36th Conference
on Current Trends in Theory and Practice of Computer Science, Spindleruv
Ml{\'{y}}n, Czech Republic, January 23-29, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5901},
pages = {503--514},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-11266-9\_42},
doi = {10.1007/978-3-642-11266-9\_42},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/HofKPST10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/uai/OrdyniakS10,
author = {Sebastian Ordyniak and
Stefan Szeider},
editor = {Peter Gr{\"{u}}nwald and
Peter Spirtes},
title = {Algorithms and Complexity Results for Exact Bayesian Structure Learning},
booktitle = {{UAI} 2010, Proceedings of the Twenty-Sixth Conference on Uncertainty
in Artificial Intelligence, Catalina Island, CA, USA, July 8-11, 2010},
pages = {401--408},
publisher = {{AUAI} Press},
year = {2010},
url = {https://dslpitt.org/uai/displayArticleDetails.jsp?mmnu=1\&\#38;smnu=2\&\#38;article\_id=2114\&\#38;proceeding\_id=26},
timestamp = {Wed, 03 Feb 2021 11:09:25 +0100},
biburl = {https://dblp.org/rec/conf/uai/OrdyniakS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/sat/2010,
editor = {Ofer Strichman and
Stefan Szeider},
title = {Theory and Applications of Satisfiability Testing - {SAT} 2010, 13th
International Conference, {SAT} 2010, Edinburgh, UK, July 11-14, 2010.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6175},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-14186-7},
doi = {10.1007/978-3-642-14186-7},
isbn = {978-3-642-14185-0},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/2010.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jar/SamerS09,
author = {Marko Samer and
Stefan Szeider},
title = {Backdoor Sets of Quantified Boolean Formulas},
journal = {J. Autom. Reason.},
volume = {42},
number = {1},
pages = {77--97},
year = {2009},
url = {https://doi.org/10.1007/s10817-008-9114-5},
doi = {10.1007/S10817-008-9114-5},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jar/SamerS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BroersmaDJS09,
author = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {Editorial},
journal = {J. Discrete Algorithms},
volume = {7},
number = {2},
pages = {147},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.09.002},
doi = {10.1016/J.JDA.2008.09.002},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/BroersmaDJS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/Szeider09,
author = {Stefan Szeider},
title = {Matched Formulas and Backdoor Sets},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {6},
number = {1-3},
pages = {1--12},
year = {2009},
url = {https://doi.org/10.3233/sat190059},
doi = {10.3233/SAT190059},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/Szeider09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FellowsRRS09,
author = {Michael R. Fellows and
Frances A. Rosamond and
Udi Rotics and
Stefan Szeider},
title = {Clique-Width is NP-Complete},
journal = {{SIAM} J. Discret. Math.},
volume = {23},
number = {2},
pages = {909--939},
year = {2009},
url = {https://doi.org/10.1137/070687256},
doi = {10.1137/070687256},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FellowsRRS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FleischnerMPS09,
author = {Herbert Fleischner and
Egbert Mujuni and
Dani{\"{e}}l Paulusma and
Stefan Szeider},
title = {Covering graphs with few complete bipartite subgraphs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {2045--2053},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.059},
doi = {10.1016/J.TCS.2008.12.059},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/FleischnerMPS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/GutinKSY09,
author = {Gregory Z. Gutin and
Eun Jung Kim and
Stefan Szeider and
Anders Yeo},
editor = {Jianer Chen and
Fedor V. Fomin},
title = {A Probabilistic Approach to Problems Parameterized above or below
Tight Bounds},
booktitle = {Parameterized and Exact Computation, 4th International Workshop, {IWPEC}
2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {5917},
pages = {234--245},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11269-0\_19},
doi = {10.1007/978-3-642-11269-0\_19},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/GutinKSY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/Szeider09,
author = {Stefan Szeider},
editor = {Oliver Kullmann},
title = {The Parameterized Complexity of k-Flip Local Search for {SAT} and
{MAX} {SAT}},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2009, 12th
International Conference, {SAT} 2009, Swansea, UK, June 30 - July
3, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5584},
pages = {276--283},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02777-2\_27},
doi = {10.1007/978-3-642-02777-2\_27},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/Szeider09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:series/faia/SamerS09,
author = {Marko Samer and
Stefan Szeider},
editor = {Armin Biere and
Marijn Heule and
Hans van Maaren and
Toby Walsh},
title = {Fixed-Parameter Tractability},
booktitle = {Handbook of Satisfiability},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {185},
pages = {425--454},
publisher = {{IOS} Press},
year = {2009},
url = {https://doi.org/10.3233/978-1-58603-929-5-425},
doi = {10.3233/978-1-58603-929-5-425},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/series/faia/SamerS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0906-1356,
author = {Gregory Z. Gutin and
Eun Jung Kim and
Stefan Szeider and
Anders Yeo},
title = {A Probabilistic Approach to Problems Parameterized Above Tight Lower
Bound},
journal = {CoRR},
volume = {abs/0906.1356},
year = {2009},
url = {http://arxiv.org/abs/0906.1356},
eprinttype = {arXiv},
eprint = {0906.1356},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0906-1356.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0907-4573,
author = {Gregory Z. Gutin and
Eun Jung Kim and
Stefan Szeider and
Anders Yeo},
title = {Solving {MAX-2-SAT} Above a Tight Lower Bound},
journal = {CoRR},
volume = {abs/0907.4573},
year = {2009},
url = {http://arxiv.org/abs/0907.4573},
eprinttype = {arXiv},
eprint = {0907.4573},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0907-4573.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GutinSY08,
author = {Gregory Z. Gutin and
Stefan Szeider and
Anders Yeo},
title = {Fixed-Parameter Complexity of Minimum Profile Problems},
journal = {Algorithmica},
volume = {52},
number = {2},
pages = {133--152},
year = {2008},
url = {https://doi.org/10.1007/s00453-007-9144-0},
doi = {10.1007/S00453-007-9144-0},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GutinSY08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cj/GottlobS08,
author = {Georg Gottlob and
Stefan Szeider},
title = {Fixed-Parameter Algorithms For Artificial Intelligence, Constraint
Satisfaction and Database Problems},
journal = {Comput. J.},
volume = {51},
number = {3},
pages = {303--325},
year = {2008},
url = {https://doi.org/10.1093/comjnl/bxm056},
doi = {10.1093/COMJNL/BXM056},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cj/GottlobS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BroersmaDJS08,
author = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {Preface},
journal = {J. Discrete Algorithms},
volume = {6},
number = {4},
pages = {539},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2008.07.005},
doi = {10.1016/J.JDA.2008.07.005},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/BroersmaDJS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/SamerS08,
author = {Marko Samer and
Stefan Szeider},
editor = {Dieter Fox and
Carla P. Gomes},
title = {Backdoor Trees},
booktitle = {Proceedings of the Twenty-Third {AAAI} Conference on Artificial Intelligence,
{AAAI} 2008, Chicago, Illinois, USA, July 13-17, 2008},
pages = {363--368},
publisher = {{AAAI} Press},
year = {2008},
url = {http://www.aaai.org/Library/AAAI/2008/aaai08-057.php},
timestamp = {Tue, 05 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/SamerS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cats/SamerS08,
author = {Marko Samer and
Stefan Szeider},
editor = {James Harland and
Prabhu Manyem},
title = {Tractable Cases of the Extended Global Cardinality Constraint},
booktitle = {Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian
Theory Symposium {(CATS} 2008), Wollongong, NSW, Australia, January
22-25, 2008. Proceedings},
series = {{CRPIT}},
volume = {77},
pages = {67--74},
publisher = {Australian Computer Society},
year = {2008},
url = {http://crpit.scem.westernsydney.edu.au/abstracts/CRPITV77Samer.html},
timestamp = {Mon, 08 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cats/SamerS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cats/MathiesonS08,
author = {Luke Mathieson and
Stefan Szeider},
editor = {James Harland and
Prabhu Manyem},
title = {The Parameterized Complexity of Regular Subgraph Problems and Generalizations},
booktitle = {Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian
Theory Symposium {(CATS} 2008), Wollongong, NSW, Australia, January
22-25, 2008. Proceedings},
series = {{CRPIT}},
volume = {77},
pages = {79--86},
publisher = {Australian Computer Society},
year = {2008},
url = {http://crpit.scem.westernsydney.edu.au/abstracts/CRPITV77Mathieson.html},
timestamp = {Mon, 08 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cats/MathiesonS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/MathiesonS08,
author = {Luke Mathieson and
Stefan Szeider},
editor = {Boting Yang and
Ding{-}Zhu Du and
Cao An Wang},
title = {Parameterized Graph Editing with Chosen Vertex Degrees},
booktitle = {Combinatorial Optimization and Applications, Second International
Conference, {COCOA} 2008, St. John's, NL, Canada, August 21-24, 2008.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5165},
pages = {13--22},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85097-7\_2},
doi = {10.1007/978-3-540-85097-7\_2},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/MathiesonS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Szeider08,
author = {Stefan Szeider},
editor = {Edward Ochmanski and
Jerzy Tyszkiewicz},
title = {Monadic Second Order Logic on Graphs with Local Cardinality Constraints},
booktitle = {Mathematical Foundations of Computer Science 2008, 33rd International
Symposium, {MFCS} 2008, Torun, Poland, August 25-29, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5162},
pages = {601--612},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85238-4\_49},
doi = {10.1007/978-3-540-85238-4\_49},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Szeider08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Szeider08,
author = {Stefan Szeider},
editor = {Ming{-}Yang Kao},
title = {Parameterized {SAT}},
booktitle = {Encyclopedia of Algorithms - 2008 Edition},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-0-387-30162-4\_283},
doi = {10.1007/978-0-387-30162-4\_283},
timestamp = {Thu, 27 Jun 2019 16:25:31 +0200},
biburl = {https://dblp.org/rec/reference/algo/Szeider08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/NishimuraRS07,
author = {Naomi Nishimura and
Prabhakar Ragde and
Stefan Szeider},
title = {Solving {\#}SAT using vertex covers},
journal = {Acta Informatica},
volume = {44},
number = {7-8},
pages = {509--523},
year = {2007},
url = {https://doi.org/10.1007/s00236-007-0056-x},
doi = {10.1007/S00236-007-0056-X},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/NishimuraRS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GutinRSY07,
author = {Gregory Z. Gutin and
Arash Rafiey and
Stefan Szeider and
Anders Yeo},
title = {The Linear Arrangement Problem Parameterized Above Guaranteed Value},
journal = {Theory Comput. Syst.},
volume = {41},
number = {3},
pages = {521--538},
year = {2007},
url = {https://doi.org/10.1007/s00224-007-1330-6},
doi = {10.1007/S00224-007-1330-6},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/GutinRSY07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/FellowsFLRSST07,
author = {Michael R. Fellows and
Fedor V. Fomin and
Daniel Lokshtanov and
Frances A. Rosamond and
Saket Saurabh and
Stefan Szeider and
Carsten Thomassen},
editor = {Andreas W. M. Dress and
Yinfeng Xu and
Binhai Zhu},
title = {On the Complexity of Some Colorful Problems Parameterized by Treewidth},
booktitle = {Combinatorial Optimization and Applications, First International Conference,
{COCOA} 2007, Xi'an, China, August 14-16, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4616},
pages = {366--377},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73556-4\_38},
doi = {10.1007/978-3-540-73556-4\_38},
timestamp = {Sat, 31 May 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/FellowsFLRSST07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DantchevMS07,
author = {Stefan S. Dantchev and
Barnaby Martin and
Stefan Szeider},
title = {Parameterized Proof Complexity},
booktitle = {48th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2007, Providence, RI, USA, October 20-23, 2007, Proceedings},
pages = {150--160},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/FOCS.2007.53},
doi = {10.1109/FOCS.2007.53},
timestamp = {Tue, 08 Jul 2025 16:25:57 +0200},
biburl = {https://dblp.org/rec/conf/focs/DantchevMS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/FleischnerMPS07,
author = {Herbert Fleischner and
Egbert Mujuni and
Dani{\"{e}}l Paulusma and
Stefan Szeider},
editor = {Vikraman Arvind and
Sanjiva Prasad},
title = {Covering Graphs with Few Complete Bipartite Subgraphs},
booktitle = {{FSTTCS} 2007: Foundations of Software Technology and Theoretical
Computer Science, 27th International Conference, New Delhi, India,
December 12-14, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4855},
pages = {340--351},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77050-3\_28},
doi = {10.1007/978-3-540-77050-3\_28},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/FleischnerMPS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lpar/SamerS07,
author = {Marko Samer and
Stefan Szeider},
editor = {Nachum Dershowitz and
Andrei Voronkov},
title = {Algorithms for Propositional Model Counting},
booktitle = {Logic for Programming, Artificial Intelligence, and Reasoning, 14th
International Conference, {LPAR} 2007, Yerevan, Armenia, October 15-19,
2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4790},
pages = {484--498},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-75560-9\_35},
doi = {10.1007/978-3-540-75560-9\_35},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lpar/SamerS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/Szeider07,
author = {Stefan Szeider},
editor = {Jo{\~{a}}o Marques{-}Silva and
Karem A. Sakallah},
title = {Matched Formulas and Backdoor Sets},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2007, 10th
International Conference, Lisbon, Portugal, May 28-31, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4501},
pages = {94--99},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-72788-0\_12},
doi = {10.1007/978-3-540-72788-0\_12},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/Szeider07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/SamerS07,
author = {Marko Samer and
Stefan Szeider},
editor = {Jo{\~{a}}o Marques{-}Silva and
Karem A. Sakallah},
title = {Backdoor Sets of Quantified Boolean Formulas},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2007, 10th
International Conference, Lisbon, Portugal, May 28-31, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4501},
pages = {230--243},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-72788-0\_23},
doi = {10.1007/978-3-540-72788-0\_23},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/SamerS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DantchevMS07,
author = {Stefan S. Dantchev and
Barnaby Martin and
Stefan Szeider},
title = {Parameterized Proof Complexity: a Complexity Gap for Parameterized
Tree-like Resolution},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR07-001}},
year = {2007},
url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-001/index.html},
eprinttype = {ECCC},
eprint = {TR07-001},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DantchevMS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HooryS06,
author = {Shlomo Hoory and
Stefan Szeider},
title = {A Note on Unsatisfiable k-CNF Formulas with Few Occurrences per Variable},
journal = {{SIAM} J. Discret. Math.},
volume = {20},
number = {2},
pages = {523--528},
year = {2006},
url = {https://doi.org/10.1137/S0895480104445745},
doi = {10.1137/S0895480104445745},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HooryS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FellowsSW06,
author = {Michael R. Fellows and
Stefan Szeider and
Graham Wrightson},
title = {On finding short resolution refutations and small unsatisfiable subsets},
journal = {Theor. Comput. Sci.},
volume = {351},
number = {3},
pages = {351--359},
year = {2006},
url = {https://doi.org/10.1016/j.tcs.2005.10.005},
doi = {10.1016/J.TCS.2005.10.005},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/FellowsSW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/GutinRSY06,
author = {Gregory Z. Gutin and
Arash Rafiey and
Stefan Szeider and
Anders Yeo},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {The Linear Arrangement Problem Parameterized Above Guaranteed Value},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {356--367},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_34},
doi = {10.1007/11758471\_34},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/GutinRSY06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cp/SamerS06,
author = {Marko Samer and
Stefan Szeider},
editor = {Fr{\'{e}}d{\'{e}}ric Benhamou},
title = {Constraint Satisfaction with Bounded Treewidth Revisited},
booktitle = {Principles and Practice of Constraint Programming - {CP} 2006, 12th
International Conference, {CP} 2006, Nantes, France, September 25-29,
2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4204},
pages = {499--513},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11889205\_36},
doi = {10.1007/11889205\_36},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cp/SamerS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/GutinSY06,
author = {Gregory Z. Gutin and
Stefan Szeider and
Anders Yeo},
editor = {Hans L. Bodlaender and
Michael A. Langston},
title = {Fixed-Parameter Complexity of Minimum Profile Problems},
booktitle = {Parameterized and Exact Computation, Second International Workshop,
{IWPEC} 2006, Z{\"{u}}rich, Switzerland, September 13-15, 2006,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4169},
pages = {60--71},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11847250\_6},
doi = {10.1007/11847250\_6},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/GutinSY06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/NishimuraRS06,
author = {Naomi Nishimura and
Prabhakar Ragde and
Stefan Szeider},
editor = {Armin Biere and
Carla P. Gomes},
title = {Solving {\#}SAT Using Vertex Covers},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2006, 9th
International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4121},
pages = {396--409},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11814948\_36},
doi = {10.1007/11814948\_36},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/NishimuraRS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FellowsRRS06,
author = {Michael R. Fellows and
Frances A. Rosamond and
Udi Rotics and
Stefan Szeider},
editor = {Jon M. Kleinberg},
title = {Clique-width minimization is NP-hard},
booktitle = {Proceedings of the 38th Annual {ACM} Symposium on Theory of Computing,
Seattle, WA, USA, May 21-23, 2006},
pages = {354--362},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1132516.1132568},
doi = {10.1145/1132516.1132568},
timestamp = {Sun, 19 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FellowsRRS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/acid/2006,
editor = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {Algorithms and Complexity in Durham 2006 - Proceedings of the Second
ACiD Workshop, 18-20 September 2006, Durham, {UK}},
series = {Texts in Algorithmics},
volume = {7},
publisher = {King's College, London},
year = {2006},
isbn = {1-904987-38-9},
timestamp = {Tue, 24 Jul 2007 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/acid/2006.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0604095,
author = {Gregory Z. Gutin and
Stefan Szeider and
Anders Yeo},
title = {Fixed-Parameter Complexity of Minimum Profile Problems},
journal = {CoRR},
volume = {abs/cs/0604095},
year = {2006},
url = {http://arxiv.org/abs/cs/0604095},
eprinttype = {arXiv},
eprint = {cs/0604095},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0604095.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0607109,
author = {Marko Samer and
Stefan Szeider},
title = {Complexity and Applications of Edge-Induced Vertex-Cuts},
journal = {CoRR},
volume = {abs/cs/0607109},
year = {2006},
url = {http://arxiv.org/abs/cs/0607109},
eprinttype = {arXiv},
eprint = {cs/0607109},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0607109.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0610174,
author = {Marko Samer and
Stefan Szeider},
title = {A Fixed-Parameter Algorithm for {\#}SAT with Parameter Incidence Treewidth},
journal = {CoRR},
volume = {abs/cs/0610174},
year = {2006},
url = {http://arxiv.org/abs/cs/0610174},
eprinttype = {arXiv},
eprint = {cs/0610174},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0610174.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/Szeider05,
author = {Stefan Szeider},
title = {Generalizations of matched {CNF} formulas},
journal = {Ann. Math. Artif. Intell.},
volume = {43},
number = {1},
pages = {223--238},
year = {2005},
url = {https://doi.org/10.1007/s10472-005-0432-6},
doi = {10.1007/S10472-005-0432-6},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/amai/Szeider05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/FleischnerS05,
author = {Herbert Fleischner and
Stefan Szeider},
title = {On Edge-Colored Graphs Covered by Properly Colored Cycles},
journal = {Graphs Comb.},
volume = {21},
number = {3},
pages = {301--306},
year = {2005},
url = {https://doi.org/10.1007/s00373-005-0613-4},
doi = {10.1007/S00373-005-0613-4},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/FleischnerS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jar/Szeider05,
author = {Stefan Szeider},
title = {Backdoor Sets for {DLL} Subsolvers},
journal = {J. Autom. Reason.},
volume = {35},
number = {1-3},
pages = {73--88},
year = {2005},
url = {https://doi.org/10.1007/s10817-005-9007-9},
doi = {10.1007/S10817-005-9007-9},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jar/Szeider05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Szeider05,
author = {Stefan Szeider},
title = {The Complexity of Resolution with Generalized Symmetry Rules},
journal = {Theory Comput. Syst.},
volume = {38},
number = {2},
pages = {171--188},
year = {2005},
url = {https://doi.org/10.1007/s00224-004-1192-0},
doi = {10.1007/S00224-004-1192-0},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Szeider05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HooryS05,
author = {Shlomo Hoory and
Stefan Szeider},
title = {Computing unsatisfiable k-SAT instances with few occurrences per variable},
journal = {Theor. Comput. Sci.},
volume = {337},
number = {1-3},
pages = {347--359},
year = {2005},
url = {https://doi.org/10.1016/j.tcs.2005.02.004},
doi = {10.1016/J.TCS.2005.02.004},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/HooryS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/acid/2005,
editor = {Hajo Broersma and
Matthew Johnson and
Stefan Szeider},
title = {Algorithms and Complexity in Durham 2005 - Proceedings of the First
ACiD Workshop, 8-10 July 2005, Durham, {UK}},
series = {Texts in Algorithmics},
volume = {4},
publisher = {King's College, London},
year = {2005},
isbn = {1-904987-10-9},
timestamp = {Tue, 24 Jul 2007 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/acid/2005.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0511030,
author = {Gregory Z. Gutin and
Arash Rafiey and
Stefan Szeider and
Anders Yeo},
title = {The Linear Arrangement Problem Parameterized Above Guaranteed Value},
journal = {CoRR},
volume = {abs/cs/0511030},
year = {2005},
url = {http://arxiv.org/abs/cs/0511030},
eprinttype = {arXiv},
eprint = {cs/0511030},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0511030.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-080,
author = {Michael R. Fellows and
Frances A. Rosamond and
Udi Rotics and
Stefan Szeider},
title = {Proving NP-hardness for clique-width {I:} non-approximability of sequential
clique-width},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-080}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-080/index.html},
eprinttype = {ECCC},
eprint = {TR05-080},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-080.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-081,
author = {Michael R. Fellows and
Frances A. Rosamond and
Udi Rotics and
Stefan Szeider},
title = {Proving NP-hardness for clique-width {II:} non-approximability of
clique-width},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-081}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-081/index.html},
eprinttype = {ECCC},
eprint = {TR05-081},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-081.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/Szeider04,
author = {Stefan Szeider},
title = {On Theorems Equivalent with Kotzig's Result on Graphs with Unique
1-Factors},
journal = {Ars Comb.},
volume = {73},
year = {2004},
timestamp = {Fri, 27 May 2005 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/arscom/Szeider04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Szeider04,
author = {Stefan Szeider},
title = {Minimal unsatisfiable formulas with bounded clause-variable difference
are fixed-parameter tractable},
journal = {J. Comput. Syst. Sci.},
volume = {69},
number = {4},
pages = {656--674},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2004.04.009},
doi = {10.1016/J.JCSS.2004.04.009},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/Szeider04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/FellowsSW04,
author = {Michael R. Fellows and
Stefan Szeider and
Graham Wrightson},
editor = {Rodney G. Downey and
Michael R. Fellows and
Frank K. H. A. Dehne},
title = {On Finding Short Resolution Refutations and Small Unsatisfiable Subsets},
booktitle = {Parameterized and Exact Computation, First International Workshop,
{IWPEC} 2004, Bergen, Norway, September 14-17, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3162},
pages = {223--234},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-28639-4\_20},
doi = {10.1007/978-3-540-28639-4\_20},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/FellowsSW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/HooryS04,
author = {Shlomo Hoory and
Stefan Szeider},
title = {Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable},
booktitle = {{SAT} 2004 - The Seventh International Conference on Theory and Applications
of Satisfiability Testing, 10-13 May 2004, Vancouver, BC, Canada,
Online Proceedings},
year = {2004},
url = {http://www.satisfiability.org/SAT04/programme/43.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sat/HooryS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/NishimuraRS04,
author = {Naomi Nishimura and
Prabhakar Ragde and
Stefan Szeider},
title = {Detecting Backdoor Sets with Respect to Horn and Binary Clauses},
booktitle = {{SAT} 2004 - The Seventh International Conference on Theory and Applications
of Satisfiability Testing, 10-13 May 2004, Vancouver, BC, Canada,
Online Proceedings},
year = {2004},
url = {http://www.satisfiability.org/SAT04/programme/51.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sat/NishimuraRS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Szeider03,
author = {Stefan Szeider},
title = {Finding paths in graphs avoiding forbidden transitions},
journal = {Discret. Appl. Math.},
volume = {126},
number = {2-3},
pages = {261--273},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00251-2},
doi = {10.1016/S0166-218X(02)00251-2},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/Szeider03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Szeider03a,
author = {Stefan Szeider},
title = {Homomorphisms of conjunctive normal forms},
journal = {Discret. Appl. Math.},
volume = {130},
number = {2},
pages = {351--365},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00411-0},
doi = {10.1016/S0166-218X(02)00411-0},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/Szeider03a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/Szeider03,
author = {Stefan Szeider},
editor = {Tandy J. Warnow and
Binhai Zhu},
title = {Minimal Unsatisfiable Formulas with Bounded Clause-Variable Difference
are Fixed-Parameter Tractable},
booktitle = {Computing and Combinatorics, 9th Annual International Conference,
{COCOON} 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2697},
pages = {548--558},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-45071-8\_55},
doi = {10.1007/3-540-45071-8\_55},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/Szeider03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/Szeider03,
author = {Stefan Szeider},
editor = {Enrico Giunchiglia and
Armando Tacchella},
title = {On Fixed-Parameter Tractable Parameterizations of {SAT}},
booktitle = {Theory and Applications of Satisfiability Testing, 6th International
Conference, {SAT} 2003. Santa Margherita Ligure, Italy, May 5-8, 2003
Selected Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2919},
pages = {188--202},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24605-3\_15},
doi = {10.1007/978-3-540-24605-3\_15},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/Szeider03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Szeider03,
author = {Stefan Szeider},
editor = {Helmut Alt and
Michel Habib},
title = {The Complexity of Resolution with Generalized Symmetry Rules},
booktitle = {{STACS} 2003, 20th Annual Symposium on Theoretical Aspects of Computer
Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2607},
pages = {475--486},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-36494-3\_42},
doi = {10.1007/3-540-36494-3\_42},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Szeider03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR03-002,
author = {Stefan Szeider},
title = {Minimal unsatisfiable formulas with bounded clause-variable difference
are fixed-parameter tractable},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR03-002}},
year = {2003},
url = {https://eccc.weizmann.ac.il/eccc-reports/2003/TR03-002/index.html},
eprinttype = {ECCC},
eprint = {TR03-002},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR03-002.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FleischnerKS02,
author = {Herbert Fleischner and
Oliver Kullmann and
Stefan Szeider},
title = {Polynomial-time recognition of minimal unsatisfiable formulas with
fixed clause-variable difference},
journal = {Theor. Comput. Sci.},
volume = {289},
number = {1},
pages = {503--516},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(01)00337-1},
doi = {10.1016/S0304-3975(01)00337-1},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/FleischnerKS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cade/Szeider01,
author = {Stefan Szeider},
editor = {Rajeev Gor{\'{e}} and
Alexander Leitsch and
Tobias Nipkow},
title = {NP-Completeness of Refutability by Literal-Once Resolution},
booktitle = {Automated Reasoning, First International Joint Conference, {IJCAR}
2001, Siena, Italy, June 18-23, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2083},
pages = {168--181},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45744-5\_13},
doi = {10.1007/3-540-45744-5\_13},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cade/Szeider01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR00-049,
author = {Herbert Fleischner and
Stefan Szeider},
title = {Polynomial-Time Recognition of Minimal Unsatisfiable Formulas with
Fixed Clause-Variable Difference},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR00-049}},
year = {2000},
url = {https://eccc.weizmann.ac.il/eccc-reports/2000/TR00-049/index.html},
eprinttype = {ECCC},
eprint = {TR00-049},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR00-049.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 2025-11-14 23:51 CET 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: