Monique Laurent

Monique Laurent

prof.dr.

 https://orcid.org/0000-0001-8474-2121

  • Warandelaan 2, Koopmans Building, room K 435

    5037 AB Tilburg

    Netherlands

1986 …2024

Research activity per year

Filter
Conference contribution

Search results

  • 2021

    Sum-of-squares hierarchies for binary polynomial optimization

    Slot, L. & Laurent, M., May 2021, Integer Programming and Combinatorial Optimization - Proceedings of the 22nd International Conference, IPCO 2021. Singh, M. & Williamson, D. P. (eds.). Cham: Springer Verlag, p. 43-57 (Lecture Notes in Computer Science; vol. 12707).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review

    4 Citations (Scopus)
  • 2015

    A Lex-BFS-based recognition algorithm for Robinsonian matrices

    Laurent, M. & Seminaroti, M., 2015, Proceedings of the 9th International Conference on Algorithms and Complexity (CIAC 2015). Vangelis, P. & Widmayer, P. (eds.). 2015 ed. Springer Verlag, Vol. 9079. p. 325-338 14 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review

  • On the closure of the completely positive semidefinite cone and linear approximations to quantum colorings

    Burgdorf, S., Laurent, M. & Piovesan, T., Nov 2015, Proceedings of the 10th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2015). Beigi, S. & Koenig, R. (eds.). Leibniz: Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Vol. 44. p. 127-146 (Leibniz International Proceedings in Informatics; vol. 44).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review

    6 Citations (Scopus)
  • 2014

    Optimization over polynomials: Selected topics

    Laurent, M., 2014, Proceedings of the International Congress of Mathematicians 2014 (ICM 2014). Jang, S. Y., Kim, Y. R., Lee, D.-W. & Yie, I. (eds.). Seoul: Kyung Moon SA Co. Ltd., p. 843-869

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review

  • 2013

    Handelman's hierarchy for the maximum stable set problem

    Laurent, M. & Sun, Z., 2013, Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2013). Cornelissen, K., Hoeksma, R., Hurink, J. & Manthey, B. (eds.). Enschede: University of Twente, Vol. WP 13-01. p. 155-158

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review

  • 2012

    The gram dimension of a graph

    Laurent, M. & Varvitsiotis, A., 2012, Proceedings of the 2nd International Symposium on Combinatorial Optimization (ISCO 2012). Mahjoub, A. R., Markakis, V., Milis, I. & Paschos, V. (eds.). Berlin Heidelberg: Springer Verlag, Vol. 7422. p. 356-367 (Lecture Notes in Computer Science; vol. 7422).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review

    5 Citations (Scopus)
  • 2011

    Computing the Grothendieck constant of some graph classes

    Laurent, M. & Varvitsiotis, A., 2011, Proceeding of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization (CTW 2011). Adacher, L., Flamini, M., Leo, G., Nicosia, G., Pacifici, A. & Piccialli, V. (eds.). Unknown Publisher, p. 184-188

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review

  • 2006

    New limits on fault-tolerant quantum computation

    Buhrman, H., Cleve, R., Laurent, M., Linden, N., Schrijver, A. & Unger, F., 2006, 47th Annual IEEE Symposium on foundations of computer science (FOCS 2006). New York: IEEE Computer Society, p. 411-419 9 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Professional

    48 Citations (Scopus)
  • 2005

    Semidefinite bounds for the stability number of a graph via sums of squares of polynomials

    Laurent, M. & Gvozdenovic, N., 2005, Integer programming and combinatorial optimization: 11th international IPCO conference, Berlin, Germany, June 8-10, 2005: Proceedings. Jünger, M. & Kaibel, V. (eds.). Berlin: Springer, p. 136-151 16 p. (Lecture notes in computer science; no. 3509).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Professional

    7 Citations (Scopus)
  • 1995

    Hypermetrics in geometry of numbers

    Laurent, M., Deza, M. M. & Grishukhin, V. P., 1995, Combinatorial optimization: Papers from the DIMACS special year. Cook, W., Lovász, L. & Seymour, P. (eds.). Providence, RI: American Mathematical Society, p. 1-109 109 p. (DIMACS series in discrete mathematics and theoretical computer science; no. 20).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Professional

  • 1994

    Hypercube embedding of distances with few values

    Laurent, M., 1994, Jerusalem Combinatorics '93: An international conference in combinatorics, May 9-17, 1993, Jerusalem, Israel. Barcelo, H. & Kalai, G. (eds.). Providence, R.I.: American Mathematical Society, p. 179-207 29 p. (Contemporary mathematics; no. 178).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Professional

    19 Citations (Scopus)
  • 1992

    The metric polytope

    Laurent, M. & Poljak, S., 1992, Integer programming and combinatorial optimization: Proceedings of a conference held at Carnegie Mellon University, May 25-27, 1992. Balas, E., Cornuejols, G. & Kannan, R. (eds.). Pittsburgh, PA: Carnegie Mellon University, Graduate School of Industrial Administration, p. 274-286 13 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Professional