Libor Barto

HOME POCOCOP RESEARCH FOR STUDENTS

Research interests: Universal algebra, computational complexity, in particular constraint satisfaction problems

IN PROGRESS

  1. K. Asimi, L. Barto, (TBD) Finitely tractable Boolean PCSPs , in preparation
  2. L. Barto, R. Olšák, F. Starke, A. Vucaj, J. Zahálka, D. Zhuk, (TBD) Binary related clones on three elements modulo minor preserving maps , in preparation
  3. L. Barto, Z. Brady, F. Jankovec, A. Vucaj, D. Zhuk, (TBD) Minimal Taylor clones on three elements , in preparation
  4. L. Barto, F. Bialas, M. Kozik, (TBD) CGT and PCSPs, in preparation

  5. L. Barto, M. Kapytka, Multisorted Boolean Clones Determined by Binary Relations up to Minion Homomorphisms, to appear in AU [arXiv]
  6. K. Asimi, L. Barto, V. Dalmau, The Complexity of Promise Constraint Satisfaction Problem Seen from the Other Side, to appear in MVLSC [arXiv]
  7. L. Barto, S. Butti, V. Dalmau, The Sherali-Adams and Weisfeiler-Leman hierarchies in (Promise Valued) Constraint Satisfaction Problems, submitted [arXiv]

BOOK CHAPTERS

  1. (survey) L. Barto, A. Krokhin, R. Willard, Polymorphisms, and how to use them, in "The Constraint Satisfaction Problem: Complexity and Approximability", Dagstuhl Follow-Ups, vol. 7, 1 44, 2017 [paper] [complete volume]. [Errata (Thm. 53)]
  2. (survey) L. Barto, M. Kozik, Absorption in Universal Algebra and CSP, in "The Constraint Satisfaction Problem: Complexity and Approximability", Dagstuhl Follow-Ups, vol. 7, 45 77, 2017 [paper] [complete volume].

