# M. Mortada, O. Togni, %blue% About S-Packing Coloring of 2-Saturated Subcubic Graphs

# B. Tarhini, O. Togni,%blue% S-Packing Coloring of Cubic Halin Graphs%%, to be published in Discrete Applied Mathematics, 2024, [[https://arxiv.org/abs/2209.09135 | arXiv:2209.09135]].

# M. Mortada, O. Togni, %blue% On S-packing Colorings of Subcubic Graphs%%, to be published in Discrete Mathematics, 2024.

# Ali Yassin, Hocine Cherifi, Hamida Seba, Olivier Togni:
Exploring Statistical Backbone Filtering Techniques in the Air Transportation Network. COMPENG 2022: 1-8, 2022.

# Ahmad Khalil, Nader Mbarek, Olivier Togni:
Fuzzy Logic based model for self-optimizing energy consumption in IoT environment. WCNC 2021: 1-7, 2021.

# O. Togni, Coloring big real life graphs: the DSAT-ratio, MARAMI 2019, Dijon, Nov. 2019.

# M. Mortada, O. Togni, %blue% On S-packing Colorings of Subcubic Graphs

# M. Haddad, F. Pitois, H. Seba, et O. Togni, %blue%[[https://dmtcs.episciences.org/12701 | Hypergraphs with Polynomial Representation: Introducing r-splits]]%%, to be published in Discrete Mathematics & Theoretical Computer Science, 25:3 special issue ICGT'22, 2024. also on [[ https://arxiv.org/abs/2212.13822 | ArXiv]]

# B. Tarhini, O. Togni,%blue%S-Packing Coloring of Cubic Halin Graphs%%, [[https://arxiv.org/abs/2209.09135 | arXiv:2209.09135]]

# M. Haddad, F. Pitois, H. Seba, et O. Togni, Hypergraphs with Polynomial Representation: Introducing r-splits (2022+), to be published in Discrete Mathematics & Theoretical Computer Science, 25:3 special issue ICGT'22, arxiv.org/abs/2212.13822. 

#    D. Amar, A. Raspaud, and O. Togni, %blue% All-to-all wavelength-routing in all-optical compound networks%%. Discrete Math. 235(1-3):353-363, 2001.

#    O. Togni, %blue% Irregularity strength and compound graphs%%. Discrete Math. 218(1-3):235-243, 2000.

#    O. Togni, %blue% Irregularity strength of the toroidal grid%%. Discrete Math. 165-166:609--620, 1997.

#    D. Amar and O. Togni, %blue% Irregularity strength of trees%%. Discrete Math. 190(1-3):15-38, 1998.

%# M. Haddad, F. Pitois, H. Seba, et O. Togni, Hypergraphs with Polynomial Representation: Introducing r-splits (2022+), to be published in Discrete Mathematics & Theoretical Computer Science, 25:3 special issue ICGT'22, arxiv.org/abs/2212.13822.

# M. Haddad, F. Pitois, H. Seba, et O. Togni, Hypergraphs with Polynomial Representation: Introducing r-splits (2022+), to be published in Discrete Mathematics & Theoretical Computer Science, 25:3 special issue ICGT'22, arxiv.org/abs/2212.13822.

# S. T. Obenofunde, O. Togni and W. Abdou. %blue%[[http://doi.org/10.1049/wss2.12028 | Optimized Disjoint Virtual Backbones Algorithms for Wireless Sensor Networks]]%%, IET Wireless Sensor Systems, sept. 2021, published online.

# B. Bresar, N. Gastineau, O. Togni, %blue% [[https://link.springer.com/article/10.1007/s00010-020-00721-6 | Packing colorings of subcubic outerplanar graphs]]%%, Aequationes mathematicae, vol. 94(5), pages 945–967 2020, DOI:10.1007/s00010-020-00721-6, [[https://arxiv.org/abs/1809.05552 | arXiv:1809.05552]]

# J.C. Godin, O. Togni, %blue%[[https://doi.org/10.7151/dmgt.2398 | Choosability with Separation of Cycles and Outerplanar Graphs]]%%, Discussiones Mathematicae - Graph Theory, Vol 23, 2023. [[https://arxiv.org/abs/2009.00287 | arXiv:2009.00287]]

# B. Bresar, N. Gastineau, T. Gologranc, O. Togni,  %blue%[[https://doi.org/10.1007/s00026-021-00524-9 | On a vertex-edge marking game on graphs]]%%, Annals of Combinatorics, 2021. [[http://o.togni.u-bourgogne.fr/col_ve_final.pdf | pdf]]

# B. Bresar, N. Gastineau, T. Gologranc, O. Togni,  %blue%[[https://doi.org/10.1007/s00026-021-00524-9 | On a vertex-edge marking game on graphs]]%%, Annals of Combinatorics, 2021.

# J.C. Godin, R. Grisot, O. Togni, %blue%On List Coloring with Separation of the Complete Graph and Set System Intersections%%, [https://arxiv.org/abs/2209.03436 | arXiv:2209.03436]]

# B. Tarhini, O. Togni,%blue%S-Packing Coloring of Cubic Halin Graphs%%

# J.C. Godin, R. Grisot, O. Togni, %blue%On List Coloring with Separation of the Complete Graph and Set System Intersections%%

# J.C. Godin, O. Togni, %blue%[[https://www.dmgt.uz.zgora.pl/publish/bbl_view_pdf.php?ID=49373 | Choosability with Separation of Cycles and Outerplanar Graphs]]%%, Discussiones Mathematicae - Graph Theory, In press, 2021. [[https://arxiv.org/abs/2009.00287 | arXiv:2009.00287]]

# S. T. Obenofunde, O. Togni and W. Abdou. %blue%[[http://doi.org/10.1049/wss2.12028 || Optimized Disjoint Virtual Backbones Algorithms for Wireless Sensor Networks]]%%, IET Wireless Sensor Systems, sept. 2021, published online.

# S. T. Obenofunde, O. Togni and W. Abdou. Optimized Disjoint Virtual Backbones Algorithms for Wireless Sensor Networks, IET Wireless Sensor Systems, to be published, 2021.

# S. T. Obenofunde, O. Togni and W. Abdou. COptimized Disjoint Virtual Backbones Algorithms for Wireless Sensor Networks, IET Wireless Sensor Systems, to be published, 2021.

# B. Bresar, N. Gastineau, T. Gologranc, O. Togni,  %blue%On a vertex-edge marking game on graphs%%, Annals of Combinatorics, accepted, 2021.

If you have no access to one of  the reference below, feel free to [[mailto:otogni@u-bourgogne.fr | contact me]]

# J.C. Godin, O. Togni, %red%Choosability with Separation of Cycles and Outerplanar Graphs%%, [[https://arxiv.org/abs/2009.00287 | arXiv:2009.00287]]


# B. Bresar, N. Gastineau, T. Gologranc, O. Togni,  %red%On a vertex-edge marking game on graphs%%, submitted, 2019

