The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Dmitry Fon-Der-Flaass: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. T. D. Bending, Dmitry Fon-Der-Flaass
    Crooked Functions, Bent Functions, and Distance Regular Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1998, v:5, n:, pp:- [Journal]
  2. Maria Axenovich, Dmitry Fon-Der-Flaass
    On Rainbow Arithmetic Progressions. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal]
  3. Dmitry Fon-Der-Flaass
    Local equivalence of transversals in matroids. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1996, v:3, n:1, pp:- [Journal]
  4. Dmitry Fon-Der-Flaass, Douglas B. West
    Graphic and Protographic Lists of Integers. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal]
  5. Dominique de Caen, Dmitry Fon-Der-Flaass
    Distance Regular Covers of Complete Graphs from Latin Squares. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2005, v:34, n:2-3, pp:149-153 [Journal]
  6. Sergey V. Avgustinovich, Dmitry Fon-Der-Flaass
    Cartesian Products of Graphs and Metric Spaces. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2000, v:21, n:7, pp:847-851 [Journal]
  7. Edwin R. van Dam, Dmitry Fon-Der-Flaass
    Codes, graphs, and schemes from nonlinear functions. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2003, v:24, n:1, pp:85-98 [Journal]
  8. Dmitry Fon-Der-Flaass
    Orbits of Antichains in Ranked Posets. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1993, v:14, n:1, pp:17-22 [Journal]
  9. Dmitry Fon-Der-Flaass
    There Exists no Distance-regular Graph with Intersection Array (5, 4, 3; 1, 1, 2). [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1993, v:14, n:5, pp:409-412 [Journal]
  10. Dmitry Fon-Der-Flaass
    A Combinatorial Construction For Twin Trees. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1996, v:17, n:2-3, pp:177-189 [Journal]
  11. Dmitry Fon-Der-Flaass
    On Exponential Trees. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1998, v:19, n:1, pp:25-27 [Journal]
  12. Oleg V. Borodin, Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, André Raspaud, Eric Sopena
    On Deeply Critical Oriented Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:81, n:1, pp:150-155 [Journal]
  13. Dmitry Fon-Der-Flaass
    A Note on Greedy Codes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1996, v:76, n:1, pp:156-159 [Journal]
  14. Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Eric Sopena
    Nilpotent Families of Endomorphisms of (p(V)+, cup). [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2002, v:86, n:1, pp:100-108 [Journal]
  15. Dmitry Fon-Der-Flaass, Ivan Rival
    Collecting Information in Graded Ordered Sets. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1993, v:3, n:, pp:253-260 [Journal]
  16. Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, Douglas R. Woodall
    Transversals in uniform hypergraphs with property (7, 2). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:207, n:1-3, pp:277-284 [Journal]
  17. Dmitry Fon-Der-Flaass
    Arrays of distinct representatives - a very simple NP-complete problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:171, n:1-3, pp:295-298 [Journal]
  18. Dmitry Fon-Der-Flaass, Alexandr V. Kostochka
    Covering boxes by points. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:269-275 [Journal]
  19. Maria Axenovich, Dmitry Fon-Der-Flaass, Alexandr V. Kostochka
    On set systems without weak 3-Delta-subsystems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:138, n:1-3, pp:57-62 [Journal]

  20. On periodicity and low complexity of infinite permutations. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002