A Pigeonhole Property for Relational Structures. - Anthony Bonato; Dejan Delic (Math. Log. Q., 1999)

Solution to A Problem of Kublanovsky and Sapir. - Dejan Delic (Int. J. Algebra Comput., 2001)

Generalized Pigeonhole Properties of Graphs and Oriented Graphs*1. - Anthony Bonato; Peter J. Cameron; Dejan Delic; Stéphan Thomassé (Eur. J. Comb., 2002)

On a Problem of Cameron's on Inexhaustible Graphs. - Anthony Bonato; Dejan Delic (Comb., 2004)

A note on orientations of the infinite random graph. - Anthony Bonato; Dejan Delic (Eur. J. Comb., 2004)

All countable monoids embed into the monoid of the infinite random graph. - Anthony Bonato; Dejan Delic; Igor Dolinka (Discret. Math., 2010)

Upper signed k-domination in a general graph. - Dejan Delic; Changping Wang (Inf. Process. Lett., 2010)

Distinguishing homomorphisms of infinite graphs. - Anthony Bonato; Dejan Delic (Contributions Discret. Math., 2012)

On the Reduction of the CSP Dichotomy Conjecture to Digraphs. - Jakub Bulin; Dejan Delic; Marcel Jackson; Todd Niven (CP, 2013)

The Global Connected Domination In Graphs. - Dejan Delic; Changping Wang (Ars Comb., 2014)

A finer reduction of constraint problems to digraphs. - Jakub Bulin; Dejan Delic; Marcel Jackson; Todd Niven (Log. Methods Comput. Sci., 2015)

The Structure and Automorphisms of Semi-directed Graphs. - Anthony Bonato; Dejan Delic; Changping Wang (J. Multiple Valued Log. Soft Comput., 2016)

Constraint Satisfaction Problem Dichotomy for Finite Templates: a Proof Via Local Consistency. - Dejan Delic (CoRR, 2017)

A new algorithm for constraint satisfaction problems with Maltsev templates. - Dejan Delic; Aklilu Habte (CoRR, 2017)

The Constraint Satisfaction Problem Over Multisorted Cores. - Dejan Delic; John Marcoux (CoRR, 2025)