# J.C. Godin, O. Togni, %red%Graph multicoloring reduction methods and application to McDiarmid-Reed's Conjecture%%, [[https://arxiv.org/abs/1812.01911 | arXiv:1812.01911]]

# N. Gastineau, W. Abdou, N. Mbarek et O. Togni,  %red%[[https://onlinelibrary.wiley.com/doi/10.1002/cpe.6067 | Leader election and local identifiers assignment f[or programmable matter on the face-centered cubic grid]]%%, Concurrency Computat Pract Exper. 2020;1–17.  [[https://arxiv.org/abs/2010.09286 | arXiv:2010.09286]]

# N. Gastineau, W. Abdou, N. Mbarek et O. Togni,  %red%{{https://onlinelibrary.wiley.com/doi/10.1002/cpe.6067 | Leader election and local identifiers assignment f[or programmable matter on the face-centered cubic grid]]%%, Concurrency Computat Pract Exper. 2020;1–17.  [[https://arxiv.org/abs/2010.09286 | arXiv:2010.09286]]

# B. Bresar, N. Gastineau, O. Togni, %red%[[https://link.springer.com/article/10.1007/s00010-020-00721-6 | Packing colorings of subcubic outerplanar graphs]]%%, Aequationes mathematicae, vol. 94(5), pages 945–967 2020, DOI:10.1007/s00010-020-00721-6, [[https://arxiv.org/abs/1809.05552 | arXiv:1809.05552]]

# N. Gastineau, W. Abdou, N. Mbarek et O. Togni,  %red%Leader election and local identifiers assignment f[or programmable matter on the face-centered cubic grid%%, Concurrency Computat Pract Exper. 2020;1–17. [[https://doi.org/10.1002/cpe.6067 | DOI 10.1002/cpe.6067]], [[https://arxiv.org/abs/2010.09286 | arXiv:2010.09286]]

# N. Gastineau, W. Abdou, N. Mbarek et O. Togni,  %red%Leader election and local identifiers assignment f[or programmable matter on the face-centered cubic grid%%, accepted in Concurrency and Computation: Practice and Experience, 2020, DOI:10.1002/cpe.6067., [[https://arxiv.org/abs/2010.09286 | arXiv:2010.09286]]

# N. Gastineau, W. Abdou, N. Mbarek et O. Togni,  %red%Leader election and local identifiers assignment f[or programmable matter on the face-centered cubic grid%%, accepted in Concurrency and Computation: Practice and Experience, 2020, DOI:10.1002/cpe.6067.

# N. Gastineau, W. Abdou, N. Mbarek et O. Togni,  %red%Leader election and local identifiers assignment f[or programmable matter on the face-centered cubic grid%%, accepted in Concurrency and Computation: Practice and Experience, 2020.

# B. Bresar, N. Gastineau, O. Togni, %red%[[https://link.springer.com/article/10.1007/s00010-020-00721-6 | Packing colorings of subcubic outerplanar graphs]]%%, Aequationes mathematicae, vol. 94, pages 945–967 2020, DOI:10.1007/s00010-020-00721-6, [[https://arxiv.org/abs/1809.05552 | arXiv:1809.05552]]

# B. Bresar, N. Gastineau, O. Togni, %red%[[https://link.springer.com/article/10.1007/s00010-020-00721-6 | Packing colorings of subcubic outerplanar graphs]]%%, Aequationes mathematicae, 2020, DOI:10.1007/s00010-020-00721-6, [[https://arxiv.org/abs/1809.05552 | arXiv:1809.05552]]

# B. Bresar, N. Gastineau, O. Togni, %red%[[https://link.springer.com/article/10.1007/s00010-020-00721-6 | Packing colorings of subcubic outerplanar graphs]]%%, Aequationes mathematicae, DOI:10.1007/s00010-020-00721-6, [[https://arxiv.org/abs/1809.05552 | arXiv:1809.05552]]

# B. Bresar, N. Gastineau, O. Togni, %red%[[https://link.springer.com/article/10.1007/s00010-020-00721-6 | Packing colorings of subcubic outerplanar graphs]]%%  , Aequationes mathematicae, DOI:10.1007/s00010-020-00721-6, [[https://arxiv.org/abs/1809.05552 | arXiv:1809.05552]]

# B. Bresar, N. Gastineau, S. Klavzar, O. Togni, %red% [[https://link.springer.com/article/10.1007/s00373-019-02089-0?wt_mc=Internal.Event.1.SEM.ArticleAuthorAssignedToIssue&utm_source=ArticleAuthorAssignedToIssue&utm_medium=email&utm_content=AA_en_06082018&ArticleAuthorAssignedToIssue_20191126 | Exact distance graphs of product graphs]]%%, Graphs&Combinatorics, 35(6), 1555-1569, 2019, [[ https://arxiv.org/abs/1810.10198 | arXiv:1810.10198]]

# B. Bresar, N. Gastineau, O. Togni, %red%Packing colorings of subcubic outerplanar graphs%%  , Aequationes mathematicae, DOI:10.1007/s00010-020-00721-6, [[https://arxiv.org/abs/1809.05552 | arXiv:1809.05552]]

# N. Gastineau, H. Kheddouci, O. Togni,  %red% Subdivision into i-packings and S-packing chromatic number of some lattices%%, Ars Mathematica Contemporanea, 9:331-354, 2015.  [[ http://amc-journal.eu/index.php/amc/article/download/436/840| pdf]]

# J.C. Godin, O. Togni, %red%Choosability with Separation of Cycles and Outerplanar Graphs%%, [https://arxiv.org/abs/2009.00287 | arXiv:2009.00287]]

# J.C. Godin, O. Togni, %red%Choosability with Separation of Cycles and Outerplanar Graphs%%, [https://arxiv.org/abs/1812.01911 | arXiv:2009.00287]]

# N. Gastineau, W. Abdou, N. Mbarek et O. Togni,  %red%Leader election and local identifiers assignment for programmable matter on the face-centered cubic grid%%, submitted, 2020

# J.C. Godin, O. Togni, %red%Choosability with Separation of Cycles and Outerplanar Graphs%%

# J.C. Godin, O. Togni, %red%Choosability with Separation of Cycles and Outerplanar Graphse%%

# B. Bresar, N. Gastineau, O. Togni, %red%Packing colorings of subcubic outerplanar graphs%%  , Aequationes mathematicae, accepted, 2020, [[https://arxiv.org/abs/1809.05552 | arXiv:1809.05552]]

# A. Khalil, N. Mbarek, O. Togni. IoT-MAAC: Multiple Attribute Access Control for IoT environments
2020 IEEE 17th Annual Consumer Communications & Networking Conference (IEEE CCNC), Jan 2020, Las Vegas, United States.

