Search - Université Clermont Auvergne Access content directly

Filter your results

10 Results
authFullName_s : Takeaki Uno

On the dualization in distributive lattices and related problems

Oscar Defrain , Lhouari Nourine , Takeaki Uno
Discrete Applied Mathematics, 2021, 300, pp.85-96. ⟨10.1016/j.dam.2021.04.018⟩
Journal articles hal-04045983v1

A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs

Mamadou Moustapha Kanté , Vincent Limouzy , Arnaud Mary , Lhouari Nourine , Takeaki Uno et al.
WG 2015: Graph-Theoretic Concepts in Computer Science, pp.138-153, 2016, ⟨10.1007/978-3-662-53174-7_11⟩
Book sections hal-02082337v1

Counting Minimal Dominating Sets

Mamadou Moustapha Kanté , Takeaki Uno
TAMC'17, 2017, Bern, Switzerland. pp.333-347, ⟨10.1007/978-3-319-55911-7_24⟩
Conference papers hal-01630342v1

Maximal strongly connected cliques in directed graphs: Algorithms and bounds

Alessio Conte , Mamadou Moustapha Kanté , Takeaki Uno , Kunihiro Wasa
Discrete Applied Mathematics, 2021, 303, pp.237-252. ⟨10.1016/j.dam.2020.05.027⟩
Journal articles hal-04056493v1

Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs

Mamadou Moustapha Kanté , Vincent Limouzy , Arnaud Mary , Lhouari Nourine , Takeaki Uno et al.
Algorithms and Data Structures (WADS), Aug 2015, Victoria, Canada. pp.446-457
Conference papers hal-01248851v1

On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs

Mamadou Moustapha Kanté , Vincent Limouzy , Arnaud Mary , Lhouari Nourine , Takeaki Uno et al.
Algorithms and Computation - 24th International Symposium, 2013, Hong Kong, China. pp.339--349, ⟨10.1007/978-3-642-45030-3_32⟩
Conference papers istex hal-02083525v1

Efficient enumeration of maximal k-degenerate induced subgraphs of a chordal graph

Alessio Conte , Mamadou Moustapha Kanté , Yota Otachi , Takeaki Uno , Kunihiro Wasa et al.
Theoretical Computer Science, 2020, 818, pp.2-11. ⟨10.1016/j.tcs.2018.08.009⟩
Journal articles hal-04056387v1
Image document

Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs

Alessio Conte , Roberto Grossi , Mamadou Moustapha Kanté , Andrea Marino , Takeaki Uno et al.
MFCS 2019 - 44th International Symposium on Mathematical Foundations of Computer Science, Aug 2019, Aachen, Germany. pp.1-14, ⟨10.4230/LIPIcs.MFCS.2019.73⟩
Conference papers hal-02335601v1

On Maximal Cliques with Connectivity Constraints in Directed Graphs

Alessio Conte , Mamadou Moustapha Kanté , Takeaki Uno , Kunihiro Wasa
28th International Symposium on Algorithms and Computation (ISAAC 2017), 2017, Phuket, Thailand. pp.23, ⟨10.4230/LIPIcs.ISAAC.2017.23⟩
Conference papers hal-01630384v1

Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph

Alessio Conte , Mamadou Moustapha Kanté , Yota Otachi , Takeaki Uno , Kunihiro Wasa et al.
Computing and Combinatorics - 23rd International Conference, {COCOON} 2017, Hong Kong, China, August 3-5, 2017, Proceedings, 2017, Hong Kong, China. pp.150-161, ⟨10.1007/978-3-319-62389-4_13⟩
Conference papers hal-01630354v1