 |
 |
 |
|
|
||
|---|---|---|
| lirmm-00738534v1
Conference papers
Parameterized Domination in Circle Graphs WG'12: 38th International Workshop on Graph Theoretic Concepts in Computer Science, Jun 2012, Jerusalem, Israel. pp.308-319, ⟨10.1007/978-3-642-34611-8_31⟩  |
||
| |
||
| inria-00073390v1
Reports
Improved Incremental Randomized Delaunay Triangulation. RR-3298, INRIA. 1997 |
||
| hal-01276903v1
Journal articles
ecceTERA: Comprehensive gene tree-species tree reconciliation using parsimony Bioinformatics, Oxford University Press (OUP), 2016, 32 (13), pp.2056-2058. ⟨10.1093/bioinformatics/btw105⟩ |
||
| hal-01071417v1
Directions of work or proceedings
Proceedings of the 1st workshop on Computational Methods for Structural RNAs Jossinet, Fabrice; Ponty, Yann; Waldispühl, Jérôme. France. McGill University, pp.76, 2014, 978-2-9550187-0-5. ⟨10.15455/CMSR.2014.0000⟩ |
||
| tel-03499342v2
Theses
Algorithmic investigations of the dynamics of species interactions Bioinformatics [q-bio.QM]. Université de Lyon, 2021. English. ⟨NNT : 2021LYSE1196⟩ |
||
| inria-00428685v1
Conference papers
Designing Hypergraph Layouts to GMPLS Routing Strategies SIROCCO, May 2009, Piran, Slovenia |
||
| hal-01632421v1
Conference papers
Verifying MPI Applications with SimGridMC Correctness 2017 - First International Workshop on Software Correctness for HPC Applications, Nov 2017, Denver, United States. pp.28-33, ⟨10.1145/3145344.3145345⟩ |
||
| hal-02957647v1
Conference papers
String Sanitization Under Edit Distance CPM 2020 - 31st Annual Symposium on Combinatorial Pattern Matching, Jun 2020, Copenhagen, Denmark. pp.1-14, ⟨10.4230/LIPIcs.CPM.2020.7⟩ |
||
| lirmm-01081429v1
Conference papers
From Indexing Data Structures to de Bruijn Graphs CPM: Combinatorial Pattern Matching, Moscow State University, Jun 2014, Moscow, Russia. pp.89-99, ⟨10.1007/978-3-319-07566-2_10⟩ |
||
| hal-01104587v3
Conference papers
Assessing the robustness of parsimonious predictions for gene neighborhoods from reconciled phylogenies ISBRA - 11th International Symposium on Bioinformatics Research and Applications - 2015, Jun 2015, Norfolk, Virginia, United States. pp.260--271, ⟨10.1007/978-3-319-19048-8_22⟩ |
||
| hal-01198994v1
Journal articles
Heuristic for Accelerating Run-Time Task Mapping in NoC-based Heterogeneous MPSoCs Journal of Digital Information Management, Digital Information Research Foundation, 2014, 12 (5), pp.298--308 |
||
| hal-03150807v1
Journal articles
Unified Polynomial Dynamic Programming Algorithms for P-Center Variants in a 2D Pareto Front Mathematics , MDPI, 2021, 9 (4), pp.453. ⟨10.3390/math9040453⟩  |
||
| inria-00071996v1
Reports
Computing shortest, fastest, and foremost journeys in dynamic networks RR-4589, INRIA. 2002 |
||
| inria-00071561v1
Reports
The Voronoi Diagram of Convex Objects in the Plane [Research Report] RR-5023, INRIA. 2003 |
||
| tel-00744247v1
Theses
Energy-aware scheduling : complexity and algorithms Other [cs.OH]. Ecole normale supérieure de lyon - ENS LYON, 2012. English. ⟨NNT : 2012ENSL0727⟩ |
||
| |
||
| inria-00072185v1
Reports
A Note on Models, Algorithms, and Data Structures for Dynamic Communication Networks [Research Report] RR-4403, INRIA. 2002 |
||
| hal-01661127v3
Reports
The Weakest Failure Detector to Solve the Mutual Exclusion Problem in an Unknown Dynamic Environment [Technical Report] LISTIC; Sorbonne Universités, UPMC Univ Paris 06, CNRS, LIP6 UMR 7606. 2018 |
||
| lirmm-01617207v1
Journal articles
Linking indexing data structures to de Bruijn graphs: Construction and update Journal of Computer and System Sciences, Elsevier, 2019, 104, pp.165-183. ⟨10.1016/j.jcss.2016.06.008⟩ |
||
| hal-02335028v1
Conference papers
Dominating Sets and Connected Dominating Sets in Dynamic Graphs STACS 2019 - 36th International Symposium on Theoretical Aspects of Computer Science, Mar 2019, Berlin, Germany. pp.1-17, ⟨10.4230/LIPIcs.STACS.2019.35⟩ |
||
| tel-02177304v2
Theses
Graceful Degradation and Speculation for Robots in Highly Dynamic Environments Distributed, Parallel, and Cluster Computing [cs.DC]. Sorbonne Université, 2019. English. ⟨NNT : 2019SORUS035⟩ |
||
| hal-02425599v1
Journal articles
Comparing Two Clusterings Using Matchings between Clusters of Clusters ACM Journal of Experimental Algorithmics, Association for Computing Machinery, 2019, 24 (1), pp.1-41. ⟨10.1145/3345951⟩ |
||
| hal-01410396v1
Reports
Clustering stability revealed by matchings between clusters of clusters [Research Report] RR-8992, Inria Sophia Antipolis; Université Côte d'Azur. 2016, pp.51 |
||
| hal-01205343v1
Conference papers
Just-in-Time Data Structures Proceedings of the 2015 ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming & Software, Oct 2015, Pittsburgh, PA, United States. ⟨10.1145/2814228.2814231⟩ |
||
| hal-00408054v1
Conference papers
Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO), May 2009, Piran, Slovenia. pp.129--144 |
||
| hal-00875487v1
Preprints, Working Papers, ...
What Makes Affinity-Based Schedulers So Efficient ? 2013 |
||
| hal-01415495v1
Preprints, Working Papers, ...
Multithreading approach to process real-time updates in KNN algorithms 2016 |
||
| tel-00429092v1
Theses
Optimization in Graphs under Degree Constraints. Application to Telecommunication Networks Mathematics [math]. Université Nice Sophia Antipolis; Universitat Politécnica de Catalunya, 2009. English |
||
| tel-00705141v1
Theses
Optimisation de la précision de calcul pour la réduction d'énergie des systèmes embarqués Traitement du signal et de l'image [eess.SP]. Université Rennes 1, 2011. Français. ⟨NNT : 2011REN1E009⟩ |
||
|
|
||
