Filtrer vos résultats
- 49
- 21
- 1
- 34
- 27
- 4
- 3
- 1
- 1
- 1
- 4
- 66
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 6
- 4
- 3
- 2
- 2
- 4
- 5
- 3
- 2
- 3
- 1
- 10
- 3
- 5
- 8
- 5
- 2
- 67
- 4
- 68
- 7
- 6
- 4
- 4
- 4
- 4
- 3
- 2
- 2
- 1
- 71
- 32
- 15
- 12
- 6
- 6
- 5
- 5
- 5
- 5
- 5
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
71 résultats
|
Blockers and Transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a gridDiscrete Mathematics, 2010, 310, pp.132--146. ⟨10.1016/j.disc.2009.08.009⟩
Article dans une revue
hal-00974959v1
|
||
|
An FPT Algorithm for Planar Multicuts with Sources and Sinks on the Outer FaceAlgorithmica, 2019, 81 (1), pp.224-237. ⟨10.1007/s00453-018-0443-4⟩
Article dans une revue
hal-02444156v1
|
||
|
On the edge capacitated Steiner tree problemDiscrete Optimization, 2020, 38, pp.100607. ⟨10.1016/j.disopt.2020.100607⟩
Article dans une revue
hal-02967013v1
|
||
Flot maximum robuste avec incertitudes sur les chemins16eme congrès annuel de la ROADEF, Feb 2015, Marseille, France. pp.1
Communication dans un congrès
hal-01126605v1
|
|||
|
Blockers for the stability number and the chromatic numberGraphs and Combinatorics, 2015, 31 (1), pp.73-90. ⟨10.1007/s00373-013-1380-2⟩
Article dans une revue
hal-01505546v1
|
||
Battery Energy Management of a Telecommunications Company to Participate in the Curtailment Market and Reduce the Total Energy Cost2020 IEEE 8th International Conference on Smart Energy Grid Engineering (SEGE), Aug 2020, Oshawa, France. pp.121-127, ⟨10.1109/SEGE49949.2020.9181937⟩
Communication dans un congrès
hal-02987640v1
|
|||
|
Managing a multi battery energy storage system of a telecommunications company in order to reduce the total energy cost2021
Pré-publication, Document de travail
halshs-03264095v1
|
||
Disjoint paths in sparse graphsDiscrete Applied Mathematics, 2009, 157, pp.3558-3568
Article dans une revue
hal-01126378v1
|
|||
The maximum integer multiterminal flow problem in directed graphsOperations Research Letters, 2007, 35, pp.195-200
Article dans une revue
hal-01125132v1
|
|||
|
Locally bounded k -colorings of treesRAIRO - Operations Research, 2009, 43 (1), pp.27-33. ⟨10.1051/ro/2009003⟩
Article dans une revue
hal-02436823v1
|
||
Optimizing Battery Usage for a Telecommunications Company Participating in a Curtailing MarketPGMODays 2019, 2019, Paris, France
Communication dans un congrès
hal-02476801v1
|
|||
Directed Steiner trees with diffusion costsJournal of Combinatorial Optimization, 2016, 32 (4), pp.1089 - 1106. ⟨10.1007/s10878-015-9925-3⟩
Article dans une revue
hal-01613972v1
|
|||
The Maximum Integer Multiterminal Flow ProblemOTA'06 Int. Workshop of ICCSA 2006, Glasgow, Jan 2006, X, France. pp.738-747
Communication dans un congrès
hal-01125180v1
|
|||
On the complexity of the multicut problem in bounded tree-width graphs and digraphsDiscrete Applied Mathematics, 2008, 156, pp.1908-1917
Article dans une revue
hal-01126374v1
|
|||
A simple algorithm for multicuts in planar graphs with outer terminalsDiscrete Applied Mathematics, 2009, 157, pp.1959-1964
Article dans une revue
hal-01126379v1
|
|||
Approximation du problème de flot multiterminal entier maximum dans les graphes orientésROADEF'06 7ème congrès, février, Feb 2006, Lille, France. pp.48
Communication dans un congrès
hal-01125159v1
|
|||
|
On the edge capacitated Steiner tree problem2017
Pré-publication, Document de travail
hal-01465403v1
|
||
Discrete tomography and graph coloringEURO XXI, Reykjavik, Iceland, Jan 2006, X, France
Communication dans un congrès
hal-01125314v1
|
|||
|
Optimisation robuste du câblage d'un parc éolien sous contraintes de load flowROADEF 2019, Feb 2020, Montpellier, France
Communication dans un congrès
hal-02475426v1
|
||
A Steiner tree problem with capacity constraintsGO IX, Ninth international colloquium on Graphs and Optimization, Jul 2014, Sirmione, Italy. pp.12
Communication dans un congrès
hal-01126587v1
|
|||
Multicuts in bounded tree-width (di)graphsFifth Int. Colloquium on Graphs and Optimisation, Leukerbad, Switzerland, Jan 2006, X, France. pp.9
Communication dans un congrès
hal-01125260v1
|
|||
Etude du problème de la multicoupe minimale à cardinalité contrainteROADEF'06 7ème congrès, février, Feb 2006, Lille, France. pp.54
Communication dans un congrès
hal-01125157v1
|
|||
A bibliography on multicut and integer multiflow problems2004
Autre publication scientifique
hal-00085921v1
|
|||
|
Minimum d-Transversals of Maximum-Weight Stable Sets in TreesEuropean conference on combinatorics, graph theory and applications. EuroComb'11, Aug 2011, Budapest, Hungary. pp.129-134, ⟨10.1016/j.endm.2011.09.022⟩
Communication dans un congrès
hal-01125892v1
|
||
Reconstruction de la coloration dun graphe à partir de projections de chaînesROADEF'06 7ème congrès ROADEF - Février, Jan 2006, Lille, France. pp.51
Communication dans un congrès
hal-01125163v1
|
|||
|
Blockers and TransversalsDiscrete Mathematics, 2009, 13, pp.4306--4314. ⟨10.1016/j.disc.2009.01.006⟩
Article dans une revue
hal-00975349v1
|
||
|
Inapproximability proof of DSTLB and USTLB in planar graphs[Research Report] Supélec. 2013
Rapport
hal-00793424v2
|
||
Edge disjoint paths and max integral multiflow/min multicut theorems in planar graphsICGT'05 7th Int. Colloquium on Graph Theory, Hyeres, Jan 2005, X, France. pp.55-60
Communication dans un congrès
hal-01125124v1
|
|||
Cabling optimization of a windfarm and capacitated K-Steiner treePGMO-COPI'14 Gaspard Monge Program for Optimization - Conference on Optimization Practices in Industry, Oct 2014, Palaiseau (91), France. 4 p
Communication dans un congrès
hal-01126586v1
|
|||
Maximum edge disjoint paths and minimum unweighted multicut problems in grid graphsContibuted talk, Proceedings Graph Theory (GT'04), Paris, Jan 2004, X, France. pp.23
Communication dans un congrès
hal-01125059v1
|