Filtrer vos résultats
- 22
- 16
- 24
- 11
- 1
- 1
- 1
- 1
- 38
- 1
- 1
- 5
- 1
- 1
- 2
- 1
- 5
- 5
- 8
- 4
- 2
- 2
- 32
- 5
- 1
- 29
- 11
- 4
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 38
- 16
- 8
- 6
- 5
- 5
- 4
- 3
- 3
- 3
- 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
38 résultats
|
|
triés par
|
|
Directed Louvain : maximizing modularity in directed networks[Research Report] Université d'Orléans. 2015
Rapport
hal-01231784v1
|
||
|
Algorithmes de noyau pour des problèmes d'édition de graphes et autres structuresAlgorithme et structure de données [cs.DS]. Université Montpellier II - Sciences et Techniques du Languedoc, 2011. Français. ⟨NNT : ⟩
Thèse
tel-00660089v1
|
||
|
Polynomial Kernels for 3-Leaf Power Graph Modification ProblemsDiscrete Applied Mathematics, 2010, 158 (16), pp.1732-1744. ⟨10.1016/j.dam.2010.07.002⟩
Article dans une revue
lirmm-00533517v1
|
||
|
A reliable and evolutive web application to detect social capitalistsASONAM 2015, Aug 2015, Paris, France
Communication dans un congrès
hal-01165487v1
|
||
|
SINr: Fast Computing of Sparse Interpretable Node Representations is not a Sin!Advances in Intelligent Data Analysis XIX, 19th International Symposium on Intelligent Data Analysis, IDA 2021, Apr 2021, Porto, Portugal. pp.325-337, ⟨10.1007/978-3-030-74251-5_26⟩
Communication dans un congrès
hal-03197434v1
|
||
Polynomial Kernels for 3-Leaf Power Graph Modification ProblemsIWOCA'09: International Workshop on Combinatorial Algorithms, pp.72-82
Communication dans un congrès
lirmm-00432664v1
|
|||
|
Exact algorithms for weak Roman dominationDiscrete Applied Mathematics, 2018, 248, pp.79-92. ⟨10.1016/j.dam.2017.09.015⟩
Article dans une revue
hal-01971124v1
|
||
Social capitalists on Twitter: detection, evolution and behavioral analysisSocial Network Analysis and Mining, 2014, 4 (1), pp.1-15. ⟨10.1007/s13278-014-0178-4⟩
Article dans une revue
hal-00968015v1
|
|||
Les capitalistes sociaux sur Twitter : détection via des mesures de similaritéEGC 2013, Jan 2013, Toulouse, France. pp.329-334
Communication dans un congrès
hal-00807822v1
|
|||
Linear vertex-kernels for several dense Ranking r-Constraint Satisfaction ProblemsTheory and Applications of Models of Computation (TAMC), May 2013, Hong Kong, Hong Kong SAR China. pp.306-318, ⟨10.1007/978-3-642-38236-9_28⟩
Communication dans un congrès
istex
hal-00942633v1
|
|||
Analysis of the dynamics and influence of the research work of Prof. Liu Zeyuan in China featuring a new hybrid approach combining community detection with topic trackingScientometrics, 2021, 126 (7), pp.6273-6300. ⟨10.1007/s11192-021-04010-0⟩
Article dans une revue
hal-03285158v1
|
|||
|
A community role approach to assess social capitalists visibility in the Twitter networkSocial Network Analysis and Mining, 2015, 5, pp.26:1-26-13. ⟨10.1007/s13278-015-0266-0⟩
Article dans une revue
hal-01163741v1
|
||
On the kernelization of ranking r-CSPs: Linear vertex-kernels for generalizations of Feedback Arc Set and Betweenness in tournamentsDiscrete Applied Mathematics, 2015, pp.10.1016/j.dam.2015.01.032. ⟨10.1016/j.dam.2015.01.032⟩
Article dans une revue
hal-01118888v1
|
|||
|
Polynomial kernels for Proper Interval Completion and related problemsInformation and Computation, 2013, 231, pp.89-108. ⟨10.1016/j.ic.2013.08.006⟩
Article dans une revue
hal-00942650v1
|
||
An $O(n^2)$-time algorithm for the minimal permutation completion problem41st International Workshop on Graph-Theoretic Concepts in Computer Science - WG 2015, 2015, Munich, Germany
Communication dans un congrès
hal-01242028v1
|
|||
|
Linear kernel for Rooted Triplet Inconsistency and other problems based on conflict packing techniqueJournal of Computer and System Sciences, 2016, 82 (2), ⟨10.1016/j.jcss.2015.08.002⟩
Article dans une revue
hal-01367979v1
|
||
A cubic vertex-kernel for Trivially Perfect Editing46th International Symposium on Mathematical Foundations of Computer Science, MFCS, Aug 2021, Tallinn, Estonia. pp.45:1--45:14
Communication dans un congrès
hal-03324798v1
|
|||
|
Polynomial Kernels for Proper Interval Completion and Related ProblemsFundamentals of Computation Theory 2011, Norway. pp.229-239
Communication dans un congrès
lirmm-00738226v1
|
||
|
Identification de rôles communautaires dans des réseaux orientés appliquée à Twitter14ème conférence Extraction et Gestion des Connaissances (EGC), Jan 2014, Rennes, France. pp.125-130
Communication dans un congrès
hal-00918175v1
|
||
|
Rôle communautaire des capitalistes sociaux dans Twitter4ème Conférence sur les modèles et l'analyse de réseaux : approches mathématiques et informatiques (MARAMI), Oct 2013, Saint-Étienne, France. pp.12
Communication dans un congrès
hal-00859779v1
|
||
|
An $O(n^2)$ time algorithm for the minimal permutation completion problemDiscrete Applied Mathematics, 2019, 254, pp.80-95. ⟨10.1016/j.dam.2018.06.036⟩
Article dans une revue
hal-01969498v1
|
||
Conflict Packing Yield Linear Vertex-Kernels for k- Fast, $k-Dense$ RTI and a Related Problem36th International Symposium on Mathematical Foundations of Computer Science (MFCS 2011), Aug 2011, Warsaw, Poland. pp.497-507, ⟨10.1007/978-3-642-22993-0_45⟩
Communication dans un congrès
istex
lirmm-00642335v1
|
|||
|
On the importance of considering social capitalism when measuring influence on TwitterBESC 2014 - International Conference on Behavioral, Economic, and Socio-Cultural Computing, Oct 2014, Shanghai, China. pp.1-7, ⟨10.1109/BESC.2014.7059501⟩
Communication dans un congrès
hal-01105133v1
|
||
|
On the (Non-)Existence of Polynomial Kernels for Pl -Free Edge Modification ProblemsIPEC 2010 - 5th International Symposium on Parameterized and Exact Computation, Dec 2010, Chennai, India. pp.147-157, ⟨10.1007/978-3-642-17493-3_15⟩
Communication dans un congrès
lirmm-00533519v1
|
||
Polynomial Kernels for Strictly Chordal Edge Modification Problems16th International Symposium on Parameterized and Exact Computation, IPEC, Sep 2021, Lisbonne (online), Portugal. pp.17:1--17:16
Communication dans un congrès
hal-03483395v1
|
|||
On graphs coverable by k shortest paths33rd International Symposium on Algorithms and Computation (ISAAC 2022), Dec 2022, Seoul, South Korea. pp.40:1--40:15, ⟨10.4230/LIPIcs.ISAAC.2022.40⟩
Communication dans un congrès
hal-03895886v1
|
|||
|
SocCap - Detection and Characterization of Social CapitalistsLogiciel hal-02178682v1 |
||
|
GeST: A New Image Segmentation Technique based on Graph EmbeddingVISAPP 2021, Feb 2021, Online Streaming, France. pp.245-252, ⟨10.5220/0010191502450252⟩
Communication dans un congrès
hal-03168420v1
|
||
Bringing a Feature Selection Metric from Machine Learning to Complex NetworksCOMPLEX NETWORKS 2018:The Seventh International Conference on Complex Networks & their Applications, Dec 2018, Cambridge, United Kingdom. pp.107-118, ⟨10.1007/978-3-030-05414-4_9⟩
Communication dans un congrès
hal-03250913v1
|
|||
Detecting Social Capitalists on Twitter Using Similarity MeasuresComplex Networks IV, 2013, Germany. pp.1-12, ⟨10.1007/978-3-642-36844-8_1⟩
Communication dans un congrès
istex
hal-00942668v1
|
- 1
- 2