default search action
BibTeX records: Jean Daligault
@article{DBLP:journals/siamcomp/BousquetDT18, author = {Nicolas Bousquet and Jean Daligault and St{\'{e}}phan Thomass{\'{e}}}, title = {Multicut Is {FPT}}, journal = {{SIAM} J. Comput.}, volume = {47}, number = {1}, pages = {166--207}, year = {2018}, url = {https://doi.org/10.1137/140961808}, doi = {10.1137/140961808}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/BousquetDT18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@phdthesis{DBLP:phd/hal/Daligault11, author = {Jean Daligault}, title = {Techniques combinatoires pour les algorithmes param{\'{e}}tr{\'{e}}s et les noyaux, avec applications aux probl{\`{e}}mes de multicoupe. (Combinatorial Techniques for Parameterized Algorithms and Kernels, with Applications to Multicut.)}, school = {Montpellier 2 University, France}, year = {2011}, url = {https://tel.archives-ouvertes.fr/tel-00804206}, timestamp = {Tue, 21 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/phd/hal/Daligault11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BousquetDT11, author = {Nicolas Bousquet and Jean Daligault and St{\'{e}}phan Thomass{\'{e}}}, editor = {Lance Fortnow and Salil P. Vadhan}, title = {Multicut is {FPT}}, booktitle = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC} 2011, San Jose, CA, USA, 6-8 June 2011}, pages = {459--468}, publisher = {{ACM}}, year = {2011}, url = {https://doi.org/10.1145/1993636.1993698}, doi = {10.1145/1993636.1993698}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/BousquetDT11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/DaligaultGR10, author = {Jean Daligault and Daniel Gon{\c{c}}alves and Micha{\"{e}}l Rao}, title = {Diamond-free circle graphs are Helly circle}, journal = {Discret. Math.}, volume = {310}, number = {4}, pages = {845--849}, year = {2010}, url = {https://doi.org/10.1016/j.disc.2009.09.022}, doi = {10.1016/J.DISC.2009.09.022}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dm/DaligaultGR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/DaligaultGKY10, author = {Jean Daligault and Gregory Z. Gutin and Eun Jung Kim and Anders Yeo}, title = {{FPT} algorithms and kernels for the Directed k-Leaf problem}, journal = {J. Comput. Syst. Sci.}, volume = {76}, number = {2}, pages = {144--152}, year = {2010}, url = {https://doi.org/10.1016/j.jcss.2009.06.005}, doi = {10.1016/J.JCSS.2009.06.005}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/DaligaultGKY10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/order/DaligaultRT10, author = {Jean Daligault and Micha{\"{e}}l Rao and St{\'{e}}phan Thomass{\'{e}}}, title = {Well-Quasi-Order of Relabel Functions}, journal = {Order}, volume = {27}, number = {3}, pages = {301--315}, year = {2010}, url = {https://doi.org/10.1007/s11083-010-9174-0}, doi = {10.1007/S11083-010-9174-0}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/order/DaligaultRT10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1010-5197, author = {Nicolas Bousquet and Jean Daligault and St{\'{e}}phan Thomass{\'{e}}}, title = {Multicut is {FPT}}, journal = {CoRR}, volume = {abs/1010.5197}, year = {2010}, url = {http://arxiv.org/abs/1010.5197}, eprinttype = {arXiv}, eprint = {1010.5197}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1010-5197.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwpec/DaligaultT09, author = {Jean Daligault and St{\'{e}}phan Thomass{\'{e}}}, editor = {Jianer Chen and Fedor V. Fomin}, title = {On Finding Directed Trees with Many Leaves}, booktitle = {Parameterized and Exact Computation, 4th International Workshop, {IWPEC} 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {5917}, pages = {86--97}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-11269-0\_7}, doi = {10.1007/978-3-642-11269-0\_7}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/iwpec/DaligaultT09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/BousquetDTY09, author = {Nicolas Bousquet and Jean Daligault and St{\'{e}}phan Thomass{\'{e}} and Anders Yeo}, editor = {Susanne Albers and Jean{-}Yves Marion}, title = {A Polynomial Kernel for Multicut in Trees}, booktitle = {26th International Symposium on Theoretical Aspects of Computer Science, {STACS} 2009, February 26-28, 2009, Freiburg, Germany, Proceedings}, series = {LIPIcs}, volume = {3}, pages = {183--194}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany}, year = {2009}, url = {https://doi.org/10.4230/LIPIcs.STACS.2009.1824}, doi = {10.4230/LIPICS.STACS.2009.1824}, timestamp = {Tue, 22 Jun 2021 15:43:57 +0200}, biburl = {https://dblp.org/rec/conf/stacs/BousquetDTY09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0902-1047, author = {Nicolas Bousquet and Jean Daligault and St{\'{e}}phan Thomass{\'{e}} and Anders Yeo}, title = {A Polynomial Kernel For Multicut In Trees}, journal = {CoRR}, volume = {abs/0902.1047}, year = {2009}, url = {http://arxiv.org/abs/0902.1047}, eprinttype = {arXiv}, eprint = {0902.1047}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0902-1047.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0904-2658, author = {Jean Daligault and St{\'{e}}phan Thomass{\'{e}}}, title = {On Finding Directed Trees with Many Leaves}, journal = {CoRR}, volume = {abs/0904.2658}, year = {2009}, url = {http://arxiv.org/abs/0904.2658}, eprinttype = {arXiv}, eprint = {0904.2658}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0904-2658.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0810-4946, author = {Jean Daligault and Gregory Z. Gutin and Eun Jung Kim and Anders Yeo}, title = {{FPT} Algorithms and Kernels for the Directed {\textdollar}k{\textdollar}-Leaf Problem}, journal = {CoRR}, volume = {abs/0810.4946}, year = {2008}, url = {http://arxiv.org/abs/0810.4946}, eprinttype = {arXiv}, eprint = {0810.4946}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0810-4946.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/analco/DaligaultM06, author = {Jean Daligault and Conrado Mart{\'{\i}}nez}, editor = {Daniel Panario and Robert Sedgewick}, title = {On the Variance of Quickselect}, booktitle = {Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics, {ANALCO} 2006, Miami, Florida, USA, January 21, 2006}, pages = {205--210}, publisher = {{SIAM}}, year = {2006}, url = {https://doi.org/10.1137/1.9781611972962.3}, doi = {10.1137/1.9781611972962.3}, timestamp = {Tue, 23 May 2017 01:10:31 +0200}, biburl = {https://dblp.org/rec/conf/analco/DaligaultM06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.