Note: My full name is unfortunately quite common. All of my publications have either my current affiliation (CNRS) or my former ones (Toronto, Waterloo, Max Planck Institute). See also my dblp page.

In review (arXiv verions)

  1. Optimal strategies for weighted ray search (with K. Panagiotou) [arXiv]

  2. Online maximum matching with recourse (with C. Dürr and S. Jin) [arXiv]


Invited chapters

  1. Deterministic searching on the line. Encyclopedia of Algorithms, 2016 [link]


Journal publications

  1. Competitive search in a network (with T. Lidbetter) European Journal of Operational Research, 2020 [link]

  2. Interruptible algorithms for multiproblem solving (with A. López-Ortiz) Journal of Scheduling, 2020 [link]

  3. Stochastic dominance and the bijective ratio of online algorithms (with M. Renault and P. Schweitzer) Algorithmica, 2019 [link]

  4. Primal-Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow Time Problems (with G. Lucarelli and NK Thang) Algorithmica, 2019 [link]

  5. Parameterized Analysis of the Online Priority and Node-Weighted Steiner Tree Problems Theory of Computing Systems, 2019 [link]

  6. The expanding search ratio of a graph (with C. Dürr and T. Lidbetter) Discrete Applied Mathematics, 2019 [link]

  7. On the separation and equivalence of paging strategies and other online algorithms (with R. Dorrigiv and A. López-Ortiz) Algorithmica, 2018. [link]

  8. Online Bin Packing with Advice of Small Size (with C. Dürr, S. Kamali, M. Renault and A. Rosen) Theory of Computing Systems, 2018. [link]

  9. Multi-processor Search and Scheduling Problems with Setup Cost (with C. Dürr, A. López-Ortiz and D. Arsenio) Theory of Computing Systems, 2017. [link]

  10. Optimal scheduling of contract algorithms with soft deadlines (with A. López-Ortiz) Journal of Scheduling, 2017. [link]

  11. Infinite linear programming and online searching with turn cost (with C. Dürr and D. Arsenio) Theoretical Computer Science, 2017 [link]

  12. Optimal Scheduling of Contract Algorithms for Anytime Problem-Solving (with A. López-Ortiz and A. Hamel) Journal of AI Research, 2014 [link]

  13. Multi-target ray searching problems (with A. López-Ortiz and K. Panagiotou) Theoretical Computer Science, 2014 [link]

  14. Paging and list update under bijective analysis (with P. Schweitzer) Journal of the ACM, 2013 [link]

  15. Randomized priority algorithms (with A. Borodin) Theoretical Computer Science [link]

  16. Tight Bounds for Quasirandom Rumor Spreading (with B. Doerr, A. Huber and K. Panagiotou) Electronic Journal of Combinatorics [link]

  17. The Power of Priority Algorithms for Facility Location and Set Cover (With A. Borodin) Algorithmica [link]


Conference publications

  1. Online computation with untrusted advice (with C. Dürr, S. Kamali, S. Jin and M. Renault) ITCS 2020, to appear [link]

  2. Earliest completion scheduling of contract algorithms with end guarantees (with S. Jin) IJCAI 2019 [link]

  3. Best-of-two worlds analysis of online search (with C. Dürr and S. Jin) STACS 2019 [link]

  4. Online maximum matching with recourse (with C. Dürr and S. Jin) MFCS 2018 [link]

  5. The Expanding Search Ratio of a Graph (with C. Dürr and T. Lidbetter) STACS 2016 [link]

  6. Primal-Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow Time Problems (with G. Lucarelli and NK Thang) ESA 2015 [link]

  7. Further Connections Between Contract-Scheduling and Ray-Searching Problems IJCAI 2015 [link]

  8. Online bin packing with advice of small size (with C. Dürr, S. Kamali, M. Renault and A. Rosen) WADS 2015 [link]

  9. Multi-target ray searching problems (with A. López-Ortiz and K. Panagiotou) WADS 2011 [link]

  10. Interruptible algorithms for multiproblem solving (with A. López-Ortiz) IJCAI 2009 [link]

  11. Paging and list update under bijective analysis (with P. Schweitzer) SODA 2009 [link]

  12. Online priority Steiner tree problems WADS 2009 [doi

  13. On the competitiveness of the online asymmetric and Euclidean Steiner tree problems WAOA 2009 [link]

  14. Optimal scheduling of contract algorithms with soft deadlines (with A. López-Ortiz) AAAI 2008 [link]

  15. A near tight bound for the online Steiner tree problem in graphs of bounded asymmetry ESA 2008 [link]

  16. List update with locality of reference (with R. Dorrigiv and A. López-Ortiz) LATIN 2008 [link]

  17. On the separation and equivalence of paging strategies (with R. Dorrigiv and A. López-Ortiz) SODA 2007 [link]

  18. Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry SODA 2007 [link]

  19. Optimal scheduling of contract algorithms for anytime problems (with A. López-Ortiz and A. Hamel) AAAI 2006 [link]

  20. The node-weighted Steiner tree problem in graphs of restricted node weights SWAT 2006 [link]

  21. Online algorithms for market equilibria (with A. Das Sarma, A. Magen and A. Viglas) COCOON 2005 [link]

  22. Order preserving transformations and greedy-like algorithms WAOA 2004 [link]

  23. Randomized priority algorithms WAOA 2003 [link]

  24. On the power of priority algorithms for facility location and set cover (with A. Borodin) [link]