Odile Marcotte's publications

Articles published in refereed journals
1. A Vertex Cut Algorithm for Model Order Reduction of Parasitic Resistive Networks, P. Kitanov, O. Marcotte, W. H. A. Schilders, and S. Shontz, COMPEL 31,6 pp. 1850-1871.
2. Optimizing the Design of a Wind Farm Collection Network, A. Hertz, O. Marcotte, A. Mdimagh, M. Carreau, and F. Welt, INFOR, Vol. 50, No. 2, May 2012, pp. 95-104.
3. Self Calibration of a Pinhole Camera, P. Armand, A. Kiselev, O. Marcotte, D. Orban, and V. Zalzal, Mathematics-in-Industry Case Studies Journal, Vol. 1, 2009, pp. 81-98.
4. On the Feedback Vertex Set Polytope of a Series-Parallel Graph, S. Fiorini and O. Marcotte, Discrete Optimization, Vol. 6, 2009, pp. 271-287.
5. Average Distance and Maximum Induced Forest, P. Hansen, A. Hertz, R. Kilani, O. Marcotte, and D. Schindl, Journal of Graph Theory, Vol. 60, 2009, pp. 31-54.
6. A Column Generation and Branch-and-Cut Algorithm for the Channel Assignment Problem, T. D. Hemazro, B. Jaumard, and O. Marcotte, Computers and Operations Research, Vol. 35, No. 4, 2008, pp. 1204-1226.
7. Dispatching buses in a depot using block patterns, M. Hamdouni, G. Desaulniers, O. Marcotte, F. Soumis, and M. van Putten, Transportation Science, Vol. 40, No. 3, August 2006, pp. 364-377.
8. A branch-and-cut algorithm for the Multiple Depot Vehicle Scheduling Problem, A. Hadjar, O. Marcotte, and F. Soumis, Operations Research, Vol. 54, No. 1, January-February 2006, pp. 130-149.
9. Comparison of column generation models for channel assignment in cellular networks, B. Jaumard, O. Marcotte, C. Meyer, and T. Vovor, Discrete Applied Mathematics, Vol 112/1-3, September 2001, pp. 217-240.
10. Optimal edge-colourings for a class of planar multigraphs, O. Marcotte, Combinatorica 21 (3), 2001, pp. 361-394.
11. Topological design of two-level telecommunication networks with modular switches, S. Chamberland, O. Marcotte, and B. Sansò, Operations Research, Vol. 48, No. 5, 2000, pp. 745-760.
12. Fixed preference channel allocation for cellular telephone systems, J. Janssen, K. Kilakos, and O. Marcotte, IEEE Transactions on Vehicular Technology, Vol. 48, No. 2, March 1999, pp. 533-541.
13. Fractional and integral colourings, K. Kilakos and O. Marcotte, Mathematical Programming, Vol. 76, 1997, pp. 333-347.
14. Fast matching algorithms for points on a polygon, O. Marcotte and S. Suri, SIAM Journal on Computing, Vol. 20, No. 3, 1991, pp. 405-422.
15. Extending an edge-coloring, O. Marcotte and P. D. Seymour, Journal of Graph Theory, Vol. 14, No. 5, November 1990, pp. 565-573.
16. On a network design problem that is intractable on trees, D. Bienstock and O. Marcotte, Mathematics of Operations Research, Vol. 15, No. 3, August 1990, pp. 530-544.
17. Packing and covering with integral feasible flows in integral supply-demand networks, R. E. Bixby, O. Marcotte, and L. E. Trotter, Jr., Mathematical Programming, Vol. 39, No. 3, December 1987, pp. 231-239.
18. On the chromatic index of multigraphs and a conjecture of Seymour (I), O. Marcotte, Journal of Combinatorial Theory, Series B, Vol. 41, No. 3, December 1986, pp. 306-331.
19. An instance of the cutting stock problem for which the rounding property does not hold, O. Marcotte, Operations Research Letters, Vol. 4, No. 5, February 1986, pp. 239-243.
20. An interactive branch-and-bound algorithm for multiple criteria optimization, O. Marcotte and R. M. Soland, Management Science, Vol. 32, No. 1, January 1986, pp. 61-75.
21. The cutting stock problem and integer rounding, O. Marcotte, Mathematical Programming, Vol. 33, September 1985, pp. 82-92.

