FIS-Box of the chair

2019

• Constraint satisfaction problems for reducts of homogeneous graphsBodirsky, M., Martin, B., Pinsker, M. & Pongracz, A., 2019, In: SIAM journal on computing : a publication of the Society for Industrial and Applied Mathematics. 48, 4, p. 1224-1264, 41 p.Electronic (full-text) versionResearch output: Contribution to journal > Research article
• Tamari Lattices for Parabolic Quotients of the Symmetric Group.Mühle, H. & Williams, N., 2019, In: The journal of combinatorics : a print version of the electronic journal of combinatorics. 26, 4, p. P4.34Electronic (full-text) versionResearch output: Contribution to journal > Research article

2018

• Submodular functions and valued constraint satisfaction problems over infinite domainsBodirsky, M., Mamino, M. & Viola, C., 1 Aug 2018, Computer Science Logic 2018, CSL 2018. Ghica, D. R. & Jung, A. (eds.). Schloss Dagstuhl- Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, 12. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 119)Electronic (full-text) versionResearch output: Contribution to book/conference proceedings/anthology/report > Conference contribution
• The complexity of disjunctive linear diophantine constraintsBodirsky, M., Martin, B., Mamino, M. & Mottet, A., 1 Aug 2018, 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018. Potapov, I., Worrell, J. & Spirakis, P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, 33. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 117)Electronic (full-text) versionResearch output: Contribution to book/conference proceedings/anthology/report > Conference contribution
• A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNPBodirsky, M., Madelaine, F. & Mottet, A., 9 Jul 2018, Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018. Institute of Electrical and Electronics Engineers (IEEE), p. 105-114, 10 p., (Proceedings - Symposium on Logic in Computer Science)Electronic (full-text) versionResearch output: Contribution to book/conference proceedings/anthology/report > Conference contribution
• A dichotomy for first-order reducts of unary structuresBodirsky, M. & Mottet, A., 22 May 2018, In: Logical methods in computer science. 14, 2, 13Electronic (full-text) versionResearch output: Contribution to journal > Research article
• Classification Transfer for Qualitative Reasoning Problems.Bodirsky, M., Jonsson, P., Martin, B. & Mottet, A., 2018, Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (IJCAI-18). p. 1256-1262, 7 p.Electronic (full-text) versionResearch output: Contribution to book/conference proceedings/anthology/report > Conference contribution
• On the lattice property of shard ordersMühle, H., 2018Research output: Contribution to conferences > Paper
• Two posets of noncrossing partitions coming from undesired parking spacesMühle, H., 2018, In: Revista Colombiana de Matematicas. 52, 1, p. 65-86, 22 p.Electronic (full-text) versionResearch output: Contribution to journal > Research article

2017

• A Heyting Algebra on Dyck Paths of Type A and BMuhle, H., Jul 2017, In: Order. 34, 2, p. 327-348, 22 p.Electronic (full-text) versionResearch output: Contribution to journal > Research article
• A topological characterisation of endomorphism monoids of countable structuresBodirsky, M. & Schneider, F. M., 1 Jun 2017, In: Algebra Universalis. 77, 3, p. 251-269, 19 p.Electronic (full-text) versionResearch output: Contribution to journal > Research article
• Symmetric decompositions and the strong Sperner property for noncrossing partition latticesMuhle, H., May 2017, In: JOURNAL OF ALGEBRAIC COMBINATORICS. 45, 3, p. 745-775, 31 p.Electronic (full-text) versionResearch output: Contribution to journal > Research article
• Constraint Satisfaction Problems over Numeric Domains.Bodirsky, M. & Mamino, M., 2017, The Constraint Satisfaction Problem: Complexity and Approximability. p. 79-111Electronic (full-text) versionResearch output: Contribution to book/conference proceedings/anthology/report > Chapter in book/Anthology/Report
• Two Posets of Noncrossing Set PartitionsMühle, H., 2017, In: Electronic notes in discrete mathematics. 61, p. 885-891, 7 p.Electronic (full-text) versionResearch output: Contribution to journal > Research article

2016

• A preliminary investigation of satisfiability problems not harder than 1-In-3-SATLagerkvist, V. & Roy, B., 1 Aug 2016, 41st International Symposium on Mathematical Foundations of Computer Science. Schloss Dagstuhl- Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, p. 64:1-64:14Electronic (full-text) versionResearch output: Contribution to book/conference proceedings/anthology/report > Chapter in book/Anthology/Report
• Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfactionBodirsky, M. & Mottet, A., 5 Jul 2016, Proceedings of the 31st Annual ACM-IEEE Symposium on Logic in Computer Science, LICS 2016. Institute of Electrical and Electronics Engineers (IEEE), p. 623-632, 10 p., (Proceedings - Symposium on Logic in Computer Science; vol. Proceedings - Symposium on Logic in Computer Science)Electronic (full-text) versionResearch output: Contribution to book/conference proceedings/anthology/report > Conference contribution
• Distance constraint satisfaction problemsBodirsky, M., Dalmau, V., Martin, B., Mottet, A. & Pinsker, M., 1 Apr 2016, In: Information and computation. 247, p. 87-105, 19 p.Electronic (full-text) versionResearch output: Contribution to journal > Research article
• The complexity of phylogeny constraint satisfactionBodirsky, M., Jonsson, P. & Van Pham, T., 1 Feb 2016, 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016. Vollmer, H. & Ollinger, N. (eds.). Schloss Dagstuhl- Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, 20Electronic (full-text) versionResearch output: Contribution to book/conference proceedings/anthology/report > Conference contribution
• Constraint Satisfaction Problems for Reducts of Homogeneous GraphsBodirsky, M., Martin, B., Pinsker, M. & Pongrácz, A., 2016, p. 119:1--119:14Electronic (full-text) versionResearch output: Contribution to conferences > Paper
• Generating Clones with Conservative Near-Unanimity Operation.Greiner, J., 2016, In:  Journal of multiple-valued logic and soft computing : MVLSC. 26, 3-5, p. 515-524Electronic (full-text) versionResearch output: Contribution to journal > Research article

2015

• TOPOLOGICAL BIRKHOFFBodirsky, M. & Pinsker, M., Apr 2015, In: Transactions of the American Mathematical Society. 367, 4, p. 2527-2549, 23 p., PII S0002-9947(2014)05975-8Research output: Contribution to journal > Research article
• The complexity of constraint satisfaction problemsBodirsky, M., 1 Feb 2015, 32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015. Mayr, E. W. & Ollinger, N. (eds.). Schloss Dagstuhl- Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, p. 2-9, 8 p., (Leibniz International Proceedings in Informatics, LIPIcs; vol. 30)Electronic (full-text) versionResearch output: Contribution to book/conference proceedings/anthology/report > Conference contribution

2014

• Tractability of quantified temporal constraints to the maxBodirsky, M., Chen, H. & Wrona, M., 16 Dec 2014, In: International journal of algebra and computation. 24, 8, p. 1141-1156, 16 p.Electronic (full-text) versionResearch output: Contribution to journal > Research article
• The 42 reducts of the random ordered graphBodirsky, M., Pinsker, M. & Pongrácz, A., 29 May 2014, In: Proceedings of the London Mathematical Society. 111, 3, p. 591-632, 42 p.Electronic (full-text) versionResearch output: Contribution to journal > Research article
• Minimal functions on the random graphBodirsky, M. & Pinsker, M., 3 Apr 2014, In: Israel Journal of MathematicsElectronic (full-text) versionResearch output: Contribution to journal > Research article