# A. Khalil, N. Mbarek, O. Togni. Fuzzy Logic based security trust evaluation for IoT environments
16th ACS/IEEE International Conference on Computer Systems and Applications AICCSA 2019, Nov 2019, Abu Dhabi, United Arab Emirates

# N. Gastineau, W. Abdou, N. Mbarek et O. Togni, Distributed leader election and computation of local identifiers for programmable matter. In : 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS 2018). Août 2018.

# B. Bresar, N. Gastineau, S. Klavzar, O. Togni, %red% [[https://link.springer.com/article/10.1007/s00373-019-02089-0?wt_mc=Internal.Event.1.SEM.ArticleAuthorAssignedToIssue&utm_source=ArticleAuthorAssignedToIssue&utm_medium=email&utm_content=AA_en_06082018&ArticleAuthorAssignedToIssue_20191126 | Exact distance graphs of product graphs]]%%, Graphs&Combinatorics, 35(6), 1555-1569, 2019, 10.1007/s00373-019-02089-0, [[ https://arxiv.org/abs/1810.10198 | arXiv:1810.10198]]

# B. Bresar, N. Gastineau, S. Klavzar, O. Togni, %red% Exact distance graphs of product graphs%%, Graphs&Combinatorics, accepted, 2019, 10.1007/s00373-019-02089-0, [[ https://arxiv.org/abs/1810.10198 | arXiv:1810.10198]]

# N. Gastineau, O. Togni, %red% Coloring of the dth power of the face-centered cubic grid%%, Discussiones Mathematicae - Graph Theory, accepted, 2019, [[https://arxiv.org/pdf/1806.08136.pdf | arXiv:1806.08136]]

#    O. Togni, %red% Strong chromatic index of products of graphs%%, Discrete Math. and Theoretical Computer Science, Vol. [[http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/677/1802 | 9(1): 47-56]], 2007.

# B. Bresar, N. Gastineau, T. Gologranc, %red% O. Togni, On a vertex-edge marking game on graphs%%, submitted, 2019

# J.C. Godin, O. Togni, Graph multicoloring reduction methods and application to McDiarmid-Reed's Conjecture, [[https://arxiv.org/abs/1812.01911 | arXiv:1812.01911]]

# B. Bresar, N. Gastineau, O. Togni, Packing colorings of subcubic outerplanar graphs  [[https://arxiv.org/abs/1809.05552 | arXiv:1809.05552]]

# A. Khalil, N. Mbarek, O.Togni, Towards Service Level Guarantee within IoT Sensing Layer, International Journal on Advances in Internet Technology, vol 12 n°1&2, 2019.

# A. Khalil, N. Mbarek, O.Togni, Towards Service Level Guarantee within IoT Sensing Layer,

# B. Bresar, N. Gastineau, S. Klavzar, O. Togni, %red% Exact distance graphs of product graphs%%, Graphs&Combinatorics, accepted, 2019, [[ https://arxiv.org/abs/1810.10198 | arXiv:1810.10198]]

# N. Gastineau, O. Togni, %red% [[ https://doi.org/10.1016/j.dam.2018.12.035 | On S-packing edge-colorings of cubic graphs]], Discrete Applied Math., Volume 259, 30 April 2019, Pages 63-75,  [[https://arxiv.org/abs/1711.10906 |  arXiv:1711.10906]]

# N. Gastineau, P. Holub, O. Togni, %red% [[https://doi.org/10.1016/j.dam.2018.07.034 | On the packing chromatic number of subcubic outerplanar graphs]], Discrete Applied Math., Volume 255, 28 February 2019, Pages 209-221, [[https://arxiv.org/abs/1703.05023 | arXiv:1703.05023]].

# B. Darties, N. Gastineau, O. Togni, %red% [[https://www.sciencedirect.com/science/article/pii/S0166218X17305395 | Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees]], Discrete Applied Math., Volume 236, 19 February 2018, Pages 124-136. Also on [[https://arxiv.org/abs/1702.08289 | arXiv:1702.08289]].

# B. Darties, N. Gastineau, O. Togni, %red% [[http://www.sciencedirect.com/science/article/pii/S0166218X16303997 |Completely Independent Spanning Trees in Some Regular Graphs]], Discrete Applied Math.,Volume 217, Part 2, 30 January 2017, Pages 163–174.

# N. Gastineau, O. Togni, %red% [[http://www.sciencedirect.com/science/article/pii/S0012365X1630111X |S-Packing Colorings of Cubics Graphs]], Discrete Math., 339 (10), pp.2461-2470,  2016. Also on [[http://arxiv.org/abs/1403.7495| arXiv:1403.7495]].

# B. Effantin, N. Gastineau, O. Togni, %red% [[http://www.sciencedirect.com/science/article/pii/S0012365X16300565 | A characterization of b-chromatic and partial Grundy numbers by induced subgraphs]], Discrete Math., 339 (8), 2157-2167, 2016. Also on [[http://arxiv.org/abs/1505.07780 | arXiv:1505.07780]]
# Y. Aubry, J.C. Godin, O. Togni, %red% [[ http://link.springer.com/article/10.1007/s00373-015-1625-3/fulltext.html |Free choosability of outerplanar graphs]], Graphs and Combinatorics,32(3), 851-859, 2016.

# H. BargaouiI, N. Mbarek, O. TogniI, and M. Frikha, %red% [[http://link.springer.com/article/10.1007/s11276-015-1091-0 | Hybrid QoS based routing protocol for inter and intra wireless mesh infrastructure communications]], J. Wireless Networks, 22(7): 2111-2130, 2016.

# Mohamad Hamze, Nader Mbarek, Olivier Togni,  %red% SLA-based Resource Allocation within Cloud Networking Environment, International journal of new computer architectures and their applications (IJNCAA), 5 (2), pp. pp. 61-78 / ISSN 2220-9085, 2015.

# N. Gastineau, H. Kheddouci, O. Togni,  %red% Subdivision into i-packings and S-packing chromatic number of some lattices, Ars Mathematica Contemporanea, 9:331-354, 2015.  [[ http://amc-journal.eu/index.php/amc/article/download/436/840| pdf]]

# Hajer BARGAOUI, Nader MBAREK, Olivier TOGNI, and Mounir Frikha, %red% HQMR: Hybrid QoS based Routing Protocol for Wireless Mesh Environment, Int. J. Adv. Netw. Serv., vol. 8, no. 1&2, pp. 27–41, 2015.

#  N. Gastineau, H. Kheddouci, O. Togni, %red% On the family of r-regular graphs with Grundy number r + 1, [[http:arXiv.org/abs/1312.6503 | Arxiv:1312.6503]], Discrete Math., 328:5-15, 2014.

# J. Ekstein, P. Holub, O. Togni, %red% The Packing Coloring of Distance Graphs D(k,t) , [[http://arxiv.org/abs/1302.0721 | arXiv:1302.0721]], Discrete Applied Math., Volume 167, pp. 100-106 ,2014.