JOURNAL PAPERS

  1. L. Barto, A. Mottet: Finite Algebras with Hom-Sets of Polynomial Size, appeared online in Transactions AMS [DOI] [arXiv]
  2. L. Barto, Z. Brady, A. Bulatov, M. Kozik, D. Zhuk, Unifying the Three Algebraic Approaches to the CSP via Minimal Taylor Algebras, TheoretiCS 3 (2024), 1-76 [DOI] [arXiv]
  3. L. Barto, J. Bulin, A. Krokhin, J. Oprsal, Algebraic approach to promise constraint satisfaction, Journal of the ACM 68/4 (2021), 1-66 [arXiv] [DOI]
  4. L. Barto, M. Pinsker, Topology is irrelevant (in the infinite domain dichotomy conjecture for constraint satisfaction problems), SIAM Journal on Computing, 49/2 (2020), 365-393 [arXiv] [DOI]
  5. L. Barto, Accessible set endofunctors are universal, Commentationes Mathematicae Universitatis Carolinae 60/4 (2019), 497-508 [arXiv]
  6. L. Barto, M. Kompatscher, M. Olsak, M. Pinsker, T. Van Pham, Equations in oligomorphic clones and the constraint satisfaction problem for omega-categorical structures, Journal of Mathematical Logic 19/2 (2019), 1950010 (31 pages) [arXiv] [DOI]
  7. L. Barto, O. Draganov, The minimal arity of near-unanimity polymorphisms, Mathematica Slovaca 69/2 (2019), 297-310 [arXiv] [DOI]
  8. L. Barto, J. Oprsal, M. Pinsker, The wonderland of reflections, Israel Journal of Mathematics 223/1 (2018), 363-398 [preprint] [DOI]
  9. L. Barto, Finitely related algebras in congruence modular varieties have few subpowers, Journal of the EMS 20/6 (2018), 1439-1471 [DOI] [preprint]
  10. L. Barto, J. Bulin, Deciding absorption in relational structures, Algebra Universalis 78/1 (2017), 3-18 [DOI] [arXiv]
  11. L. Barto, The collapse of the bounded width hierarchy, Journal of Logic and Computation 26/3 (2016), 923-943 [DOI] [preprint]
  12. L. Barto, A. Kazda, Deciding absorption, Int. J. Algebra Comput. 26/05 (2016), 1033-1060 [DOI] [arXiv]
  13. L. Barto, M. Kozik, Robustly solvable constraint satisfaction problems, SIAM Journal on Computing 45-4 (2016), 1646-1669 [DOI] [arXiv]
  14. (survey) L. Barto, The constraint satisfaction problem and universal algebra, The Bulletin of Symbolic Logic 21/03 (2015), 319-337. [DOI] [preprint]
  15. L. Barto, M. Kozik, D. Stanovsky, Mal'tsev conditions, lack of absorption, and solvability, Algebra Universalis 74/1-2 (2015), 185-206 [DOI] [preprint]
  16. L. Barto, M. Kozik, Constraint satisfaction problems solvable by local consistency methods, Journal of the ACM 61/1 (2014), 3:1-3:19 [DOI]
  17. L. Barto, J. Bulin, CSP dichotomy for special polyads, Int. J. Algebra Comput. 23/05 (2013), 1151-1174 [DOI] [preprint]
  18. L. Barto, Finitely related algebras in congruence distributive varieties have near unanimity terms, Canadian Journal of Mathematics 65/1 (2013), 3-21 [DOI] [preprint]
  19. L. Barto, M. Kozik, Absorbing subalgebras, cyclic terms and the constraint satisfaction problem, Logical Methods in Computer Science 8/1:07 (2012), 1-26. [preprint]
  20. L. Barto, D. Stanovsky, Polymorphisms of small digraphs, Novi Sad J. Math. 40/2 (2010), 95-109 [ paper & data ]
  21. L. Barto, M. Kozik, Cyclic terms for SD(v) varieties - revisited, Algebra Universalis 64/1-2 (2010), 137-142 [ DOI ], [preprint]
  22. L. Barto, M. Kozik, Congruence distributivity implies bounded width, SIAM Journal on Computing 39/4 (2009), 1531-1542 [preprint]
  23. L. Barto, M. Kozik, M. Maroti, R. McKenzie, T. Niven, Congruence modularity implies cyclic terms for finite algebras, Algebra Universalis 61/3 (2009), 365-380 [preprint]
  24. L. Barto, M. Kozik, M. Maroti, T. Niven, CSP dichotomy for special triads, Proc. Amer. Math. Soc. 137/9 (2009), 2921-2934. [preprint] [errata!]
  25. L. Barto, Slices of essentially algebraic categories, Applied Categorical Structures 17/2 (2009), 119-152. [preprint]
  26. L. Barto, M. Kozik, T. Niven, The CSP dichotomy holds for digraphs with no sources and no sinks (a positive answer to a conjecture of Bang-Jensen and Hell), SIAM Journal on Computing 38/5 (2009), 1782-1802. [preprint]
  27. L. Barto, The category of varieties and interpretations is alg-universal, Journal of Pure and Applied Algebra 211/3 (2007), 721-731. [preprint]
  28. L. Barto, Finitary set endofunctors are alg-universal, Algebra Universalis 57/1 (2007), 15-26. [preprint]
  29. L. Barto, P. Zima, Every group is representable by all natural transformations of some set-functor, Theory and Applications of Categories 14/13 (2005), 294-309. [download]
  30. L. Barto, Weakly terminal objects in quasicategories of set endofunctors, Applied Categorical Structures 13/3 (2005), 257-264. [preprint]

