Sebastian Ordyniak
Privatdoz. Dipl.-Inf. / PhD
Role
-
Affiliated
Algorithms and Complexity, E192-01
Projects
-
Parameterized Complexity of Local Search
2011 – 2013 / Federal Ministry of Science and Research (bm:wf)
Publications: 167676 / 54316 / 54321 -
The Parameterized Complexity of Reasoning Problems
2010 – 2014 / European Research Council (ERC)
Publications: 155819 / 155821 / 157455 / 157456 / 157457 / 162509 / 162538 / 162539 / 162540 / 162541 / 162546 / 163741 / 164269 / 164271 / 164272 / 164274 / 164275 / 164276 / 164277 / 167426 / 23575 / 23746 / 23747 / 27324 / 27722 / 37417 / 53171 / 53318 / 53320 / 53321 / 53322 / 53323 / 53324 / 53449 / 53531 / 53758 / 53759 / 53760 / 53761 / 53762 / 53763 / 53764 / 53765 / 54313 / 54314 / 54315 / 54316 / 54317 / 54318 / 54319 / 54320 / 54321 / 54322 / 54323 / 54790 / 54863 / 54864 / 54865 / 54866 / 54867 / 54869 / 54870 / 54871 / 54873 / 54874 / 54875 / 54876 / 54877 / 54878 / 54879 / 54880 / 54886 / 54888 / 55734 / 55806 / 55807 / 55808 / 55809 / 55810 / 55811 / 55812 / 55813 / 55815 / 55816 / 85421 / 85422 / 85423 / 85668 / 85669 / 85670 / 85671
Publications
2024
-
A Tight Subexponential-Time Algorithm for Two-Page Book Embedding
/
Ganian, R., Müller, H., Ordyniak, S., Paesani, G., & Rychlicki, M. (2024). A Tight Subexponential-Time Algorithm for Two-Page Book Embedding. In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024) (pp. 68:1-68:18). https://doi.org/10.4230/LIPIcs.ICALP.2024.68
Projects: Parameterisierte Analyse in der Künstlichen Intelligenz (2021–2026) / Parameterized Graph Drawing (2023–2027)
2023
-
CSP beyond tractable constraint languages
/
Dreier, J., Ordyniak, S., & Szeider, S. (2023). CSP beyond tractable constraint languages. Constraints, 28(3), 450–471. https://doi.org/10.1007/s10601-023-09362-3
Download: PDF (503 KB)
Projects: REVEAL-AI (2020–2024) / SLIM (2019–2024) - On the parameterized complexity of clustering problems for incomplete data / Eiben, E., Ganian, R., Kanj, I., Ordyniak, S., & Szeider, S. (2023). On the parameterized complexity of clustering problems for incomplete data. Journal of Computer and System Sciences, 134, 1–19. https://doi.org/10.1016/j.jcss.2022.12.001
- Group Activity Selection with Few Agent Types / Ganian, R., Ordyniak, S., & Rahul, C. S. (2023). Group Activity Selection with Few Agent Types. Algorithmica, 85(5), 1111–1155. https://doi.org/10.1007/s00453-022-01058-z
- Parameterized complexity of envy-free resource allocation in social networks / Eiben, E., Ganian, R., Hamm, T., & Ordyniak, S. (2023). Parameterized complexity of envy-free resource allocation in social networks. Artificial Intelligence, 315, Article 103826. https://doi.org/10.1016/j.artint.2022.103826
- Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF / Fichte, J. K., Ganian, R., Hecher, M., Slivovsky, F., & Ordyniak, S. (2023). Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF. In 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (pp. 1–14). IEEE. https://doi.org/10.1109/LICS56636.2023.10175675
- Learning Small Decision Trees with Large Domain / Eiben, E., Ordyniak, S., Paesani, G., & Szeider, S. (2023). Learning Small Decision Trees with Large Domain. In Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence (IJCAI-23) (pp. 3184–3192). https://doi.org/10.24963/ijcai.2023/355
- The Computational Complexity of Concise Hypersphere Classification / Eiben, E., Ganian, R., Kanj, I., Ordyniak, S., & Szeider, S. (2023). The Computational Complexity of Concise Hypersphere Classification. In A. Krause, E. Brunskill, K. Cho, B. Engelhardt, S. Sabato, & J. Scarlett (Eds.), Proceedings of the 40th International Conference on Machine Learning (pp. 9060–9070). http://hdl.handle.net/20.500.12708/188983
- From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem / Eiben, E., Ganian, R., Kanj, I., Ordyniak, S., & Szeider, S. (2023). From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem. In N. Misra & M. Wahlström (Eds.), 18th International Symposium on Parameterized and Exact Computation (IPEC 2023) (pp. 1–14). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.IPEC.2023.16
- The Parameterized Complexity of Finding Concise Local Explanations / Ordyniak, S., Paesani, G., & Szeider, S. (2023). The Parameterized Complexity of Finding Concise Local Explanations. In Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence (IJCAI-23) (pp. 3312–3320). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2023/369
2022
-
Finding a Cluster in Incomplete Data
/
Eiben, E., Ganian, R., Kanj, I., Ordyniak, S., & Szeider, S. (2022). Finding a Cluster in Incomplete Data. In 30th Annual European Symposium on Algorithms (ESA 2022) (pp. 1–14). Schloss Dagstuhl -- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2022.47
Download: PDF (610 KB)
Projects: Parameterisierte Analyse in der Künstlichen Intelligenz (2021–2026) / SLIM (2019–2024) -
SAT Backdoors: Depth Beats Size
/
Dreier, J., Ordyniak, S., & Szeider, S. (2022). SAT Backdoors: Depth Beats Size. In 30th Annual European Symposium on Algorithms (ESA 2022) (pp. 1–18). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2022.46
Download: PDF (829 KB)
Projects: REVEAL-AI (2020–2024) / SLIM (2019–2024) -
CSP Beyond Tractable Constraint Languages
/
Dreier, J., Ordyniak, S., & Szeider, S. (2022). CSP Beyond Tractable Constraint Languages. In C. Solnon (Ed.), 28th International Conference on Principles and Practice of Constraint Programming (pp. 1–17). Schloss Dagstuhl, Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CP.2022.20
Download: PDF (681 KB) -
The Complexity of Envy-Free Graph Cutting
/
Deligkas, A., Eiben, E., Ganian, R., Hamm, T., & Ordyniak, S. (2022). The Complexity of Envy-Free Graph Cutting. In L. De Raedt (Ed.), Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence (pp. 237–243). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2022/34
Download: paper (182 KB)
Projects: NFPC (2018–2022) / Parameterisierte Analyse in der Künstlichen Intelligenz (2021–2026)
2021
- The Complexity of Object Association in Multiple Object Tracking / Ganian, R., Hamm, T., & Ordyniak, S. (2021). The Complexity of Object Association in Multiple Object Tracking. In The Thirty-Fifth AAAI Conference on Artificial Intelligence (AAAI-21) (pp. 1388–1396). AAAI Press. http://hdl.handle.net/20.500.12708/58619
- The Parameterized Complexity of Clustering Incomplete Data / Eiben, E., Ganian, R., Kanj, I., Ordyniak, S., & Szeider, S. (2021). The Parameterized Complexity of Clustering Incomplete Data. In Thirty-Fifth AAAI Conference on Artificial Intelligence (pp. 7296–7304). AAAI Press. http://hdl.handle.net/20.500.12708/58587
- Parameterized Complexity of Small Decision Tree Learning / Ordyniak, S., & Szeider, S. (2021). Parameterized Complexity of Small Decision Tree Learning. In Thirty-Fifth AAAI Conference on Artificial Intelligence (pp. 1–9). AAAI Press. http://hdl.handle.net/20.500.12708/58602
- The Parameterized Complexity of Connected Fair Division / Deligkas, A., Eiben, E., Ganian, R., Hamm, T., & Ordyniak, S. (2021). The Parameterized Complexity of Connected Fair Division. In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence. IJCAI 2021 - 30th International Joint Conference on Artificial Intelligence, Montreal, Canada, Canada. https://doi.org/10.24963/ijcai.2021/20
- The complexity landscape of decompositional parameters for ILP: Programs with few global variables and constraints / Dvořák, P., Eiben, E., Ganian, R., Knop, D., & Ordyniak, S. (2021). The complexity landscape of decompositional parameters for ILP: Programs with few global variables and constraints. Artificial Intelligence, 300(103561), 103561. https://doi.org/10.1016/j.artint.2021.103561
- On Structural Parameterizations of the Edge Disjoint Paths Problem / Ganian, R., Ordyniak, S., & Ramanujan, M. S. (2021). On Structural Parameterizations of the Edge Disjoint Paths Problem. Algorithmica, 83(6), 1605–1637. https://doi.org/10.1007/s00453-020-00795-3
2020
- Parameterized Complexity of Envy-Free Resource Allocation in Social Networks / Eiben, E., Ganian, R., Hamm, T., & Ordyniak, S. (2020). Parameterized Complexity of Envy-Free Resource Allocation in Social Networks. In Proceedings of the AAAI Conference on Artificial Intelligence (pp. 7135–7142). AAAI Press. https://doi.org/10.1609/aaai.v34i05.6201
- On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank / Ganian, R., Kanj, I., Ordyniak, S., & Szeider, S. (2020). On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank. In Proceedings of the AAAI Conference on Artificial Intelligence (pp. 3906–3913). AAAI Press. https://doi.org/10.1609/aaai.v34i04.5804
- On Structural Parameterizations of the Bounded‑Degree Vertex Deletion Problem / Ganian, R., Klute, F., & Ordyniak, S. (2020). On Structural Parameterizations of the Bounded‑Degree Vertex Deletion Problem. Algorithmica, 83(1), 297–336. https://doi.org/10.1007/s00453-020-00758-8
- The Power of Cut‑Based Parameters for Computing Edge‑Disjoint Paths / Ganian, R., & Ordyniak, S. (2020). The Power of Cut‑Based Parameters for Computing Edge‑Disjoint Paths. Algorithmica, 83(2), 726–752. https://doi.org/10.1007/s00453-020-00772-w
- Towards a Polynomial Kernel for Directed Feedback VertexSet / Bergougnoux, B., Eiben, E., Ganian, R., Ordyniak, S., & Ramanujan, M. S. (2020). Towards a Polynomial Kernel for Directed Feedback VertexSet. Algorithmica, 83(5), 1201–1221. https://doi.org/10.1007/s00453-020-00777-5
- Usingdecomposition-parametersforQBF:Mindtheprefix! / Eiben, E., Ganian, R., & Ordyniak, S. (2020). Usingdecomposition-parametersforQBF:Mindtheprefix! Journal of Computer and System Sciences, 110, 1–21. https://doi.org/10.1016/j.jcss.2019.12.005
2019
- Parameterized Complexity Results for the Completion and Clustering of Incomplete Data / Szeider, S., Ganian, R., Kanj, I., & Ordyniak, S. (2019). Parameterized Complexity Results for the Completion and Clustering of Incomplete Data. Kocoon Workshop, Arras, France. http://hdl.handle.net/20.500.12708/86961
-
Backdoors to planning
/
Kronegger, M., Ordyniak, S., & Pfandler, A. (2019). Backdoors to planning. Artificial Intelligence, 269, 49–75. https://doi.org/10.1016/j.artint.2018.10.002
Projects: FAIR (2013–2018) / START (2014–2022) - SAT-Encodings for Treecut Width and Treedepth / Ganian, R., Lodha, N., Ordyniak, S., & Szeider, S. (2019). SAT-Encodings for Treecut Width and Treedepth. In S. G. Kobourov & H. Meyerhenke (Eds.), Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX). SIAM. https://doi.org/10.1137/1.9781611975499
- A SAT Approach to Branchwidth / Lodha, N., Ordyniak, S., & Szeider, S. (2019). A SAT Approach to Branchwidth. ACM Transactions on Computational Logic, 20(3), 1–24. https://doi.org/10.1145/3326159
2018
- A Structural Approach to Activity Selection / Eiben, E., Ganian, R., & Ordyniak, S. (2018). A Structural Approach to Activity Selection. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (pp. 203–209). International Joint Conferences on Artificial Intelligence. http://hdl.handle.net/20.500.12708/57663
- Small Resolution Proofs for QBF using Dependency Treewidth / Eiben, E., Ganian, R., & Ordyniak, S. (2018). Small Resolution Proofs for QBF using Dependency Treewidth. In Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France (pp. 1–14). 35th Symposium on Theoretical Aspects of Computer Science. http://hdl.handle.net/20.500.12708/57665
- On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem / Ganian, R., Klute, F., & Ordyniak, S. (2018). On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem. In Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science (pp. 1–14). 35th Symposium on Theoretical Aspects of Computer Science. http://hdl.handle.net/20.500.12708/57666
- The Complexity Landscape of Decompositional Parameters for ILP / Ganian, R., & Ordyniak, S. (2018). The Complexity Landscape of Decompositional Parameters for ILP. Artificial Intelligence, 257, 61–71. https://doi.org/10.1016/j.artint.2017.12.006
- Parameterized Algorithms for the Matrix Completion Problem / Ganian, R., Kanj, I., Ordyniak, S., & Szeider, S. (2018). Parameterized Algorithms for the Matrix Completion Problem. In Proceeding of ICML (pp. 1642–1651). Journal of Machine Learning Research. http://hdl.handle.net/20.500.12708/57440
2017
- Kernelization using structural parameters on sparse graph classes / Gajarsky, J., Hlinený, P., Obdrzalek, J., Ordyniak, S., Reidl, F., Rossmanith, P., Villaamil Sanchez, F., & Sikdar, S. (2017). Kernelization using structural parameters on sparse graph classes. Journal of Computer and System Sciences, 84, 219–242. https://doi.org/10.1016/j.jcss.2016.09.002
- The Constraint Satisfaction Problem: Complexity and Approximability / Szeider, S., Ordyniak, S., & Gaspers, S. (2017). The Constraint Satisfaction Problem: Complexity and Approximability. In The Constraint Satisfaction Problem: Complexity and Approximability (pp. 137–157). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany. http://hdl.handle.net/20.500.12708/29616
- Towards a Polynomial Kernel for Directed Feedback Vertex Set / Bergnougnoux, B., Eiben, E., Ganian, R., Ordyniak, S., & Ramanujan, M. S. (2017). Towards a Polynomial Kernel for Directed Feedback Vertex Set. In Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science (pp. 1–15). Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science. http://hdl.handle.net/20.500.12708/57302
- Going Beyond Primal Treewidth for (M)ILP / Ganian, R., Ordyniak, S., & Ramanujan, M. S. (2017). Going Beyond Primal Treewidth for (M)ILP. In Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence (pp. 815–821). http://hdl.handle.net/20.500.12708/57013
- Backdoors into heterogeneous classes of SAT and CSP / Gaspers, S., Misra, N., Ordyniak, S., Szeider, S., & Živný, S. (2017). Backdoors into heterogeneous classes of SAT and CSP. Journal of Computer and System Sciences, 85, 38–56. https://doi.org/10.1016/j.jcss.2016.10.007
- First order limits of sparse graphs: Plane trees and path-width / Gajarsky, J., Hlinený, P., Kaiser, T., Král, D., Kupec, M., Obdrzalek, J., Ordyniak, S., & Vojtech, T. (2017). First order limits of sparse graphs: Plane trees and path-width. Random Structures and Algorithms, 50, 612–635. http://hdl.handle.net/20.500.12708/147742
- A SAT Approach to Branchwidth / Lodha, N., Ordyniak, S., & Szeider, S. (2017). A SAT Approach to Branchwidth. In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017) (pp. 4894–4898). http://hdl.handle.net/20.500.12708/57272
- SAT-Encodings for Special Treewidth and Pathwidth / Lodha, N., Ordyniak, S., & Szeider, S. (2017). SAT-Encodings for Special Treewidth and Pathwidth. In Theory and Applications of Satisfiability Testing – SAT 2017 (pp. 429–445). Springer International Publishing AG 2017. https://doi.org/10.1007/978-3-319-66263-3_27
2016
-
Clique-Width and Directed Width Measures for Answer-Set Programming
/
Bliem, B., Ordyniak, S., & Woltran, S. (2016). Clique-Width and Directed Width Measures for Answer-Set Programming. In G. A. Kaminka, M. Fox, P. Bouquet, E. Hüllermeier, V. Dignum, F. Dignum, & F. van Harmelen (Eds.), ECAI 2016 - 22nd European Conference on Artificial Intelligence (pp. 1105–1113). IOS Press. http://hdl.handle.net/20.500.12708/56679
Project: START (2014–2022) -
Clique-Width and Directed Width Measures for Answer-Set Programming
/
Bliem, B., Ordyniak, S., & Woltran, S. (2016). Clique-Width and Directed Width Measures for Answer-Set Programming. In T. Eiter, W. Faber, & S. Woltran (Eds.), Proceedings of the Workshop on Trends and Applications of Answer Set Programming (TAASP 2016) (p. 17). http://hdl.handle.net/20.500.12708/56809
Project: START (2014–2022) - Backdoors to q-Horn / Gaspers, S., Ordyniak, S., Ramanujan, M. S., Saurabh, S., & Szeider, S. (2016). Backdoors to q-Horn. Algorithmica, 74(1), 540–557. https://doi.org/10.1007/s00453-014-9958-5
- Tree-depth and vertex-minors / Hlinený, P., Kwon, O.-J., Obdrzalek, J., & Ordyniak, S. (2016). Tree-depth and vertex-minors. European Journal of Combinatorics, 56, 46–56. http://hdl.handle.net/20.500.12708/149904
- Complexity and monotonicity results for domination games / Kreutzer, S., & Ordyniak, S. (2016). Complexity and monotonicity results for domination games. Theoretical Computer Science, 628, 1–29. https://doi.org/10.1016/j.tcs.2016.03.003
- Directed elimination games / Engelmann, V., Ordyniak, S., & Kreutzer, S. (2016). Directed elimination games. Discrete Applied Mathematics, 199, 187–198. https://doi.org/10.1016/j.dam.2014.08.030
- A Parameterized Study of Maximum Generalized Pattern Matching Problems / Ordyniak, S., & Popa, A. (2016). A Parameterized Study of Maximum Generalized Pattern Matching Problems. Algorithmica, 75(1), 1–26. https://doi.org/10.1007/s00453-015-0008-8
- SOBRA - Shielding Optimization for BRAchytherapy / Blin, G., Gasparoux, M., Ordyniak, S., & Popa, A. (2016). SOBRA - Shielding Optimization for BRAchytherapy. In Combinatorial Algorithms - 27th International Workshop (pp. 309–320). http://hdl.handle.net/20.500.12708/56880
- Edge-Editing to a Dense and a Sparse Graph Class / Kotrbcık, M., Kralovic, R., & Ordyniak, S. (2016). Edge-Editing to a Dense and a Sparse Graph Class. In Proceedings of LATIN 2016: Theoretical Informatics - 12th Latin American Symposium (pp. 562–575). http://hdl.handle.net/20.500.12708/56878
- Counting Linear Extensions Parameterizations by Treewidth / Eiben, E., Ganian, R., Kangas, K., & Ordyniak, S. (2016). Counting Linear Extensions Parameterizations by Treewidth. In Proceedings of the 24th Annual European Symposium on Algorithms (pp. 1–18). http://hdl.handle.net/20.500.12708/56800
- On the Complexity Landscape of Connected f-Factor Problems* / Ganian, R., Narayanaswamy, N. S., Ordyniak, S., Rahul, C. S., & Ramanujan, M. S. (2016). On the Complexity Landscape of Connected f-Factor Problems*. In Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (pp. 1–14). http://hdl.handle.net/20.500.12708/56689
- Using Decomposition-Parameters for QBF: Mind the Prefix! / Eiben, E., Ganian, R., & Ordyniak, S. (2016). Using Decomposition-Parameters for QBF: Mind the Prefix! In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (pp. 964–970). http://hdl.handle.net/20.500.12708/56686
- The Complexity Landscape of Decompositional Parameters for ILP / Ganian, R., & Ordyniak, S. (2016). The Complexity Landscape of Decompositional Parameters for ILP. In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (pp. 710–716). http://hdl.handle.net/20.500.12708/56685
- A SAT Approach to Branchwidth / Lodha, N., Ordyniak, S., & Szeider, S. (2016). A SAT Approach to Branchwidth. In Proceedings of SAT 2016: Theory and Applications of Satisfiability Testing - SAT 2016 (pp. 179–195). http://hdl.handle.net/20.500.12708/56670
2015
- A Complete Parameterized Complexity Analysis of Bounded Planning / Bäckström, C., Jonsson, P., Ordyniak, S., & Szeider, S. (2015). A Complete Parameterized Complexity Analysis of Bounded Planning. Journal of Computer and System Sciences, 81(7), 1311–1332. https://doi.org/10.1016/j.jcss.2015.04.002
- On finding optimal polytrees / Gaspers, S., Koivisto, M., Liedloff, M., Ordyniak, S., & Szeider, S. (2015). On finding optimal polytrees. Theoretical Computer Science, 592, 49–58. https://doi.org/10.1016/j.tcs.2015.05.012
- Variable-Deletion Backdoors to Planning / Ordyniak, S. (2015). Variable-Deletion Backdoors to Planning. Postdoc Presentation Days, Masaryk University Brno, EU. http://hdl.handle.net/20.500.12708/86162
- Parameterized Algorithms for Parity Games / Gajarsky, J., Lampis, M., Makino, K., Mitsou, V., & Ordyniak, S. (2015). Parameterized Algorithms for Parity Games. In G. F. Italiano, G. Pighizzini, & D. Sannella (Eds.), Mathematical Foundations of Computer Science 2015 - 40th International Symposium, {MFCS} 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part {II} (pp. 336–347). http://hdl.handle.net/20.500.12708/56223
-
Variable-Deletion Backdoors to Planning
/
Kronegger, M., Pfandler, A., & Ordyniak, S. (2015). Variable-Deletion Backdoors to Planning. In B. Bonet & S. Koenig (Eds.), Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25-30, 2015, Austin, Texas, USA (pp. 3305–3312). AAAI Press. http://hdl.handle.net/20.500.12708/56214
Project: FAIR (2013–2018)
2014
-
Backdoors to Planning
/
Kronegger, M., Pfandler, A., & Ordyniak, S. (2014). Backdoors to Planning. In C. E. Brodley & P. Stone (Eds.), Proceedings of the Twenty-Eighth AAAI Conference on Aritifical Intelligence (pp. 2300–2307). AAAI Press. http://hdl.handle.net/20.500.12708/55794
Project: FAIR (2013–2018) -
Backdoors to Planning
/
Kronegger, M., Pfandler, A., & Ordyniak, S. (2014). Backdoors to Planning. In M. R. Fellows, S. Gaspers, & T. Walsh (Eds.), Proceedings of the 2nd Workshop on the Parameterized Complexity of Computational Reasoning (PCCR) (p. 2). http://hdl.handle.net/20.500.12708/55774
Project: FAIR (2013–2018) -
The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation
/
Kim, E. J., Ordyniak, S., & Szeider, S. (2014). The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation. In TAFA 2013 (pp. 158–175). LNAI / Springer. http://hdl.handle.net/20.500.12708/55815
Project: Complex Reason (2010–2014) -
Backdoors into Heterogeneous Classes of SAT and CSP
/
Gaspers, S., Misra, N., Ordyniak, S., Szeider, S., & Zivný, S. (2014). Backdoors into Heterogeneous Classes of SAT and CSP. In AAAI 2014 (pp. 2652–2658). http://hdl.handle.net/20.500.12708/55809
Project: Complex Reason (2010–2014)
2013
-
Parameterized Complexity and Kernel Bounds for Hard Planning Problems
/
Bäckström, C., Jonsson, P., Ordyniak, S., & Szeider, S. (2013). Parameterized Complexity and Kernel Bounds for Hard Planning Problems. In P. G. Spirakis & M. Serna (Eds.), Algorithms and Complexity 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings. Springer / LNCS. https://doi.org/10.1007/978-3-642-38233-8_2
Project: Complex Reason (2010–2014) -
Upper and Lower Bounds for Weak Backdoor Set Detection
/
Misra, N., Ordyniak, S., Raman, V., & Szeider, S. (2013). Upper and Lower Bounds for Weak Backdoor Set Detection. In M. Järvisalo & A. Van Gelder (Eds.), Theory and Applications of Satisfiability Testing - SAT 2013 16th International Conference, Helsinki, Finland, July 8-12, 2013, Proceedings. Springer / LNCS. https://doi.org/10.1007/978-3-642-39071-5_29
Project: Complex Reason (2010–2014) -
Parameterized Complexity Results for Exact Bayesian Network Structure Learning
/
Ordyniak, S., & Szeider, S. (2013). Parameterized Complexity Results for Exact Bayesian Network Structure Learning. Journal of Artificial Intelligence Research, 46, 263–302. https://doi.org/10.1613/jair.3744
Project: Complex Reason (2010–2014) -
Satisfiability of acyclic and almost acyclic CNF formulas
/
Ordyniak, S., Paulusma, D., & Szeider, S. (2013). Satisfiability of acyclic and almost acyclic CNF formulas. Theoretical Computer Science, 481, 85–99. https://doi.org/10.1016/j.tcs.2012.12.039
Project: Complex Reason (2010–2014) -
Backdoors to q-Horn
/
Gaspers, S., Ordyniak, S., Ramanujan, M. S., Saurabh, S., & Szeider, S. (2013). Backdoors to q-Horn. In N. Portier & T. Wilke (Eds.), 30th Symposium on Theoretical Aspects of Computer Science (STACS´13) (pp. 67–79). Dagstuhl Publishing. http://hdl.handle.net/20.500.12708/54875
Project: Complex Reason (2010–2014)
2012
-
The Complexity of Planning Revisited - A Parameterized Analysis
/
Bäckström, C., Chen, Y., Jonsson, P., Ordyniak, S., & Szeider, S. (2012). The Complexity of Planning Revisited - A Parameterized Analysis. In J. Hoffmann & B. Selman (Eds.), Proceedings of the 26th Conference on Artificial Intelligence (AAAI 2012) (pp. 1735–1741). AAAI Press. http://hdl.handle.net/20.500.12708/54314
Project: Complex Reason (2010–2014) -
Augmenting Tractable Fragments of Abstract Argumentation
/
Dvořák, W., Ordyniak, S., & Szeider, S. (2012). Augmenting Tractable Fragments of Abstract Argumentation. Artificial Intelligence, 186, 157–173. https://doi.org/10.1016/j.artint.2012.03.002
Projects: Argu (2009–2012) / Complex Reason (2010–2014) -
Valued-Based Argumentation for Tree-like Value Graphs
/
Kim, E. J., & Ordyniak, S. (2012). Valued-Based Argumentation for Tree-like Value Graphs. In B. Verheij, S. Szeider, & S. Woltran (Eds.), Fourth International Conference on Computational Models of Argument (Comma 2012) (pp. 378–389). IOS Press. http://hdl.handle.net/20.500.12708/54321
Projects: Complex Reason (2010–2014) / Complexity (2011–2013) -
Don't Be Strict in Local Search!
/
Gaspers, S., Kim, E. J., Ordyniak, S., Saurabh, S., & Szeider, S. (2012). Don’t Be Strict in Local Search! In J. Hoffmann & B. Selman (Eds.), Proceedings of the 26th Conference on Artificial Intelligence (AAAI 2012) (pp. 486–492). AAAI Press. http://hdl.handle.net/20.500.12708/54316
Projects: Complex Reason (2010–2014) / Complexity (2011–2013) -
On Finding Optimal Polytrees
/
Gaspers, S., Koivisto, M., Liedloff, M., Ordyniak, S., & Szeider, S. (2012). On Finding Optimal Polytrees. In J. Hoffmann & B. Selman (Eds.), Proceedings of the 26th Conference on Artificial Intelligence (AAAI 2012) (pp. 750–756). AAAI Press. http://hdl.handle.net/20.500.12708/54315
Project: Complex Reason (2010–2014)
2011
-
Algorithms and Complexity Results for Persuasive Argumentation
/
Kim, E. J., Ordyniak, S., & Szeider, S. (2011). Algorithms and Complexity Results for Persuasive Argumentation. Artificial Intelligence, 175(9–10), 1722–1736. https://doi.org/10.1016/j.artint.2011.03.001
Project: Complex Reason (2010–2014) - Digraph decompositions and monotonicity in digraph searching / Kreutzer, S., & Ordyniak, S. (2011). Digraph decompositions and monotonicity in digraph searching. Theoretical Computer Science, 412(35), 4688–4703. https://doi.org/10.1016/j.tcs.2011.05.003
-
Satisfiability of Acyclic and almost Acyclic CNF Formulas (II)
/
Ordyniak, S., Paulusma, D., & Szeider, S. (2011). Satisfiability of Acyclic and almost Acyclic CNF Formulas (II). In Theory and Applications of Satisfiability Testing - SAT 2011 (pp. 47–60). Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-21581-0_6
Project: Complex Reason (2010–2014) -
Augmenting Tractable Fragments of Abstract Argumentation
/
Ordyniak, S., & Szeider, S. (2011). Augmenting Tractable Fragments of Abstract Argumentation. In T. Walsh (Ed.), Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (pp. 1033–1038). http://hdl.handle.net/20.500.12708/53761
Project: Complex Reason (2010–2014)
2010
-
Algorithms and Complexity Results for Exact Bayesian Structure Learning
/
Ordyniak, S., & Szeider, S. (2010). Algorithms and Complexity Results for Exact Bayesian Structure Learning. In P. Grünwald & P. Spirtes (Eds.), Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence (UAI 2010) (pp. 401–408). AUAI Press. http://hdl.handle.net/20.500.12708/53324
Project: Complex Reason (2010–2014) -
Algorithms and Complexity Results for Persuasive Argumentation
/
Kim, E. J., Ordyniak, S., & Szeider, S. (2010). Algorithms and Complexity Results for Persuasive Argumentation. In P. Baroni, F. Cerutti, M. Giacomin, & G. R. Simari (Eds.), Proceedings of Third International Conference on Computational Models of Argument (COMMA 2010) (pp. 311–322). IOS Press. http://hdl.handle.net/20.500.12708/53322
Project: Complex Reason (2010–2014) -
Satisfiability of Acyclic and Almost Acyclic CNF Formulas
/
Ordyniak, S., Paulusma, D., & Szeider, S. (2010). Satisfiability of Acyclic and Almost Acyclic CNF Formulas. In K. Lodaya & M. Mahajan (Eds.), IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010) (pp. 84–95). Leibniz International Proceedings in Informatics (LIPIcs). https://doi.org/10.4230/LIPIcs.FSTTCS.2010.84
Project: Complex Reason (2010–2014)
Supervisions
- Practical algorithms for Deletion to Small Components : With applications to planning and ILP / Maleki, H. (2019). Practical algorithms for Deletion to Small Components : With applications to planning and ILP [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/79312