Equations of tournaments are not finitely based. - Jaroslav Jezek; Petar Markovic; Miklós Maróti; Ralph McKenzie (Discret. Math., 2000)

Tractability and learnability arising from algebras with few subpowers. - Pawel M. Idziak; Petar Markovic; Ralph McKenzie; Matthew Valeriote; Ross Willard (LICS, 2007)

CD(4) has bounded width - Catarina Carvalho; Víctor Dalmau; Petar Markovic; Miklós Maróti (CoRR, 2007)

The 11-element case of Frankl's conjecture. - Ivica Bosnjak; Petar Markovic (Electron. J. Comb., 2008)

Finitely Related Clones and Algebras with Cube Terms. - Petar Markovic; Miklós Maróti; Ralph McKenzie (Order, 2012)

QCSP on Semicomplete Digraphs. - Petar Dapic; Petar Markovic; Barnaby Martin (ICALP (1), 2014)

Mining Skier Transportation Patterns From Ski Resort Lift Usage Data. - Boris Delibasic; Petar Markovic; Pavlos Delias; Zoran Obradovic (IEEE Trans. Hum. Mach. Syst., 2017)

Quantified Constraint Satisfaction Problem on Semicomplete Digraphs. - Petar Dapic; Petar Markovic; Barnaby Martin (ACM Trans. Comput. Log., 2017)

Unveiling Hidden Patterns in Flexible Medical Treatment Processes - A Process Mining Case Study. - Kathrin Kirchner; Petar Markovic (ICDSST, 2018)

QCSP on Reflexive Tournaments. - Benoît Larose; Petar Markovic; Barnaby Martin; Daniël Paulusma; Siani Smith; Stanislav Zivný (ESA, 2021)