CONFERENCE PAPERS

  1. L. Barto, S. Butti, A. Kazda, C. Viola, S. Zivny, Algebraic Approach to Approximation, 39th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2024), Article No. 10, 1-14 [arXiv] [DOI]
  2. L. Barto, B. Bodor, M. Kozik, A. Mottet, M. Pinsker, Symmetries of Graphs and Structures that Fail to Interpret a Finite Thing, 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2023), 1-13 [arXiv] [DOI]
  3. L. Barto, S. Butti, Weisfeiler-Leman Invariant Promise Valued CSPs, 28th International Conference on Principles and Practice of Constraint Programming (CP 2022), 4:1-4:17 [arXiv] [DOI]
  4. K. Asimi, L. Barto, S. Butti, Fixed-Template Promise Model Checking Problems, 28th International Conference on Principles and Practice of Constraint Programming (CP 2022), 2:1--2:17 [arXiv] [DOI]
  5. L. Barto, M. Kozik, Combinatorial Gap Theorem and Reductions between Promise CSPs, Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2022), 1204-1220 [DOI] [arXiv]
  6. K. Asimi, L. Barto, Finitely Tractable Promise Constraint Satisfaction Problems, 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021), 11:1-11:16 [DOI]
  7. L. Barto, Z. Brady, A. Bulatov, M. Kozik, D. Zhuk, Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP, 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2021), 1-13 [arXiv] [DOI]
  8. L. Barto, W. DeMeo, A. Mottet, Constraint Satisfaction Problems over Finite Structures, 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2021), 1 - 13 [arXiv] [DOI]
  9. L. Barto, D. Battistelli, K. M. Berg, Symmetric Promise Constraint Satisfaction Problems: Beyond the Boolean Case, 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021), 10:1-10:16 [DOI]
  10. L. Barto, M. Kozik, J. Tan, M. Valeriote, Sensitive instances of the Constraint Satisfaction Problem, in 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), 110:1--110:18 [arXiv] [DOI]
  11. L. Barto, Promises make finite (constraint satisfaction) problems infinitary, Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), LICS'19, 1-8 [arXiv] [DOI]
  12. L. Barto, Algebraic Theory of Promise Constraint Satisfaction Problems, First Steps, FCT'19, 3-17. (invited talk, non-refereed) [arXiv] [DOI]
  13. L. Barto, M. Kompatscher, M. Olsak, T. Van Pham, M. Pinsker, The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problems, Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS'17, 1-12. [DOI] [arXiv]
  14. L. Barto, M. Pinsker, The algebraic dichotomy conjecture for infinite domain constraint satisfaction problems, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS'16, 615-622. [preprint]
  15. L. Barto, M. Kozik, R. Willard, Near unanimity constraints have bounded pathwidth duality, Proceedings of the 27th ACM/IEEE Symposium on Logic in Computer Science, LICS'12, 125-134. [preprint].
  16. L. Barto, M. Kozik, Robust satisfiability of constraint satisfaction problems, Proceedings of the 44th symposium on Theory of Computing, STOC'12 (2012), 931-940. [preprint]. Also published in ECCC, Report No. 163 (2011).
  17. L. Barto, The dichotomy for conservative constraint satisfaction problems revisited, Proceedings of the 26th IEEE Symposium on Logic in Computer Science, LICS'11, 301-310 [preprint]
  18. L. Barto, M. Kozik, New conditions for Taylor varieties and CSP, Proceedings of the 25th IEEE Symposium on Logic in Computer Science, LICS'10, 100-109 [ DOI ]
  19. L. Barto, M. Kozik, Constraint satisfaction problems of bounded width, Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS'09 (2009), 595-603 [preprint]
  20. L. Barto, M. Kozik, T. Niven, Graphs, Polymorphisms and the Complexity of Homomorphism Problems, Proceedings of the 40th ACM Symposium on Theory of Computing, STOC'08 (2008), 789-796.

OTHER PAPERS

  1. L. Barto, Symetrie ve výpočetní složitosti, Vesmír, 101,559, 2022/9 (in Czech, popularizační článek). [link]
  2. (survey) L. Barto, Constraint satisfaction problem and universal algebra, ACM SIGLOG News 1/2 (2014), 14-24. [PDF] [The whole issue]

THESES

  1. L. Barto, Universal Algebra and the Constraint Satisfaction Problem, Habilitation thesis, Charles University in Prague, 2015 [PDF]
  2. L. Barto, Full embeddings and their modifications, PhD thesis, Charles University in Prague, 2006 [PDF] [PS]
  3. L. Barto, Funktory blízké úplným vnořením, Master's thesis, Charles University in Prague, 2003 (in Czech)

LECTURE NOTES

  1. D. Stanovsky, L. Barto, Pocitacova algebra (Computer algebra), Matfyzpress, 2011

