Filtrer vos résultats
- 48
- 2
- 31
- 17
- 1
- 1
- 33
- 19
- 4
- 2
- 4
- 3
- 4
- 3
- 2
- 4
- 3
- 1
- 1
- 1
- 2
- 3
- 2
- 2
- 5
- 4
- 1
- 3
- 49
- 1
- 50
- 1
- 1
- 1
- 1
- 50
- 5
- 5
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 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
- 1
- 1
50 résultats
|
|
|
triés par
|
Graph Theory and CombinatoricsICGT, 2014, Grenoble, France
Communication dans un congrès
hal-01420401v1
|
|||
|
|
The (2, k)-Connectivity Augmentation Problem: Algorithmic AspectsAlgorithmica, 2021, 83 (8), pp.2333-2350. ⟨10.1007/s00453-021-00829-4⟩
Article dans une revue
hal-03326082v1
|
||
|
|
Connectivity of orientations of 3-edge-connected graphsEuropean Journal of Combinatorics, 2021, 94, pp.103292. ⟨10.1016/j.ejc.2020.103292⟩
Article dans une revue
hal-03275463v1
|
||
Partition constrained covering of a symmetric crossing supermodular function by a graph,SIAM Journal on Discrete Mathematics, 2017, 31 (1), pp.335 - 382. ⟨10.1137/140996902⟩
Article dans une revue
hal-01529662v1
|
|||
|
|
On packing spanning arborescences with matroid constraintJournal of Graph Theory, 2020, 93 (2), pp.230-252. ⟨10.1002/jgt.22484⟩
Article dans une revue
hal-02273541v1
|
||
On (2,k)-connected graphsJournal of Graph Theory, 2019, 91 (4), pp.305 - 325
Article dans une revue
hal-02152394v1
|
|||
Hypergraph edge-connectivity augmentationWorkshop celebrating Frank's 60th, 2009, Budapest, Hungary
Communication dans un congrès
hal-00633792v1
|
|||
An excluded minor characterization of Seymour graphs,proceedings 15th IPCO, 2011, LNCS 6655, pp.1-13
Article dans une revue
hal-00677808v1
|
|||
|
|
Sandwich problems on orientationsJournal of the Brazilian Computer Society, 2012, 18 (2), pp.85-93. ⟨10.1007/s13173-012-0065-7⟩
Article dans une revue
hal-00717315v1
|
||
|
|
Packing of arborescences with matroid constraints via matroid intersectionMathematical Programming, 2020, 184 (1 - 2), pp.85-117. ⟨10.1007/s10107-019-01377-0⟩
Article dans une revue
hal-03005350v1
|
||
|
|
Eulerian orientations and vertex-connectivityDiscrete Applied Mathematics, 2021, pp.115 - 124. ⟨10.1016/j.dam.2020.09.022⟩
Article dans une revue
hal-03002865v1
|
||
|
|
On the complexity of finding well-balanced orientations with upper bounds on the out-degreesJournal of Combinatorial Optimization, 2023, 45 (1), pp.30. ⟨10.1007/s10878-022-00962-y⟩
Article dans une revue
hal-03961401v1
|
||
Old and new results on packing arborescences.9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, May 2015, Fukuoka, Japan
Communication dans un congrès
hal-01359348v1
|
|||
|
|
Packing of Mixed Hyperarborescences with Flexible Roots via Matroid IntersectionThe Electronic Journal of Combinatorics, 2021, 28 (3), ⟨10.37236/10105⟩
Article dans une revue
hal-03326074v1
|
||
Partition constrained covering of symmetric crossing supermodular functionsACM-SIAM Symposium on Discrete Algorithms, Jan 2010, Austin, United States. pp.1512-1520
Communication dans un congrès
hal-00451825v1
|
|||
Recent results on well-balanced orientationsDiscrete Optimization, 2008, 5 (4), pp.663-676
Article dans une revue
hal-00363639v1
|
|||
Simultaneous well-balanced orientations of graphsJournal of Combinatorial Theory, Series B, 2006, 96, pp.684-692
Article dans une revue
hal-00360181v1
|
|||
|
|
Packing of rigid spanning subgraphs and spanning treesJournal of Combinatorial Theory, Series B, 2014, 105, pp.17-25. ⟨10.1016/j.jctb.2013.11.003⟩
Article dans une revue
hal-00958668v1
|
||
Edge-splittings preserving edge-connectivity of graphsDiscrete Applied Mathematics, 2005, special issue : GRACO 2005, 2nd brasilian Symp. on Graphs, Algorithms & Combinatorics
Article dans une revue
hal-00360112v1
|
|||
On packing spanning arborescences with matroid constraintsThe European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB'17), May 2017, Vienne, Austria. pp.451 - 457
Communication dans un congrès
hal-01529665v1
|
|||
Packing mixed hyperarborescences2023, 12th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, Budapest, Hungary, 2023, March, ISBN 978-963-421-903-3
Proceedings/Recueil des communications
hal-04053264v1
|
|||
A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral CaseSIAM Journal on Discrete Mathematics, 2022, 36 (3), pp.1730-1747. ⟨10.1137/20M1372822⟩
Article dans une revue
hal-03860876v1
|
|||
|
|
Packing mixed hyperarborescencesDiscrete Optimization, 2023, 50, pp.100811. ⟨10.1016/j.disopt.2023.100811⟩
Article dans une revue
hal-04331404v1
|
||
|
|
A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case,APPROX 2020, Aug 2020, Seattle, United States. pp.61:1-61:12
Communication dans un congrès
hal-03002877v1
|
||
Edge-connectivity augmentation of graphs over symmetric parity familiesDiscrete Mathematics, 2008, 308 (24), pp.6527-6532
Article dans une revue
hal-00363848v1
|
|||
Covering symmetric semi-monotone functionsDiscrete Applied Mathematics, 2008, 156 (1), pp.138-144
Article dans une revue
hal-00187293v1
|
|||
|
|
Steiner connectivity problems in hypergraphsInformation Processing Letters, 2024, 183, pp.106428. ⟨10.1016/j.ipl.2023.106428⟩
Article dans une revue
hal-04191145v1
|
||
Edge-connectivity augmentation of graphs over symmetric parity familiesThe POC workshop celebrating Jack's 75 th, 2009, PARIS, France
Communication dans un congrès
hal-00633790v1
|
|||
Packing arborescences with matroid constraints via matroid intersectionFollow Up Workshop to Combinatorial Optimization, Aug 2018, Bonn, Germany
Communication dans un congrès
hal-02135591v1
|
|||
On the local splitting off theoremGRACO 2005, 2nd Brasilian Symposium on Graphs, Algorithms and Combinatorics, 2005, --, France. pp.57-61
Communication dans un congrès
hal-00375226v1
|
- 1
- 2