Papers with * have been completed to a journal publication.

  1. Circular coloring of signed bipartite planar graphs. EUROCOMB'21, Barcelona (Online). With Z. Wang.
  2. Cliques in exact distance powers of graphs of given maximum degree. LAGOS2021. With F. Foucaud, S. Mishra, N. Narayanan, and P. Valicov
  3. Sensitivity Lower Bounds from Linear Dependencies. LIPIcs, Volume 170, MFCS 2020. With S. Laplante and A. Sunny.
  4. Smallest C_{2l+1}-critical graphs of odd-girth 2k+1. Changat, Manoj (ed.) et al., Algorithms and discrete applied mathematics. 6th international conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020. Proceedings. Cham: Springer (ISBN 978-3-030-39218-5/pbk; 978-3-030-39219-2/ebook). Lecture Notes in Computer Science 12016, 184-196 (2020). With Laurent Beaudou and Florent Foucaud.
  5. A new graph parameter to measure linearity. Gao, Xiaofeng (ed.) et al., Combinatorial optimization and applications. 11th international conference, COCOA 2017, Shanghai, China, December 16–18, 2017. Proceedings. Part II. Cham: Springer (ISBN 978-3-319-71146-1/pbk; 978-3-319-71147-8/ebook). Lecture Notes in Computer Science 10628, 154-168 (2017). With P. Charbit, M. Habib and L. Mouatadid.
  6. * Safe Sets in Graphs: Graph Classes and Structural Parameters, 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2016), December 16-18, 2016 in Hong Kong, China. Lecture Notes in Computer Science 10043 (2016) p. 241-253. With R. Agueda, N. Cohen, S. Fujita, S. Legay, Y. Manoussakis, Y. Matsui, L. Montero, Y. Otachi, T. Sakuma, Z. Tuza and R. Xu.
  7. * The complexity of signed graph and edge-coloured graph homomorphisms, Bordeaux Graph Theory Workshop 2016. With Richard Brewster, Florent Foucaud, Pavol Hell.
  8. * Edge clique covers in graphs with independence number 2, Bordeaux Graph Theory Workshop 2016. With Ben Seamone, Manuel Lafond, Gena Hahn, Pierre Charbit, Marcin Kamiński, Rezvan Sherkati and Nicolas Lichiardopol.
  9. * Algorithms and complexity for metric dimension and location-domination on interval and permutation graphs. Proceedings of the 41st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2015). Graph-theoretic concepts in computer science, 456–471, Lecture Notes in Comput. Sci., 9224, Springer, Berlin, 2016. With F. Foucaud, G. B. Mertzios, A. Parreau and P. Valicov.
  10. The complexity of signed graph homomorphisms and signed constraint satisfaction. Proceedings of the 11th Latin American Symposium on Theoretical Informatics (LATIN 2014). LNCS 8392:526-537, 2014. With F. Foucaud.
  11. * On homomorphisms of planar signed graphs to signed projective cubes, EUROCOMB'13, Pisa Italy, with E. Rollová and E. Sopena.
  12. * Homomorphisms of signed bipartite graphs, EUROCOMB'13, Pisa Italy, with E. Rollová and E. Sopena.
  13. * Bounding K4-minor-free graphs in the homomorphism order, Bordeaux Graph Theory Workshop 2012. With Florent Foucaud.
  14. * Edge identifying codes. Electronic Notes in Discrete Mathematics 38:343-348, 2011. Proceedings of the 6th European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB 2011). With F. Foucaud, S. Gravier, A. Parreau and P. Valicov.
  15. * $K_5$-free bound for the class of planar graphs, in EUROCOMB'03 Abstracts, ITI Series 2003-145, J. Fiala ed., Charles University, pp 280-283, 2003.
  16. Optimal Strategy for Imperial Oil's Cold Lake Facilities, with Brian Alspach, Calin Anton, Amos Ben-Zwi, Kyle Biswanger, Yonqiang Cao, Glynis Carling, Huaxiong Huang, Dong Liang, Margaret Liang, Mufeed Mahmoud, Jim Muldowney, Marc Paulhus, Cristina Popescu, Miro Powojowski, Bruce Rout, Nikhil Shah, Shane Stark, Tzvetalin S. Vassilev. Proceedings [1] of the 4th[2] PIMS[3]Annual Industrial Problem Solving Workshop[4], Edmonton, Alberta, Canada, May 29 - June 2, 2000, Pages 7-32.