Frank Niedermeyer

According to our database1, Frank Niedermeyer authored at least 6 papers between 1991 and 2014.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2014
Cryptanalysis of Basic Bloom Filters Used for Privacy Preserving Record Linkage.
J. Priv. Confidentiality, 2014

2006
The <i>f</i>-factor Problem for Graphs and the Hereditary Property.
Arch. Math. Log., 2006

2002
On a Class of Key Agreement Protocols Which Cannot Be Unconditionally Secure.
Proceedings of the Security in Communication Networks, Third International Conference, 2002

1994
Large <i>k</i>-preserving sets in infinite graphs.
J. Graph Theory, 1994

Matchable Infinite Graphs.
J. Comb. Theory B, 1994

1991
f-Optimal factors of infinite graphs.
Discret. Math., 1991


  Loading...