Abdelhamid Benhocine

According to our database, Abdelhamid Benhocine authored at least 13 papers between 1978 and 2013.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2013

New Images Watermarking Scheme Based on Singular Value Decomposition.

Abdelhamid Benhocine, Lamri Laouamer, Laurent Nana, Anca Christine Pascu

J. Inf. Hiding Multim. Signal Process., 2013

2012

An efficient algorithm for generating AoA networks

Nasser Eddine Mouhoub, Abdelhamid Benhocine

CoRR, 2012

2008

A New Approach against Color Attacks of Watermarked Images.

Abdelhamid Benhocine, Lamri Laouamer, Laurent Nana, Anca Pascu

Proceedings of the 4th International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2008), 2008

1993

Graphs with every matching contained in a cycle.

Abdelhamid Benhocine, A. Pawel Wojda

Discret. Math., 1993

1987

Pancyclic and panconnected line graphs.

Abdelhamid Benhocine, Jean-Luc Fouquet

J. Graph Theory, 1987

The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs.

Abdelhamid Benhocine, A. Pawel Wojda

J. Comb. Theory B, 1987

The Chvátal-Erdös condition and pancyclic line-graphs.

Abdelhamid Benhocine, Jean-Luc Fouquet

Discret. Math., 1987

1986

On circuits and pancyclic line graphs.

Abdelhamid Benhocine, L. Clark, N. Köhler, Henk Jan Veldman

J. Graph Theory, 1986

Pancyclism and Meyniel's conditions.

Abdelhamid Benhocine

Discret. Math., 1986

1985

On self-complementation.

Abdelhamid Benhocine, A. Pawel Wojda

J. Graph Theory, 1985

1984

On the existence of a specified cycle in digraphs with constraints on degrees.

Abdelhamid Benhocine

J. Graph Theory, 1984

1983

On the existence of specified cycles in a tournament.

Abdelhamid Benhocine, A. Pawel Wojda

J. Graph Theory, 1983

1978

Nombres de ramsey dans le cas orienté.

Abdelhamid Benhocine

Discret. Math., 1978