Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Michel Habib
@article{DBLP:journals/amc/ChenHL24,
author = {Meirun Chen and
Michel Habib and
Cheng{-}Kuan Lin},
title = {A novel edge connectivity based on edge partition for hypercube and
folded hypercube},
journal = {Appl. Math. Comput.},
volume = {470},
pages = {128558},
year = {2024},
url = {https://doi.org/10.1016/j.amc.2024.128558},
doi = {10.1016/J.AMC.2024.128558},
timestamp = {Fri, 29 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/amc/ChenHL24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BergeDH24,
author = {Pierre Berg{\'{e}} and
Guillaume Ducoffe and
Michel Habib},
title = {Subquadratic-time Algorithm for the Diameter and all Eccentricities
on Median Graphs},
journal = {Theory Comput. Syst.},
volume = {68},
number = {1},
pages = {144--193},
year = {2024},
url = {https://doi.org/10.1007/s00224-023-10153-9},
doi = {10.1007/S00224-023-10153-9},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/BergeDH24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/order/DusartHC24,
author = {J{\'{e}}r{\'{e}}mie Dusart and
Michel Habib and
Derek G. Corneil},
title = {Maximal Cliques Lattices Structures for Cocomparability Graphs with
Algorithmic Applications},
journal = {Order},
volume = {41},
number = {1},
pages = {99--133},
year = {2024},
url = {https://doi.org/10.1007/s11083-023-09641-x},
doi = {10.1007/S11083-023-09641-X},
timestamp = {Sun, 05 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/order/DusartHC24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HabibMSZ24,
author = {Michel Habib and
Lalla Mouatadid and
{\'{E}}ric Sopena and
Mengchuan Zou},
title = {{\textbackslash}({\textbackslash}boldsymbol\{({\textbackslash}alpha,
{\textbackslash}beta )\}{\textbackslash})-Modules in Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {38},
number = {1},
pages = {566--589},
year = {2024},
url = {https://doi.org/10.1137/21m1443534},
doi = {10.1137/21M1443534},
timestamp = {Thu, 29 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/HabibMSZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/CharbitHMN23,
author = {Pierre Charbit and
Michel Habib and
Lalla Mouatadid and
Reza Naserasr},
title = {A new graph parameter to measure linearity},
journal = {J. Graph Theory},
volume = {103},
number = {3},
pages = {462--485},
year = {2023},
url = {https://doi.org/10.1002/jgt.22929},
doi = {10.1002/JGT.22929},
timestamp = {Sun, 10 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/CharbitHMN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tjs/ChenHL23,
author = {Meirun Chen and
Michel Habib and
Cheng{-}Kuan Lin},
title = {Diagnosability for a family of matching composition networks},
journal = {J. Supercomput.},
volume = {79},
number = {7},
pages = {7584--7608},
year = {2023},
url = {https://doi.org/10.1007/s11227-022-04949-8},
doi = {10.1007/S11227-022-04949-8},
timestamp = {Sun, 16 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tjs/ChenHL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sss/HabibNRV23,
author = {Michel Habib and
Minh{-}Hang Nguyen and
Mika{\"{e}}l Rabie and
Laurent Viennot},
editor = {Shlomi Dolev and
Baruch Schieber},
title = {Forbidden Patterns in Temporal Graphs Resulting from Encounters in
a Corridor},
booktitle = {Stabilization, Safety, and Security of Distributed Systems - 25th
International Symposium, {SSS} 2023, Jersey City, NJ, USA, October
2-4, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14310},
pages = {344--358},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-44274-2\_25},
doi = {10.1007/978-3-031-44274-2\_25},
timestamp = {Sun, 08 Oct 2023 13:20:04 +0200},
biburl = {https://dblp.org/rec/conf/sss/HabibNRV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-07666,
author = {Michel Habib and
Minh{-}Hang Nguyen and
Mika{\"{e}}l Rabie and
Laurent Viennot},
title = {Forbidden Patterns in Temporal Graphs Resulting from Encounters in
a Corridor},
journal = {CoRR},
volume = {abs/2302.07666},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.07666},
doi = {10.48550/ARXIV.2302.07666},
eprinttype = {arXiv},
eprint = {2302.07666},
timestamp = {Mon, 20 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-07666.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-11619,
author = {Guillaume Ducoffe and
Laurent Feuilloley and
Michel Habib and
Fran{\c{c}}ois Pitois},
title = {Pattern detection in ordered graphs},
journal = {CoRR},
volume = {abs/2302.11619},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.11619},
doi = {10.48550/ARXIV.2302.11619},
eprinttype = {arXiv},
eprint = {2302.11619},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-11619.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DucoffeHV22,
author = {Guillaume Ducoffe and
Michel Habib and
Laurent Viennot},
title = {Diameter, Eccentricities and Distance Oracle Computations on \emph{H}-Minor
Free Graphs and Graphs of Bounded (Distance) Vapnik-Chervonenkis Dimension},
journal = {{SIAM} J. Comput.},
volume = {51},
number = {5},
pages = {1506--1534},
year = {2022},
url = {https://doi.org/10.1137/20m136551x},
doi = {10.1137/20M136551X},
timestamp = {Mon, 07 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/DucoffeHV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChenCHL22,
author = {Hong Chen and
Meirun Chen and
Michel Habib and
Cheng{-}Kuan Lin},
title = {Connectivity for some families of composition networks},
journal = {Theor. Comput. Sci.},
volume = {922},
pages = {361--367},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.04.036},
doi = {10.1016/J.TCS.2022.04.036},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChenCHL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HabibMMZ22,
author = {Michel Habib and
Fabien de Montgolfier and
Lalla Mouatadid and
Mengchuan Zou},
title = {A general algorithmic scheme for combinatorial decompositions with
application to modular decompositions of hypergraphs},
journal = {Theor. Comput. Sci.},
volume = {923},
pages = {56--73},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.04.052},
doi = {10.1016/J.TCS.2022.04.052},
timestamp = {Mon, 27 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/HabibMMZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icprai/GacemHSBH22,
author = {Abderaouf Gacem and
Mohammed Haddad and
Hamida Seba and
Ga{\'{e}}tan Berthe and
Michel Habib},
editor = {Mounim A. El{-}Yacoubi and
Eric Granger and
Pong Chi Yuen and
Umapada Pal and
Nicole Vincent},
title = {Guiding Random Walks by Effective Resistance for Effective Node Embedding},
booktitle = {Pattern Recognition and Artificial Intelligence - Third International
Conference, {ICPRAI} 2022, Paris, France, June 1-3, 2022, Proceedings,
Part {I}},
series = {Lecture Notes in Computer Science},
volume = {13363},
pages = {665--676},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-09037-0\_54},
doi = {10.1007/978-3-031-09037-0\_54},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icprai/GacemHSBH22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BergeDH22,
author = {Pierre Berg{\'{e}} and
Guillaume Ducoffe and
Michel Habib},
editor = {Petra Berenbrink and
Benjamin Monmege},
title = {Subquadratic-Time Algorithm for the Diameter and All Eccentricities
on Median Graphs},
booktitle = {39th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2022, March 15-18, 2022, Marseille, France (Virtual Conference)},
series = {LIPIcs},
volume = {219},
pages = {9:1--9:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.STACS.2022.9},
doi = {10.4230/LIPICS.STACS.2022.9},
timestamp = {Sat, 12 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/BergeDH22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/DucoffeHV21,
author = {Guillaume Ducoffe and
Michel Habib and
Laurent Viennot},
title = {Fast Diameter Computation within Split Graphs},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {23},
number = {3},
year = {2021},
url = {https://doi.org/10.46298/dmtcs.6422},
doi = {10.46298/DMTCS.6422},
timestamp = {Tue, 31 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/DucoffeHV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DusartCH21,
author = {J{\'{e}}r{\'{e}}mie Dusart and
Derek G. Corneil and
Michel Habib},
title = {Corrigendum: LDFS-Based Certifying Algorithm for the Minimum Path
Cover Problem on Cocomparability Graphs},
journal = {{SIAM} J. Comput.},
volume = {50},
number = {3},
pages = {1148--1153},
year = {2021},
url = {https://doi.org/10.1137/20M1327835},
doi = {10.1137/20M1327835},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DusartCH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FeuilloleyH21,
author = {Laurent Feuilloley and
Michel Habib},
title = {Graph Classes and Forbidden Patterns on Three Vertices},
journal = {{SIAM} J. Discret. Math.},
volume = {35},
number = {1},
pages = {55--90},
year = {2021},
url = {https://doi.org/10.1137/19M1280399},
doi = {10.1137/19M1280399},
timestamp = {Thu, 29 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FeuilloleyH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lagos/BergeH21,
author = {Pierre Berg{\'{e}} and
Michel Habib},
editor = {Carlos E. Ferreira and
Orlando Lee and
Fl{\'{a}}vio Keidi Miyazawa},
title = {Diameter in linear time for constant-dimension median graphs},
booktitle = {Proceedings of the {XI} Latin and American Algorithms, Graphs and
Optimization Symposium, {LAGOS} 2021, Online Event / S{\~{a}}o Paulo,
Brazil, May 2021},
series = {Procedia Computer Science},
volume = {195},
pages = {97--107},
publisher = {Elsevier},
year = {2021},
url = {https://doi.org/10.1016/j.procs.2021.11.015},
doi = {10.1016/J.PROCS.2021.11.015},
timestamp = {Tue, 18 Jan 2022 09:21:02 +0100},
biburl = {https://dblp.org/rec/conf/lagos/BergeH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-08881,
author = {Michel Habib and
Lalla Mouatadid and
{\'{E}}ric Sopena and
Mengchuan Zou},
title = {({\(\alpha\)}, {\(\beta\)})-Modules in Graphs},
journal = {CoRR},
volume = {abs/2101.08881},
year = {2021},
url = {https://arxiv.org/abs/2101.08881},
eprinttype = {arXiv},
eprint = {2101.08881},
timestamp = {Sat, 30 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2101-08881.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-12150,
author = {Pierre Berg{\'{e}} and
Michel Habib},
title = {Diameter, radius and all eccentricities in linear time for constant-dimension
median graphs},
journal = {CoRR},
volume = {abs/2105.12150},
year = {2021},
url = {https://arxiv.org/abs/2105.12150},
eprinttype = {arXiv},
eprint = {2105.12150},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-12150.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2110-02709,
author = {Pierre Berg{\'{e}} and
Guillaume Ducoffe and
Michel Habib},
title = {Subquadratic-time algorithm for the diameter and all eccentricities
on median graphs},
journal = {CoRR},
volume = {abs/2110.02709},
year = {2021},
url = {https://arxiv.org/abs/2110.02709},
eprinttype = {arXiv},
eprint = {2110.02709},
timestamp = {Thu, 21 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2110-02709.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2112-00629,
author = {Laurent Feuilloley and
Michel Habib},
title = {Classifying grounded intersection graphs via ordered forbidden patterns},
journal = {CoRR},
volume = {abs/2112.00629},
year = {2021},
url = {https://arxiv.org/abs/2112.00629},
eprinttype = {arXiv},
eprint = {2112.00629},
timestamp = {Tue, 07 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2112-00629.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HabibM20,
author = {Michel Habib and
Lalla Mouatadid},
title = {Maximum Induced Matching Algorithms via Vertex Ordering Characterizations},
journal = {Algorithmica},
volume = {82},
number = {2},
pages = {260--278},
year = {2020},
url = {https://doi.org/10.1007/s00453-018-00538-5},
doi = {10.1007/S00453-018-00538-5},
timestamp = {Thu, 06 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HabibM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caldam/HabibMZ20,
author = {Michel Habib and
Lalla Mouatadid and
Mengchuan Zou},
editor = {Manoj Changat and
Sandip Das},
title = {Approximating Modular Decomposition Is Hard},
booktitle = {Algorithms and Discrete Applied Mathematics - 6th International Conference,
{CALDAM} 2020, Hyderabad, India, February 13-15, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12016},
pages = {53--66},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-39219-2\_5},
doi = {10.1007/978-3-030-39219-2\_5},
timestamp = {Tue, 28 Jan 2020 12:29:36 +0100},
biburl = {https://dblp.org/rec/conf/caldam/HabibMZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DucoffeHV20,
author = {Guillaume Ducoffe and
Michel Habib and
Laurent Viennot},
editor = {Shuchi Chawla},
title = {Diameter computation on \emph{H}-minor free graphs and graphs of bounded
(distance) VC-dimension},
booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
pages = {1905--1922},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611975994.117},
doi = {10.1137/1.9781611975994.117},
timestamp = {Thu, 15 Jul 2021 13:48:53 +0200},
biburl = {https://dblp.org/rec/conf/soda/DucoffeHV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ChepoiDHVA19,
author = {Victor Chepoi and
Feodor F. Dragan and
Michel Habib and
Yann Vax{\`{e}}s and
Hend Alrasheed},
title = {Fast approximation of eccentricities and distances in hyperbolic graphs},
journal = {J. Graph Algorithms Appl.},
volume = {23},
number = {2},
pages = {393--433},
year = {2019},
url = {https://doi.org/10.7155/jgaa.00496},
doi = {10.7155/JGAA.00496},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/ChepoiDHVA19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/EtesamiGHHNS19,
author = {Omid Etesami and
Narges Ghareghani and
Michel Habib and
Mohammad Reza Hooshmandasl and
Reza Naserasr and
Pouyeh Sharifani},
title = {When an optimal dominating set with given constraints exists},
journal = {Theor. Comput. Sci.},
volume = {780},
pages = {54--65},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2019.02.012},
doi = {10.1016/J.TCS.2019.02.012},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/EtesamiGHHNS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/DucoffeHV19,
author = {Guillaume Ducoffe and
Michel Habib and
Laurent Viennot},
editor = {Yingshu Li and
Mihaela Cardei and
Yan Huang},
title = {Fast Diameter Computation Within Split Graphs},
booktitle = {Combinatorial Optimization and Applications - 13th International Conference,
{COCOA} 2019, Xiamen, China, December 13-15, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11949},
pages = {155--167},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-36412-0\_13},
doi = {10.1007/978-3-030-36412-0\_13},
timestamp = {Thu, 12 Dec 2019 15:59:09 +0100},
biburl = {https://dblp.org/rec/conf/cocoa/DucoffeHV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/HabibMMZ19,
author = {Michel Habib and
Fabien de Montgolfier and
Lalla Mouatadid and
Mengchuan Zou},
editor = {Charles J. Colbourn and
Roberto Grossi and
Nadia Pisanti},
title = {A General Algorithmic Scheme for Modular Decompositions of Hypergraphs
and Applications},
booktitle = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
Pisa, Italy, July 23-25, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11638},
pages = {251--264},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-25005-8\_21},
doi = {10.1007/978-3-030-25005-8\_21},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/HabibMMZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-04385,
author = {Guillaume Ducoffe and
Michel Habib and
Laurent Viennot},
title = {Diameter computation on H-minor free graphs and graphs of bounded
(distance) VC-dimension},
journal = {CoRR},
volume = {abs/1907.04385},
year = {2019},
url = {http://arxiv.org/abs/1907.04385},
eprinttype = {arXiv},
eprint = {1907.04385},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-04385.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1910-03438,
author = {Guillaume Ducoffe and
Michel Habib and
Laurent Viennot},
title = {Fast Diameter Computation within Split Graphs},
journal = {CoRR},
volume = {abs/1910.03438},
year = {2019},
url = {http://arxiv.org/abs/1910.03438},
eprinttype = {arXiv},
eprint = {1910.03438},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1910-03438.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HabibN18,
author = {Michel Habib and
Lhouari Nourine},
title = {Representation of lattices via set-colored posets},
journal = {Discret. Appl. Math.},
volume = {249},
pages = {64--73},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2018.03.068},
doi = {10.1016/J.DAM.2018.03.068},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/HabibN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/ChepoiDHVA18,
author = {Victor Chepoi and
Feodor F. Dragan and
Michel Habib and
Yann Vax{\`{e}}s and
Hend Alrasheed},
editor = {Donghyun Kim and
R. N. Uma and
Alexander Zelikovsky},
title = {Fast Approximation of Centrality and Distances in Hyperbolic Graphs},
booktitle = {Combinatorial Optimization and Applications - 12th International Conference,
{COCOA} 2018, Atlanta, GA, USA, December 15-17, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11346},
pages = {3--18},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04651-4\_1},
doi = {10.1007/978-3-030-04651-4\_1},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/ChepoiDHVA18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-04660,
author = {Feodor F. Dragan and
Michel Habib and
Laurent Viennot},
title = {Revisiting Radius, Diameter, and all Eccentricity Computation in Graphs
through Certificates},
journal = {CoRR},
volume = {abs/1803.04660},
year = {2018},
url = {http://arxiv.org/abs/1803.04660},
eprinttype = {arXiv},
eprint = {1803.04660},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-04660.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-07232,
author = {Victor Chepoi and
Feodor F. Dragan and
Michel Habib and
Yann Vax{\`{e}}s and
Hend Al{-}Rasheed},
title = {Fast approximation of centrality and distances in hyperbolic graphs},
journal = {CoRR},
volume = {abs/1805.07232},
year = {2018},
url = {http://arxiv.org/abs/1805.07232},
eprinttype = {arXiv},
eprint = {1805.07232},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-07232.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1812-05913,
author = {Laurent Feuilloley and
Michel Habib},
title = {Graph classes and forbidden patterns on three vertices},
journal = {CoRR},
volume = {abs/1812.05913},
year = {2018},
url = {http://arxiv.org/abs/1812.05913},
eprinttype = {arXiv},
eprint = {1812.05913},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1812-05913.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DusartH17,
author = {J{\'{e}}r{\'{e}}mie Dusart and
Michel Habib},
title = {A new LBFS-based algorithm for cocomparability graph recognition},
journal = {Discret. Appl. Math.},
volume = {216},
pages = {149--161},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2015.07.016},
doi = {10.1016/J.DAM.2015.07.016},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/DusartH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/CharbitHMN17,
author = {Pierre Charbit and
Michel Habib and
Lalla Mouatadid and
Reza Naserasr},
editor = {Xiaofeng Gao and
Hongwei Du and
Meng Han},
title = {A New Graph Parameter to Measure Linearity},
booktitle = {Combinatorial Optimization and Applications - 11th International Conference,
{COCOA} 2017, Shanghai, China, December 16-18, 2017, Proceedings,
Part {II}},
series = {Lecture Notes in Computer Science},
volume = {10628},
pages = {154--168},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-71147-8\_11},
doi = {10.1007/978-3-319-71147-8\_11},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/CharbitHMN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/HabibM17,
author = {Michel Habib and
Lalla Mouatadid},
editor = {Yoshio Okamoto and
Takeshi Tokuyama},
title = {Maximum Induced Matching Algorithms via Vertex Ordering Characterizations},
booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC}
2017, December 9-12, 2017, Phuket, Thailand},
series = {LIPIcs},
volume = {92},
pages = {43:1--43:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.43},
doi = {10.4230/LIPICS.ISAAC.2017.43},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/HabibM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CharbitHMN17,
author = {Pierre Charbit and
Michel Habib and
Lalla Mouatadid and
Reza Naserasr},
title = {Towards {A} Unified View of Linear Structure on Graph Classes},
journal = {CoRR},
volume = {abs/1702.02133},
year = {2017},
url = {http://arxiv.org/abs/1702.02133},
eprinttype = {arXiv},
eprint = {1702.02133},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CharbitHMN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HabibM17,
author = {Michel Habib and
Lalla Mouatadid},
title = {Maximum Induced Matching Algorithms via Vertex Ordering Characterizations},
journal = {CoRR},
volume = {abs/1707.01245},
year = {2017},
url = {http://arxiv.org/abs/1707.01245},
eprinttype = {arXiv},
eprint = {1707.01245},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HabibM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CorneilDHMM16,
author = {Derek G. Corneil and
J{\'{e}}r{\'{e}}mie Dusart and
Michel Habib and
Antoine Mamcarz and
Fabien de Montgolfier},
title = {A tie-break model for graph search},
journal = {Discret. Appl. Math.},
volume = {199},
pages = {89--100},
year = {2016},
url = {https://doi.org/10.1016/j.dam.2015.06.011},
doi = {10.1016/J.DAM.2015.06.011},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CorneilDHMM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Cohen-AddadHM16,
author = {Vincent Cohen{-}Addad and
Michel Habib and
Fabien de Montgolfier},
title = {Algorithmic aspects of switch cographs},
journal = {Discret. Appl. Math.},
volume = {200},
pages = {23--42},
year = {2016},
url = {https://doi.org/10.1016/j.dam.2015.07.008},
doi = {10.1016/J.DAM.2015.07.008},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/Cohen-AddadHM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rairo/BaiouHN16,
author = {Mourad Ba{\"{\i}}ou and
Michel Habib and
Lhouari Nourine},
title = {Preface},
journal = {{RAIRO} Oper. Res.},
volume = {50},
number = {2},
pages = {221--222},
year = {2016},
url = {https://doi.org/10.1051/ro/2016004},
doi = {10.1051/RO/2016004},
timestamp = {Wed, 02 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rairo/BaiouHN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/CorneilDHK16,
author = {Derek G. Corneil and
J{\'{e}}r{\'{e}}mie Dusart and
Michel Habib and
Ekkehard K{\"{o}}hler},
title = {On the Power of Graph Searching for Cocomparability Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {30},
number = {1},
pages = {569--591},
year = {2016},
url = {https://doi.org/10.1137/15M1012396},
doi = {10.1137/15M1012396},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/CorneilDHK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/CorneilH16,
author = {Derek G. Corneil and
Michel Habib},
title = {Unified View of Graph Searching and LDFS-Based Certifying Algorithms},
booktitle = {Encyclopedia of Algorithms},
pages = {2291--2297},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_685},
doi = {10.1007/978-1-4939-2864-4\_685},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/CorneilH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/VolkelBHLV16,
author = {Finn V{\"{o}}lkel and
Eric Bapteste and
Michel Habib and
Philippe Lopez and
Chloe Vigliotti},
title = {Read networks and k-laminar graphs},
journal = {CoRR},
volume = {abs/1603.01179},
year = {2016},
url = {http://arxiv.org/abs/1603.01179},
eprinttype = {arXiv},
eprint = {1603.01179},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/VolkelBHLV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DusartHC16,
author = {J{\'{e}}r{\'{e}}mie Dusart and
Michel Habib and
Derek G. Corneil},
title = {Maximal cliques structure for cocomparability graphs and applications},
journal = {CoRR},
volume = {abs/1611.02002},
year = {2016},
url = {http://arxiv.org/abs/1611.02002},
eprinttype = {arXiv},
eprint = {1611.02002},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DusartHC16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BorassiCHKMT15,
author = {Michele Borassi and
Pierluigi Crescenzi and
Michel Habib and
Walter A. Kosters and
Andrea Marino and
Frank W. Takes},
title = {Fast diameter and radius BFS-based computation in (weakly connected)
real-world graphs: With an application to the six degrees of separation
games},
journal = {Theor. Comput. Sci.},
volume = {586},
pages = {59--80},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.02.033},
doi = {10.1016/J.TCS.2015.02.033},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BorassiCHKMT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/entcs/BorassiCH16,
author = {Michele Borassi and
Pierluigi Crescenzi and
Michel Habib},
editor = {Pierluigi Crescenzi and
Michele Loreti},
title = {Into the Square: On the Complexity of Some Quadratic-time Solvable
Problems},
booktitle = {Proceedings of the 16th Italian Conference on Theoretical Computer
Science, {ICTCS} 2015, Firenze, Italy, September 9-11, 2015},
series = {Electronic Notes in Theoretical Computer Science},
volume = {322},
pages = {51--67},
publisher = {Elsevier},
year = {2015},
url = {https://doi.org/10.1016/j.entcs.2016.03.005},
doi = {10.1016/J.ENTCS.2016.03.005},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/entcs/BorassiCH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CorneilDHM15,
author = {Derek G. Corneil and
J{\'{e}}r{\'{e}}mie Dusart and
Michel Habib and
Fabien de Montgolfier},
title = {A tie-break model for graph search},
journal = {CoRR},
volume = {abs/1501.06148},
year = {2015},
url = {http://arxiv.org/abs/1501.06148},
eprinttype = {arXiv},
eprint = {1501.06148},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CorneilDHM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HabibMM14,
author = {Michel Habib and
Antoine Mamcarz and
Fabien de Montgolfier},
title = {Computing H-Joins with Application to 2-Modular Decomposition},
journal = {Algorithmica},
volume = {70},
number = {2},
pages = {245--266},
year = {2014},
url = {https://doi.org/10.1007/s00453-013-9820-1},
doi = {10.1007/S00453-013-9820-1},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HabibMM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/CharbitHM14,
author = {Pierre Charbit and
Michel Habib and
Antoine Mamcarz},
title = {Influence of the tie-break rule on the end-vertex problem},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {16},
number = {2},
pages = {57--72},
year = {2014},
url = {https://doi.org/10.46298/dmtcs.2081},
doi = {10.46298/DMTCS.2081},
timestamp = {Tue, 31 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/CharbitHM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/BorassiCHKMT14,
author = {Michele Borassi and
Pierluigi Crescenzi and
Michel Habib and
Walter A. Kosters and
Andrea Marino and
Frank W. Takes},
editor = {Alfredo Ferro and
Fabrizio Luccio and
Peter Widmayer},
title = {On the Solvability of the Six Degrees of Kevin Bacon Game - {A} Faster
Graph Diameter and Radius Computation Method},
booktitle = {Fun with Algorithms - 7th International Conference, {FUN} 2014, Lipari
Island, Sicily, Italy, July 1-3, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8496},
pages = {52--63},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-07890-8\_5},
doi = {10.1007/978-3-319-07890-8\_5},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fun/BorassiCHKMT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/HabibM14,
author = {Michel Habib and
Antoine Mamcarz},
editor = {Dieter Kratsch and
Ioan Todinca},
title = {Colored Modular and Split Decompositions of Graphs with Applications
to Trigraphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International
Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014.
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8747},
pages = {263--274},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-12340-0\_22},
doi = {10.1007/978-3-319-12340-0\_22},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/HabibM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BorassiCH14,
author = {Michele Borassi and
Pierluigi Crescenzi and
Michel Habib},
title = {Into the Square - On the Complexity of Quadratic-Time Solvable Problems},
journal = {CoRR},
volume = {abs/1407.4972},
year = {2014},
url = {http://arxiv.org/abs/1407.4972},
eprinttype = {arXiv},
eprint = {1407.4972},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BorassiCH14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/order/FigueiredoHKS13,
author = {Adriana P. Figueiredo and
Michel Habib and
Sulamita Klein and
Jayme Luiz Szwarcfiter},
title = {The Arboreal Jump Number of an Order},
journal = {Order},
volume = {30},
number = {1},
pages = {339--350},
year = {2013},
url = {https://doi.org/10.1007/s11083-012-9246-4},
doi = {10.1007/S11083-012-9246-4},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/order/FigueiredoHKS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CorneilDH13,
author = {Derek G. Corneil and
Barnaby Dalton and
Michel Habib},
title = {LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem
on Cocomparability Graphs},
journal = {{SIAM} J. Comput.},
volume = {42},
number = {3},
pages = {792--807},
year = {2013},
url = {https://doi.org/10.1137/11083856X},
doi = {10.1137/11083856X},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CorneilDH13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HabibS13,
author = {Michel Habib and
Juraj Stacho},
title = {Unique perfect phylogeny is intractable},
journal = {Theor. Comput. Sci.},
volume = {476},
pages = {47--66},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2012.12.048},
doi = {10.1016/J.TCS.2012.12.048},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HabibS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CrescenziGHLM13,
author = {Pilu Crescenzi and
Roberto Grossi and
Michel Habib and
Leonardo Lanzi and
Andrea Marino},
title = {On computing the diameter of real-world undirected graphs},
journal = {Theor. Comput. Sci.},
volume = {514},
pages = {84--95},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2012.09.018},
doi = {10.1016/J.TCS.2012.09.018},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/CrescenziGHLM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BelghitiH13,
author = {Ismael Belghiti and
Michel Habib},
title = {A general method for common intervals},
journal = {CoRR},
volume = {abs/1309.7141},
year = {2013},
url = {http://arxiv.org/abs/1309.7141},
eprinttype = {arXiv},
eprint = {1309.7141},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BelghitiH13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Cohen-AddadHM13,
author = {Vincent Cohen{-}Addad and
Michel Habib and
Fabien de Montgolfier},
title = {Algorithmic Aspects of Switch Cographs},
journal = {CoRR},
volume = {abs/1310.1012},
year = {2013},
url = {http://arxiv.org/abs/1310.1012},
eprinttype = {arXiv},
eprint = {1310.1012},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Cohen-AddadHM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChepoiDEHVX12,
author = {Victor Chepoi and
Feodor F. Dragan and
Bertrand Estellon and
Michel Habib and
Yann Vax{\`{e}}s and
Yang Xiang},
title = {Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic
Graphs},
journal = {Algorithmica},
volume = {62},
number = {3-4},
pages = {713--732},
year = {2012},
url = {https://doi.org/10.1007/s00453-010-9478-x},
doi = {10.1007/S00453-010-9478-X},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChepoiDEHVX12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CorneilHLRR12,
author = {Derek G. Corneil and
Michel Habib and
Jean{-}Marc Lanlignel and
Bruce A. Reed and
Udi Rotics},
title = {Polynomial-time recognition of clique-width {\(\leq\)}3 graphs},
journal = {Discret. Appl. Math.},
volume = {160},
number = {6},
pages = {834--865},
year = {2012},
url = {https://doi.org/10.1016/j.dam.2011.03.020},
doi = {10.1016/J.DAM.2011.03.020},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/CorneilHLRR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Bui-XuanHR12,
author = {Binh{-}Minh Bui{-}Xuan and
Michel Habib and
Micha{\"{e}}l Rao},
title = {Tree-representation of set families and applications to combinatorial
decompositions},
journal = {Eur. J. Comb.},
volume = {33},
number = {5},
pages = {688--711},
year = {2012},
url = {https://doi.org/10.1016/j.ejc.2011.09.032},
doi = {10.1016/J.EJC.2011.09.032},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/Bui-XuanHR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/HabibS12,
author = {Michel Habib and
Juraj Stacho},
title = {Reduced clique graphs of chordal graphs},
journal = {Eur. J. Comb.},
volume = {33},
number = {5},
pages = {712--735},
year = {2012},
url = {https://doi.org/10.1016/j.ejc.2011.09.031},
doi = {10.1016/J.EJC.2011.09.031},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/HabibS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jbcb/HabibT12,
author = {Michel Habib and
Thu{-}Hien To},
title = {Constructing a Minimum phylogenetic Network from a Dense triplet Set},
journal = {J. Bioinform. Comput. Biol.},
volume = {10},
number = {5},
year = {2012},
url = {https://doi.org/10.1142/S0219720012500138},
doi = {10.1142/S0219720012500138},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jbcb/HabibT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CharbitHTV12,
author = {Pierre Charbit and
Michel Habib and
Nicolas Trotignon and
Kristina Vuskovic},
title = {Detecting 2-joins faster},
journal = {J. Discrete Algorithms},
volume = {17},
pages = {60--66},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.11.003},
doi = {10.1016/J.JDA.2012.11.003},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/CharbitHTV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/HabibMM12,
author = {Michel Habib and
Antoine Mamcarz and
Fabien de Montgolfier},
editor = {David Fern{\'{a}}ndez{-}Baca},
title = {Algorithms for Some H-Join Decompositions},
booktitle = {{LATIN} 2012: Theoretical Informatics - 10th Latin American Symposium,
Arequipa, Peru, April 16-20, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7256},
pages = {446--457},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-29344-3\_38},
doi = {10.1007/978-3-642-29344-3\_38},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/HabibMM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DurandH11,
author = {Arnaud Durand and
Michel Habib},
title = {Complexity issues for the sandwich homogeneous set problem},
journal = {Discret. Appl. Math.},
volume = {159},
number = {7},
pages = {574--580},
year = {2011},
url = {https://doi.org/10.1016/j.dam.2010.08.008},
doi = {10.1016/J.DAM.2010.08.008},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DurandH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/HabibS11,
author = {Michel Habib and
Juraj Stacho},
editor = {Raffaele Giancarlo and
Giovanni Manzini},
title = {Unique Perfect Phylogeny Is \emph{NP}-Hard},
booktitle = {Combinatorial Pattern Matching - 22nd Annual Symposium, {CPM} 2011,
Palermo, Italy, June 27-29, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6661},
pages = {132--146},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-21458-5\_13},
doi = {10.1007/978-3-642-21458-5\_13},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/HabibS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/HabibT11,
author = {Michel Habib and
Thu{-}Hien To},
editor = {Teresa M. Przytycka and
Marie{-}France Sagot},
title = {On a Conjecture about Compatibility of Multi-states Characters},
booktitle = {Algorithms in Bioinformatics - 11th International Workshop, {WABI}
2011, Saarbr{\"{u}}cken, Germany, September 5-7, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6833},
pages = {116--127},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-23038-7\_11},
doi = {10.1007/978-3-642-23038-7\_11},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wabi/HabibT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1105-1109,
author = {Michel Habib and
Thu{-}Hien To},
title = {On a conjecture of compatibility of multi-states characters},
journal = {CoRR},
volume = {abs/1105.1109},
year = {2011},
url = {http://arxiv.org/abs/1105.1109},
eprinttype = {arXiv},
eprint = {1105.1109},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1105-1109.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1107-3977,
author = {Pierre Charbit and
Michel Habib and
Nicolas Trotignon and
Kristina Vuskovic},
title = {Detecting 2-joins faster},
journal = {CoRR},
volume = {abs/1107.3977},
year = {2011},
url = {http://arxiv.org/abs/1107.3977},
eprinttype = {arXiv},
eprint = {1107.3977},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1107-3977.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/csr/HabibP10,
author = {Michel Habib and
Christophe Paul},
title = {A survey of the algorithmic aspects of modular decomposition},
journal = {Comput. Sci. Rev.},
volume = {4},
number = {1},
pages = {41--59},
year = {2010},
url = {https://doi.org/10.1016/j.cosrev.2010.01.001},
doi = {10.1016/J.COSREV.2010.01.001},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/csr/HabibP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wg/2009,
editor = {Christophe Paul and
Michel Habib},
title = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-11409-0},
doi = {10.1007/978-3-642-11409-0},
isbn = {978-3-642-11408-3},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/2009.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1011-5737,
author = {Michel Habib and
Juraj Stacho},
title = {Unique perfect phylogeny is NP-hard},
journal = {CoRR},
volume = {abs/1011.5737},
year = {2010},
url = {http://arxiv.org/abs/1011.5737},
eprinttype = {arXiv},
eprint = {1011.5737},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1011-5737.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1012-4084,
author = {Michel Habib and
Thu{-}Hien To},
title = {Structure and Recognition of 3,4-leaf Powers of Galled Phylogenetic
Networks in Polynomial Time},
journal = {CoRR},
volume = {abs/1012.4084},
year = {2010},
url = {http://arxiv.org/abs/1012.4084},
eprinttype = {arXiv},
eprint = {1012.4084},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1012-4084.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Bui-XuanHLM09,
author = {Binh{-}Minh Bui{-}Xuan and
Michel Habib and
Vincent Limouzy and
Fabien de Montgolfier},
title = {Algorithmic aspects of a general modular decomposition theory},
journal = {Discret. Appl. Math.},
volume = {157},
number = {9},
pages = {1993--2009},
year = {2009},
url = {https://doi.org/10.1016/j.dam.2008.11.001},
doi = {10.1016/J.DAM.2008.11.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Bui-XuanHLM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/HabibS09,
author = {Michel Habib and
Juraj Stacho},
title = {Linear Algorithms for Chordal Graphs of Bounded Directed Vertex Leafage},
journal = {Electron. Notes Discret. Math.},
volume = {32},
pages = {99--108},
year = {2009},
url = {https://doi.org/10.1016/j.endm.2009.02.014},
doi = {10.1016/J.ENDM.2009.02.014},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/HabibS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/HabibL09,
author = {Michel Habib and
Vincent Limouzy},
title = {On some simplicial elimination schemes for chordal graphs},
journal = {Electron. Notes Discret. Math.},
volume = {32},
pages = {125--132},
year = {2009},
url = {https://doi.org/10.1016/j.endm.2009.02.017},
doi = {10.1016/J.ENDM.2009.02.017},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/HabibL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Bui-XuanH09,
author = {Binh{-}Minh Bui{-}Xuan and
Michel Habib},
title = {Unifying the representation of symmetric crossing families and weakly
partitive families},
journal = {Electron. Notes Discret. Math.},
volume = {34},
pages = {329--333},
year = {2009},
url = {https://doi.org/10.1016/j.endm.2009.07.054},
doi = {10.1016/J.ENDM.2009.07.054},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/Bui-XuanH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/HabibS09a,
author = {Michel Habib and
Juraj Stacho},
title = {A Decomposition Theorem for Chordal Graphs and its Applications},
journal = {Electron. Notes Discret. Math.},
volume = {34},
pages = {561--565},
year = {2009},
url = {https://doi.org/10.1016/j.endm.2009.07.093},
doi = {10.1016/J.ENDM.2009.07.093},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/HabibS09a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/Habib09,
author = {Michel Habib},
editor = {Sonia Cafieri and
Antonio Mucherino and
Giacomo Nannicini and
Fabien Tarissan and
Leo Liberti},
title = {Diameter and Center Computations in Networks},
booktitle = {Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial
Optimization, {CTW} 2009, Paris, France, June 2-4 2009},
pages = {257--258},
year = {2009},
url = {http://www.lix.polytechnique.fr/ctw09/ctw09-proceedings.pdf\#page=269},
timestamp = {Thu, 12 Mar 2020 11:34:41 +0100},
biburl = {https://dblp.org/rec/conf/colognetwente/Habib09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/ToH09,
author = {Thu{-}Hien To and
Michel Habib},
editor = {Gregory Kucherov and
Esko Ukkonen},
title = {Level-k Phylogenetic Networks Are Constructable from a Dense Triplet
Set in Polynomial Time},
booktitle = {Combinatorial Pattern Matching, 20th Annual Symposium, {CPM} 2009,
Lille, France, June 22-24, 2009, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5577},
pages = {275--288},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02441-2\_25},
doi = {10.1007/978-3-642-02441-2\_25},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/ToH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/HabibS09,
author = {Michel Habib and
Juraj Stacho},
editor = {Amos Fiat and
Peter Sanders},
title = {Polynomial-Time Algorithm for the Leafage of Chordal Graphs},
booktitle = {Algorithms - {ESA} 2009, 17th Annual European Symposium, Copenhagen,
Denmark, September 7-9, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5757},
pages = {290--300},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-04128-0\_27},
doi = {10.1007/978-3-642-04128-0\_27},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/HabibS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0901-2645,
author = {Michel Habib and
Vincent Limouzy},
title = {On some simplicial elimination schemes for chordal graphs},
journal = {CoRR},
volume = {abs/0901.2645},
year = {2009},
url = {http://arxiv.org/abs/0901.2645},
eprinttype = {arXiv},
eprint = {0901.2645},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0901-2645.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0904-2728,
author = {Cl{\'{e}}mence Magnien and
Matthieu Latapy and
Michel Habib},
title = {Fast Computation of Empirically Tight Bounds for the Diameter of Massive
Graphs},
journal = {CoRR},
volume = {abs/0904.2728},
year = {2009},
url = {http://arxiv.org/abs/0904.2728},
eprinttype = {arXiv},
eprint = {0904.2728},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0904-2728.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0912-1457,
author = {Michel Habib and
Christophe Paul},
title = {A survey on algorithmic aspects of modular decomposition},
journal = {CoRR},
volume = {abs/0912.1457},
year = {2009},
url = {http://arxiv.org/abs/0912.1457},
eprinttype = {arXiv},
eprint = {0912.1457},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0912-1457.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/ChepoiDEHV08,
author = {Victor Chepoi and
Feodor F. Dragan and
Bertrand Estellon and
Michel Habib and
Yann Vax{\`{e}}s},
title = {Notes on diameters, centers, and approximating trees of delta-hyperbolic
geodesic spaces and graphs},
journal = {Electron. Notes Discret. Math.},
volume = {31},
pages = {231--234},
year = {2008},
url = {https://doi.org/10.1016/j.endm.2008.06.046},
doi = {10.1016/J.ENDM.2008.06.046},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/ChepoiDEHV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CharbitHLMRR08,
author = {Pierre Charbit and
Michel Habib and
Vincent Limouzy and
Fabien de Montgolfier and
Mathieu Raffinot and
Micha{\"{e}}l Rao},
title = {A note on computing set overlap classes},
journal = {Inf. Process. Lett.},
volume = {108},
number = {4},
pages = {186--191},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.05.005},
doi = {10.1016/J.IPL.2008.05.005},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CharbitHLMRR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/MagnienLH08,
author = {Cl{\'{e}}mence Magnien and
Matthieu Latapy and
Michel Habib},
title = {Fast computation of empirically tight bounds for the diameter of massive
graphs},
journal = {{ACM} J. Exp. Algorithmics},
volume = {13},
year = {2008},
url = {https://doi.org/10.1145/1412228.1455266},
doi = {10.1145/1412228.1455266},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/MagnienLH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BretscherCHP08,
author = {Anna Bretscher and
Derek G. Corneil and
Michel Habib and
Christophe Paul},
title = {A Simple Linear Time LexBFS Cograph Recognition Algorithm},
journal = {{SIAM} J. Discret. Math.},
volume = {22},
number = {4},
pages = {1277--1296},
year = {2008},
url = {https://doi.org/10.1137/060664690},
doi = {10.1137/060664690},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BretscherCHP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Bui-XuanHP08,
author = {Binh{-}Minh Bui{-}Xuan and
Michel Habib and
Christophe Paul},
title = {Competitive graph searches},
journal = {Theor. Comput. Sci.},
volume = {393},
number = {1-3},
pages = {72--80},
year = {2008},
url = {https://doi.org/10.1016/j.tcs.2007.10.048},
doi = {10.1016/J.TCS.2007.10.048},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Bui-XuanHP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/ChepoiDEHV08,
author = {Victor Chepoi and
Feodor F. Dragan and
Bertrand Estellon and
Michel Habib and
Yann Vax{\`{e}}s},
editor = {Monique Teillaud},
title = {Diameters, centers, and approximating trees of delta-hyperbolicgeodesic
spaces and graphs},
booktitle = {Proceedings of the 24th {ACM} Symposium on Computational Geometry,
College Park, MD, USA, June 9-11, 2008},
pages = {59--68},
publisher = {{ACM}},
year = {2008},
url = {https://doi.org/10.1145/1377676.1377687},
doi = {10.1145/1377676.1377687},
timestamp = {Mon, 14 Jun 2021 16:24:59 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/ChepoiDEHV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/TedderCHP08,
author = {Marc Tedder and
Derek G. Corneil and
Michel Habib and
Christophe Paul},
editor = {Luca Aceto and
Ivan Damg{\aa}rd and
Leslie Ann Goldberg and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Anna Ing{\'{o}}lfsd{\'{o}}ttir and
Igor Walukiewicz},
title = {Simpler Linear-Time Modular Decomposition Via Recursive Factorizing
Permutations},
booktitle = {Automata, Languages and Programming, 35th International Colloquium,
{ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
{I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
series = {Lecture Notes in Computer Science},
volume = {5125},
pages = {634--645},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-70575-8\_52},
doi = {10.1007/978-3-540-70575-8\_52},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/TedderCHP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/Bui-XuanH08,
author = {Binh{-}Minh Bui{-}Xuan and
Michel Habib},
editor = {Eduardo Sany Laber and
Claudson F. Bornstein and
Loana Tito Nogueira and
Lu{\'{e}}rbio Faria},
title = {A Representation Theorem for Union-Difference Families and Application},
booktitle = {{LATIN} 2008: Theoretical Informatics, 8th Latin American Symposium,
B{\'{u}}zios, Brazil, April 7-11, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4957},
pages = {492--503},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-78773-0\_43},
doi = {10.1007/978-3-540-78773-0\_43},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/latin/Bui-XuanH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HabibKLP07,
author = {Michel Habib and
David Kelly and
Emmanuelle Lebhar and
Christophe Paul},
title = {Can transitive orientation make sandwich problems easier?},
journal = {Discret. Math.},
volume = {307},
number = {16},
pages = {2030--2041},
year = {2007},
url = {https://doi.org/10.1016/j.disc.2005.12.048},
doi = {10.1016/J.DISC.2005.12.048},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/HabibKLP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DobsonGHS07,
author = {Maria Patricia Dobson and
Marisa Gutierrez and
Michel Habib and
Jayme Luiz Szwarcfiter},
title = {On transitive orientations with restricted covering graphs},
journal = {Inf. Process. Lett.},
volume = {101},
number = {3},
pages = {119--125},
year = {2007},
url = {https://doi.org/10.1016/j.ipl.2006.08.008},
doi = {10.1016/J.IPL.2006.08.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DobsonGHS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Bui-XuanHLM07,
author = {Binh{-}Minh Bui{-}Xuan and
Michel Habib and
Vincent Limouzy and
Fabien de Montgolfier},
editor = {Takeshi Tokuyama},
title = {Unifying Two Graph Decompositions with Modular Decomposition},
booktitle = {Algorithms and Computation, 18th International Symposium, {ISAAC}
2007, Sendai, Japan, December 17-19, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4835},
pages = {52--64},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77120-3\_7},
doi = {10.1007/978-3-540-77120-3\_7},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/Bui-XuanHLM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0710-3901,
author = {Marc Tedder and
Derek G. Corneil and
Michel Habib and
Christophe Paul},
title = {Simple, linear-time modular decomposition},
journal = {CoRR},
volume = {abs/0710.3901},
year = {2007},
url = {http://arxiv.org/abs/0710.3901},
eprinttype = {arXiv},
eprint = {0710.3901},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0710-3901.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0711-4573,
author = {Pierre Charbit and
Michel Habib and
Vincent Limouzy and
Fabien de Montgolfier and
Mathieu Raffinot and
Micha{\"{e}}l Rao},
title = {A Note On Computing Set Overlap Classes},
journal = {CoRR},
volume = {abs/0711.4573},
year = {2007},
url = {http://arxiv.org/abs/0711.4573},
eprinttype = {arXiv},
eprint = {0711.4573},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0711-4573.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Bui-XuanHLM06,
author = {Binh{-}Minh Bui{-}Xuan and
Michel Habib and
Vincent Limouzy and
Fabien de Montgolfier},
title = {On Modular Decomposition Concepts: the case for Homogeneous Relations},
journal = {Electron. Notes Discret. Math.},
volume = {27},
pages = {13--14},
year = {2006},
url = {https://doi.org/10.1016/j.endm.2006.08.033},
doi = {10.1016/J.ENDM.2006.08.033},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/Bui-XuanHLM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/DiekertH06,
author = {Volker Diekert and
Michel Habib},
title = {Foreword},
journal = {Theory Comput. Syst.},
volume = {39},
number = {1},
pages = {1},
year = {2006},
url = {https://doi.org/10.1007/s00224-005-3902-7},
doi = {10.1007/S00224-005-3902-7},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/DiekertH06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/XuanHLM06,
author = {Binh{-}Minh Bui{-}Xuan and
Michel Habib and
Vincent Limouzy and
Fabien de Montgolfier},
editor = {Fedor V. Fomin},
title = {Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms},
booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop,
{WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4271},
pages = {278--288},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11917496\_25},
doi = {10.1007/11917496\_25},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/XuanHLM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0603048,
author = {Binh{-}Minh Bui{-}Xuan and
Michel Habib and
Vincent Limouzy and
Fabien de Montgolfier},
title = {Homogeneity vs. Adjacency: generalising some graph decomposition algorithms},
journal = {CoRR},
volume = {abs/cs/0603048},
year = {2006},
url = {http://arxiv.org/abs/cs/0603048},
eprinttype = {arXiv},
eprint = {cs/0603048},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0603048.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0604065,
author = {Binh{-}Minh Bui{-}Xuan and
Michel Habib and
Vincent Limouzy and
Fabien de Montgolfier},
title = {Unifying two Graph Decompositions with Modular Decomposition},
journal = {CoRR},
volume = {abs/cs/0604065},
year = {2006},
url = {http://arxiv.org/abs/cs/0604065},
eprinttype = {arXiv},
eprint = {cs/0604065},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0604065.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0611019,
author = {Binh{-}Minh Bui{-}Xuan and
Michel Habib and
Vincent Limouzy and
Fabien de Montgolfier},
title = {Algorithmic Aspects of a Novel Modular Decomposition Theory},
journal = {CoRR},
volume = {abs/cs/0611019},
year = {2006},
url = {http://arxiv.org/abs/cs/0611019},
eprinttype = {arXiv},
eprint = {cs/0611019},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0611019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HabibP05,
author = {Michel Habib and
Christophe Paul},
title = {A simple linear time algorithm for cograph recognition},
journal = {Discret. Appl. Math.},
volume = {145},
number = {2},
pages = {183--197},
year = {2005},
url = {https://doi.org/10.1016/j.dam.2004.01.011},
doi = {10.1016/J.DAM.2004.01.011},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HabibP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HabibN05,
author = {Michel Habib and
Lhouari Nourine},
title = {The number of Moore families on \emph{n}=6},
journal = {Discret. Math.},
volume = {294},
number = {3},
pages = {291--296},
year = {2005},
url = {https://doi.org/10.1016/j.disc.2004.11.010},
doi = {10.1016/J.DISC.2004.11.010},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/HabibN05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/XuanHP05,
author = {Binh{-}Minh Bui{-}Xuan and
Michel Habib and
Christophe Paul},
editor = {Xiaotie Deng and
Ding{-}Zhu Du},
title = {Revisiting T. Uno and M. Yagiura's Algorithm},
booktitle = {Algorithms and Computation, 16th International Symposium, {ISAAC}
2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3827},
pages = {146--155},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11602613\_16},
doi = {10.1007/11602613\_16},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/XuanHP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HabibNRT04,
author = {Michel Habib and
Lhouari Nourine and
Olivier Raynaud and
Eric Thierry},
title = {Computational aspects of the 2-dimension of partially ordered sets},
journal = {Theor. Comput. Sci.},
volume = {312},
number = {2-3},
pages = {401--431},
year = {2004},
url = {https://doi.org/10.1016/j.tcs.2003.10.029},
doi = {10.1016/J.TCS.2003.10.029},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/HabibNRT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/HabibPR04,
author = {Michel Habib and
Christophe Paul and
Mathieu Raffinot},
editor = {S{\"{u}}leyman Cenk Sahinalp and
S. Muthukrishnan and
Ugur Dogrus{\"{o}}z},
title = {Maximal Common Connected Sets of Interval Graphs},
booktitle = {Combinatorial Pattern Matching, 15th Annual Symposium, {CPM} 2004,
Istanbul,Turkey, July 5-7, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3109},
pages = {359--372},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27801-6\_27},
doi = {10.1007/978-3-540-27801-6\_27},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/HabibPR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HabibMP04,
author = {Michel Habib and
Fabien de Montgolfier and
Christophe Paul},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using
Order Extension},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {187--198},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_17},
doi = {10.1007/978-3-540-27810-8\_17},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/HabibMP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/FouquetHMV04,
author = {Jean{-}Luc Fouquet and
Michel Habib and
Fabien de Montgolfier and
Jean{-}Marie Vanherpe},
editor = {Juraj Hromkovic and
Manfred Nagl and
Bernhard Westfechtel},
title = {Bimodular Decomposition of Bipartite Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG
2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {3353},
pages = {117--128},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30559-0\_10},
doi = {10.1007/978-3-540-30559-0\_10},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/FouquetHMV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stacs/2004,
editor = {Volker Diekert and
Michel Habib},
title = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/b96012},
doi = {10.1007/B96012},
isbn = {3-540-21236-1},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/2004.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HabibLP03,
author = {Michel Habib and
Emmanuelle Lebhar and
Christophe Paul},
title = {A note on finding all homogeneous set sandwiches},
journal = {Inf. Process. Lett.},
volume = {87},
number = {3},
pages = {147--151},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(03)00265-5},
doi = {10.1016/S0020-0190(03)00265-5},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/HabibLP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BretscherCHP03,
author = {Anna Bretscher and
Derek G. Corneil and
Michel Habib and
Christophe Paul},
editor = {Hans L. Bodlaender},
title = {A Simple Linear Time LexBFS Cograph Recognition Algorithm},
booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop,
{WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2880},
pages = {119--130},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-39890-5\_11},
doi = {10.1007/978-3-540-39890-5\_11},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/BretscherCHP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stacs/2003,
editor = {Helmut Alt and
Michel Habib},
title = {{STACS} 2003, 20th Annual Symposium on Theoretical Aspects of Computer
Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2607},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-36494-3},
doi = {10.1007/3-540-36494-3},
isbn = {3-540-00623-0},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/2003.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/CapelleHM02,
author = {Christian Capelle and
Michel Habib and
Fabien de Montgolfier},
title = {Graph Decompositions andFactorizing Permutations},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {5},
number = {1},
pages = {55--70},
year = {2002},
url = {https://doi.org/10.46298/dmtcs.298},
doi = {10.46298/DMTCS.298},
timestamp = {Fri, 07 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmtcs/CapelleHM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/interspeech/NguyenJH02,
author = {No{\"{e}}l Nguyen and
Ludovic Jankowski and
Michel Habib},
editor = {John H. L. Hansen and
Bryan L. Pellom},
title = {The perception of stop consonant sequences in dyslexic and normal
children},
booktitle = {7th International Conference on Spoken Language Processing, {ICSLP2002}
- {INTERSPEECH} 2002, Denver, Colorado, USA, September 16-20, 2002},
pages = {2565--2568},
publisher = {{ISCA}},
year = {2002},
url = {https://doi.org/10.21437/ICSLP.2002-498},
doi = {10.21437/ICSLP.2002-498},
timestamp = {Thu, 22 Jun 2023 16:42:18 +0200},
biburl = {https://dblp.org/rec/conf/interspeech/NguyenJH02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HabibMNS01,
author = {Michel Habib and
Raoul Medina and
Lhouari Nourine and
George Steiner},
title = {Efficient algorithms on distributive lattices},
journal = {Discret. Appl. Math.},
volume = {110},
number = {2-3},
pages = {169--187},
year = {2001},
url = {https://doi.org/10.1016/S0166-218X(00)00258-4},
doi = {10.1016/S0166-218X(00)00258-4},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/HabibMNS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CorneilDHP01,
author = {Derek G. Corneil and
Feodor F. Dragan and
Michel Habib and
Christophe Paul},
title = {Diameter determination on restricted graph families},
journal = {Discret. Appl. Math.},
volume = {113},
number = {2-3},
pages = {143--166},
year = {2001},
url = {https://doi.org/10.1016/S0166-218X(00)00281-X},
doi = {10.1016/S0166-218X(00)00281-X},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/CorneilDHP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/HabibPV01,
author = {Michel Habib and
Christophe Paul and
Laurent Viennot},
title = {Linear time recognition of P4-indifference graphs},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {4},
number = {2},
pages = {173--178},
year = {2001},
url = {https://doi.org/10.46298/dmtcs.269},
doi = {10.46298/DMTCS.269},
timestamp = {Fri, 07 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmtcs/HabibPV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DamiandHP01,
author = {Guillaume Damiand and
Michel Habib and
Christophe Paul},
title = {A simple paradigm for graph recognition: application to cographs and
distance hereditary graphs},
journal = {Theor. Comput. Sci.},
volume = {263},
number = {1-2},
pages = {99--111},
year = {2001},
url = {https://doi.org/10.1016/S0304-3975(00)00234-6},
doi = {10.1016/S0304-3975(00)00234-6},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/DamiandHP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HabibMPV00,
author = {Michel Habib and
Ross M. McConnell and
Christophe Paul and
Laurent Viennot},
title = {Lex-BFS and partition refinement, with applications to transitive
orientation, interval graph recognition and consecutive ones testing},
journal = {Theor. Comput. Sci.},
volume = {234},
number = {1-2},
pages = {59--84},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(97)00241-7},
doi = {10.1016/S0304-3975(97)00241-7},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HabibMPV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/CorneilHLRR00,
author = {Derek G. Corneil and
Michel Habib and
Jean{-}Marc Lanlignel and
Bruce A. Reed and
Udi Rotics},
editor = {Gaston H. Gonnet and
Daniel Panario and
Alfredo Viola},
title = {Polynomial Time Recognition of Clique-Width {\textbackslash}le {\textbackslash}leq
3 Graphs (Extended Abstract)},
booktitle = {{LATIN} 2000: Theoretical Informatics, 4th Latin American Symposium,
Punta del Este, Uruguay, April 10-14, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1776},
pages = {126--134},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/10719839\_14},
doi = {10.1007/10719839\_14},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/CorneilHLRR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ci/CaseauHNR99,
author = {Yves Caseau and
Michel Habib and
Lhouari Nourine and
Olivier Raynaud},
title = {Encoding of Multiple Inheritance Hierarchies and Partial Orders},
journal = {Comput. Intell.},
volume = {15},
pages = {50--62},
year = {1999},
url = {https://doi.org/10.1111/0824-7935.00081},
doi = {10.1111/0824-7935.00081},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ci/CaseauHNR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/HabibPV99,
author = {Michel Habib and
Christophe Paul and
Laurent Viennot},
title = {Partition Refinement Techniques: An Interesting Algorithmic Tool Kit},
journal = {Int. J. Found. Comput. Sci.},
volume = {10},
number = {2},
pages = {147--170},
year = {1999},
url = {https://doi.org/10.1142/S0129054199000125},
doi = {10.1142/S0129054199000125},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/HabibPV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/DietzFHL98,
author = {Andreas Dietz and
Christophe Fiorio and
Michel Habib and
Claude Lauren{\c{c}}o},
editor = {Pierre Hansen and
Patrick W. Fowler and
Maolin Zheng},
title = {Representation of stereochemistry using combinatorial maps},
booktitle = {Discrete Mathematical Chemistry, Proceedings of a {DIMACS} Workshop,
New Brunswick, New Jersey, USA, 1998},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {51},
pages = {117--128},
publisher = {{DIMACS/AMS}},
year = {1998},
url = {https://doi.org/10.1090/dimacs/051/09},
doi = {10.1090/DIMACS/051/09},
timestamp = {Mon, 22 May 2023 16:07:35 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/DietzFHL98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/HabibPV98,
author = {Michel Habib and
Christophe Paul and
Laurent Viennot},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {A Synthesis on Partition Refinement: {A} Useful Routine for Strings,
Graphs, Boolean Matrices and Automata},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {25--38},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028546},
doi = {10.1007/BFB0028546},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/HabibPV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/CorneilDHP98,
author = {Derek G. Corneil and
Feodor F. Dragan and
Michel Habib and
Christophe Paul},
editor = {Juraj Hromkovic and
Ondrej S{\'{y}}kora},
title = {Diameter Determination on Restricted Graph Faminlies},
booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop,
{WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1517},
pages = {192--202},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/10692760\_16},
doi = {10.1007/10692760\_16},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/CorneilDHP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/HabibNS97,
author = {Michel Habib and
Lhouari Nourine and
George Steiner},
title = {Gray Codes for the Ideals of Interval Orders},
journal = {J. Algorithms},
volume = {25},
number = {1},
pages = {52--66},
year = {1997},
url = {https://doi.org/10.1006/jagm.1997.0863},
doi = {10.1006/JAGM.1997.0863},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/HabibNS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BouchitteHM97,
author = {Vincent Bouchitt{\'{e}} and
Michel Habib and
Michel Morvan},
title = {Preface: Orders, Algorithms and Applications},
journal = {Theor. Comput. Sci.},
volume = {175},
number = {2},
pages = {223},
year = {1997},
url = {https://doi.org/10.1016/S0304-3975(96)00199-5},
doi = {10.1016/S0304-3975(96)00199-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BouchitteHM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/istcs/CapelleH97,
author = {Christian Capelle and
Michel Habib},
title = {Graph decompositions and factorizing permutations},
booktitle = {Fifth Israel Symposium on Theory of Computing and Systems, {ISTCS}
1997, Ramat-Gan, Israel, June 17-19, 1997, Proceedings},
pages = {132--143},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/ISTCS.1997.595165},
doi = {10.1109/ISTCS.1997.595165},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/istcs/CapelleH97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HabibN96,
author = {Michel Habib and
Lhouari Nourine},
title = {Tree Structure for Distributive Lattices and its Applications},
journal = {Theor. Comput. Sci.},
volume = {165},
number = {2},
pages = {391--405},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(95)00232-4},
doi = {10.1016/0304-3975(95)00232-4},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/HabibN96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HabibHS95,
author = {Michel Habib and
Marianne Huchard and
Jeremy P. Spinrad},
title = {A Linear Algorithm To Decompose Inheritance Graphs Into Modules},
journal = {Algorithmica},
volume = {13},
number = {6},
pages = {573--591},
year = {1995},
url = {https://doi.org/10.1007/BF01189070},
doi = {10.1007/BF01189070},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HabibHS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/GalinierHP95,
author = {Philippe Galinier and
Michel Habib and
Christophe Paul},
editor = {Manfred Nagl},
title = {Chordal Graphs and Their Clique Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop,
{WG} '95, Aachen, Germany, June 20-22, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1017},
pages = {358--371},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60618-1\_88},
doi = {10.1007/3-540-60618-1\_88},
timestamp = {Thu, 14 Oct 2021 10:32:32 +0200},
biburl = {https://dblp.org/rec/conf/wg/GalinierHP95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FelsnerHM94,
author = {Stefan Felsner and
Michel Habib and
Rolf H. M{\"{o}}hring},
title = {On the Interplay Between Interval Dimension and Dimension},
journal = {{SIAM} J. Discret. Math.},
volume = {7},
number = {1},
pages = {32--40},
year = {1994},
url = {https://doi.org/10.1137/S089548019121885X},
doi = {10.1137/S089548019121885X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FelsnerHM94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caap/CournierH94,
author = {Alain Cournier and
Michel Habib},
editor = {Sophie Tison},
title = {A New Linear Algorithm for Modular Decomposition},
booktitle = {Trees in Algebra and Programming - CAAP'94, 19th International Colloquium,
Edinburgh, UK, April 11-13, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {787},
pages = {68--84},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/BFb0017474},
doi = {10.1007/BFB0017474},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/caap/CournierH94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/oopsla/DucournauHHM94,
author = {Roland Ducournau and
Michel Habib and
Marianne Huchard and
Marie{-}Laure Mugnier},
editor = {Jeff McKenna and
J. Eliot B. Moss and
Richard L. Wexelblat},
title = {Proposal for a Monotonic Multiple Inheritance Linearization},
booktitle = {Proceedings of the Ninth Annual Conference on Object-Oriented Programming
Systems, Languages, and Applications, {OOPSLA} 1994, Portland, Oregon,
USA, October 23-27, 1994},
pages = {164--175},
publisher = {{ACM}},
year = {1994},
url = {https://doi.org/10.1145/191080.191110},
doi = {10.1145/191080.191110},
timestamp = {Wed, 30 Mar 2022 13:55:40 +0200},
biburl = {https://dblp.org/rec/conf/oopsla/DucournauHHM94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ordal/HabibN94,
author = {Michel Habib and
Lhouari Nourine},
editor = {Vincent Bouchitt{\'{e}} and
Michel Morvan},
title = {Bit-Vector Encoding for Partially Ordered Sets},
booktitle = {Orders, Algorithms, and Applications, International Workshop {ORDAL}
'94, Lyon, France, July 4-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {831},
pages = {1--12},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/BFb0019423},
doi = {10.1007/BFB0019423},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/ordal/HabibN94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HabibMR93,
author = {Michel Habib and
Michel Morvan and
Jean{-}Xavier Rampon},
title = {On the calculation of transitive reduction - closure of orders},
journal = {Discret. Math.},
volume = {111},
number = {1-3},
pages = {289--303},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90164-O},
doi = {10.1016/0012-365X(93)90164-O},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HabibMR93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/oopsla/DucournauHHM92,
author = {Roland Ducournau and
Michel Habib and
Marianne Huchard and
Marie{-}Laure Mugnier},
editor = {John R. Pugh},
title = {Monotonic Conflict Resolution Mechanisms for Inheritance},
booktitle = {Proceedings of the Seventh Annual Conference on Object-Oriented Programming
Systems, Languages, and Applications, {OOPSLA} 1992, Vancouver, British
Columbia, Canada, October 18-22, 1992},
pages = {16--24},
publisher = {{ACM}},
year = {1992},
url = {https://doi.org/10.1145/141936.141939},
doi = {10.1145/141936.141939},
timestamp = {Fri, 13 May 2022 10:38:22 +0200},
biburl = {https://dblp.org/rec/conf/oopsla/DucournauHHM92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/CournierH92,
author = {Alain Cournier and
Michel Habib},
editor = {Ernst W. Mayr},
title = {An Efficient Algorithm to Recognize Prime Undirected Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop,
{WG} '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {657},
pages = {212--224},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56402-0\_49},
doi = {10.1007/3-540-56402-0\_49},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/CournierH92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HabibKM91,
author = {Michel Habib and
David Kelly and
Rolf H. M{\"{o}}hring},
title = {Interval dimension is a comparability invariant},
journal = {Discret. Math.},
volume = {88},
number = {2-3},
pages = {211--229},
year = {1991},
url = {https://doi.org/10.1016/0012-365X(91)90010-Y},
doi = {10.1016/0012-365X(91)90010-Y},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HabibKM91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/HabibMR90,
author = {Michel Habib and
Michel Morvan and
Jean{-}Xavier Rampon},
editor = {Rolf H. M{\"{o}}hring},
title = {Remarks on Some Concurrency Measures},
booktitle = {Graph-Theoretic Concepts in Computer Science, 16rd International Workshop,
{WG} '90, Berlin, Germany, June 20-22, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {484},
pages = {221--238},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-53832-1\_45},
doi = {10.1007/3-540-53832-1\_45},
timestamp = {Fri, 17 Jul 2020 16:12:47 +0200},
biburl = {https://dblp.org/rec/conf/wg/HabibMR90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HabibM87,
author = {Michel Habib and
Rolf H. M{\"{o}}hring},
title = {On some complexity properties of N-free posets and posets with bounded
decomposition diameter},
journal = {Discret. Math.},
volume = {63},
number = {2-3},
pages = {157--182},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90006-9},
doi = {10.1016/0012-365X(87)90006-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HabibM87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecoop/DucournauH87,
author = {Roland Ducournau and
Michel Habib},
editor = {Jean B{\'{e}}zivin and
Jean{-}Marie Hullot and
Pierre Cointe and
Henry Lieberman},
title = {On Some Algorithms for Multiple Inheritance in Object-Oriented Programming},
booktitle = {ECOOP'87 European Conference on Object-Oriented Programming, Paris,
France, June 15-17, 1987, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {276},
pages = {243--252},
publisher = {Springer},
year = {1987},
url = {https://doi.org/10.1007/3-540-47891-4\_23},
doi = {10.1007/3-540-47891-4\_23},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/ecoop/DucournauH87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/DaoHRT86,
author = {M. Dao and
Michel Habib and
J. P. Richard and
Didier Tallot},
editor = {Gottfried Tinhofer and
Gunther Schmidt},
title = {CABRI, An Interactive System for Graph Manipulation},
booktitle = {Graphtheoretic Concepts in Computer Science, International Workshop,
{WG} '86, Bernried, Germany, June 17-19, 1986, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {246},
pages = {58--67},
publisher = {Springer},
year = {1986},
url = {https://doi.org/10.1007/3-540-17218-1\_49},
doi = {10.1007/3-540-17218-1\_49},
timestamp = {Wed, 27 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/DaoHRT86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HabibJ85,
author = {Michel Habib and
Roland J{\'{e}}gou},
title = {N-free posets as generalizations of series-parallel posets},
journal = {Discret. Appl. Math.},
volume = {12},
number = {3},
pages = {279--291},
year = {1985},
url = {https://doi.org/10.1016/0166-218X(85)90030-7},
doi = {10.1016/0166-218X(85)90030-7},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HabibJ85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HabibM85,
author = {Michel Habib and
M. C. Maurer},
title = {1-Intersecting families},
journal = {Discret. Math.},
volume = {53},
pages = {91--101},
year = {1985},
url = {https://doi.org/10.1016/0012-365X(85)90132-3},
doi = {10.1016/0012-365X(85)90132-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HabibM85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CheinH84,
author = {Michel Chein and
Michel Habib},
title = {Jump number of dags having Dilworth number 2},
journal = {Discret. Appl. Math.},
volume = {7},
number = {3},
pages = {243--250},
year = {1984},
url = {https://doi.org/10.1016/0166-218X(84)90002-7},
doi = {10.1016/0166-218X(84)90002-7},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/CheinH84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BermondFHP84,
author = {Jean{-}Claude Bermond and
Jean{-}Luc Fouquet and
Michel Habib and
Bernard P{\'{e}}roche},
title = {On linear k-arboricity},
journal = {Discret. Math.},
volume = {52},
number = {2-3},
pages = {123--132},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90075-X},
doi = {10.1016/0012-365X(84)90075-X},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/BermondFHP84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HabibP82,
author = {Michel Habib and
Bernard P{\'{e}}roche},
title = {Some problems about linear arboricity},
journal = {Discret. Math.},
volume = {41},
number = {2},
pages = {219--220},
year = {1982},
url = {https://doi.org/10.1016/0012-365X(82)90209-6},
doi = {10.1016/0012-365X(82)90209-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HabibP82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CheinHM81,
author = {Michel Chein and
Michel Habib and
M. C. Maurer},
title = {Partitive hypergraphs},
journal = {Discret. Math.},
volume = {37},
number = {1},
pages = {35--50},
year = {1981},
url = {https://doi.org/10.1016/0012-365X(81)90138-2},
doi = {10.1016/0012-365X(81)90138-2},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/CheinHM81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HabibM79,
author = {Michel Habib and
M. C. Maurer},
title = {On the X-join decomposition for undirected graphs},
journal = {Discret. Appl. Math.},
volume = {1},
number = {3},
pages = {201--207},
year = {1979},
url = {https://doi.org/10.1016/0166-218X(79)90043-X},
doi = {10.1016/0166-218X(79)90043-X},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HabibM79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/CogisH79,
author = {Olivier Cogis and
Michel Habib},
title = {Nombre de sauts et graphes s{\'{e}}rie-parall{\`{e}}les},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {13},
number = {1},
pages = {3--18},
year = {1979},
url = {https://doi.org/10.1051/ita/1979130100031},
doi = {10.1051/ITA/1979130100031},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/CogisH79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-05-06 20:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
