Eglantine Camby

Publication Activity (10 Years)

Years Active: 2012-2019
Publications (10 Years): 4

Top Topics

Polynomial Time Approximation

Top Venues

Discret. Appl. Math.

Publications

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