Olivier Togni

Discuss. Math. Graph Theory, 2023

Air Transportation Network Backbone Extraction: A Comparative Analysis of Structural Filtering Techniques.

[BibT_eX]

[DOI]

Proceedings of the Computational Data and Social Networks - 12th International Conference, 2023

A Modular Network Exploration of Backbone Extraction Techniques.

[BibT_eX]

[DOI]

Proceedings of the Complex Networks & Their Applications XII, 2023

2022

Hypergraphs with Polynomial Representation: Introducing r-splits.

[BibT_eX]

[DOI]

CoRR, 2022

S-Packing Coloring of Cubic Halin Graphs.

[BibT_eX]

[DOI]

Batoul Tarhini

CoRR, 2022

On List Coloring with Separation of the Complete Graph and Set System Intersections.

[BibT_eX]

[DOI]

Rémi Grisot

CoRR, 2022

Leader election and local identifiers for three-dimensional programmable matter.

[BibT_eX]

[DOI]

Concurr. Comput. Pract. Exp., 2022

Air Transport Network: A Comparison of Statistical Backbone Filtering Techniques.

[BibT_eX]

[DOI]

Proceedings of the Complex Networks and Their Applications XI, 2022

Exploring Statistical Backbone Filtering Techniques in the Air Transportation Network.

[BibT_eX]

[DOI]

Proceedings of the IEEE Workshop on Complexity in Engineering, 2022

2021

A Self-Optimizing QoS-Based Access for IoT Environments.

[BibT_eX]

[DOI]

Wirel. Pers. Commun., 2021

Optimised disjoint virtual backbone algorithms for wireless sensor networks.

[BibT_eX]

[DOI]

Simon T. Obenofunde

Wahabou Abdou

IET Wirel. Sens. Syst., 2021

Coloring of the dth power of the face-centered cubic grid.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2021

Fuzzy Logic based model for self-optimizing energy consumption in IoT environment.

[BibT_eX]

[DOI]

Proceedings of the IEEE Wireless Communications and Networking Conference, 2021

2020

Leader Election And Local Identifiers For 3D Programmable Matter.

[BibT_eX]

[DOI]

CoRR, 2020

Construction of Disjoint Virtual Backbones for Wireless Sensor Networks.

[BibT_eX]

[DOI]

Simon T. Obenofunde

Wahabou Abdou

Proceedings of the icWCSN 2020: International Conference on Wireless Communication and Sensor Networks, 2020

IoT-MAAC: Multiple Attribute Access Control for IoT environments.

[BibT_eX]

[DOI]

Proceedings of the IEEE 17th Annual Consumer Communications & Networking Conference, 2020

2019

Exact Distance Graphs of Product Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2019

On S-packing edge-colorings of cubic graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

On the packing chromatic number of subcubic outerplanar graphs.

[BibT_eX]

[DOI]

Premysl Holub

Discret. Appl. Math., 2019

Fuzzy Logic Based Security Trust Evaluation for IoT Environments.

[BibT_eX]

[DOI]

Proceedings of the 16th IEEE/ACS International Conference on Computer Systems and Applications, 2019

2018

Almost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees.

[BibT_eX]

[DOI]

Benoît Darties

Discret. Appl. Math., 2018

Graph multicoloring reduction methods and application to McDiarmid-Reed's Conjecture.

[BibT_eX]

[DOI]

CoRR, 2018

Coloring of the dth power of the face-centered cubic grid.

[BibT_eX]

[DOI]

CoRR, 2018

Self-Configuring IoT Service QoS Guarantee Using QBAIoT.

[BibT_eX]

[DOI]

Comput., 2018

SREP: An Energy Efficient Relay Protocol for Wireless Sensor Networks.

[BibT_eX]

[DOI]

Simon T. Obenofunde

Wahabou Abdou

Proceedings of the 14th International Conference on Signal-Image Technology & Internet-Based Systems, 2018

IoT Service QoS Guarantee Using QBAIoT Wireless Access Method.

[BibT_eX]

[DOI]

Proceedings of the Mobile, Secure, and Programmable Networking, 2018

Distributed Leader Election and Computation of Local Identifiers for Programmable Matter.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2018

2017

Completely independent spanning trees in some regular graphs.

[BibT_eX]

[DOI]

Benoît Darties

Discret. Appl. Math., 2017

Completely independent spanning trees for enhancing the robustness in ad-hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the 13th IEEE International Conference on Wireless and Mobile Computing, 2017

Service level guarantee framework for IoT environments: full paper.

[BibT_eX]

[DOI]

Proceedings of the 1st International Conference on Internet of Things and Machine Learning, 2017

2016

Hybrid QoS based routing protocol for inter and intra wireless mesh infrastructure communications.

[BibT_eX]

[DOI]

Wirel. Networks, 2016

