| 2022 | ISAAC | Nested Active-Time Scheduling. | Nairen Cao, Jeremy T. Fineman, Shi Li, Julin Mestre, Katina Russell, Seeun William Umboh |
| 2022 | ISAAC | Approximating the Minimum Logarithmic Arrangement Problem. | Julin Mestre, Sergey Pupyrev |
| 2022 | SPAA | Brief Announcement: Nested Active-Time Scheduling. | Nairen Cao, Jeremy T. Fineman, Shi Li, Julin Mestre, Katina Russell, Seeun William Umboh |
| 2021 | ISAAC | On the Extended TSP Problem. | Julin Mestre, Sergey Pupyrev, Seeun William Umboh |
| 2020 | COCOON | An Optimal Lower Bound for Hierarchical Universal Solutions for TSP on the Plane. | Patrick Eades, Julin Mestre |
| 2020 | COCOON | Tight Approximation for the Minimum Bottleneck Generalized Matching Problem. | Julin Mestre, Nicols E. Stier Moses |
| 2017 | Algosensors | Barrier Coverage with Uniform Radii in 2D. | Andrew Cherry, Joachim Gudmundsson, Julin Mestre |
| 2017 | EuroPar | Towards Memory-Optimal Schedules for SDF. | Mitchell Jones, Julin Mestre, Bernhard Scholz |
| 2017 | ISAAC | Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements. | Serge Gaspers, Joachim Gudmundsson, Julin Mestre, Stefan Rmmele |
| 2017 | ISAAC | Precedence-Constrained Min Sum Set Cover. | Jessica McClintock, Julin Mestre, Anthony Wirth |
| 2015 | IJCAI | Welfare Maximization in Fractional Hedonic Games. | Haris Aziz, Serge Gaspers, Joachim Gudmundsson, Julin Mestre, Hanjo Tubig |
| 2014 | ICALP | How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions. | Wiebke Hhn, Julin Mestre, Andreas Wiese |
| 2012 | MSWIM | Enabling mobile distributed social networking on smartphones. | Kanchana Thilakarathna, Henrik Petander, Julin Mestre, Aruna Seneviratne |
| 2012 | WG | Optimization Problems in Dotted Interval Graphs. | Danny Hermelin, Julin Mestre, Dror Rawitz |
| 2011 | ICALP | On Tree-Constrained Matchings and Generalizations. | Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Klau, Julin Mestre |
| 2010 | ALENEX | A Polynomial Delay Algorithm for Enumerating Approximate Solutions to the Interval Constrained Coloring Problem. | Stefan Canzar, Khaled M. Elbassioni, Julin Mestre |
| 2010 | ESA | When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings - (Extended Abstract). | Nikhil Bansal, Anupam Gupta, Jian Li, Julin Mestre, Viswanath Nagarajan, Atri Rudra |
| 2010 | ICDM | Bonsai: Growing Interesting Small Trees. | Stephan Seufert, Srikanta J. Bedathur, Julin Mestre, Gerhard Weikum |
| 2010 | IPCO | Universal Sequencing on a Single Machine. | Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julin Mestre, Martin Skutella, Leen Stougie |
| 2010 | STACS | Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model. | Leah Epstein, Asaf Levin, Julin Mestre, Danny Segev |
| 2009 | ICALP | Popular Mixed Matchings. | Telikepalli Kavitha, Julin Mestre, Meghana Nasre |
| 2009 | ISAAC | Max-Coloring Paths: Tight Bounds and Extensions. | Telikepalli Kavitha, Julin Mestre |
| 2009 | STACS | Improved Approximations for Guarding 1.5-Dimensional Terrains. | Khaled M. Elbassioni, Erik Krohn, Domagoj Matijevic, Julin Mestre, Domagoj Severdija |
| 2008 | ESA | An Optimal Incremental Algorithm for Minimizing Lateness with Rejection. | Samir Khuller, Julin Mestre |
| 2008 | SODA | Adaptive local ratio. | Julin Mestre |
| 2008 | STACS | Lagrangian Relaxation and Partial Cover (Extended Abstract). | Julin Mestre |
| 2007 | ESA | Approximation of Partial Capacitated Vertex Cover. | Reuven Bar-Yehuda, Guy Flysher, Julin Mestre, Dror Rawitz |
| 2007 | ESA | To Fill or Not to Fill: The Gas Station Problem. | Samir Khuller, Azarakhsh Malekian, Julin Mestre |
| 2006 | ESA | Greedy in Approximation Algorithms. | Julin Mestre |
| 2006 | ICALP | Weighted Popular Matchings. | Julin Mestre |