online bibliography
Here is the bibliography related to GraPHedron. If you have any publication whose results were obtained with the help of GraPHedron or which concern this system, we would appreciate that you add your bibliography entry.
If you want to cite GraPHedron, please use the following reference.
Please, log in to download the full bibliography as PDF or bibtex files.
Articles in journal
- Bruyère, V., and Mélot, H.
Fibonacci index and stability number of graphs: a polyhedral study.
Journal of Combinatorial Optimization 18 (2009), 207 - 228.
[See information] [Download] - Cardinal, J., Langerman, S., and Levy, E.
Improved approximation ratios for edge dominating set in dense
graphs.
Theoretical Computer Science 410 (2009), 949-957.
[See information] [Download] - Christophe, J., Dewez, S., Doignon, J., Elloumi, S., Fasbender, G.,
Grégoire, P., Huygens, D., Labbé, M., Mélot, H., and Yaman, H.
Linear inequalities among graph invariants: using graphedron to
uncover optimal relationships.
Networks 52 (2008), 287-298.
[See information] [Download] - Mélot, H.
Facet defining inequalities among graph invariants: the system
graphedron.
Discrete Applied Mathematics 156 (2008), 1875-1891.
[See information] [Download]
Articles in proceedings
- Bruyère, V., and Mélot, H.
Turan graphs, stability number, and fibonacci index.
In Combinatorial Optimization and Applications, COCOA 2008
(St. John's, Newfounland, Canada, 2008), vol. 5165 of Lecture Notes in
Computer Science, Springer-Verlag, pp. 127-138.
[See information] [Download] - Cardinal, J., Labbé, M., Langerman, S., Levy, E., and Mélot, H.
A tight analysis of the maximal matching heuristic.
In Computing and Combinatorics: 11th Annual International
Conference, COCOON 2005 (Kunming, China, 2005), vol. 3595 of Lecture
Notes in Computer Science, Springer-Verlag, pp. 701 - 709.
[See information] [Download] - Cardinal, J., Langerman, S., and Levy, E.
Improved approximation bounds for edge dominating set in dense
graphs.
In Proc. Workshop on Approximation and Online Algorithms
(WAOA) (2006), vol. 4368 of Lecture Notes in Computer Science,
Springer-Verlag, pp. 108-120.
[See information] [Download] - Cardinal, J., and Levy, E.
Connected vertex covers in dense graphs.
In Proceedings of APPROX (2008), Springer-Verlag, Ed.,
vol. 5171 of LNCS, pp. 35-48.
[See information] [Download]
Submitted
- Bruyère, V., Joret, G., and Mélot, H.
Trees with given stability number and minimum number of stable sets.
Submitted, 2010.
[See information] [Download]
PhD theses
- Levy, E.
Approximation Algorithms for Covering Problems in Dense Graphs.
PhD thesis, Université Libre de Bruxelles, 2009.
[See information] [Download] - Mélot, H.
On Automated and Computer Assisted Conjectures in Graph Theory.
PhD thesis, Université de Mons-Hainaut, 2006.
[See information] [Download]
Master's theses
- Cereghetti, J.
Création et utilisation de tables d'isomorphisme pour le calcul
d'invariants de graphes, 2009.
MSc thesis, Université de Mons-Hainaut.
[See information] - Kontos, K.
Approche polyédrale pour l'identification de relations linéaires
optimales entre invariants de graphes, 2004.
MSc thesis, Université Libre de Bruxelles.
[See information]