Article submitted to a refereed journal
22. On the maximum orders of an induced forest, an induced tree, and a stable set, A. Hertz, O. Marcotte, and D. Schindl, Cahier du GERAD G-2011-45.

Articles published in refereed conference proceedings
23. How Is Meaning Grounded in Dictionary Definitions?, A. Blondin Massé, G. Chicoisne, Y. Gargouri, S. Harnad, O. Marcotte, and O. Picard, Proceedings of the 3rd TextGraphs workshop on Graph-based Algorithms for Natural Language Processing (Coling 2008), pp. 17-24.
24. Un modèle d'adaptation pour les oeuvres médiatiques, A. Ouali, B. Kerhervé, O. Marcotte, and P. Landon, Revue des Nouvelles Technologies de l'Information, RNTI-E-5, Extraction des connaissances: Etat et perspectives, pp. 147-151, Editions Cepadus (2005).
25. The height and length of colour switching, O. Marcotte and P. Hansen, Graph Colouring and Applications (Editors: P. Hansen and O. Marcotte), CRM Proceedings and Lecture Notes, Vol. 23, 1999, American Mathematical Society, pp. 101-110.
26. Mathematical models and exact methods for channel assignment in cellular networks, B. Jaumard, O. Marcotte, and C. Meyer, Telecommunications Network Planning (Editors: P. Soriano and B. Sansò), Kluwer, Norwell, MA, pp. 239-256 (1998).
27. Heuristics for ring network design when several types of switches are available, S. Chamberland, O. Marcotte, and B. Sansò, Proceedings of the IEEE International Conference on Communications, 1997, pp. 570-574.
28. On the joint topological, dimensioning and location problem for broadband networks, S. Chamberland, O. Marcotte, and B. Sansò, Proceedings of the IEEE/IFIP Conference on Broadband Communications, 1996, pp. 525-536.
29. Intelligent component retrieval for software reuse, H. Mili, O. Marcotte, and A. Kabbaj, Proceedings of the Third Maghrebian Conference on Software Engineering and Artificial Intelligence, MIPS and IEEE-Computer Society, 1994, pp. 101-114.
30. On the chromatic index of multigraphs and a conjecture of Seymour, (II), O. Marcotte, Polyhedral Combinatorics, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 1, 1990, American Mathematical Society, pp. 245-279.
31. Exact edge-colorings of graphs without prescribed minors, O. Marcotte, Polyhedral Combinatorics, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 1, 1990, American Mathematical Society, pp. 235-243.
32. Fast matching algorithms for points on a polygon, O. Marcotte and S. Suri, Proceedings of the 30th Annual Symposium on Foundations of Computer Science, IEEE Press, 1989, pp. 60-65 (an extended abstract followed by the publication of Article No. 12).
33. On geometric matching, O. Marcotte and S. Suri, Proceedings of the Fifth Annual ACM Symposium on Computational Geometry, ACM Press, 1989, pp. 302-314.
34. An application of matroid polyhedral theory to unit-execution time, tree-precedence job scheduling, O. Marcotte and L. E. Trotter, Jr., Progress in Combinatorial Optimization, Academic Press, 1984, pp. 263-271.

Books
35. Graph Theory and Combinatorial Optimization (Editors: D. Avis, A. Hertz, and O. Marcotte), GERAD 25th Anniversary Series, 2005, Springer, New York, New York, USA.
36. Graph Colouring and Applications (Editors: P. Hansen and O. Marcotte), CRM Proceedings and Lecture Notes, Vol. 23, 1999, American Mathematical Society, Providence, Rhode Island, USA.

Note
37. Review of the book Recent Advances in Algorithms and Combinatorics (Editors: B. A. Reed and C. L. Sales) by O. Marcotte, CMS Notes, Vol. 37, No. 4, May 2005, pp. 4-6.

Proceedings
38. Proceedings of the First Montreal Industrial Problem Solving Workshop, August 20-24, 2007 (Editor: O. Marcotte), CRM Research Report CRM-3276. proceedings page
39. Proceedings of the Second Montreal Industrial Problem Solving Workshop, August 18-22, 2008 (Editor: O. Marcotte), CRM Research Report CRM-3277. proceedings page
40. Proceedings of the Third Montreal Industrial Problem Solving Workshop, August 17-21, 2009 (Editor: O. Marcotte), CRM Research Report CRM-3315. proceedings page