default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Christian Laforest
@inproceedings{DBLP:conf/sofsem/LaforestM23,
author = {Christian Laforest and
Timoth{\'{e}}e Martinod},
editor = {Leszek Gasieniec},
title = {Introduction to Routing Problems with Mandatory Transitions},
booktitle = {{SOFSEM} 2023: Theory and Practice of Computer Science - 48th International
Conference on Current Trends in Theory and Practice of Computer Science,
{SOFSEM} 2023, Nov{\'{y}} Smokovec, Slovakia, January 15-18,
2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13878},
pages = {254--266},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-23101-8\_17},
doi = {10.1007/978-3-031-23101-8\_17},
timestamp = {Fri, 23 Dec 2022 17:47:39 +0100},
biburl = {https://dblp.org/rec/conf/sofsem/LaforestM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LaforestM22,
author = {Christian Laforest and
Timoth{\'{e}}e Martinod},
title = {On the complexity of independent dominating set with obligations in
graphs},
journal = {Theor. Comput. Sci.},
volume = {904},
pages = {1--14},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2021.05.018},
doi = {10.1016/J.TCS.2021.05.018},
timestamp = {Tue, 08 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LaforestM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CornetL18,
author = {Alexis Cornet and
Christian Laforest},
title = {Domination problems with no conflicts},
journal = {Discret. Appl. Math.},
volume = {244},
pages = {78--88},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2018.03.018},
doi = {10.1016/J.DAM.2018.03.018},
timestamp = {Sun, 19 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CornetL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/CornetL18,
author = {Alexis Cornet and
Christian Laforest},
editor = {Donghyun Kim and
R. N. Uma and
Alexander Zelikovsky},
title = {Graph Problems with Obligations},
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 = {183--197},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04651-4\_13},
doi = {10.1007/978-3-030-04651-4\_13},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/CornetL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/CornetL17,
author = {Alexis Cornet and
Christian Laforest},
title = {Total Domination, Connected Vertex Cover and Steiner Tree with Conflicts},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {19},
number = {3},
year = {2017},
url = {https://doi.org/10.23638/DMTCS-19-3-17},
doi = {10.23638/DMTCS-19-3-17},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/CornetL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/LaforestM15,
author = {Christian Laforest and
Benjamin Mom{\`{e}}ge},
editor = {Giuseppe F. Italiano and
Tiziana Margaria{-}Steffen and
Jaroslav Pokorn{\'{y}} and
Jean{-}Jacques Quisquater and
Roger Wattenhofer},
title = {Nash-Williams-type and Chv{\'{a}}tal-type Conditions in One-Conflict
Graphs},
booktitle = {{SOFSEM} 2015: Theory and Practice of Computer Science - 41st International
Conference on Current Trends in Theory and Practice of Computer Science,
Pec pod Sn{\v{e}}{\v{z}}kou, Czech Republic, January 24-29, 2015.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8939},
pages = {327--338},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-46078-8\_27},
doi = {10.1007/978-3-662-46078-8\_27},
timestamp = {Sun, 02 Jun 2019 21:12:07 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/LaforestM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/LaforestM14,
author = {Christian Laforest and
Benjamin Mom{\`{e}}ge},
editor = {Jan Kratochv{\'{\i}}l and
Mirka Miller and
Dalibor Froncek},
title = {Some Hamiltonian Properties of One-Conflict Graphs},
booktitle = {Combinatorial Algorithms - 25th International Workshop, {IWOCA} 2014,
Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8986},
pages = {262--273},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-19315-1\_23},
doi = {10.1007/978-3-319-19315-1\_23},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/LaforestM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/opodis/DelbotLR14,
author = {Fran{\c{c}}ois Delbot and
Christian Laforest and
Stephane Rovedakis},
editor = {Marcos K. Aguilera and
Leonardo Querzoni and
Marc Shapiro},
title = {Self-stabilizing Algorithms for Connected Vertex Cover and Clique
Decomposition Problems},
booktitle = {Principles of Distributed Systems - 18th International Conference,
{OPODIS} 2014, Cortina d'Ampezzo, Italy, December 16-19, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8878},
pages = {307--322},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-14472-6\_21},
doi = {10.1007/978-3-319-14472-6\_21},
timestamp = {Mon, 15 Jun 2020 17:10:01 +0200},
biburl = {https://dblp.org/rec/conf/opodis/DelbotLR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DelbotLR14,
author = {Fran{\c{c}}ois Delbot and
Christian Laforest and
Stephane Rovedakis},
title = {Self-stabilizing algorithms for Connected Vertex Cover and Clique
decomposition problems},
journal = {CoRR},
volume = {abs/1408.2116},
year = {2014},
url = {http://arxiv.org/abs/1408.2116},
eprinttype = {arXiv},
eprint = {1408.2116},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DelbotLR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AngelCL13,
author = {Eric Angel and
Romain Campigotto and
Christian Laforest},
title = {A new lower bound on the independence number of graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {6},
pages = {847--852},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.10.001},
doi = {10.1016/J.DAM.2012.10.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AngelCL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rairo/LaforestP13,
author = {Christian Laforest and
Raksmey Phan},
title = {Solving the Minimum Independent Domination Set Problem in Graphs by
Exact Algorithm and Greedy Heuristic},
journal = {{RAIRO} Oper. Res.},
volume = {47},
number = {3},
pages = {199--221},
year = {2013},
url = {https://doi.org/10.1051/ro/2013034},
doi = {10.1051/RO/2013034},
timestamp = {Wed, 02 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rairo/LaforestP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/DelbotLP13,
author = {Fran{\c{c}}ois Delbot and
Christian Laforest and
Raksmey Phan},
editor = {Thierry Lecroq and
Laurent Mouchard},
title = {New Approximation Algorithms for the Vertex Cover Problem},
booktitle = {Combinatorial Algorithms - 24th International Workshop, {IWOCA} 2013,
Rouen, France, July 10-12, 2013, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8288},
pages = {438--442},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45278-9\_39},
doi = {10.1007/978-3-642-45278-9\_39},
timestamp = {Wed, 25 Sep 2019 18:08:04 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/DelbotLP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/KanteLM13,
author = {Mamadou Moustapha Kant{\'{e}} and
Christian Laforest and
Benjamin Mom{\`{e}}ge},
editor = {Peter van Emde Boas and
Frans C. A. Groen and
Giuseppe F. Italiano and
Jerzy R. Nawrocki and
Harald Sack},
title = {An Exact Algorithm to Check the Existence of (Elementary) Paths and
a Generalisation of the Cut Problem in Graphs with Forbidden Transitions},
booktitle = {{SOFSEM} 2013: Theory and Practice of Computer Science, 39th International
Conference on Current Trends in Theory and Practice of Computer Science,
{\v{S}}pindler{\r{u}}v Ml{\'{y}}n, Czech Republic, January 26-31,
2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7741},
pages = {257--267},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-35843-2\_23},
doi = {10.1007/978-3-642-35843-2\_23},
timestamp = {Mon, 28 Aug 2023 21:17:48 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/KanteLM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/KanteLM13,
author = {Mamadou Moustapha Kant{\'{e}} and
Christian Laforest and
Benjamin Mom{\`{e}}ge},
editor = {T.{-}H. Hubert Chan and
Lap Chi Lau and
Luca Trevisan},
title = {Trees in Graphs with Conflict Edges or Forbidden Transitions},
booktitle = {Theory and Applications of Models of Computation, 10th International
Conference, {TAMC} 2013, Hong Kong, China, May 20-22, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7876},
pages = {343--354},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38236-9\_31},
doi = {10.1007/978-3-642-38236-9\_31},
timestamp = {Tue, 25 Feb 2025 11:15:14 +0100},
biburl = {https://dblp.org/rec/conf/tamc/KanteLM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/AngelCL12,
author = {Eric Angel and
Romain Campigotto and
Christian Laforest},
editor = {Ralf Klasing},
title = {Implementation and Comparison of Heuristics for the Vertex Cover Problem
on Huge Graphs},
booktitle = {Experimental Algorithms - 11th International Symposium, {SEA} 2012,
Bordeaux, France, June 7-9, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7276},
pages = {39--50},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-30850-5\_5},
doi = {10.1007/978-3-642-30850-5\_5},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/wea/AngelCL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aor/AngelCL11,
author = {Eric Angel and
Romain Campigotto and
Christian Laforest},
title = {Analysis and Comparison of Three Algorithms for the Vertex Cover Problem
on Large Graphs with Low Memory Capacities},
journal = {Algorithmic Oper. Res.},
volume = {6},
number = {1},
pages = {56--67},
year = {2011},
url = {http://journals.hil.unb.ca/index.php/AOR/article/view/15266},
timestamp = {Wed, 10 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/aor/AngelCL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tsi/BirmeleDLT11,
author = {Etienne Birmel{\'{e}} and
Fran{\c{c}}ois Delbot and
Christian Laforest and
Nicolas Thibault},
title = {Analyse du nombre de perturbations lors du maintien d'un arbre de
connexion de faible diam{\`{e}}tre},
journal = {Tech. Sci. Informatiques},
volume = {30},
number = {7},
pages = {781--808},
year = {2011},
url = {https://doi.org/10.3166/tsi.30.781-808},
doi = {10.3166/TSI.30.781-808},
timestamp = {Wed, 24 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tsi/BirmeleDLT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cj/BlinLRT10,
author = {L{\'{e}}lia Blin and
Christian Laforest and
Stephane Rovedakis and
Nicolas Thibault},
title = {Hardness Results and Heuristic for Multi-groups Interconnection},
journal = {Comput. J.},
volume = {53},
number = {9},
pages = {1497--1507},
year = {2010},
url = {https://doi.org/10.1093/comjnl/bxp072},
doi = {10.1093/COMJNL/BXP072},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cj/BlinLRT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/DelbotL10,
author = {Fran{\c{c}}ois Delbot and
Christian Laforest},
title = {Analytical and experimental comparison of six algorithms for the vertex
cover problem},
journal = {{ACM} J. Exp. Algorithmics},
volume = {15},
year = {2010},
url = {https://doi.org/10.1145/1671970.1865971},
doi = {10.1145/1671970.1865971},
timestamp = {Sun, 19 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/DelbotL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BirmeleDL09,
author = {Etienne Birmel{\'{e}} and
Fran{\c{c}}ois Delbot and
Christian Laforest},
title = {Mean analysis of an online algorithm for the vertex cover problem},
journal = {Inf. Process. Lett.},
volume = {109},
number = {9},
pages = {436--439},
year = {2009},
url = {https://doi.org/10.1016/j.ipl.2008.12.021},
doi = {10.1016/J.IPL.2008.12.021},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BirmeleDL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocnet/BarthBCFLV09,
author = {Dominique Barth and
Pascal Berthom{\'{e}} and
Dominique Chiaroni and
Jean{-}Michel Fourneau and
Christian Laforest and
Sandrine Vial},
title = {Mixing Convergence and Deflection Strategies for Packet Routing in
All-Optical Networks},
journal = {{JOCN}},
volume = {1},
number = {3},
pages = {222--234},
year = {2009},
url = {https://doi.org/10.1364/jocn.1.000222},
doi = {10.1364/JOCN.1.000222},
timestamp = {Tue, 23 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocnet/BarthBCFLV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/ThibaultL09,
author = {Nicolas Thibault and
Christian Laforest},
title = {Online time constrained scheduling with penalties},
booktitle = {23rd {IEEE} International Symposium on Parallel and Distributed Processing,
{IPDPS} 2009, Rome, Italy, May 23-29, 2009},
pages = {1--8},
publisher = {{IEEE}},
year = {2009},
url = {https://doi.org/10.1109/IPDPS.2009.5160994},
doi = {10.1109/IPDPS.2009.5160994},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipps/ThibaultL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/BailleBLR08,
author = {Fabien Baille and
Evripidis Bampis and
Christian Laforest and
Christophe Rapine},
title = {Bicriteria scheduling for contiguous and non contiguous parallel tasks},
journal = {Ann. Oper. Res.},
volume = {159},
number = {1},
pages = {97--106},
year = {2008},
url = {https://doi.org/10.1007/s10479-007-0282-1},
doi = {10.1007/S10479-007-0282-1},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/BailleBLR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DelbotL08,
author = {Fran{\c{c}}ois Delbot and
Christian Laforest},
title = {A better list heuristic for vertex cover},
journal = {Inf. Process. Lett.},
volume = {107},
number = {3-4},
pages = {125--127},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.02.004},
doi = {10.1016/J.IPL.2008.02.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DelbotL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/join/ThibaultL07,
author = {Nicolas Thibault and
Christian Laforest},
title = {An Optimal Rebuilding Strategy for an Incremental Tree Problem},
journal = {J. Interconnect. Networks},
volume = {8},
number = {1},
pages = {75--99},
year = {2007},
url = {https://doi.org/10.1142/S0219265907001916},
doi = {10.1142/S0219265907001916},
timestamp = {Fri, 05 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/join/ThibaultL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aor/KlasingLPT06,
author = {Ralf Klasing and
Christian Laforest and
Joseph G. Peters and
Nicolas Thibault},
title = {Constructing Incremental Sequences in Graphs},
journal = {Algorithmic Oper. Res.},
volume = {1},
number = {2},
year = {2006},
url = {http://journals.hil.unb.ca/index.php/AOR/article/view/666},
timestamp = {Wed, 10 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/aor/KlasingLPT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/europar/BailleBL06,
author = {Fabien Baille and
L{\'{e}}lia Blin and
Christian Laforest},
editor = {Wolfgang E. Nagel and
Wolfgang V. Walter and
Wolfgang Lehner},
title = {Distributed Approximation Allocation Resources Algorithm for Connecting
Groups},
booktitle = {Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference,
Dresden, Germany, August 28 - September 1, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4128},
pages = {519--529},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11823285\_54},
doi = {10.1007/11823285\_54},
timestamp = {Thu, 25 Dec 2025 12:47:20 +0100},
biburl = {https://dblp.org/rec/conf/europar/BailleBL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/ThibaultL06,
author = {Nicolas Thibault and
Christian Laforest},
editor = {Paola Flocchini and
Leszek Gasieniec},
title = {An Optimal Rebuilding Strategy for a Decremental Tree Problem},
booktitle = {Structural Information and Communication Complexity, 13th International
Colloquium, {SIROCCO} 2006, Chester, UK, July 2-5, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4056},
pages = {157--170},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11780823\_13},
doi = {10.1007/11780823\_13},
timestamp = {Tue, 14 May 2019 10:00:55 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/ThibaultL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/BailleBLT05,
author = {Fabien Baille and
Evripidis Bampis and
Christian Laforest and
Nicolas Thibault},
editor = {Lusheng Wang},
title = {On-Line Simultaneous Maximization of the Size and the Weight for Degradable
Intervals Schedules},
booktitle = {Computing and Combinatorics, 11th Annual International Conference,
{COCOON} 2005, Kunming, China, August 16-29, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3595},
pages = {308--317},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11533719\_32},
doi = {10.1007/11533719\_32},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/BailleBLT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/europar/BailleBLT05,
author = {Fabien Baille and
Evripidis Bampis and
Christian Laforest and
Nicolas Thibault},
editor = {Jos{\'{e}} C. Cunha and
Pedro D. Medeiros},
title = {On-Line Bicriteria Interval Scheduling},
booktitle = {Euro-Par 2005, Parallel Processing, 11th International Euro-Par Conference,
Lisbon, Portugal, August 30 - September 2, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3648},
pages = {312--322},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11549468\_36},
doi = {10.1007/11549468\_36},
timestamp = {Mon, 03 Mar 2025 21:04:12 +0100},
biburl = {https://dblp.org/rec/conf/europar/BailleBLT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ispan/ThibaultL05,
author = {Nicolas Thibault and
Christian Laforest},
title = {On-line Time-Constrained Scheduling Problem for the Size on kappa
machines},
booktitle = {8th International Symposium on Parallel Architectures, Algorithms,
and Networks, {ISPAN} 2005, December 7-9. 2005, Las Vegas, Nevada,
{USA}},
pages = {20--24},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/ISPAN.2005.65},
doi = {10.1109/ISPAN.2005.65},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ispan/ThibaultL05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KlasingL04,
author = {Ralf Klasing and
Christian Laforest},
title = {Hardness results and approximation algorithms of k-tuple domination
in graphs},
journal = {Inf. Process. Lett.},
volume = {89},
number = {2},
pages = {75--83},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.10.004},
doi = {10.1016/J.IPL.2003.10.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KlasingL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ppl/BailleBL04,
author = {Fabien Baille and
Evripidis Bampis and
Christian Laforest},
title = {A Note On Bicriteria Schedules With Optimal Approximations Ratios},
journal = {Parallel Process. Lett.},
volume = {14},
number = {2},
pages = {315--323},
year = {2004},
url = {https://doi.org/10.1142/S0129626404001891},
doi = {10.1142/S0129626404001891},
timestamp = {Tue, 24 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ppl/BailleBL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/BailleBL04,
author = {Fabien Baille and
Evripidis Bampis and
Christian Laforest},
editor = {Kyung{-}Yong Chwa and
J. Ian Munro},
title = {Maximization of the Size and the Weight of Schedules of Degradable
Intervals},
booktitle = {Computing and Combinatorics, 10th Annual International Conference,
{COCOON} 2004, Jeju Island, Korea, August 17-20, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3106},
pages = {219--228},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27798-9\_25},
doi = {10.1007/978-3-540-27798-9\_25},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/BailleBL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/DestreLV04,
author = {Christian Destr{\'{e}} and
Christian Laforest and
Sandrine Vial},
title = {Assignment of Shortest Paths Spanning Trees in Meshes},
booktitle = {18th International Parallel and Distributed Processing Symposium {(IPDPS}
2004), {CD-ROM} / Abstracts Proceedings, 26-30 April 2004, Santa Fe,
New Mexico, {USA}},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/IPDPS.2004.1302903},
doi = {10.1109/IPDPS.2004.1302903},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipps/DestreLV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/europar/Laforest03,
author = {Christian Laforest},
editor = {Harald Kosch and
L{\'{a}}szl{\'{o}} B{\"{o}}sz{\"{o}}rm{\'{e}}nyi and
Hermann Hellwagner},
title = {Construction of Efficient Communication Sub-structures: Non-approximability
Results and Polynomial sub-cases},
booktitle = {Euro-Par 2003. Parallel Processing, 9th International Euro-Par Conference,
Klagenfurt, Austria, August 26-29, 2003. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2790},
pages = {903--910},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-45209-6\_124},
doi = {10.1007/978-3-540-45209-6\_124},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/europar/Laforest03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/DestreLV03,
author = {Christian Destr{\'{e}} and
Christian Laforest and
Sandrine Vial},
editor = {Jop F. Sibeyn},
title = {The Broadcast Assignment Problem},
booktitle = {{SIROCCO} 10: Proceedings of the 10th Internaltional Colloquium on
Structural Information Complexity, June 18-20, 2003, Ume{\aa} Sweden},
series = {Proceedings in Informatics},
volume = {17},
pages = {101--116},
publisher = {Carleton Scientific},
year = {2003},
timestamp = {Thu, 05 Feb 2004 10:15:25 +0100},
biburl = {https://dblp.org/rec/conf/sirocco/DestreLV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/europar/BarthBCFLV02,
author = {Dominique Barth and
Pascal Berthom{\'{e}} and
T. Czarchoski and
Jean{-}Michel Fourneau and
Christian Laforest and
Sandrine Vial},
editor = {Burkhard Monien and
Rainer Feldmann},
title = {A Mixed Deflection and Convergence Routing Algorithm: Design and Performance},
booktitle = {Euro-Par 2002, Parallel Processing, 8th International Euro-Par Conference
Paderborn, Germany, August 27-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2400},
pages = {767--774},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45706-2\_107},
doi = {10.1007/3-540-45706-2\_107},
timestamp = {Sun, 02 Nov 2025 21:27:42 +0100},
biburl = {https://dblp.org/rec/conf/europar/BarthBCFLV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/LaforestV02,
author = {Christian Laforest and
Sandrine Vial},
title = {Short Cut Eulerian Routing of Datagrams in All Optical Point-to-Point
Networks},
booktitle = {16th International Parallel and Distributed Processing Symposium {(IPDPS}
2002), 15-19 April 2002, Fort Lauderdale, FL, USA, CD-ROM/Abstracts
Proceedings},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/IPDPS.2002.1015518},
doi = {10.1109/IPDPS.2002.1015518},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipps/LaforestV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/opodis/Laforest02,
author = {Christian Laforest},
editor = {Alain Bui and
Hac{\`{e}}ne Fouchal},
title = {A good balance between weight and distances for multipoint trees},
booktitle = {Procedings of the 6th International Conference on Principles of Distributed
Systems. {OPODIS} 2002, Reims, France, December 11-13, 2002},
series = {Studia Informatica Universalis},
volume = {3},
pages = {193--202},
publisher = {Suger, Saint-Denis, rue Catulienne, France},
year = {2002},
timestamp = {Tue, 20 Jan 2004 14:15:23 +0100},
biburl = {https://dblp.org/rec/conf/opodis/Laforest02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LaforestLSS01,
author = {Christian Laforest and
Arthur L. Liestman and
Thomas C. Shermer and
Dominique Sotteau},
title = {Edge-disjoint spanners of complete bipartite graphs},
journal = {Discret. Math.},
volume = {234},
number = {1-3},
pages = {65--76},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00192-8},
doi = {10.1016/S0012-365X(00)00192-8},
timestamp = {Sun, 19 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/LaforestLSS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigops/BouabdallahL00,
author = {Abdelmadjid Bouabdallah and
Christian Laforest},
title = {A Distributed token/based Algorithm for the Dynamic Resource Allocation
Problem},
journal = {{ACM} {SIGOPS} Oper. Syst. Rev.},
volume = {34},
number = {3},
pages = {60--68},
year = {2000},
url = {https://doi.org/10.1145/506117.506125},
doi = {10.1145/506117.506125},
timestamp = {Tue, 14 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigops/BouabdallahL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/IrlaneKL00,
author = {Alexis Irlande and
Jean{-}Claude K{\"{o}}nig and
Christian Laforest},
editor = {Michele Flammini and
Enrico Nardelli and
Guido Proietti and
Paul G. Spirakis},
title = {Construction of low-cost and low-diameter Steiner trees for multipoint
groups},
booktitle = {{SIROCCO} 7, Proceedings of the 7th International Colloquium on Structural
Information and Communication Complexity, Laquila, Italy, June 20-22,
2000},
pages = {197--210},
publisher = {Carleton Scientific},
year = {2000},
timestamp = {Thu, 05 Feb 2004 10:15:13 +0100},
biburl = {https://dblp.org/rec/conf/sirocco/IrlaneKL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LaforestLPSS99,
author = {Christian Laforest and
Arthur L. Liestman and
David Peleg and
Thomas C. Shermer and
Dominique Sotteau},
title = {Edge-disjoint spanners of complete graphs and complete digraphs},
journal = {Discret. Math.},
volume = {203},
number = {1-3},
pages = {133--159},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(99)00012-6},
doi = {10.1016/S0012-365X(99)00012-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/LaforestLPSS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pc/BarthL99,
author = {Dominique Barth and
Christian Laforest},
title = {Scattering and multi-scattering in trees and meshes, with local routing
and without buffering},
journal = {Parallel Comput.},
volume = {25},
number = {8},
pages = {1035--1057},
year = {1999},
url = {https://doi.org/10.1016/S0167-8191(99)00028-9},
doi = {10.1016/S0167-8191(99)00028-9},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/pc/BarthL99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Laforest97,
author = {Christian Laforest},
title = {Broadcast and Gossip in Line-communication Mode},
journal = {Discret. Appl. Math.},
volume = {80},
number = {2-3},
pages = {161--176},
year = {1997},
url = {https://doi.org/10.1016/S0166-218X(97)00054-1},
doi = {10.1016/S0166-218X(97)00054-1},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Laforest97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/hicss/LaforestLSS97,
author = {Christian Laforest and
Arthur L. Liestman and
Thomas C. Shermer and
Dominique Sotteau},
title = {Edge Disjoint Graph Spanners of Complete Graphs and Complete Digraphs},
booktitle = {30th Annual Hawaii International Conference on System Sciences (HICSS-30),
7-10 January 1997, Maui, Hawaii, {USA}},
pages = {191--199},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/HICSS.1997.667214},
doi = {10.1109/HICSS.1997.667214},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/hicss/LaforestLSS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/FraigniaudL96,
author = {Pierre Fraigniaud and
Christian Laforest},
title = {Minimum gossip bus networks},
journal = {Networks},
volume = {27},
number = {4},
pages = {239--251},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0037(199605)27:3\&\#60;239::AID-NET8\&\#62;3.0.CO;2-J},
doi = {10.1002/(SICI)1097-0037(199605)27:3\&\#60;239::AID-NET8\&\#62;3.0.CO;2-J},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/FraigniaudL96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/europar/Laforest96,
author = {Christian Laforest},
editor = {Luc Boug{\'{e}} and
Pierre Fraigniaud and
Anne Mignotte and
Yves Robert},
title = {Gossip in Trees under Line-Communication Mode},
booktitle = {Euro-Par '96 Parallel Processing, Second International Euro-Par Conference,
Lyon, France, August 26-29, 1996, Proceedings, Volume {I}},
series = {Lecture Notes in Computer Science},
volume = {1123},
pages = {333--340},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61626-8\_43},
doi = {10.1007/3-540-61626-8\_43},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/europar/Laforest96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/europar/FujitaLP96,
author = {Satoshi Fujita and
Christian Laforest and
Stephane Perennes},
editor = {Luc Boug{\'{e}} and
Pierre Fraigniaud and
Anne Mignotte and
Yves Robert},
title = {A Gossip Algorithm for Bus Networks with Buses of Limited Length},
booktitle = {Euro-Par '96 Parallel Processing, Second International Euro-Par Conference,
Lyon, France, August 26-29, 1996, Proceedings, Volume {I}},
series = {Lecture Notes in Computer Science},
volume = {1123},
pages = {353--360},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61626-8\_46},
doi = {10.1007/3-540-61626-8\_46},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/europar/FujitaLP96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/parco/FraigniaudL93,
author = {Pierre Fraigniaud and
Christian Laforest},
editor = {Gerhard R. Joubert and
Denis Trystram and
Frans J. Peters and
David J. Evans},
title = {Disjoint Spanning Trees of Small Depth},
booktitle = {Parallel Computing: Trends and Applications, {PARCO} 1993, Grenoble,
France},
pages = {105--112},
publisher = {Elsevier},
year = {1993},
timestamp = {Tue, 13 Mar 2018 14:43:53 +0100},
biburl = {https://dblp.org/rec/conf/parco/FraigniaudL93.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.
last updated on 2025-01-20 22:57 CET 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:
