Research.Interests History

Hide minor edits - Show changes to output

July 03, 2023, at 10:15 AM by 10.168.195.180 -
Changed line 4 from:
* Graph coloring with distance constraints (radio labeling, k-distance and packing coloring)
to:
* Graph coloring with distance constraints (radio labeling, k-distance and packing coloring), list coloring with (and without) separation, multicoloring
December 09, 2022, at 04:37 PM by 193.52.237.96 -
Changed lines 1-3 from:
My favourite topics of research concern graph theory. More specifically, I'm (or have been) interested in

to:
My favorite topics of research concern graph theory. More specifically, I'm (or have been) interested in

Changed lines 8-10 from:
* Constrained spanning trees and walks : completely independent spanning trees, Hamiltonian walks

* Grands graphes et compression :  [[https://coregraphie.projet.liris.cnrs.fr | ANR Projetc COREGRAPHIE]]
to:
* Constrained spanning trees and walks: completely independent spanning trees, Hamiltonian walks

* Big graphs and compression :  [[https://coregraphie.projet.liris.cnrs.fr | ANR Project COREGRAPHIE]]
March 18, 2021, at 11:01 AM by 193.52.237.96 -
Added lines 9-10:

* Grands graphes et compression :  [[https://coregraphie.projet.liris.cnrs.fr | ANR Projetc COREGRAPHIE]]
May 19, 2015, at 03:14 PM by 193.52.237.96 -
Changed lines 1-6 from:
Topics of research

* Graph
theory and network algorithms:

* graph
coloring with distance constraints (radio labeling, k-distance and packing coloring)
to:
My favourite topics of research concern graph theory. More specifically, I'm (or have been) interested in


* Graph
coloring with distance constraints (radio labeling, k-distance and packing coloring)
Changed lines 8-12 from:
* constrained spanning trees and walks
to:
* Constrained spanning trees and walks : completely independent spanning trees, Hamiltonian walks

I am also interested in network algorithms and protocols:

* Mobility, Wireless networks, cloud networking, ...
June 17, 2014, at 05:00 PM by 193.52.237.96 -
Changed lines 5-8 from:
* multi-, total, fractionar and circular colorings

* Radio
-labelings: strong labelings, antipodal labelings, hamiltonian-labelings, radio k-labelings
to:
* graph coloring with distance constraints (radio labeling, k-distance and packing coloring)
Changed line 9 from:
* path colorings
to:
* constrained spanning trees and walks
Changed lines 3-11 from:
Algorithmique des graphes et des réseaux/ Graph and network algorithms:

    Multicolorations, colorations totales, fractionnaires, circulaires / multi-, total, fractionar and circular colorings

 
  Radio-étiquetages: colorations fortes, antipodales, hamiltoniennes, radio k-étiquetages / Radio-labelings: strong labelings, antipodal labelings, hamiltonian-labelings, radio k-labelings

    Colorations sommet-distinguantes: force d'irrégularité colorations à sommets adjacents disntingués / Vertex-distinguishing colorings: irregularity strength, (adjacent) vertex-dinstinguishing edge colorings

    Colorations de chemins /
path colorings
to:
* Graph theory and network algorithms:

* multi-, total, fractionar and circular colorings

* Radio-labelings: strong labelings, antipodal labelings
, hamiltonian-labelings, radio k-labelings

* Vertex-distinguishing
colorings: irregularity strength, (adjacent) vertex-dinstinguishing edge colorings

*
path colorings
Added lines 1-11:
Topics of research

Algorithmique des graphes et des réseaux/ Graph and network algorithms:

    Multicolorations, colorations totales, fractionnaires, circulaires / multi-, total, fractionar and circular colorings

    Radio-étiquetages: colorations fortes, antipodales, hamiltoniennes, radio k-étiquetages / Radio-labelings: strong labelings, antipodal labelings, hamiltonian-labelings, radio k-labelings

    Colorations sommet-distinguantes: force d'irrégularité colorations à sommets adjacents disntingués / Vertex-distinguishing colorings: irregularity strength, (adjacent) vertex-dinstinguishing edge colorings

    Colorations de chemins / path colorings