Filter your results
- 16
- 4
- 17
- 6
- 4
- 3
- 3
- 3
- 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
- 1
- 1
- 20
- 3
- 1
- 17
- 4
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 18
- 18
- 17
- 17
- 17
- 17
- 6
- 4
- 4
- 4
- 4
- 4
- 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
- 1
- 1
- 1
- 1
- 20
- 17
- 3
- 1
- 6
- 1
- 2
- 7
- 2
- 1
|
|
sorted by
|
|
A Family of Tree-Based Generators for Bubbles in Directed GraphsIWOCA 2020 - 31st International Workshop on Combinatorial Algorithms, Jun 2020, Bordeaux, France. pp.17-29, ⟨10.1007/978-3-030-48966-3_2⟩
Conference papers
hal-02971154v1
|
||
Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental StudyWorkshop on Algorithm Engineering and Experiments, 2018, New Orleans, United States
Conference papers
hal-01925963v1
|
|||
|
Planar Reachability Under Single Vertex or Edge FailuresSODA 2021 - ACM-SIAM Symposium on Discrete Algorithms, Jan 2021, Alexandria, United States. pp.2739-2758, ⟨10.1137/1.9781611976465.163⟩
Conference papers
hal-03474039v1
|
||
Maximum colorful cliques in vertex-colored graphsCOCOON 2018 - 24th International Computing and Combinatorics Conference, Jul 2018, Qingdao, China. pp.480-491, ⟨10.1007/978-3-319-94776-1_40⟩
Conference papers
hal-01827893v1
|
|||
|
Approximating the smallest 2-vertex connected spanning subgraph of a directed graphTheoretical Computer Science, 2019, pp.1-16. ⟨10.1016/j.tcs.2019.09.040⟩
Journal articles
hal-02335015v1
|
||
|
Computing Vertex-Edge Cut-Pairs and 2-Edge Cuts in PracticeSEA 2021 - 19th International Symposium on Experimental Algorithms, Jun 2021, Nice, France. pp.1-19, ⟨10.4230/LIPIcs.SEA.2021.20⟩
Conference papers
hal-03395500v1
|
||
|
All-Pairs LCA in DAGs: Breaking through the $O ( n 2.5 )$ barrierSODA 2021 - ACM-SIAM Symposium on Discrete Algorithms, Jan 2021, Alexandria, United States. pp.273-289, ⟨10.1137/1.9781611976465.18⟩
Conference papers
hal-03474036v1
|
||
|
Design of Dynamic Algorithms via Primal-Dual MethodICALP 2018 - International Colloquium on Automata, Languages, and Programming, Jul 2015, Kyoto, Japan. pp.206-218, ⟨10.1007/978-3-662-47672-7_17⟩
Conference papers
hal-01964700v1
|
||
|
Computing the 4-Edge-Connected Components of a Graph: An Experimental StudyESA 2022 - 30th Annual European Symposium on Algorithms, 2022, Berlin/Potsdam, Germany. ⟨10.4230/LIPIcs.ESA.2022.60⟩
Conference papers
hal-03829988v1
|
||
Maximum Colorful Cycles in Vertex-Colored GraphsCSR 2018 - 13th International Computer Science Symposium in Russia, Jun 2018, Moscow, Russia. pp.106-117, ⟨10.1007/978-3-319-90530-3_10⟩
Conference papers
hal-01762581v1
|
|||
|
2-Vertex Connectivity in Directed GraphsInformation and Computation, 2018
Journal articles
hal-01925966v1
|
||
|
Decremental SPQR-trees for Planar GraphsEuropean Symposium on Algorithms, 2018, Helsinki, Finland
Conference papers
hal-01925961v1
|
||
|
Preventing Ransomware Attacks Through File System Filter DriversSecond Italian Conference on Cyber Security, 2018, Milan, Italy
Conference papers
hal-01925958v1
|
||
|
Strong Connectivity in Directed Graphs under Failures, with Applications *SIAM Journal on Computing, 2017, 49 (5), pp.1880 - 1899. ⟨10.1137/19M1258530⟩
Journal articles
hal-02957607v1
|
||
|
A family of tree-based generators for bubbles in directed graphsJournal of Graph Algorithms and Applications, 2021, 25 (1), pp.549-562. ⟨10.7155/jgaa.00572⟩
Journal articles
hal-03504540v1
|
||
|
Compressed Weighted de Bruijn GraphsCPM 2021 - 32nd Annual Symposium on Combinatorial Pattern Matching, Jul 2021, Wroclaw, Poland. pp.1-16, ⟨10.4230/LIPIcs.CPM.2021.16⟩
Conference papers
hal-03395413v1
|
||
|
Dynamic Algorithms for the Massively Parallel Computation ModelSPAA 2019 - 31st ACM Symposium on Parallelism in Algorithms and Architectures, Jun 2019, Phoenix, France. pp.49-58, ⟨10.1145/3323165.3323202⟩
Conference papers
hal-02335011v1
|
||
|
Incremental Strong Connectivity and 2-Connectivity in Directed GraphsLatin American Symposium on Theoretical Informatics, 2018, Buenos Aires, Argentina
Conference papers
hal-01925953v1
|
||
|
Computing the 4-Edge-Connected Components of a Graph in Linear TimeESA 2021 - 29th Annual European Symposium on Algorithms, Sep 2021, Lisbon, Portugal. pp.1-41
Conference papers
hal-03474050v1
|
||
|
On Bubble Generators in Directed GraphsWG 2017 - 43rd International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2017, Eindhoven, Netherlands. pp.18-31, ⟨10.1007/978-3-319-68705-6_2⟩
Conference papers
hal-01647516v1
|