Martin Kronegger
Dr.techn.
Role
- Senior Lecturer
Automation Systems, E191-03
Contact
- martin.kronegger@tuwien.ac.at
- +43-1-58801-183351
- 1040 Wien, Treitlstrasse 3 / Room DE0414
- vCard from TISS
- orcid.org/0009-0008-7268-0136
- informatics.tuwien.ac.at/people/martin-kronegger
- tiss.tuwien.ac.at/person/50552
Courses
Summer 2027
- Project in Computer Science 1 / 192.021 PR
- Project in Computer Science 2 / 192.022 PR
Winter 2026
- Bachelor Thesis / 183.609 PR
- Computer Engineering Project / 191.006 PR
- Fundamentals of Digital Systems / 192.134 VU
- Project in Computer Science 1 / 191.008 PR
- Project in Computer Science 2 / 191.009 PR
- Scientific Project Computer Engineering / 191.007 PR
Publications
- Fichte, J. K., Kronegger, M., Woltran, S. (2019). A Multiparametric View on Answer Set Programming. Annals of Mathematics and Artificial Intelligence, 86(1–3), 121–147. Invited and peer-reviewed.
- Kronegger, M., Ordyniak, S., Pfandler, A. (2019). Backdoors to planning. Artificial Intelligence, 269, 49–75. Peer-reviewed.
- Ganian, R., Kronegger, M., Pfandler, A., Popa, A. (2019). Parameterized Complexity of Asynchronous Border Minimization. Algorithmica, 81(1), 201–223. Peer-reviewed.
- Fichte, J., Kronegger, M., Woltran, S. (2017). A Multiparametric View on Answer Set Programming. In 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’17) (pp. 1–14).HDL: 20.500.12708/57098 / Project: START
- Egly, U., Kronegger, M., Lonsing, F., Pfandler, A. (2017). Conformant planning as a case study of incremental QBF solving. Annals of Mathematics and Artificial Intelligence, 80(1), 21–45. Peer-reviewed.
- Fichte, J., Kronegger, M., Woltran, S. (2016). Multiparametric View on Answer Set Programming (DBAI-TR-2016-99).HDL: 20.500.12708/39080 / Project: START
- Egly, U., Kronegger, M., Lonsing, F., Pfandler, A. (2016). Conformant Planning as a Case Study of Incremental QBF Solving. Annals of Mathematics and Artificial Intelligence, 80(1), 21–45. Peer-reviewed.DOI: 10.1007/s10472-016-9501-2 / Project: Boolean
- de Haan, R., Kronegger, M., Pfandler, A. (2015). Fixed-parameter Tractable Reductions to SAT for Planning. In Q. Yang M. Wooldridge (Eds.), Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence - IJCAI 2015 (pp. 2897–2903). AAAI Press. Peer-reviewed.HDL: 20.500.12708/56184 / Project: FAIR
- 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 (Issue 1, pp. 3305–3312). AAAI Press. Peer-reviewed.DOI: 10.1609/aaai.v29i1.9662 / Project: FAIR
- Ganian, R., Kronegger, M., Pfandler, A., Popa, A. (2015). Parameterized Complexity of Asynchronous Border Minimization. In R. Jain, S. Jain, F. Stephan (Eds.), Theory and Applications of Models of Computation : 12th Annual Conference, TAMC 2015, Singapore, May 18-20, 2015, Proceedings (pp. 428–440). Springer. Peer-reviewed.DOI: 10.1007/978-3-319-17142-5_36 / Project: FAIR
- Kaufmann, P., Kronegger, M., Pfandler, A., Seidl, M., Widl, M. (2015). Intra- and interdiagram consistency checking of behavioral multiview models. Computer Languages, Systems and Structures, 44, 72–88. Peer-reviewed.DOI: 10.1016/j.cl.2015.08.003 / Project: FAIR
- Egly, U., Kronegger, M., Lonsing, F., Pfandler, A. (2014). Conformant Planning as a Case Study of Incremental QBF Solving. In Artificial Intelligence and Symbolic Computation (pp. 120–131). Springer. Peer-reviewed.
- Kaufmann, P., Kronegger, M., Pfandler, A., Seidl, M., Widl, M. (2014). A SAT-Based Debugging Tool for State Machines and Sequence Diagrams. In Proceedings of the 7th International Conference on Software Language Engineering (SLE) (pp. 21–40). Peer-reviewed.
- Kronegger, M., Lackner, M., Pfandler, A., Pichler, R. (2014). A Parameterized Complexity Analysis of Generalized CP-Nets. In M. R. Fellows, S. Gaspers, T. Walsh (Eds.), Proceedings of the 2nd Workshop on the Parameterized Complexity of Computational Reasoning (PCCR) (p. 2). Peer-reviewed.HDL: 20.500.12708/55773 / Project: FAIR
- 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). Peer-reviewed.HDL: 20.500.12708/55774 / Project: FAIR
- Kronegger, M., Lackner, M., Pfandler, A., Pichler, R. (2014). A Parameterized Complexity Analysis of Generalized CP-Nets. In C. E. Brodley P. Stone (Eds.), Proceedings of the Twenty-Eighth AAAI Conference on Aritifical Intelligence (pp. 1091–1097). Peer-reviewed.HDL: 20.500.12708/55793 / Project: FAIR
- 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. Peer-reviewed.HDL: 20.500.12708/55794 / Project: FAIR
- Alviano, M., Calimeri, F., Charwat, G., Dao-Tran, M., Dodaro, C., Ianni, G., Krennwallner, T., Kronegger, M., Oetsch, J., Pfandler, A., Puehrer, J., Redl, C., Ricca, F., Schneider, P., Schwengerer, M., Spendier, L., Wallner, J. P., Xiao, G. (2013). The Fourth Answer Set Programming Competition: Preliminary Report. In P. Cabalar T. C. Son (Eds.), 12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2013) (pp. 42–53). Springer.
- Charwat, G., Ianni, G., Krennwallner, T., Kronegger, M., Pfandler, A., Redl, C., Schwengerer, M., Spendier, L., Wallner, J. P., Xiao, G. (2013). VCWC: A Versioning Competition Workflow Compiler. In T. C. Son P. Cabalar (Eds.), 12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2013) (pp. 233–238). Springer. Peer-reviewed.
- Kaufmann, P., Kronegger, M., Pfandler, A., Seidl, M., Widl, M. (2013). Global State Checker: Towards SAT-Based Reachability Analysis of Communicating State Machines. In Proceedings of the 10th International Workshop on Model Driven Engineering, Verification and Validation co-located with 16th International Conference on Model Driven Engineering Languages and Systems (MODELS 2013) (pp. 31–40). CEUR Workshop Proceedings. Peer-reviewed.
- Kronegger, M., Pfandler, A., Pichler, R. (2013). Parameterized Complexity of Optimal Planning: A Detailed Map. In F. Rossi (Ed.), IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence (pp. 954–961). AAAI Press. Peer-reviewed.HDL: 20.500.12708/54787 / Project: FAIR
- Kronegger, M., Lackner, M., Pfandler, A., Pichler, R. (2013). A Parameterized Complexity Analysis of Generalized CP-Nets. In 7th Multidisciplinary Workshop on Advances in Preference Handling (p. 7). Peer-reviewed.HDL: 20.500.12708/54788 / Project: FAIR
- Kronegger, M., Pfandler, A., Pichler, R. (2013). Conformant Planning as a Benchmark for QBF-Solvers. In International Workshop on Quantified Boolean Formulas (QBF 2013) (p. 5). Peer-reviewed.HDL: 20.500.12708/54793 / Project: FAIR
Presentations
- Kronegger, M., Lackner, M., Pfandler, A., Pichler, R. (2014). On the Parameterized Complexity of Generalized CP-Nets. Workshop on Challenges in Algorithmic Social Choice (CASC), Bad Belzig, Germany.HDL: 20.500.12708/85939 / Project: FAIR
- Egly, U., Kronegger, M., Lonsing, F., Pfandler, A. (2014). Conformant Planning as a Case Study of Incremental QBF Solving. International Workshop on Quantified Boolean Formulas, Helsinki, Finland. Invited.
- Kaufmann, P., Kronegger, M., Pfandler, A., Seidl, M., Widl, M. (2014). A SAT-based Debugging Tool for State Machines and Sequence Diagrams. PUMA/RiSE Workshop, Mondsee, Austria.HDL: 20.500.12708/86017
Theses
- Benuska, V. (2017). A modular portfolio solver for planning [Diploma Thesis, Technische Universität Wien]. reposiTUm.DOI: 10.34726/hss.2017.27685 / Download: PDF
- Kronegger, M. (2016). On the parameterized complexity of planning [Dissertation, Technische Universität Wien]. reposiTUm.HDL: 20.500.12708/79793
- Kronegger, M. (2011). Efficient planning with QBF-solvers [Diploma Thesis, Technische Universität Wien]. reposiTUm.HDL: 20.500.12708/160797