Eglantine Camby

12 papers B 1C 2Journal 9
YearRankTypeTitle / Venue / Authors
2019 J jnl
Price of Connectivity for the Vertex Cover Problem and the Dominating Set Problem: Conjectures and Investigation of Critical Graphs.
Graphs Comb.
Eglantine Camby
2018 J jnl
A sharp lower bound on the number of non-equivalent colorings of graphs of order and maximum degree.
Discret. Appl. Math.
Romain Absil, Eglantine Camby, Alain Hertz, Hadrien Mélot
2017 J jnl
A note on an induced subgraph characterization of domination perfect graphs.
Discret. Appl. Math.
Eglantine Camby, Fränk Plein
2016 J jnl
A New Characterization of P
Algorithmica
Eglantine Camby, Oliver Schaudt
2014 B conf
A New Characterization of P
WG
Eglantine Camby, Oliver Schaudt
2014 J jnl
A new characterization of $P_k$-free graphs.
CoRR
Eglantine Camby, Oliver Schaudt
2014 J jnl
The Price of Connectivity for Vertex Cover.
Discret. Math. Theor. Comput. Sci.
Eglantine Camby, Jean Cardinal, Samuel Fiorini, Oliver Schaudt
2014 J jnl
The price of connectivity for dominating set: Upper bounds and complexity.
Discret. Appl. Math.
Eglantine Camby, Oliver Schaudt
2013 J jnl
A Note on Connected Dominating Set in Graphs Without Long Paths And Cycles
CoRR
Eglantine Camby, Oliver Schaudt
2013 C conf
Connected dominating set in graphs without long paths and cycles.
CTW
Eglantine Camby, Oliver Schaudt
2013 J jnl
The Price of Connectivity for Vertex Cover
CoRR
Eglantine Camby, Jean Cardinal, Samuel Fiorini, Oliver Schaudt
2012 C conf
The Price of Connectivity for Vertex Cover: Perfect, Near-Perfect and Critical Graphs.
CTW
Eglantine Camby, Jean Cardinal, Samuel Fiorini, Oliver Schaudt