default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDmitry Fon-Der-Flaass
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2011
[j24]Dmitry Fon-Der-Flaass:
Domination Number of Certain Infinite Tournaments. Order 28(1): 157-161 (2011)- 2007
- [j23]Dmitry Fon-Der-Flaass, Anna E. Frid:
On periodicity and low complexity of infinite permutations. Eur. J. Comb. 28(8): 2106-2114 (2007) - 2005
- [j22]Dominique de Caen, Dmitry Fon-Der-Flaass:
Distance Regular Covers of Complete Graphs from Latin Squares. Des. Codes Cryptogr. 34(2-3): 149-153 (2005) - 2004
- [j21]Maria Axenovich, Dmitry Fon-Der-Flaass:
On Rainbow Arithmetic Progressions. Electron. J. Comb. 11(1) (2004) - [j20]Dmitry Fon-Der-Flaass, Douglas B. West:
Graphic and Protographic Lists of Integers. Electron. J. Comb. 11(1) (2004) - 2003
- [j19]Edwin R. van Dam
, Dmitry Fon-Der-Flaass:
Codes, graphs, and schemes from nonlinear functions. Eur. J. Comb. 24(1): 85-98 (2003) - 2002
- [j18]Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Éric Sopena:
Nilpotent Families of Endomorphisms of (p(V)+, cup). J. Comb. Theory B 86(1): 100-108 (2002) - [j17]Oleg V. Borodin, Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, André Raspaud, Éric Sopena:
Acyclic list 7-coloring of planar graphs. J. Graph Theory 40(2): 83-90 (2002) - 2001
- [j16]Oleg V. Borodin, Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, André Raspaud, Éric Sopena:
On Deeply Critical Oriented Graphs. J. Comb. Theory B 81(1): 150-155 (2001) - 2000
- [j15]Sergey V. Avgustinovich, Dmitry Fon-Der-Flaass:
Cartesian Products of Graphs and Metric Spaces. Eur. J. Comb. 21(7): 847-851 (2000) - 1999
- [j14]Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, Douglas R. Woodall:
Transversals in uniform hypergraphs with property (7, 2). Discret. Math. 207(1-3): 277-284 (1999) - 1998
- [j13]T. D. Bending, Dmitry Fon-Der-Flaass:
Crooked Functions, Bent Functions, and Distance Regular Graphs. Electron. J. Comb. 5 (1998) - [j12]Dmitry Fon-Der-Flaass:
On Exponential Trees. Eur. J. Comb. 19(1): 25-27 (1998) - 1997
- [j11]Dmitry Fon-Der-Flaass:
Arrays of distinct representatives - a very simple NP-complete problem. Discret. Math. 171(1-3): 295-298 (1997) - 1996
- [j10]Dmitry Fon-Der-Flaass:
Local equivalence of transversals in matroids. Electron. J. Comb. 3(1) (1996) - [j9]Dmitry Fon-Der-Flaass:
A Combinatorial Construction For Twin Trees. Eur. J. Comb. 17(2-3): 177-189 (1996) - [j8]Dmitry Fon-Der-Flaass:
A Note on Greedy Codes. J. Comb. Theory A 76(1): 156-159 (1996) - 1995
- [j7]Maria Axenovich, Dmitry Fon-Der-Flaass, Alexandr V. Kostochka:
On set systems without weak 3-Delta-subsystems. Discret. Math. 138(1-3): 57-62 (1995) - [j6]Peter J. Cameron, Dmitry Fon-Der-Flaass:
Bases for permutation groups and matroids. Eur. J. Comb. 16(6): 537-544 (1995) - [j5]Peter J. Cameron, Dmitry Fon-Der-Flaass:
Orbits of antichains revisited. Eur. J. Comb. 16(6): 545-554 (1995) - 1993
- [j4]Dmitry Fon-Der-Flaass, Alexandr V. Kostochka:
Covering boxes by points. Discret. Math. 120(1-3): 269-275 (1993) - [j3]Dmitry Fon-Der-Flaass:
Orbits of Antichains in Ranked Posets. Eur. J. Comb. 14(1): 17-22 (1993) - [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 Process. Lett. 3: 253-260 (1993)
Conference and Workshop Papers
- 2000
- [c1]Sergey V. Avgustinovich, Dmitry Fon-Der-Flaass, Anna E. Frid:
Arithmetical Complexity of Infinite Words. Words, Languages & Combinatorics 2000: 51-62
Informal and Other Publications
- 2014
- [i1]Dmitry Fon-Der-Flaass:
Perfect colorings of the 12-cube that attain the bound on correlation immunity. CoRR abs/1403.8091 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