# O. Togni, %red% On Packing Colorings of Distance Graphs, [[http://arxiv.org/abs/1011.0971 | arXiv:1011.0971]], Discrete Applied Math., Volume 167, pp. 280–289, 2014.

# Y. Aubry, J.-C. Godin and O. Togni, %red% Every triangle-free induced subgraph of the triangular lattice is (5m,2m)-choosable, [[http://arxiv.org/abs/1110.2650 | arXiv:1110.2650]], Discrete Applied Math., Volume 166, pp. 51-58, 2014.

# Ahmad Rahil, Nader Mbarek, Olivier Togni, Mirna Atieh,  %red% Integrated Fuzzy Solution for Network Selection using MIH in Heterogeneous Environment,International journal on advances in networks and services 6, 3&4(2013) 175-187, 2013. [[https://hal-univ-bourgogne.archives-ouvertes.fr/hal-00926022v1 | Hal]]


#    R. Čada, J. Ekstein, P. Holub, O. Togni,  %red% Radio Labelings of Distance Graphs, [[http://arxiv.org/abs/1207.4219 | arXiv:1207.4219]], Discrete Applied Math., 161(18), pp. 2876–2884, 2013.

#  J-L. Baril, H. Kheddouci and O. Togni, %red% Vertex Distinguishing Edge- and Total-Colorings of Cartesian and other Product Graphs, Ars Combinatoria, 107, pp. 109-127, 2012. [[http://o.togni.u-bourgogne.fr/BKTtotal.pdf | pdf]]

#    Y. Aubry, J.-C. Godin and O. Togni, %red% Vectorial Solutions to List Multicoloring Problems on Graphs, Advances and Applications in Discrete Mathematics, 9(2), pp. 65-81, 2012. [[http://o.togni.u-bourgogne.fr/VecSol.pdf | pdf]]

#    R. Khennoufa and O. Togni, %red% The radio antipodal and radio numbers of the hypercube, Ars Combinatoria, 102 , pp. 447-461, 2011. [[http://o.togni.u-bourgogne.fr/KhennoufaHyper.pdf | pdf]]

#    J-L. Baril and O. Togni, %red% Neighbor-Distinguishing k-tuple Edge-Colorings of Graphs, Discrete Mathematics, 309, pp. 5147-5157, 2009. [[http://o.togni.u-bourgogne.fr/BarilNDktuple.pdf | pdf]]

#    R. Khennoufa and O. Togni, %red% Total and fractional total colourings of circulant graphs, Discrete Mathematics, 338 (24): 6316 - 6329 ,  2008. [[http://o.togni.u-bourgogne.fr/KhennoufaTotal.pdf | pdf]]

#    M. Kchikech, R. Khennoufa and O. Togni, %red% Radio k-Labelings for Cartesian Products of Graphs, Discuss. Math. - Graph Theory, 28(1): 165-178, 2008. [[http://o.togni.u-bourgogne.fr/KchikechRadioLabProduct.pdf | pdf]]

#    H. Kheddouci and O. Togni, %red% Bounds for minimum feedback vertex sets in distance graphs and circulant graphs. Discrete Math. and Theoretical Computer Science,  Vol. 10(1):57-70, 2008. [[https://dmtcs.episciences.org/417/pdf |pdf]]

#    O. Togni, %red% Strong chromatic index of products of graphs, Discrete Math. and Theoretical Computer Science, Vol. [[http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/677/1802 | 9(1): 47-56]], 2007.

#    M. Kchikech, R. Khennoufa and O. Togni, %red% Linear and cyclic radio k-labelings of trees, Discuss. Math. - Graph Theory, 27 (1):105-123, 2007. [[http://o.togni.u-bourgogne.fr/KchikechRadioLabeling.pdf | pdf]]

#    M. Kchikech and O. Togni, %red% Approximation algorithms for multicoloring powers of square and triangular meshes, Discrete Math. and Theoretical Computer Science, Vol. [[http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/507/1621 | 8 (1):159-172]], 2006.

#    J-L. Baril, H. Kheddouci and O. Togni, %red% Adjacent Vertex Distinguishing Edge-Colorings of Meshes. Australasian Journal of Combinatorics, 35:89-102, 2006.  [[http://o.togni.u-bourgogne.fr/AVDgrid.pdf | pdf]]

#    J-L. Baril, H. Kheddouci and O. Togni, %red% The Irregularity Strength of Circulant Graphs. Discrete Math., 304 (1-3):1-10, 2005. [[http://o.togni.u-bourgogne.fr/BarilStrength.pdf | pdf]]

#    R. Khennoufa and O. Togni, %red% A Note on Radio Antipodal Colouring of Paths. Mathematica Bohemica, 130 (3):277-282, 2005. [[http://o.togni.u-bourgogne.fr/KhennoufaAntipodal.pdf | pdf]]

#    D. Amar, A. Raspaud, and O. Togni, %red% All-to-all wavelength-routing in all-optical compound networks. Discrete Math. 235(1-3):353-363, 2001.

#    O. Togni, %red% Irregularity strength and compound graphs. Discrete Math. 218(1-3):235-243, 2000.

#    D. Amar and O. Togni, %red% Irregularity strength of trees. Discrete Math. 190(1-3):15-38, 1998.

#    O. Togni, %red% Irregularity strength of the toroidal grid. Discrete Math. 165-166:609--620, 1997.

# N. Gastineau, O. Togni, [[ https://doi.org/10.1016/j.dam.2018.12.035 | On S-packing edge-colorings of cubic graphs]], Discrete Applied Math., Volume 259, 30 April 2019, Pages 63-75,  [[https://arxiv.org/abs/1711.10906 |  arXiv:1711.10906]]

# N. Gastineau, P. Holub, O. Togni, [[https://doi.org/10.1016/j.dam.2018.07.034 | On the packing chromatic number of subcubic outerplanar graphs]], Discrete Applied Math., Volume 255, 28 February 2019, Pages 209-221, [[https://arxiv.org/abs/1703.05023 | arXiv:1703.05023]].

# B. Darties, N. Gastineau, O. Togni, [[https://www.sciencedirect.com/science/article/pii/S0166218X17305395 | Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees]], Discrete Applied Math., Volume 236, 19 February 2018, Pages 124-136. Also on [[https://arxiv.org/abs/1702.08289 | arXiv:1702.08289]].

# B. Darties, N. Gastineau, O. Togni, [[http://www.sciencedirect.com/science/article/pii/S0166218X16303997 |Completely Independent Spanning Trees in Some Regular Graphs]], Discrete Applied Math.,Volume 217, Part 2, 30 January 2017, Pages 163–174.

# N. Gastineau, O. Togni, [[http://www.sciencedirect.com/science/article/pii/S0012365X1630111X |S-Packing Colorings of Cubics Graphs]], Discrete Math., 339 (10), pp.2461-2470,  2016. Also on [[http://arxiv.org/abs/1403.7495| arXiv:1403.7495]].

