| 2017 | INFOCOM | Expect the unexpected: Sub-second optimization for segment routing. | Steven Gay, Renaud Hartert, Stefano Vissicchio |
| 2016 | CP | Compact-Table: Efficiently Filtering Table Constraints with Reversible Sparse Bit-Sets. | Jordan Demeulenaere, Renaud Hartert, Christophe Lecoutre, Guillaume Perez, Laurent Perron, Jean-Charles Rgin, Pierre Schaus |
| 2015 | CP | Conflict Ordering Search for Scheduling Problems. | Steven Gay, Renaud Hartert, Christophe Lecoutre, Pierre Schaus |
| 2015 | CP | Simple and Scalable Time-Table Filtering for the Cumulative Constraint. | Steven Gay, Renaud Hartert, Pierre Schaus |
| 2015 | CP | Solving Segment Routing Problems with Hybrid Constraint Programming Techniques. | Renaud Hartert, Pierre Schaus, Stefano Vissicchio, Olivier Bonaventure |
| 2015 | CPAIOR | Time-Table Disjunctive Reasoning for the Cumulative Constraint. | Steven Gay, Renaud Hartert, Pierre Schaus |
| 2015 | SIGCOMM | A Declarative and Expressive Approach to Control Forwarding Paths in Carrier-Grade Networks. | Renaud Hartert, Stefano Vissicchio, Pierre Schaus, Olivier Bonaventure, Clarence Filsfils, Thomas Telkamp, Pierre Franois |
| 2014 | AAAI | A Support-Based Algorithm for the Bi-Objective Pareto Constraint. | Renaud Hartert, Pierre Schaus |
| 2013 | CP | Multi-Objective Large Neighborhood Search. | Pierre Schaus, Renaud Hartert |