Christian Laforest

Available identifiers

zbMath Open laforest.christianMaRDI QIDQ186177

List of research outcomes

Publication	Date of Publication	Type
Introduction to routing problems with mandatory transitions	2023-08-14	Paper
On the complexity of independent dominating set with obligations in graphs	2022-02-01	Paper
Graph problems with obligations	2019-10-11	Paper
https://portal.mardi4nfdi.de/entity/Q4560218	2018-12-10	Paper
Domination problems with no conflicts	2018-05-24	Paper
https://portal.mardi4nfdi.de/entity/Q2965836	2017-03-03	Paper
Some Hamiltonian Properties of One-Conflict Graphs	2015-09-15	Paper
Nash-Williams-type and Chvátal-type Conditions in One-Conflict Graphs	2015-02-20	Paper
An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions	2014-11-04	Paper
https://portal.mardi4nfdi.de/entity/Q5406226	2014-04-01	Paper
Solving the Minimum Independent Domination Set Problem in Graphs by Exact Algorithm and Greedy Heuristic	2014-02-24	Paper
New Approximation Algorithms for the Vertex Cover Problem	2014-01-17	Paper
https://portal.mardi4nfdi.de/entity/Q2865867	2013-12-11	Paper
Trees in Graphs with Conflict Edges or Forbidden Transitions	2013-05-28	Paper
A new lower bound on the independence number of graphs	2013-04-18	Paper
Mean analysis of an online algorithm for the vertex cover problem	2010-08-16	Paper
A better list heuristic for vertex cover	2010-04-19	Paper
Hardness results and approximation algorithms of \(k\)-tuple domination in graphs	2009-07-09	Paper
AN OPTIMAL REBUILDING STRATEGY FOR AN INCREMENTAL TREE PROBLEM	2009-06-30	Paper
An Optimal Rebuilding Strategy for a Decremental Tree Problem	2009-03-12	Paper
Bicriteria scheduling for contiguous and non contiguous parallel tasks	2008-09-03	Paper
https://portal.mardi4nfdi.de/entity/Q5755518	2007-08-13	Paper
Computing and Combinatorics	2006-01-11	Paper
Computing and Combinatorics	2005-06-15	Paper
https://portal.mardi4nfdi.de/entity/Q4813143	2004-08-12	Paper
Edge-disjoint spanners of complete bipartite graphs	2002-03-29	Paper
Scattering and multi-scattering in trees and meshes, with local routing and without buffering	2000-01-12	Paper
Edge-disjoint spanners of complete graphs and complete digraphs	1999-12-20	Paper
Broadcast and gossip in line-communication mode	1998-11-01	Paper
Minimum gossip bus networks	1996-11-25	Paper

Research outcomes over time

This page was built for person: Christian Laforest