Eglantine Camby
Title
Cited by
Cited by
Year
A New Characterization of -Free Graphs
E Camby, O Schaudt
Algorithmica 75 (1), 205-217, 2016
272016
The price of connectivity for vertex cover
E Camby, J Cardinal, S Fiorini, O Schaudt
arXiv preprint arXiv:1303.2478, 2013
252013
An algorithm for cost optimization of PMU and communication infrastructure in WAMS
MARS Cruz, HRO Rocha, MHM Paiva, MEV Segatto, E Camby, ...
International Journal of Electrical Power & Energy Systems 106, 96-104, 2019
182019
The price of connectivity for dominating set: Upper bounds and complexity
E Camby, O Schaudt
Discrete Applied Mathematics 177, 53-59, 2014
182014
A primal-dual 3-approximation algorithm for hitting 4-vertex paths
E Camby, J Cardinal, M Chapelle, S Fiorini, G Joret
9th International colloquium on graph theory and combinatorics, 2014
82014
A note on an induced subgraph characterization of domination perfect graphs
E Camby, F Plein
Discrete applied mathematics 217, 711-717, 2017
72017
Price of connectivity for the vertex cover problem and the dominating set problem: Conjectures and investigation of critical graphs
E Camby
Graphs and Combinatorics 35 (1), 103-118, 2019
52019
Studying graphs and their induced subgraphs with the computer: GraphsInGraphs
E Camby
42016
Connecting hitting sets and hitting paths in graphs
E Camby
Doctoral Thesis, 2015
42015
A note on connected dominating set in graphs without long paths and cycles
E Camby, O Schaudt
arXiv preprint arXiv:1303.2868, 2013
42013
The Price of Connectivity for vertex cover: Perfect, Near-Perfect and Critical Graphs
E Camby, J Cardinal, S Fiorini, O Schaudt
11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012
32012
Flight-connection Prediction for Airline Crew Scheduling to Construct Initial Clusters for OR Optimizer
Y Yaakoubi, F Soumis, S Lacoste-Julien
arXiv preprint arXiv:2009.12501, 2020
22020
Expected distance based on random walks
E Camby, G Caporossi, MHM Paiva, MEV Segatto
Journal of Mathematical Chemistry 56 (2), 618-629, 2018
22018
A sharp lower bound on the number of non-equivalent colorings of graphs of order n and maximum degree n− 3
R Absil, E Camby, A Hertz, H Melot
Discrete applied mathematics 234, 3-11, 2018
22018
Price of independence for the dominating set problem
E Camby
GERAD, École des hautes études commerciales, 2017
22017
The extended Jaccard distance in complex networks
É Camby, G Caporossi
GERAD, École des hautes études commerciales, 2017
12017
Research on the price of connectivity for the vertex cover problem and the dominating set problem, with the help of the system GraphsInGraphs
E Camby, G Caporossi
Proc. CTW, 31-34, 2017
12017
Connected dominating set in graphs without long paths and cycles.
E Camby, O Schaudt
CTW, 39-42, 2013
12013
From Cartesian product graph to a robust communication network
E Camby
International Network Optimization Conference 2017, 2017
2017
The Price of Connectivity for Vertex Cover
O Schaudt, S Fiorini, J Cardinal, E Camby
Discrete Mathematics & Theoretical Computer Science 16, 2014
2014
The system can't perform the operation now. Try again later.
Articles 1–20