INVITED TALKS

  1. Oct 2024, Clones, Constraints, and Minions at Colloquium Logicum, Wien, Austria. [Slides]
  2. Jan 2024, Symetrie ve výpočetní složitosti (in Czech) for Learned Society of the Czech Republic. [Slides] [YouTube video]
  3. Jul 2022, CSPs and Set Functors at Structure Meets Power, affiliated workshop to ICALP, Paris. [Slides]
  4. May 2021, Minimal Taylor Clones at ISMVL, Nursultan, Kazahstan (online). [Slides]
  5. Feb 2021, Algebras with polynomially many homomorphisms at AAA 100, Krakow, Poland. [Slides]
  6. Jan 2020, Promise Constraint Satisfaction at ATCAGC 2020: Algebraic, Topological and Complexity Aspects of Graph Covers , Bedrichov, Czechia. [Slides]
  7. Sep 2019, Promise Constraint Satisfaction Problem at TbiLLC 2019: Thirteenth International Tbilisi Symposium on Language, Logic and Computation, Tsikhisdziri, Georgia. [Slides]
  8. Aug 2019, Algebraic Theory of Promise Constraint Satisfaction Problems, First Steps at FCT, Copenhagen, Denmark. [Slides]
  9. May 2019, Algebraic theory of promise constraint satisfaction problems at Prague Gathering of Logicians 2019, Prague, Czechia. [Slides]
  10. June 2018 - Height one identities at 96. Arbeitstagung Allgemeine Algebra, Darmstadt, Germany. [Slides]
  11. August 2017 - Equationally nontrivial algebras at BLAST, Nashville, TN, USA. [Slides]
  12. November 2016 - {Symmetry, Logic, CSP} at the workshop {Symmetry, Logic, Computation}, part of the programme Logical Structures in Computation, Berkeley, USA. [Slides]
  13. August 2016 - Infinite domain constraint satisfaction problem at CSL, Marseille, France. [Slides]
  14. August 2016 - The algebraic dichotomy conjecture for infinite domain constraint satisfaction problems at special session "Homogeneous structures: model theory meets universal algebra" of Logic Colloquiuim, Leeds, UK. [Slides]
  15. May 2015 - A rectangularity theorem for simple Taylor algebras at Open Problems in Universal Algebra , a Shanks workshop at Vanderbilt University, Nashville, USA.
  16. February 2015 - Weighted clones at 89th Arbeitstagung Allgemeine Algebra, Dresden, Germany. [Slides]
  17. May 2014 - Universal algebra and the constraint satisfaction problem at Association of Symbolic Logic North American Annual Meeting, Boulder, CO, USA. [Slides]
  18. September 2013 - Finitely related algebras at The 51st Summer School on General Algebra and Ordered Sets, Trojanovice, Czech Republic. [Slides]
  19. July 2013 - The distance from congruence distributivity to near unanimity at GAIA 2013: General Algebra and its Applications, Melbourne, Australia. [Slides]
  20. June 2013 - Prime Maltsev conditions at 4th Novi Sad Algebraic Conference, Novi Sad, Serbia. [Slides]
  21. February 2013 - Decision, counting and optimisation in constraint satisfaction problems at A Gathering of Prague-Based Logicians, Prague, Czech Republic.
  22. June 2012 - The Valeriote conjecture at Conference on Universal Algebra and Lattice Theory, Szeged, Hungary. [Slides]
  23. March 2012 - Robust algorithms for CSPs at 83th Arbeitstagung Allgemeine Algebra, Novi Sad, Serbia. [Slides]
  24. June 2011 - Instances of the Constraint Satisfaction Problem in Universal Algebra at Second International Conference on Order, Algebra and Logics, Krakow, Poland. [Slides]
  25. June 2010 - An Application of CSP to Universal Algebra: A Proof of "The Crazy Z\'adori's Conjecture" at Workshop on Universal Algebra, Complexity and Constraint Satisfaction Problems, Lisbon, Portugal.
  26. August 2009 - Prague Strategies at Novi Sad Algebraic Conference, Novi Sad, Serbia. [Slides]
  27. November 2008 - Constraint Satisfaction Problems of Bounded Width at Eduard Cech Center meeting, Trest, Czech Republic [Slides]

INVITED TUTORIALS

  1. Jun 2022, Algebra and Logic in the Complexity of Constraints at Logic Colloquium 2022, Reykjavik, Iceland. [Slides]
  2. Jan 2021, Universal Algebra: Tutorial at Homogeneous structures: model theory meets universal algebra, Oberwolfach, Germany. [Slides]
  3. June 2019, Constraint satisfaction problems at Caleidoscope : Complexity as a Kaleidoscope, Institute Henri Poincare, Paris, France. [Slides, part I] [Slides, part II]
  4. September 2017 - Universal algebra today at 55th Summer School on Algebra and Ordered Sets, Novy Smokovec, Slovakia. [Slides I] [Slides II] [Slides III]
  5. September 2015 - Constraint satisfaction problem over a fixed template at Highlights of Logic, Games and Automata , Prague, Czech Republic. [Slides]