# B. Effantin, N. Gastineau, O. Togni, [[http://www.sciencedirect.com/science/article/pii/S0012365X16300565 | A characterization of b-chromatic and partial Grundy numbers by induced subgraphs]], Discrete Math., 339 (8), 2157-2167, 2016. Also on [[http://arxiv.org/abs/1505.07780 | arXiv:1505.07780]]
# Y. Aubry, J.C. Godin, O. Togni, [[ http://link.springer.com/article/10.1007/s00373-015-1625-3/fulltext.html |Free choosability of outerplanar graphs]], Graphs and Combinatorics,32(3), 851-859, 2016.

# H. BargaouiI, N. Mbarek, O. TogniI, and M. Frikha, [[http://link.springer.com/article/10.1007/s11276-015-1091-0 | Hybrid QoS based routing protocol for inter and intra wireless mesh infrastructure communications]], J. Wireless Networks, 22(7): 2111-2130, 2016.

# Mohamad Hamze, Nader Mbarek, Olivier Togni, SLA-based Resource Allocation within Cloud Networking Environment, International journal of new computer architectures and their applications (IJNCAA), 5 (2), pp. pp. 61-78 / ISSN 2220-9085, 2015.

# N. Gastineau, H. Kheddouci, O. Togni, Subdivision into i-packings and S-packing chromatic number of some lattices, Ars Mathematica Contemporanea, 9:331-354, 2015.  [[ http://amc-journal.eu/index.php/amc/article/download/436/840| pdf]]

# Hajer BARGAOUI, Nader MBAREK, Olivier TOGNI, and Mounir Frikha, HQMR: Hybrid QoS based Routing Protocol for Wireless Mesh Environment, Int. J. Adv. Netw. Serv., vol. 8, no. 1&2, pp. 27–41, 2015.

#  N. Gastineau, H. Kheddouci, O. Togni, On the family of r-regular graphs with Grundy number r + 1, [[http:arXiv.org/abs/1312.6503 | Arxiv:1312.6503]], Discrete Math., 328:5-15, 2014.

# J. Ekstein, P. Holub, O. Togni, The Packing Coloring of Distance Graphs D(k,t) , [[http://arxiv.org/abs/1302.0721 | arXiv:1302.0721]], Discrete Applied Math., Volume 167, pp. 100-106 ,2014.

# O. Togni, On Packing Colorings of Distance Graphs, [[http://arxiv.org/abs/1011.0971 | arXiv:1011.0971]], Discrete Applied Math., Volume 167, pp. 280–289, 2014.

# Y. Aubry, J.-C. Godin and O. Togni, Every triangle-free induced subgraph of the triangular lattice is (5m,2m)-choosable, [[http://arxiv.org/abs/1110.2650 | arXiv:1110.2650]], Discrete Applied Math., Volume 166, pp. 51-58, 2014.

# Ahmad Rahil, Nader Mbarek, Olivier Togni, Mirna Atieh, Integrated Fuzzy Solution for Network Selection using MIH in Heterogeneous Environment,International journal on advances in networks and services 6, 3&4(2013) 175-187, 2013. [[https://hal-univ-bourgogne.archives-ouvertes.fr/hal-00926022v1 | Hal]]


#    R. Čada, J. Ekstein, P. Holub, O. Togni, Radio Labelings of Distance Graphs, [[http://arxiv.org/abs/1207.4219 | arXiv:1207.4219]], Discrete Applied Math., 161(18), pp. 2876–2884, 2013.

#  J-L. Baril, H. Kheddouci and O. Togni, Vertex Distinguishing Edge- and Total-Colorings of Cartesian and other Product Graphs, Ars Combinatoria, 107, pp. 109-127, 2012. [[http://o.togni.u-bourgogne.fr/BKTtotal.pdf | pdf]]

#    Y. Aubry, J.-C. Godin and O. Togni, Vectorial Solutions to List Multicoloring Problems on Graphs, Advances and Applications in Discrete Mathematics, 9(2), pp. 65-81, 2012. [[http://o.togni.u-bourgogne.fr/VecSol.pdf | pdf]]

#    R. Khennoufa and O. Togni, The radio antipodal and radio numbers of the hypercube, Ars Combinatoria, 102 , pp. 447-461, 2011. [[http://o.togni.u-bourgogne.fr/KhennoufaHyper.pdf | pdf]]

#    J-L. Baril and O. Togni, Neighbor-Distinguishing k-tuple Edge-Colorings of Graphs, Discrete Mathematics, 309, pp. 5147-5157, 2009. [[http://o.togni.u-bourgogne.fr/BarilNDktuple.pdf | pdf]]

#    R. Khennoufa and O. Togni, Total and fractional total colourings of circulant graphs, Discrete Mathematics, 338 (24): 6316 - 6329 ,  2008. [[http://o.togni.u-bourgogne.fr/KhennoufaTotal.pdf | pdf]]

#    M. Kchikech, R. Khennoufa and O. Togni, Radio k-Labelings for Cartesian Products of Graphs, Discuss. Math. - Graph Theory, 28(1): 165-178, 2008. [[http://o.togni.u-bourgogne.fr/KchikechRadioLabProduct.pdf | pdf]]

#    H. Kheddouci and O. Togni, Bounds for minimum feedback vertex sets in distance graphs and circulant graphs. Discrete Math. and Theoretical Computer Science,  Vol. 10(1):57-70, 2008. [[https://dmtcs.episciences.org/417/pdf |pdf]]

#    O. Togni, Strong chromatic index of products of graphs, Discrete Math. and Theoretical Computer Science, Vol. [[http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/677/1802 | 9(1): 47-56]], 2007.

#    M. Kchikech, R. Khennoufa and O. Togni, Linear and cyclic radio k-labelings of trees, Discuss. Math. - Graph Theory, 27 (1):105-123, 2007. [[http://o.togni.u-bourgogne.fr/KchikechRadioLabeling.pdf | pdf]]

#    M. Kchikech and O. Togni, Approximation algorithms for multicoloring powers of square and triangular meshes, Discrete Math. and Theoretical Computer Science, Vol. [[http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/507/1621 | 8 (1):159-172]], 2006.

#    J-L. Baril, H. Kheddouci and O. Togni, Adjacent Vertex Distinguishing Edge-Colorings of Meshes. Australasian Journal of Combinatorics, 35:89-102, 2006.  [[http://o.togni.u-bourgogne.fr/AVDgrid.pdf | pdf]]

#    J-L. Baril, H. Kheddouci and O. Togni, The Irregularity Strength of Circulant Graphs. Discrete Math., 304 (1-3):1-10, 2005. [[http://o.togni.u-bourgogne.fr/BarilStrength.pdf | pdf]]

#    R. Khennoufa and O. Togni, A Note on Radio Antipodal Colouring of Paths. Mathematica Bohemica, 130 (3):277-282, 2005. [[http://o.togni.u-bourgogne.fr/KhennoufaAntipodal.pdf | pdf]]

