Thèse
Algorithme et structure de données
Affichage des résultats 1 à 12 sur 53 au total
Algorithme et structure de données : 1 à 12 sur 53 au total
-
-
Thèse
Loric Duhaze-Pradines. Reachability problems for general rotor walks in graphs. Computer Science and Game Theory [cs.GT]. Université Paris-Saclay, 2023. English. ⟨NNT : 2023UPASG051⟩. ⟨tel-04504876⟩
-
Communication dans un congrès
George Manoussakis. An output sensitive algorithm for maximal clique enumeration in sparse graphs. International Symposium on Parameterized and Exact Computation, Sep 2017, Vienna, Austria. ⟨hal-01687111⟩
-
Communication dans un congrès
Fabien Dufoulon, Janna Burman, Joffroy Beauquier. Can Uncoordinated Beeps tell Stories?. ACM Symposium on Principles of Distributed Computing (PODC), Aug 2020, Virtual, Italy. ⟨hal-02860827v2⟩
-
Communication dans un congrès
Andreas Bärtschi, Evangelos Bampas, Jérémie Chalopin, Shantanu Das, Christina Karousatou, et al.. Near-Gathering of Energy-Constrained Mobile Agents. 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2019), Jul 2019, L'Aquila, Italy. pp.52-65, ⟨10.1007/978-3-030-24922-9/_4⟩. ⟨hal-02351154⟩
-
Communication dans un congrès
Benoit Groz, Tova Milo. Skyline Queries with Noisy Comparisons. ACM SIGMOD/PODS, May 2015, Melbourne, Australia. ⟨10.1145/2745754.2745775⟩. ⟨hal-01146568⟩
-
Communication dans un congrès
Pierre Bergé, Jason Crampton, Gregory Gutin, Rémi Watrigant. The Authorization Policy Existence Problem. CODASPY: Conference on Data and Application Security and Privacy, Mar 2017, Scottsdale, United States. pp.163-165, ⟨10.1145/3029806.3029844⟩. ⟨hal-01995978⟩
-
Communication dans un congrès
Dimitri Watel, Marc-Antoine Weisser, Dominique Barth. Parameterized complexity and approximability of coverability problems in weighted Petri nets. International Conference on Application and Theory of Petri Nets and Concurrency, Jun 2017, Zaragoza, Spain. pp.330-349, ⟨10.1007/978-3-319-57861-3_19⟩. ⟨hal-01459206⟩
-
Article dans une revue
Stefi Nouleho Ilemo, Dominique Barth, Olivier David, Franck Quessette, Marc-Antoine Weisser, et al.. Improving graphs of cycles approach to structural similarity of molecules. PLoS ONE, 2019, 14 (12), pp.e0226680. ⟨10.1371/journal.pone.0226680⟩. ⟨hal-04113953⟩
-
Article dans une revue
Kaourintin Le Guiban, Arpad Rimmel, Marc-Antoine Weisser, Joanna Tomasik. The First Approximation Algorithm for the Maximin Latin Hypercube Design Problem. Operations Research, 2018, 66 (1), pp.253-266. ⟨10.1287/opre.2017.1665⟩. ⟨hal-04379112⟩
-
Communication dans un congrès
Pierre Bergé, Julien Hemery, Arpad Rimmel, Joanna Tomasik. The Competitiveness of Randomized Strategies for Canadians via Systems of Linear Inequalities. International Symposium on Computer and Information Sciences, Sep 2018, Poznań, Poland. pp.96-103, ⟨10.1007/978-3-030-00840-6_11⟩. ⟨hal-04379165⟩
-
Article dans une revue
Mohamed Lamine Lamali, Nasreddine Fergani, Johanne Cohen. Algorithmic and complexity aspects of path computation in multi-layer networks. IEEE/ACM Transactions on Networking, In press, 26 (6), pp.2787 - 2800. ⟨hal-01706362v2⟩