TALKS AT INVITATIONAL WORKSHOPS

  1. May 2022 - Combinatorial value and gap amplification at Dagstuhl workshop The Constraint Satisfaction Problem: Complexity and Approximability, Schloss Dagstuhl, Germany. [Slides]
  2. June 2018 - Cyclic operations in promise constraint satisfaction problems at Dagstuhl workshop The Constraint Satisfaction Problem: Complexity and Approximability, Schloss Dagstuhl, Germany. [Slides]
  3. October 2015 - The CSP basics revisited at Dagstuhl workshop Duality in Computer Science Schloss Dagstuhl, Germany.
  4. July 2015 - CSPs over hereditarily semisimple algebra at Dagstuhl workshop The Constraint Satisfaction Problem: Complexity and Approximability , Schloss Dagstuhl, Germany.
  5. November 2014 - The basic CSP reductions revisited at BIRS Workshop Algebraic and Model Theoretical Methods in Constraint Satisfaction, Banff, Canada. [Slides]
  6. November 2012 - Robust Satisfiability of CSPs at the workshop The Constraint Satisfaction Problem: Complexity and Approximability, Schloss Dagstuhl, Germany. [Slides]

OTHER CONFERENCE TALKS

  1. September 2022, Cores of minions at CSP World Congress 2022, Molveno, Italy.
  2. September 2021, We can't compose at CSP World Congress 2021, Kranjska Gora, Slovenia.
  3. June 2021, QA for Constraint Satisfaction Problems over Finite Structures (talk given by A. Mottet) at LICS, online. [QA: short summary]
  4. June 2021, Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP at LICS, online. [Video] [Slides] [QA: short summary]
  5. September 2020, Non-collapse of width at CSP World Congress 2020, Voels am Schlern, Italy.
  6. July 2020, Sensitive instances of the Constraint Satisfaction Problem at ICALP, online. [Slides] [Video]
  7. February 2020, Reconstructing subproducts from projections at 99th Arbeitstagung Allgemeine Algebra, Siena, Italy. [Slides]
  8. September 2019, A hardness criterion for Promise CSPs at 57th Summer School on Algebra and Ordered Sets, Karolinka, Czechia. [Slides]
  9. June 2019, Promises make finite (constraint satisfaction) problems infinitary at LICS, Vancouver, Canada. [Slides]
  10. March 2019 - A loop lemma for nonidempotent cores at 97th Arbeitstagung Allgemeine Algebra, Wien, Austria. [Slides]
  11. June 2017 - Cores of oligomorphic clones revisited at 94th Arbeitstagung Allgemeine Algebra + 5th Novi Sad Algebraic Conference, Novi Sad, Serbia.
  12. September 2016 - Local Loop Lemma at The 54th Summer School on General Algebra and Ordered Sets, Trojanovice, Czech Republic. [Slides]
  13. September 2014 - On simple Taylor algebras at 52nd Summer School on Algebra and Ordered Sets, Stara Lesna, Slovakia. [Slides]
  14. September 2012 - Decidability of absorption for relational structures at 50th Summer School on Algebra and Ordered Sets, Novy Smokovec, Slovakia. [Slides]
  15. August 2011 - Robust approximation of CSPs at Workshop on Approximability of CSPs, Toronto, Canada.
  16. August 2011 - A welcome conservative talk at Workshop on Algebras and CSPs (a part of Summer Thematic Program on the Mathematics of Constraint Satisfaction at the Fields Institute), Toronto, Canada. [ Slides ]
  17. June 2011 - The Dichotomy for Conservative Constraint Satisfaction Problems Revisited at LICS 2011, Toronto, ON, Canada. [Slides]
  18. March 2011 - Applications of the Constraint Satisfaction Problem to Universal Algebra at AMS Spring Central Section Meeting, Iowa City, IA, USA. [Slides]
  19. June 2010 - Rectangularity Theorem for Conservative Algebras at 80th Arbeitstagung Allgemeine Algebra, Bedlewo, Poland. [Slides]
  20. October 2009 - Constraint Satisfaction Problems of Bounded Width at FOCS 2009, Atlanta, GA, USA. [Slides]
  21. September 2009 - Congruence distributivity and near unanimity at Summer School on Algebra and Ordered Sets 2009, Stara Lesna, Slovakia.
  22. June 2009 - Cyclic terms for join semi-distributive varieties I , 78th Arbeitstagung Allgemeine Algebra, Bern, Switzerland. My [slides], Marcin's [slides] for the second part.
  23. June 2009 - O slozitosti H-barveni digrafu (in Czech) , STTI 2009, Prague, Czech Republic. [Slides]
  24. May 2009 - CSPs of Bounded Width II at CanaDAM 2009, Montreal, Canada. Marcin's [slides] for the first part, my [slides]
  25. September 2008 - The algebraic approach to CSP at Fall School of Logic & Complexity, Prague, Czech Republic.
  26. May 2008 - CSP and NU(4) at 76th Workshop on General Algebra, Linz, Austria. [Slides]
  27. September 2007 - Modularity and coloring of terms by variables at 45th Summer School on General Algebra and Ordered Sets, Tale, Slovakia. [Slides]
  28. July 2007 - J nsson terms imply cyclic terms for finite algebras at Algorithmic Complexity and Universal Algebra, Szeged, Hungary. [Slides]
  29. June 2007 - Set functors determined by values on objects at International Conference on Order, Algebra, and Logics, Nasville, USA. [Slides]
  30. February 2007 - Baskets of essentially algebraic categories at 73rd Arbeitstagung Allgemeine Algebra, Klagenfurt, Austria. [Slides]
  31. November 2006 - Clones are comprehensive at ECC meeting, Telc, Czech Republic.
  32. September 2006 - The category of varieties is alg-universal at 44th Summer School on General Algebra and Ordered Sets, Radejov, Czech Republic. [Slides]
  33. February 2006 - Algebraic universality of set endofunctors at 71st Arbeitstagung Allgemeine Algebra, Bedlewo, Poland. [Slides]
  34. June 2004 - Axioms for concrete categories at Week of Doctoral Students, Prague, Czech Republic.