Free Choosability of Outerplanar Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2016

S-packing colorings of cubic graphs.

[BibT_eX]

[DOI]

Discret. Math., 2016

A characterization of b-chromatic and partial Grundy numbers by induced subgraphs.

[BibT_eX]

[DOI]

Brice Effantin

Discret. Math., 2016

QoS Multi-tree Based Routing Protocol for Inter-mesh Infrastructure Communications.

[BibT_eX]

[DOI]

Proceedings of the Wired/Wireless Internet Communications, 2016

Self-configuring multipath intra-mesh infrastructure QoS based routing.

[BibT_eX]

[DOI]

Proceedings of the 12th IEEE International Conference on Wireless and Mobile Computing, 2016

Broker and federation based Cloud networking architecture for IaaS and NaaS QoS guarantee.

[BibT_eX]

[DOI]

Mohamad Hamze

Proceedings of the 13th IEEE Annual Consumer Communications & Networking Conference, 2016

2015

Subdivision into i-packings and S-packing chromatic number of some lattices.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2015

IMRR and IMPR routing protocols for inter and intra wireless mesh Communications.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Protocol Engineering, 2015

QoS based routing protocol for intra-mesh infrastructure communications.

[BibT_eX]

[DOI]

Proceedings of the Global Summit on Computer & Information Technology, 2015

2014

On the family of r-regular graphs with Grundy number r+1.

[BibT_eX]

[DOI]

Discret. Math., 2014

On packing colorings of distance graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

The packing coloring of distance graphs D(k, t).

[BibT_eX]

[DOI]

Jan Ekstein

Premysl Holub

Discret. Appl. Math., 2014

Every triangle-free induced subgraph of the triangular lattice is (5m, 2m)-choosable.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Self-establishing a Service Level Agreement within autonomic cloud networking environment.

[BibT_eX]

[DOI]

Mohamad Hamze

Proceedings of the 2014 IEEE Network Operations and Management Symposium, 2014

Autonomic Brokerage Service for an End-to-End Cloud Networking Service Level Agreement.

[BibT_eX]

[DOI]

Mohamad Hamze

Proceedings of the IEEE 3rd Symposium on Network Cloud Computing and Applications, 2014

2013

Radio labelings of distance graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

2012

Vectorial solutions to list multicoloring problems on graphs

[BibT_eX]

[DOI]

CoRR, 2012

Vertex Distinguishing Edge- and Total-Colorings of Cartesian and other Product Graphs.

[BibT_eX]

Ars Comb., 2012

2011

The Radio Antipodal and Radio Numbers of the Hypercube.

[BibT_eX]

Ars Comb., 2011

2010

Extended core and choosability of a graph

[BibT_eX]

[DOI]

CoRR, 2010

Choosability of a weighted path and free-choosability of a cycle.

[BibT_eX]

[DOI]

CoRR, 2010

2009

l-distant Hamiltonian walks in Cartesian product graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Neighbor-distinguishing k-tuple edge-colorings of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2009

2008

Minimum Feedback Vertex Sets in Distance Graphs and Circulant Graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2008

Radio k--labelings for Cartesian products of graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2008

Total and fractional total colourings of circulant graphs.

[BibT_eX]

[DOI]

Discret. Math., 2008

Multilevel Bandwidth and Radio Labelings of Graphs.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, Second International Workshop, 2008

2007

Strong Chromatic Index of Products of Graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2007

Linear and cyclic radio k-labelings of trees.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2007

2006

Approximation Algorithms for Multicoloring Planar Graphs and Powers of Square and Triangular Meshes.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2006

Adjacent vertex distinguishing edge-colorings of meshes.

[BibT_eX]

[DOI]

Australas. J Comb., 2006

2005

Radio k-Labelings for Cartesian Products of Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

The irregularity strength of circulant graphs.

[BibT_eX]

[DOI]

Discret. Math., 2005

Frequency Assignment and Multicoloring Powers of Square and Triangular Meshes.

[BibT_eX]

[DOI]

Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

2003

Paths Coloring Algorithms in Mesh Networks.

[BibT_eX]

[DOI]

Proceedings of the Discrete Mathematics and Theoretical Computer Science, 2003

2001

Optical Routing of Uniform Instances in Cayley Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

All-to-all wavelength-routing in all-optical compound networks.

[BibT_eX]

[DOI]

Denise Amar

André Raspaud

Discret. Math., 2001

2000

Irregularity strength and compound graphs.

[BibT_eX]

[DOI]

Discret. Math., 2000

1998

Irregularity strength of trees.

[BibT_eX]

[DOI]

Denise Amar

Discret. Math., 1998

Optical All-to-All Communication in Inflated Networks.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998

1997

Irregularity strength of the toroidal grid.

[BibT_eX]

[DOI]