#    D. Amar, A. Raspaud, and O. Togni, All-to-all wavelength-routing in all-optical compound networks. Discrete Math. 235(1-3):353-363, 2001.

#    O. Togni, Irregularity strength and compound graphs. Discrete Math. 218(1-3):235-243, 2000.

#    D. Amar and O. Togni, Irregularity strength of trees. Discrete Math. 190(1-3):15-38, 1998.

#    O. Togni, Irregularity strength of the toroidal grid. Discrete Math. 165-166:609--620, 1997.

# N. Gastineau, O. Togni, %orange% Coloring of the dth power of the face-centered cubic grid%%, Discussiones Mathematicae - Graph Theory, accepted, 2019, [[https://arxiv.org/pdf/1806.08136.pdf | arXiv:1806.08136]]

# N. Gastineau, O. Togni, %darkblue% Coloring of the dth power of the face-centered cubic grid%%, Discussiones Mathematicae - Graph Theory, accepted, 2019, [[https://arxiv.org/pdf/1806.08136.pdf | arXiv:1806.08136]]

# N. Gastineau, O. Togni, %blue% Coloring of the dth power of the face-centered cubic grid%%, Discussiones Mathematicae - Graph Theory, accepted, 2019, [[https://arxiv.org/pdf/1806.08136.pdf | arXiv:1806.08136]]

# N. Gastineau, O. Togni, Coloring of the dth power of the face-centered cubic grid, Discussiones Mathematicae - Graph Theory, accepted, 2019, [[https://arxiv.org/pdf/1806.08136.pdf | arXiv:1806.08136]]

# N. Gastineau, O. Togni, On S-packing edge-colorings of cubic graphs, Discrete Applied Math., to be published,  [[https://arxiv.org/abs/1711.10906 |  arXiv:1711.10906]]

# J.-L. Baril, B. Darties, N. Gastineau, A. Moinet et
O. Togni, Completely independent spanning trees for enhancing the robustness in ad-hoc networks. In : STWiMob. Rome, Italy, oct. 2017.

# N. Gastineau, P. Holub, O. Togni, [[https://doi.org/10.1016/j.dam.2018.07.034 | On the packing chromatic number of subcubic outerplanar graphs]], Discrete Applied Math., to be published, [[https://arxiv.org/abs/1703.05023 | arXiv:1703.05023]].

# B. Bresar, N. Gastineau, O. Togni, Packing colorings of subcubic outerplanar graphs  [[https://arxiv.org/abs/1810.10198 | arXiv:1810.10198]]

# B. Bresar, N. Gastineau, S. Klavzar, O. Togni, Exact distance graphs of product graphs [[ | arXiv:1810.10198v1]]

# B. Bresar, N. Gastineau, O. Togni, Packing colorings of subcubic outerplanar graphs  [[https://arxiv.org/abs/1809.05552 | arXiv:1809.05552]]

# B. Bresar, N. Gastineau, S. Klavzar, O. Togni, Exact distance graphs of product graphs

# B. Bresar, N. Gastineau, O. Togni, Packing colorings of subcubic outerplanar graphs