SEMINAR TALKS
  1. Feb 2022, The number of homomorphisms into finite algebras at TCS lab seminar, HSE University, Russia (online). [Slides]
  2. May 2021, CSPs and Symmetries, Symmetry in New Castle seminar, The University of Newcastle, Australia (online).
  3. Feb 2021, Finitely tractable PCSPs, Ulam Seminar, CU Boulder, USA. [Slides] [Video]
  4. Oct 2020, CSPs and Symmetries, 19th Jarnik lecture, Prague, Czechia. [Slides]
  5. July 2020 - Baby PCP Theorem and reductions between Promise CSPs at Online CSP seminar. [Slides] [Video]
  6. October 2019 - Mathematics in coloring problems with promises at Palacky Universty, Olomouc, Czechia.
  7. November 2017 - Promise Constraint Satisfaction Problem at TU Wien, Austria.
  8. November 2014 - The CSP basics revisited at McMaster University, Hamilton, ON, Canada.
  9. November 2012 - The dichotomy for constraint satisfaction problems at Colloquium on Mathematics, Masaryk University, Brno, Czech Republic.
  10. November 2012 - Constraint satisfaction problem, decision and optimisation at Paris 7, France.
  11. May 2012 - Robust algorithms for CSPs at University of Denver, CO, USA.
  12. February 2012 - The complexity of CSPs at McMaster University, Hamilton, ON, Canada.
  13. October 2011 - Robust approximation of constraint satisfaction problems at McMaster University, Hamilton, ON, Canada.
  14. July 2011 - Categories and Magic Taylor at Fields Institute, Toronto, ON, Canada.
  15. October 2010 - The complexity of constraint satisfaction problems at McMaster University, Hamilton, ON, Canada.
  16. February 2010 - Absorption at Vanderbilt University, Nashville, TN, USA.
  17. September 2009 - Finitely related algebras generating a congruence distributive variety at University of Szeged, Hungary.
  18. December 2008 - Constraint satisfaction problems of bounded width at Jagiellonian University in Krakow, Poland.
  19. November 2008 - Meet semidistributivity has bounded width at University of Szeged, Hungary.
  20. December 2007 - The algebraic approach to CSP, recent progress at Jagiellonian University in Krakow, Poland.
  21. November 2007 - The algebraic approach to the constraint satisfaction problem, recent progress at University of Linz, Austria.
Talks on local seminars (Algebra colloquium, KAFKA, Algebra seminar, Seminar on general mathematical structures, and others) are not listed.

