Filtrer vos résultats
- 147
- 30
- 95
- 76
- 4
- 1
- 1
- 171
- 12
- 2
- 4
- 4
- 6
- 4
- 12
- 7
- 10
- 2
- 12
- 12
- 10
- 14
- 5
- 5
- 9
- 15
- 12
- 7
- 3
- 9
- 5
- 6
- 2
- 1
- 1
- 165
- 12
- 98
- 81
- 19
- 4
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 177
- 32
- 22
- 15
- 11
- 8
- 7
- 7
- 6
- 6
- 6
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
177 résultats
Spectral Graph Approach for Process Model MatchmakingIEEE 10th International Conference on Services Computing (SCC), Jun 2013, Santa Clara Marriott, CA, USA (Center of Silicon Valley), United States. pp.408-415
Communication dans un congrès
hal-01339191v1
|
|||
|
|
A heuristic algorithm for a vehicle routing problem with pickup & delivery and synchronization constraints9th International Network Optimization Conference (INOC), Jun 2019, Avignon, France. ⟨10.5441/002/inoc.2019.21⟩
Communication dans un congrès
hal-02155536v1
|
||
A Generative Time Series Clustering Framework Based on an Ensemble Mixture of HMMsICTAI: International Conference on Tools with Artificial Intelligence, Nov 2020, Online, France. ⟨10.1109/ICTAI50040.2020.00126⟩
Communication dans un congrès
hal-02942474v1
|
|||
|
|
Gap vertex-distinguishing edge colorings of graphs.Discrete Mathematics, 2012, 20, 312, pp.3011-3025. ⟨10.1016/j.disc.2012.06.019⟩
Article dans une revue
hal-01353069v1
|
||
|
|
[1,2]-Domination in Generalized Petersen Graphs2019
Pré-publication, Document de travail
hal-02166989v1
|
||
A O ( m ) Self-Stabilizing Algorithm for Maximal Triangle Partition of General GraphsParallel Processing Letters, 2017, 27 (02), ⟨10.1142/S0129626417500049⟩
Article dans une revue
hal-01653868v1
|
|||
Sum coloring of distance and circulant graphs7th International Colloquium on Graph Theory, 2005, Hyères, France. pp.239-244
Communication dans un congrès
hal-00174206v1
|
|||
[r,s,t]-coloring of Trees and Bipartite graphsBritish Combinatorial Conference 2007, BCC'2007, 2007, Reading, United Kingdom. pp.000
Communication dans un congrès
hal-00192135v1
|
|||
A Dual of 4-regular graph for GxC2nJournal of Discrete Mathematical Sciences and Cryptography, 2001, 6 (1), pp.85-96
Article dans une revue
hal-00188437v1
|
|||
Packing two copies of a tree into its fourth powerDiscrete Mathematics, 2000, 213 (1-3), pp.169-178
Article dans une revue
hal-00188438v1
|
|||
Embedding Plane Graphs in the GridsThe 9th International Conference on Information Visualisation IV05, 2005, Londres, United Kingdom. pp.670-675
Communication dans un congrès
hal-00188507v1
|
|||
The Minimum Feedback Vertex Set for the Kronecker Product of a Cubic Graph By a Complete GraphInternational Network Optimization Conference (INOC2005), 2005, Lisbonne, Portugal. pp.000
Communication dans un congrès
hal-00188510v1
|
|||
Adjacent vertex distinguishing edge-colorings of meshes and hypercubesThe Australasian Journal of Combinatorics, 2006, 35, pp.89-102
Article dans une revue
hal-00188388v1
|
|||
Web Service Matchmaking by Subgraph MatchingFilipe and J. Cordeiro Web Information Systems and Technologies, Springer-Verlag, pp.43-56, 2012
Chapitre d'ouvrage
hal-01353085v1
|
|||
Robustness Study of Emerged Communities from Exchanges in Peer-to-peer NetworksComputer Communications, 2013, 10-11, 36, pp.1145-1158
Article dans une revue
hal-01339170v1
|
|||
Partially Square Graphs, Hamiltonicity and Circumference IIColloque International de Graphes et Combinatoire, 2000, marseille, France. pp.000
Communication dans un congrès
hal-00192125v1
|
|||
On the packing of three graphsthe Third Krakow Conference on Graph Theory, 1997, Kazimierz, Poland. pp.000
Communication dans un congrès
hal-00192130v1
|
|||
Remarks on the Partially Square Graphs, Hamiltonicity and CircumferenceDiscussiones Mathematicae Graph Theory, 2001, 21 (1), pp.255-266
Article dans une revue
hal-00188434v1
|
|||
Mobility impact on routing protocols in mobile ad hoc networksIEEE 7th International Conference on Computer and Information Technology – IEEE CIF 2007, Oct 2007, Fukushima, Japan. pp.10
Communication dans un congrès
hal-00188497v1
|
|||
A Distributed Fully Dynamic Algorithm for Maintaining a Minimal Feedback Vertex Set in a GraphInternational Network Optimization Conference 2007 (INOC 2007), Apr 2007, Belgium. pp.12
Communication dans un congrès
hal-00188504v1
|
|||
On the packing of trees into their powerEuroconference on Combinatorics, Graph Theory and Applications, 2001, Spain. pp.000
Communication dans un congrès
hal-00188526v1
|
|||
|
|
Message Correlation and Business Protocol Discovery in Service Interaction Logsinternational conference on Advanced Information Systems Engineering (CAISE), Jun 2008, Montpellier, France. pp.405 - 419, ⟨10.1007/978-3-540-69534-9_31⟩
Communication dans un congrès
hal-00385436v1
|
||
Vertex Distinguishing Edge- and Total-Colorings of Cartesian and other Product GraphsArs Combinatoria, 2012, 107, pp.109-127
Article dans une revue
hal-00762728v1
|
|||
Packing of two copies of a caterpillar into its third powerDiscussiones Mathematicae Graph Theory, 2003, 23 (1), pp.105-115
Article dans une revue
hal-00188409v1
|
|||
|
|
Bounds for minimum feedback vertex sets in distance graphs and circulant graphsDiscrete Mathematics and Theoretical Computer Science, 2008, Vol. 10 no. 1 (1), pp.57--70. ⟨10.46298/dmtcs.417⟩
Article dans une revue
hal-00972307v1
|
||
Exact values for the b-chromatic number of a power complete k-ary treeJournal of Discrete Mathematical Sciences and Cryptography, 2005, 8 (1), pp.117-129
Article dans une revue
hal-00381210v1
|
|||
A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph9th International Conference on Distributed Computing and Networking (ICDCN 2008), 2008, India. pp.209-214
Communication dans un congrès
hal-00188342v1
|
|||
|
|
Double Total Dominator Chromatic Number of GraphsDiscussiones Mathematicae Graph Theory, 2022, 14(5): 2150154:1-2150154:27 (2022), ⟨10.7151/dmgt.2363⟩
Article dans une revue
hal-04106070v1
|
||
|
|
Complexity of Edge Monitoring on Some Graph Classes2019
Pré-publication, Document de travail
hal-02167603v1
|
||
|
|
Propagation d’événements dans un graphe économiqueExtraction et Gestion des connaissances (EGC), Jan 2019, Metz, France. pp.315-320
Communication dans un congrès
hal-02096635v1
|