dr hab. Marcin Kozik, prof. UJ

Jednostki:

  • Wydział Matematyki i Informatyki UJ
  • Instytut Informatyki Analitycznej
  • Katedra Algorytmiki

HabilitacjaOtwarcie: 2010-05-27, Zamknięcie: 2011-01-13

Publikacje:

29.
Libor Barto, Tan Johnson, Marcin Kozik, Matthew Valeriote
Sensitive Instances of the Constraint Satisfaction Problem, INTERNATIONAL COLLOQUIUM ON AUTOMATA LANGUAGES AND PROGRAMMING [ICALP](MAIN), (2020), 110:1--110:18
27.
Victor Dalmau, Marcin Kozik, Andrei Krokhin, Konstantin Makarychev, Yury Makarychev, Jakub Oprsal
26.
Alexandr Kazda, Marcin Kozik, Ralph McKenzie, Matthew Moore
Absorption and directed Jónsson terms, (2018), "Don Pigozzi on Abstract Algebraic Logic", Springer
25.
Libor Barto, Marcin Kozik
Absorption in Universal Algebra and CSP, (2017), "The Constraint Satisfaction Problem: Complexity and Approximability", Schloss Dagstuhl – Leibniz-Zentrum für Informatik
24.
Victor Dalmau, Marcin Kozik, Andrei Krokhin, Konstantin Makarychev, Yury Makarychev, Jakub Oprsal
Robust algorithms with polynomial loss for near-unanimity CSPs, PROCEEDINGS OF THE 28TH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS SODA'17 (2017), 340-357
23.
Andrei Bulatov, Marcin Kozik, Peter Mayr, Markus Steindl
22.
Weak consistency notions for all CSPs of bounded width, PROCEEDINGS OF THE 31ST ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS'16) (2016), 633-641
21.
20.
Marcin Kozik, Joanna Ochremiak
Algebraic Properties of Valued Constraint Satisfaction Problem, PROCEEDINGS OF 42ND INTERNATIONAL COLLOQUIUM, ICALP 2015 (2015), 846-858
19.
Libor Barto, Marcin Kozik, David Stanovský
18.
Marcin Kozik, Andrei Krokhin, Matthew Valeriote, Ross Willard
16.
Libor Barto, Marcin Kozik
Robust Satisfiability of Constraint Satisfaction Problems, PROCEEDINGS OF THE 44TH ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC'12 (2012), 931-940
15.
Libor Barto, Marcin Kozik, Ross Willard
Near unanimity constraints have bounded pathwidth duality, PROCEEDINGS OF THE 27TH IEEE/ACM SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE LICS'12 (2012), 125-134
13.
12.
Libor Barto, Marcin Kozik
New conditions for Taylor varieties and CSP, PROCEEDINGS OF THE 25TH IEEE/ACM SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE LICS'10 (2010), 100-109
8.
Libor Barto, Marcin Kozik, Miklós Maróti, Todd Niven
CSP dichotomy for special triads, P AM MATH SOC vol. 137 (2009), 2921-2934
7.
Libor Barto, Marcin Kozik
Constraint Satisfaction Problems of Bounded Width, PROCEEDINGS OF THE 50TH SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, FOCS'09 (2009), 595-603
6.
Libor Barto, Marcin Kozik, Miklós Maróti, Ralph McKenzie, Todd Niven
3.
Libor Barto, Marcin Kozik, Todd Niven
Graphs, polymorphisms and the complexity of homomorphism problems, PROCEEDINGS OF THE 40TH ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC'08 (2008), 789-796
1.
On-line Coloring of I_s-free graphs and co-planar graphs, DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE PROCEEDINGS vol. AF (2006), 61-68

Konferencje:

3.
The 46th International Colloquium on Automata, Languages and Programming (ICALP 2019), University of Patras i European Association for Theoretical Computer Science (EATCS), Patras, Grecja, 2019-07-08 - 2019-07-12
2.
The Constraint Satisfaction Problem: Complexity and Approximability, Schloss Dagstuhl Leibniz Center for Informatics, Dagstuhl, Niemcy, 2018-06-03 - 2018-06-08
1.
The Structure of Finite Algebras and the Constraint Satisfaction Problem, Banff International Research Station, Banff, Kanada, 2017-08-06 - 2017-08-13

Granty (realizowane po maju 2009 roku)