GRANT PARTICIPATION

  1. 2024-2029 UNCE/24/SCI/022 301 44/204087 - Intersections of algebra, geometry, and informatics, Charles University Research Center - UNCE (PI L. Barto)
  2. 2023-2029 ERC SyG - POCOCOP (Polynomial-time Computation: Opening the Blackboxes in Constraint Problems) (PIs L. Barto, M. Bodirsky, M. Pinsker) 301-56/23669, indirect 301-56/236691
  3. 2018-2023 ERC CoG 771005 301-56/18269 - CoCoSym: Symmetry in Computational Complexity (PI L. Barto)
  4. 2018-2023 UNCE SCI/022 - Methods of Algebra and Logic (PI J. Krajicek)
  5. 2018-2020 GACR 18-20123S 301-13/201846 - Expanding the Scope of Universal Algebra (PI M. Pinsker)
  6. 2013-2017 GACR 13-01832S 301-13/201243 - General algebra and its connections to computer science (PI L. Barto)
  7. 2013-2014 7AMB 13P10 13 301-29/221083 - General algebra and applications (PIs D. Stanovsky, MFF UK, A. Zamojska-Dzieno, Politechnika Warszawska)
  8. 2009-2011 GACR 201/09/P223 301-13/201710 - Constraint Satisfaction Problem and Universal Algebra (PI L. Barto)
  9. 2009-2010 MEB 040915 301-29/221029 - Graph, Grupoids and Algorithms (PIs J. Jezek, MFF UK; M. Maroti, University of Szeged)
  10. 2008-2009 MEB 050817 301-29/221002 - An Algebraic Approach to the Constraint Satisfaction Problem (PIs J. Tuma, MFF UK; P. Idziak, Jagiellonian University, Krakow)
  11. 2007 LC 505 ECC 301-29/248001 VZ 300-03/206099 - Eduard Cech Center
  12. 2006-2008 GACR 201/06/0664 - Categorical methods in structural mathematics (PI M. Demlova, CVUT Praha)
  13. 2002-2004 GACR 201/02/0148 - Categorical methods in informatics and structural mathematics (PI M. Demlova, CVUT Praha)

EVENTS I (CO-)ORGANIZED

  1. 2018 [56th Summer School on Algebra and Ordered Sets], member of the organizing quarumvirate
  2. 2016 [92th Arbeitstagung Allgemeine Algebra], organizer (with P. Jedlicka, D. Stanovsky)
  3. 2015 [53rd Summer School on Algebra and Ordered Sets], organizer (with D. Stanovsky)
  4. 2014 [Conference on Algebras and Clones (Algebras & Clones fest)], organizer (with D. Stanovsky)
  5. 2011 [Summer Thematic Program on the Mathematics of Constraint Satisfaction at the Fields Institute, Toronto], organizer (with A. Krokhin and R. Willard) of the Workshop on Algebra and CSPs. Here is a list of problems (last update 30 September 2011) from the workshop. Slides and audio are here.
  6. 2010 [International Conference on Algebras and Lattices (Jardafest)], member of the organizing triumvirate
  7. 2008 [46th Summer School on Algebra and Ordered Sets], member of the organizing quadrumvirate

OTHERS

  1. Since 2022 Editor of Acta Scientiarum Mathematicarum
  2. Since 2018 Editor of Algebra Universalis
  3. PC member of LICS 2024
  4. PC member of ICALP 2022
  5. PC member of STACS 2022
  6. Since 2018 Steering Committee member of AAA series
  7. Since 2022 Board member of Cooperatio program "SCI Mathematics" (program to support science and research at Charles University)
  8. Since 2019 Member of PhD study program board (algebra, number theory, logic) at Faculty of Mathematics and Physics, Charles University

 

RESEARCH VISITS (SINCE 2017)

  1. Jan 28 - Feb 2, 2024, Jagiellonian University, Krakow, Poland (M. Kozik)
  2. Dec 10 - Dec 12, 2023, Durham University, Durham, UK (A. Krokhin)
  3. Oct 6 - Oct 7, 2019, Palacky University, Olomouc, Czechia (M. Botur)
  4. Feb 10 - Feb 16, 2019, Jagiellonian University, Krakow, Poland (M. Kozik, M. Olsak)
  5. May 6 - May 11, 2018, Durham University, UK (A. Krokhin).
  6. Feb 25 - Mar 3, 2018, Jagiellonian University, Krakow, Poland (M. Kozik).
  7. Nov 23 - Nov 24, 2017, TU Wien (M. Pinsker and postdocs)
  8. Jun 2 - Jun 8, 2017, Jagiellonian University, Krakow, Poland (M. Kozik).