| 2011 | ||
|---|---|---|
| j22 | Dmitry Fon-Der-Flaass: Domination Number of Certain Infinite Tournaments. Order 28(1): 157-161 (2011) | |
| 2007 | ||
| j21 | Dmitry Fon-Der-Flaass, Anna E. Frid: On periodicity and low complexity of infinite permutations. Eur. J. Comb. 28(8): 2106-2114 (2007) | |
| 2005 | ||
| j20 | Dominique De Caen, Dmitry Fon-Der-Flaass: Distance Regular Covers of Complete Graphs from Latin Squares. Des. Codes Cryptography 34(2-3): 149-153 (2005) | |
| 2004 | ||
| j19 | Maria Axenovich, Dmitry Fon-Der-Flaass: On Rainbow Arithmetic Progressions. Electr. J. Comb. 11(1) (2004) | |
| j18 | Dmitry Fon-Der-Flaass, Douglas B. West: Graphic and Protographic Lists of Integers. Electr. J. Comb. 11(1) (2004) | |
| 2003 | ||
| j17 | Edwin R. van Dam, Dmitry Fon-Der-Flaass: Codes, graphs, and schemes from nonlinear functions. Eur. J. Comb. 24(1): 85-98 (2003) | |
| 2002 | ||
| j16 | Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Eric Sopena: Nilpotent Families of Endomorphisms of (p(V)+, cup). J. Comb. Theory, Ser. B 86(1): 100-108 (2002) | |
| j15 | Oleg V. Borodin, Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, André Raspaud, Eric Sopena: Acyclic list 7-coloring of planar graphs. Journal of Graph Theory 40(2): 83-90 (2002) | |
| 2001 | ||
| j14 | Oleg V. Borodin, Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, André Raspaud, Eric Sopena: On Deeply Critical Oriented Graphs. J. Comb. Theory, Ser. B 81(1): 150-155 (2001) | |
| 2000 | ||
| j13 | Sergey V. Avgustinovich, Dmitry Fon-Der-Flaass: Cartesian Products of Graphs and Metric Spaces. Eur. J. Comb. 21(7): 847-851 (2000) | |
| c1 | Sergey V. Avgustinovich, Dmitry Fon-Der-Flaass, Anna E. Frid: Arithmetical Complexity of Infinite Words. Words, Languages & Combinatorics 2000: 51-62 | |
| 1999 | ||
| j12 | Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, Douglas R. Woodall: Transversals in uniform hypergraphs with property (7, 2). Discrete Mathematics 207(1-3): 277-284 (1999) | |
| 1998 | ||
| j11 | T. D. Bending, Dmitry Fon-Der-Flaass: Crooked Functions, Bent Functions, and Distance Regular Graphs. Electr. J. Comb. 5 (1998) | |
| j10 | ||
| 1997 | ||
| j9 | Dmitry Fon-Der-Flaass: Arrays of distinct representatives - a very simple NP-complete problem. Discrete Mathematics 171(1-3): 295-298 (1997) | |
| 1996 | ||
| j8 | ||
| j7 | Dmitry Fon-Der-Flaass: A Combinatorial Construction For Twin Trees. Eur. J. Comb. 17(2-3): 177-189 (1996) | |
| j6 | ||
| 1995 | ||
| j5 | Maria Axenovich, Dmitry Fon-Der-Flaass, Alexandr V. Kostochka: On set systems without weak 3-Delta-subsystems. Discrete Mathematics 138(1-3): 57-62 (1995) | |
| 1993 | ||
| j4 | Dmitry Fon-Der-Flaass, Alexandr V. Kostochka: Covering boxes by points. Discrete Mathematics 120(1-3): 269-275 (1993) | |
| j3 | ||
| j2 | Dmitry Fon-Der-Flaass: There Exists no Distance-regular Graph with Intersection Array (5, 4, 3; 1, 1, 2). Eur. J. Comb. 14(5): 409-412 (1993) | |
| j1 | Dmitry Fon-Der-Flaass, Ivan Rival: Collecting Information in Graded Ordered Sets. Parallel Processing Letters 3: 253-260 (1993) | |
Colors in the list of coauthors
Last update Tue May 21 23:41:46 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page