The following pages link to Marc Demange (Q266807):
Displaying 50 items.
- On the minimum and maximum selective graph coloring problems in some graph classes (Q266810) (← links)
- Inverse chromatic number problems in interval and permutation graphs (Q319198) (← links)
- On the online track assignment problem (Q423916) (← links)
- \((p,k)\)-coloring problems in line graphs (Q817821) (← links)
- Algorithms for the on-line quota traveling salesman problem (Q834904) (← links)
- Time slot scheduling of compatible jobs (Q880586) (← links)
- A tutorial on the use of graph coloring for some problems in robotics (Q948648) (← links)
- The 0-1 inverse maximum stable set problem (Q955316) (← links)
- (Q1028480) (redirect page) (← links)
- Weighted coloring on planar, bipartite and split graphs: Complexity and approximation (Q1028481) (← links)
- Differential approximation algorithms for some combinatorial optimization problems (Q1274917) (← links)
- A generalization of König-Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios (Q1278660) (← links)
- A note on the approximation of a minimum-weight maximal independent set (Q1303785) (← links)
- Approximation results for the minimum graph coloring problem (Q1321829) (← links)
- On an approximation measure founded on the links between optimization and polynomial approximation theory (Q1351453) (← links)
- The approximability behaviour of some combinatorial problems with respect to the approximability of a class of maximum independent set problems (Q1356067) (← links)
- Improved approximations for maximum independent set via approximation chains (Q1372278) (← links)
- Differential approximation results for the Steiner tree problem (Q1431874) (← links)
- A note on online colouring problems in overlap graphs and their complements (Q1641110) (← links)
- Online firefighting on trees (Q1661869) (← links)
- A hypocoloring model for batch scheduling (Q1765371) (← links)
- On-line vertex-covering (Q1770381) (← links)
- Polynomial approximation algorithms with performance guarantees: an introduction-by-example (Q1771343) (← links)
- On inverse traveling salesman problems (Q1936660) (← links)
- On some coloring problems in grids (Q1939251) (← links)
- New results on maximum induced matchings in bipartite graphs and beyond (Q1951557) (← links)
- Bridging gap between standard and differential polynomial approximation: The case of bin-packing (Q1961735) (← links)
- Generalised online colouring problems in overlap graphs (Q2034796) (← links)
- A graph theoretical approach to the firebreak locating problem (Q2124231) (← links)
- A robust \(p\)-center problem under pressure to locate shelters in wildfire context (Q2195562) (← links)
- About some robustness and complexity properties of \(G\)-graphs networks (Q2255041) (← links)
- Firefighting on trees (Q2328866) (← links)
- Efficient recognition of equimatchable graphs (Q2350604) (← links)
- Complexity of the improper twin edge coloring of graphs (Q2409501) (← links)
- On the complexity of the selective graph coloring problem in some special classes of graphs (Q2453167) (← links)
- Partitioning cographs into cliques and stable sets (Q2568333) (← links)
- Improved approximations for weighted and unweighted graph problems (Q2581009) (← links)
- On some applications of the selective graph coloring problem (Q2629634) (← links)
- Orienteering problem with time-windows and updating delay (Q2658039) (← links)
- On-line computation and maximum-weighted hereditary subgraph problems (Q2853213) (← links)
- (Q2861543) (← links)
- Hardness and approximation of minimum maximal matchings (Q2935383) (← links)
- (Q3059318) (← links)
- (Q3059325) (← links)
- (Q3061962) (← links)
- (Q3070856) (← links)
- (Q3070857) (← links)
- (Q3142706) (← links)
- Selective Graph Coloring in Some Special Classes of Graphs (Q3167636) (← links)
- (p, k)-coloring problems in line graphs (Q3439661) (← links)
