Covering boxes by points. - Dmitry Fon-Der-Flaass; Alexandr V. Kostochka (Discret. Math., 1993)

Orbits of Antichains in Ranked Posets. - Dmitry Fon-Der-Flaass (Eur. J. Comb., 1993)

There Exists no Distance-regular Graph with Intersection Array (5, 4, 3; 1, 1, 2). - Dmitry Fon-Der-Flaass (Eur. J. Comb., 1993)

Collecting Information in Graded Ordered Sets. - Dmitry Fon-Der-Flaass; Ivan Rival (Parallel Process. Lett., 1993)

On set systems without weak 3-Delta-subsystems. - Maria Axenovich; Dmitry Fon-Der-Flaass; Alexandr V. Kostochka (Discret. Math., 1995)

Bases for permutation groups and matroids. - Peter J. Cameron; Dmitry Fon-Der-Flaass (Eur. J. Comb., 1995)

Orbits of antichains revisited. - Peter J. Cameron; Dmitry Fon-Der-Flaass (Eur. J. Comb., 1995)

Local equivalence of transversals in matroids. - Dmitry Fon-Der-Flaass (Electron. J. Comb., 1996)

A Combinatorial Construction For Twin Trees. - Dmitry Fon-Der-Flaass (Eur. J. Comb., 1996)

A Note on Greedy Codes. - Dmitry Fon-Der-Flaass (J. Comb. Theory A, 1996)

Arrays of distinct representatives - a very simple NP-complete problem. - Dmitry Fon-Der-Flaass (Discret. Math., 1997)

Crooked Functions, Bent Functions, and Distance Regular Graphs. - T. D. Bending; Dmitry Fon-Der-Flaass (Electron. J. Comb., 1998)

On Exponential Trees. - Dmitry Fon-Der-Flaass (Eur. J. Comb., 1998)

Transversals in uniform hypergraphs with property (7, 2). - Dmitry Fon-Der-Flaass; Alexandr V. Kostochka; Douglas R. Woodall (Discret. Math., 1999)

Arithmetical Complexity of Infinite Words. - Sergey V. Avgustinovich; Dmitry Fon-Der-Flaass; Anna E. Frid (Words, Languages & Combinatorics, 2000)

Cartesian Products of Graphs and Metric Spaces. - Sergey V. Avgustinovich; Dmitry Fon-Der-Flaass (Eur. J. Comb., 2000)

On Deeply Critical Oriented Graphs. - Oleg V. Borodin; Dmitry Fon-Der-Flaass; Alexandr V. Kostochka; André Raspaud; Éric Sopena (J. Comb. Theory B, 2001)

Nilpotent Families of Endomorphisms of (p(V)+, cup). - Dmitry Fon-Der-Flaass; Alexandr V. Kostochka; Jaroslav Nesetril; André Raspaud; Éric Sopena (J. Comb. Theory B, 2002)

Acyclic list 7-coloring of planar graphs. - Oleg V. Borodin; Dmitry Fon-Der-Flaass; Alexandr V. Kostochka; André Raspaud; Éric Sopena (J. Graph Theory, 2002)

Codes, graphs, and schemes from nonlinear functions. - Edwin R. van Dam; Dmitry Fon-Der-Flaass (Eur. J. Comb., 2003)

On Rainbow Arithmetic Progressions. - Maria Axenovich; Dmitry Fon-Der-Flaass (Electron. J. Comb., 2004)

Graphic and Protographic Lists of Integers. - Dmitry Fon-Der-Flaass; Douglas B. West (Electron. J. Comb., 2004)

Distance Regular Covers of Complete Graphs from Latin Squares. - Dominique de Caen; Dmitry Fon-Der-Flaass (Des. Codes Cryptogr., 2005)

On periodicity and low complexity of infinite permutations. - Dmitry Fon-Der-Flaass; Anna E. Frid (Eur. J. Comb., 2007)

Domination Number of Certain Infinite Tournaments. - Dmitry Fon-Der-Flaass (Order, 2011)

Perfect colorings of the 12-cube that attain the bound on correlation immunity. - Dmitry Fon-Der-Flaass (CoRR, 2014)