# N. Gastineau, P. Holub, O. Togni,
[[https://doi.org/10.1016/j.dam.2018.07.034 | On the packing chromatic number of subcubic outerplanar graphs]], Discrete Applied Math., to be published, [[https://arxiv.org/abs/1703.05023 | arXiv:1703.05023]].

# N. Gastineau, P. Holub, O. Togni, On the packing chromatic number of subcubic outerplanar graphs, Discrete Applied Math., to be published, [[https://arxiv.org/abs/1703.05023 | arXiv:1703.05023]].

# N. Gastineau, O. Togni, Coloring of the dth power of the face-centered cubic grid

# O. Togni, N. Gastineau, "S-packing colourings of subcubic graphs", 27th Workshop on Cycles & Colourings, Nový Smokovec, High Tatras, Slovakia, September 3-8, 2017, Invated lecture.

# B. Darties, N. Gastineau, O. Togni, Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees, Discrete Applied Math., Volume 236, 19 February 2018, Pages 124-136. Also on [[https://arxiv.org/abs/1702.08289 | arXiv:1702.08289]].

# B. Darties, N. Gastineau, O. Togni, Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees, Discrete Applied Math., to be published, 2017. Also on [[https://arxiv.org/abs/1702.08289 | arXiv:1702.08289]].

# Hajer BARGAOUI, Nader MBAREK, Olivier TOGNI, and Mounir Frikha, [[http://link.springer.com/article/10.1007/s11276-015-1091-0 | Hybrid QoS based routing protocol for inter and intra wireless mesh infrastructure communications]], J. Wireless Networks, 22(7): 2111-2130, 2016.

# B. Darties, N. Gastineau, O. Togni, Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees, Discrete Applied Math., to be published, 2017.
 Also on [[https://arxiv.org/abs/1702.08289 | arXiv:1702.08289]].

# B. Darties, N. Gastineau, O. Togni, [[http://www.sciencedirect.com/science/article/pii/S0166218X16303997 |Completely Independent Spanning Trees in Some Regular Graphs]], Discrete Applied Math,Volume 217, Part 2, 30 January 2017, Pages 163–174.

# N. Gastineau, O. Togni, [[http://www.sciencedirect.com/science/article/pii/S0012365X1630111X |S-Packing Colorings of Cubics Graphs]], Discrete Math., 339 (10), pp.2461-2470,  2016. Also on [[http://arxiv.org/abs/1403.7495| arXiv:1403.7495]]

# B. Effantin, N. Gastineau, O. Togni, [[http://www.sciencedirect.com/science/article/pii/S0012365X16300565 | A characterization of b-chromatic and partial Grundy numbers by induced subgraphs]], Discrete Math., 339 (8), 2157-2167, 2016.Also on [[http://arxiv.org/abs/1505.07780 | arXiv:1505.07780]]

# Hajer BARGAOUI, Nader MBAREK, Olivier TOGNI, and Mounir Frikha, [[http://link.springer.com/article/10.1007/s11276-015-1091-0 | Hybrid QoS based routing protocol for inter and intra wireless mesh infrastructure communications]], J. Wireless Networks, published online, 2015

# 1. M. Hamze, N. Mbarek, O. Togni, « Broker and Federation Based Cloud Networking Architecture for IaaS and NaaS QoS Guarentee », 13th Annual IEEE Consumer Communications & Networking Conference, CCNC 2016, Las-Vegas, 9-12 Jan. 2016.

# 2. H.Bargaoui, N.Mbarek, O.Togni, M.Frikha , “IMRR and IMPR Routing Protocols For Inter and Intra Wireless Mesh Communications”, CFIP-NOTERE 2015 , Paris , Juillet 2015.

# 3. N. Gastineau, P. Holub, O. Togni, Packing chromatic number in outerplanar graphs with maxdegree 3, Fifth International Conference on Combinatorics, Graph Theory, and Applications, Elgersburg, Germany, 2015.

# N. Gastineau, O. Togni, [[http://www.sciencedirect.com/science/article/pii/S0012365X1630111X |S-Packing Colorings of Cubics Graphs]], Discrete Math., 339 (10), pp.2461-2470,  2016. Also on [[http://arxiv.org/abs/1403.7495| Arxiv:1403.7495]]

# B. Effantin, N. Gastineau, O. Togni, [[http://www.sciencedirect.com/science/article/pii/S0012365X16300565 | A characterization of b-chromatic and partial Grundy numbers by induced subgraphs]], Discrete Math., 339 (8), 2157-2167, 2016.Also on [[http://arxiv.org/abs/1505.07780 | Arxiv:1505.07780]]

#    H. Kheddouci and O. Togni, Bounds for minimum feedback vertex sets in distance graphs and circulant graphs. Discrete Math. and Theoretical Computer Science,  Vol. 10(1):57-70, 2008. [[http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/download/494/2185 |pdf]]

# B. Darties, N. Gastineau, O. Togni, Completely Independent Spanning Trees in Some Regular Graphs, Discrete Applied Math, accepted, 2016.

# Hajer BARGAOUI, Nader MBAREK, Olivier TOGNI, and Mounir Frikha, Hybrid QoS based routing protocol for inter and intra wireless mesh infrastructure communications, J. Wireless Networks, [[http://link.springer.com/article/10.1007/s11276-015-1091-0 | published online]], 2015

# N. Gastineau, O. Togni, S-Packing Colorings of Cubics Graphs, Discrete Math., accepted, 2016. [[http://arxiv.org/abs/1403.7495| Arxiv:1403.7495]]

# B. Effantin, N. Gastineau, O. Togni, A characterization of b-chromatic and partial Grundy numbers by induced subgraphs, Discrete Math., accepted, 2016.[[http://arxiv.org/abs/1505.07780 | Arxiv:1505.07780]]
# Y. Aubry, J.C. Godin, O. Togni, Free choosability of outerplanar graphs, Graphs and Combinatorics,32(3), 851-859, 2016 [[ http://link.springer.com/article/10.1007/s00373-015-1625-3/fulltext.html | online]]

# N. Gastineau, O. Togni, S-Packing Colorings of Cubics Graphs, Discrete Math., accepted, 2016.

# B. Effantin, N. Gastineau, O. Togni, A characterization of b-chromatic and partial Grundy numbers by induced subgraphs, Discrete Math., accepted, 2016.

# Y. Aubry, J.C. Godin, O. Togni, Free choosability of outerplanar graphs, Graphs and Combinatorics, [[ http://link.springer.com/article/10.1007/s00373-015-1625-3/fulltext.html | published online]], 2015

# Y. Aubry, J.C. Godin, O. Togni, Free choosability of outerplanar graphs, Graphs and Combinatorics, published online,[[ http://link.springer.com/article/10.1007/s00373-015-1625-3/fulltext.html | springer]] , 2015

# Hajer BARGAOUI, Nader MBAREK, Olivier TOGNI, and Mounir Frikha, Hybrid QoS based routing protocol for inter and intra wireless mesh infrastructure communications, J. Wireless Networks, published online, [[http://link.springer.com/article/10.1007/s11276-015-1091-0 | springer]], 2015

# Y. Aubry, J.C. Godin, O. Togni, Free choosability of outerplanar graphs, Graphs and Combinatorics, to be published, 2015

# Hajer BARGAOUI, Nader MBAREK, Olivier TOGNI, and Mounir Frikha, “HQMR: Hybrid QoS based Routing Protocol for Wireless Mesh Environment,” Int. J. Adv. Netw. Serv., vol. 8, no. 1&2, pp. 27–41, 2015.

# Hajer BARGAOUI, Nader MBAREK, Olivier TOGNI, and Mounir Frikha, “HQMR: Hybrid QoS based Routing Protocol for Wireless Mesh Environment,” Int. J. Adv. Netw. Serv., vol. 8, no. 1&2, pp. 27–
41, 2015.

# Hajer BARGAOUI, Nader MBAREK, Olivier TOGNI, and Mounir Frikha, “HQMR: Hybrid QoS based
Routing Protocol for Wireless Mesh Environment,” Int. J. Adv. Netw. Serv., vol. 8, no. 1&2, pp. 27–

# N. Gastineau, H. Kheddouci, O. Togni, Subdivision into i-packings and S-packing chromatic number of some lattices, [[ http://amc-journal.eu/index.php/amc/article/download/436/840| pdf]], Ars Mathematica Contemporanea, 9:331-354, 2015.

#    H. Kheddouci and O. Togni, Bounds for minimum feedback vertex sets in distance graphs and circulant graphs. Discrete Math. and Theoretical Computer Science,  Vol.  [[http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/494/2185 |10(1):57-70]], 2008.

# N. Gastineau, H. Kheddouci, O. Togni, Subdivision into i-packings and S-packing chromatic number of some lattices, [[ http://amc-journal.eu/index.php/amc/article/view/436/840| Arxiv:1505.07781]], Ars Mathematica Contemporanea, 9:331-354, 2015.

# N. Gastineau, H. Kheddouci, O. Togni, Subdivision into i-packings and S-packing chromatic number of some lattices, [[ http://arxiv.org/abs/1505.07781| Arxiv:1505.07781]], Ars Mathematica Contemporanea, 9:331-354, 2015.

# N. Gastineau, H. Kheddouci, O. Togni, Subdivision into i-packings and S-packing chromatic number of some lattices, [[ http://arxiv.org/abs/1505.07781| Arxiv:1505.07781]], Ars Mathematica Contemporanea, to be published, 2015.

#    H. Kheddouci and O. Togni, Bounds for minimum feedback vertex sets in distance graphs and circulant graphs. [[http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/494/2185 | Discrete Math. and Theoretical Computer Science]],  Vol. 10(1):57-70, 2008.

#    O. Togni, Strong chromatic index of products of graphs, Discrete Math. and Theoretical Computer Science, Vol. 9(1): 47-56, 2007.

#    M. Kchikech and O. Togni, Approximation algorithms for multicoloring powers of square and triangular meshes, Discrete Math. and Theoretical Computer Science, Vol. 8 (1):159-172, 2006.

#    J-L. Baril, H. Kheddouci and O. Togni, Adjacent Vertex Distinguishing Edge-Colorings of Meshes. Australasian Journal of Combinatorics, 35:89-102, 2006.

#    J-L. Baril, H. Kheddouci and O. Togni, The Irregularity Strength of Circulant Graphs. Discrete Math., 304 (1-3):1-10, 2005.

#    R. Khennoufa and O. Togni, A Note on Radio Antipodal Colouring of Paths. Mathematica Bohemica, 130 (3):277-282, 2005.

#    R. Khennoufa and O. Togni, The radio antipodal and radio numbers of the hypercube, Ars Combinatoria, 102 , pp. 447-461, 2011. [[http://o.togni.u-bourgogne.fr/KhennoufaAntipodal.pdf | pdf]]

#    R. Khennoufa and O. Togni, Total and fractional total colourings of circulant graphs, Discrete Mathematics, 338 (24): 6316 - 6329 ,  2008. [[http://o.togni.u-bourgogne.fr/KhennoufaTotal.pdf.pdf | pdf]]

#    M. Kchikech, R. Khennoufa and O. Togni, Radio k-Labelings for Cartesian Products of Graphs, Discuss. Math. - Graph Theory, 28(1): 165-178, 2008.

#    H. Kheddouci and O. Togni, Bounds for minimum feedback vertex sets in distance graphs and circulant graphs. Discrete Math. and Theoretical Computer Science,  Vol. 10(1):57-70, 2008.

#    M. Kchikech, R. Khennoufa and O. Togni, Linear and cyclic radio k-labelings of trees, Discuss. Math. - Graph Theory, 27 (1):105-123, 2007.

#    Y. Aubry, J.-C. Godin and O. Togni, Vectorial Solutions to List Multicoloring Problems on Graphs, Advances and Applications in Discrete Mathematics, 9(2), pp. 65-81, 2012.

#    R. Khennoufa and O. Togni, The radio antipodal and radio numbers of the hypercube, Ars Combinatoria, 102 , pp. 447-461, 2011.

#    J-L. Baril and O. Togni, Neighbor-Distinguishing k-tuple Edge-Colorings of Graphs, Discrete Mathematics, 309, pp. 5147-5157, 2009.

#    R. Khennoufa and O. Togni, Total and fractional total colourings of circulant graphs, Discrete Mathematics, 338 (24): 6316 - 6329 , 2008.

#    R. Čada, J. Ekstein, P. Holub, O. Togni, Radio Labelings of Distance Graphs, arXiv:1207.4219, Discrete Applied Math., 161(18), pp. 2876–2884, 2013.

#  J-L. Baril, H. Kheddouci and O. Togni, Vertex Distinguishing Edge- and Total-Colorings of Cartesian and other Product Graphs, Ars Combinatoria, 107, pp. 109-127, 2012.

#  N. Gastineau B. Effantin and O. Togni,

# N. Gastineau, H. Kheddouci, O. Togni, Subdivision into i-packings and S-packing chromatic number of some lattices, [[ http://arxiv.org/abs/1505.07781| Arxiv:1505.07781]], Ars Mathematica Contemporana, to be published, 2015.

# N. Gastineau, H. Kheddouci, O. Togni, Subdivision into i-packings and S-packing chromatic number of some lattices, Ars Mathematica Contemporana, to be published, 2015. [[ http://arxiv.org/abs/1505.07781| pdf]]

#  N. Gastineau, H. Kheddouci, O. Togni, On the family of r-regular graphs with Grundy number r + 1, [[http:arXiv.org/abs/1312.6503 | pdf]], Discrete Math., 328:5-15, 2014.

# Ahmad Rahil, Nader Mbarek, Olivier Togni, Mirna Atieh, Integrated Fuzzy Solution for Network Selection using MIH in Heterogeneous Environment,International journal on advances in networks and services 6, 3&4(2013) 175-187, 2013 lien sur HAL.

#  N. Gastineau, H. Kheddouci, O. Togni, On the family of r-regular graphs with Grundy number r + 1, [[arXiv:1312.6503]], Discrete Math., 328:5-15, 2014.

# J. Ekstein, P. Holub, O. Togni, The Packing Coloring of Distance Graphs D(k,t) , [[http://arxiv.org/pdf/ | arXiv:1302.0721]], Discrete Applied Math., Volume 167, pp. 100-106 ,2014.

# O. Togni, On Packing Colorings of Distance Graphs, arXiv:1011.0971, hal-00531583, Discrete Applied Math., Volume 167, pp. 280–289, 2014.

# Y. Aubry, J.-C. Godin and O. Togni, Every triangle-free induced subgraph of the triangular lattice is (5m,2m)-choosable, arXiv:1110.2650, Discrete Applied Math., Volume 166, pp. 51-58, 2014.

# N. Gastineau, H. Kheddouci, O. Togni, Subdivision into i-packings and S-packing chromatic number of some lattices, Ars Mathematica Contemporana, to be published, 2015.

!!'''Conferences'''

'''International conferences'''

#    O. Togni, Irregularity strength of the toroidal grid. 5i?e Colloque International de Th?rie des Graphes et Combinatoire, Luminy, 1995.

# J. Ekstein, P. Holub, O. Togni, The Packing Coloring of Distance Graphs D(k,t) , [[http://arxiv.org | arXiv:1302.0721]], Discrete Applied Math., Volume 167, pp. 100-106 ,2014.

# J. Ekstein, P. Holub, O. Togni, The Packing Coloring of Distance Graphs D(k,t) , [[arXiv:1302.0721]], Discrete Applied Math., Volume 167, pp. 100-106 ,2014.

# J. Ekstein, P. Holub, O. Togni, The Packing Coloring of Distance Graphs D(k,t) , arXiv:1302.0721, Discrete Applied Math., Volume 167, pp. 100-106 ,2014.

#  N. Gastineau, H. Kheddouci, O. Togni, On the family of r-regular graphs with Grundy number r + 1, arXiv:1312.6503, Discrete Math., 328:5-15, 2014.

N. Gastineau, O. Togni, S-Packing Colorings of Cubics Graphs, 2014.
*

# N. Gastineau, H. Kheddouci, O. Togni, Subdivision into i-packings and S-packing chromatic number of some lattices, Ars Mathematica Contemportana, to be published, 2015.

* N. Gastineau, O. Togni, S-Packing Colorings of Cubics Graphs, 2014.
* N. Gastineau, H. Kheddouci, O. Togni, Subdivision into i-packings and S-packing chromatic number of some lattices, 2013.

#    A. Rahil, N. Mbarek, O. Togni, Smart Network Selection and Packet Loss Improvement during Handover in Heterogeneous Environment, in Proc. of ICNS 2013, Lisbon, march 2013.

*  N. Gastineau, H. Kheddouci, O. Togni, On the family of r-regular graphs with Grundy number r + 1, 2013.

#  J. Ekstein, P. Holub, O. Togni, The Packing Coloring of Distance Graphs D(k,t), arXiv:1302.0721 [math.CO], to be published in Discrete Applied Math., 2013.

#    O. Togni, On Packing Colorings of Distance Graphs, arXiv:1011.0971, hal-00531583, to be published in Discrete Applied Math., 2013.

#    Y. Aubry, J.-C. Godin and O. Togni, Every triangle-free induced subgraph of the triangular lattice is (5m,2m)-choosable, arXiv:1110.2650, to be published in Discrete Applied Math., 2013.