Foundations of Computer Science Chair

Chair for Foundations of Computer Science was founded on August 1st, 2010 and is one of the youngest chairs at the Faculty of Sciences. Members of the Chair are active researchers that teach not only in Novi Sad, but also at universities in Austria, Germany, Switzerland and the countries in the ex-Yugoslavia region.


  1. Dr. Dragan Mašulović, full professor
  2. Dr. Miloš Stojaković, full professor (Chair)
  3. Dr. Maja Pech, associate professor
  4. Dr. Mirjana Mikalački, associate professor
  5. Dr. Marko Savić, assitant professor
  6. Bojana Pantić, teaching and research assistant

Research interests

Members of the Chair are organised in two active research groups. One group is interested mainly in the Ramsey property of classes of finite structures, homogeneity and countable categoricity of countable structures, and the applications thereof in other areas of mathematics such as model theory. The other group is mainly interested in positional games played on graphs and other discrete structures, and the applications of these results in computer science, as well as developing new efficient algorithms on discrete geometric structures.

Members of the Chair actively collaborate with colleagues from Hungary, France, Poland, Czech Republic, Germany, Israel, the Netherlands, Great Britain, Austria and Switzerland through various grants.

Selected references

D. Clemens, M. Mikalački. How fast can Maker win in fair biased games? Discrete Mathematics 341 (2018), 51—66

D. Clemens, M. Mikalački. A remark on the tournament game. The Electronic Journal of Combinatorics 22(3) 2015, P3.42

A. Grzesik, M. Mikalački, Z. L. Nagy, A. Naor, B. Patkós, F. Skerman. Avoider-Enforcer star games. Discrete Mathematics and Theoretical Computer Science 17:1 (2015), 145—160

M. Kovačević, M. Stojaković, V. Tan. Zero-error capacity of P-ary shift channels and FIFO queues. IEEE Transactions on Information Theory 63 (2017), 7698—7707

D. Mašulović, L. Scow. Categorical equivalence and the Ramsey property for finite powers of a primal algebra. Algebra Universalis 78 (2017), 159—179

D. Mašulović, N. Mudrinski. On the Dual Ramsey Property for Finite Distributive Lattices. Order 34 (2017), 479—490

D. Mašulović. A Dual Ramsey Theorem for Permutations. Electronic Journal of Combinatorics 24(3) (2017), #P3.39

D. Mašulović. Pre-adjunctions and the Ramsey property. European Journal of Combinatorics, 70 (2018), 268—283

R. Nenadov, A. Steger, M. Stojaković. On the threshold for the Maker-Breaker H-game. Random Structures & Algorithms 49 (2016), 558—578

C. Pech, M. PechPolymorphism clones of homogeneous structures: generating sets, Sierpiński rank, cofinality and the Bergman propertyAlgebra Univers. (2018) 79:45

C. Pech, M. PechPolymorphism clones of homogeneous structures: gate coverings and automatic homeomorphicity. Algebra Univers. (2018) 79: 35

C. Pech, M. PechReconstructing the Topology of the Elementary Self-embedding Monoids of Countable Saturated StructuresStudia Logica (2018) 106: 595

C. Pech, M. PechTowards a Ryll‐Nardzewski‐type theorem for weakly oligomorphic structures. Math. Log. Quart. 62 (2016) 25—34

M. Savić, M. Stojaković. Faster bottleneck non-crossing matchings of points in convex position. Computational Geometry: Theory and Applications 65 (2017), 27—34

J. Solymosi, M. Stojaković. Many collinear k-tuples with no k+1 collinear points. Discrete & Computational Geometry 50 (2013), 811—820