Publications

Maximilian Stahlberg, Guillaume Sagnol, Benjamin Ducke, Max Klimm (2023). Spatiotemporal reconstruction of ancient road networks through sequential cost–benefit analysis. PNAS Nexus, 2(2), pgac313.

PDF Cite DOI

Guillaume Sagnol (2023). Improved Analysis of Two Algorithms for Min-Weighted Sum Bin Packing. Lecture Notes in Computer Science (LNCS) 13889, Proceedings of the 34th International Workshop on Combinatorial Algorithms (IWOCA 2023), pp. 343–355.

PDF Cite DOI

Guillaume Sagnol, Luc Pronzato (2023). Fast Screening Rules for Optimal Design via Quadratic Lasso Reformulation. Journal of Machine Learning Research, 24(307), pp. 1–32.

PDF Cite

Sven Jäger, Guillaume Sagnol, Daniel Schmidt genannt Waldschmidt, Philipp Warode (2023). Competitive Kill-and-Restart and Preemptive Strategies for Non-Clairvoyant Scheduling. Lecture Notes in Computer Science (LNCS) 13904, Proceedings of the 24th International Conference on Integer Programming and Combinatorial Optimization (IPCO 2023), pp. 246–260.

PDF Cite DOI

Guillaume Sagnol, M. Stahlberg (2022). PICOS: A Python interface to conic optimization solvers. Journal of Open Source Software, 7(70), pp. 3915.

PDF Cite DOI

Guillaume Sagnol, D. Schmidt gen. Waldschmidt (2022). Improved Bounds for Stochastic Extensible Bin Packing under Distributional Assumptions. Lecture Notes in Computer Science (LNCS) 13526, 7th International Symposium on Combinatorial Optimization (ISCO 2022), pp. 228–241.

PDF Cite DOI

Max Klimm, Guillaume Sagnol, Martin Skutella, Khai Van Tran (2022). Competitive Algorithms for Symmetric Rendezvous on the Line. Proceedings of the 33rd ACM-SIAM Symposium on Discrete Algorithms (SODA 2022), pp. 329–347.

PDF Cite DOI

Guillaume Sagnol, Daniel Schmidt genannt Waldschmidt (2021). Restricted Adaptivity in Stochastic Scheduling. LIPIcs 204, 29th Annual European Symposium on Algorithms (ESA 2021), pp. 79:1–79:14.

PDF Cite DOI

L. Pronzato, Guillaume Sagnol (2021). Removing inessential points in $c-$ and $A-$optimal design. Journal of Statistical Planning and Inference, 213, pp. 233–252.

PDF Cite DOI

B.P.M. Duarte, Guillaume Sagnol (2020). Approximate and exact D-optimal designs for $2^k$ factorial experiments for Generalized Linear Models via SOCP. Statistical Papers, 61, pp. 2737–2767.

PDF Cite DOI

Guillaume Sagnol, E. Pauwels (2019). An unexpected connection between Bayes $A-$optimal designs and the Group Lasso. Statistical Papers, 60(2), pp. 215–234.

PDF Cite DOI

Guillaume Sagnol, A. Tesch (2019). Algorithmen unterstützen OP-Planung. Popularization article in a specialized journal for hospital managers, Management & Krankenhaus 12, p. 20.

PDF Cite

Guillaume Sagnol, D. Schmidt gen. Waldschmidt, A. Tesch (2018). The Price of Fixed Assignments in Stochastic Extensible Bin Packing. Lecture Notes in Computer Science (LNCS) 11312, Proceeding of the 16th Worshop on Approximation and Online Algorithms (WAOA'18), pp. 327–347.

PDF Cite DOI

Guillaume Sagnol (2018). The Cone of Flow Matrices: Approximation Hierarchies and Applications. Networks, 72(1), pp. 128–150.

PDF Cite DOI

Guillaume Sagnol, C. Barner, R. Borndörfer, M. Grima, M. Seeling, C. Spies, K. Wernecke (2018). Robust allocation of operating rooms: A cutting plane approach to handle lognormal case durations. European Journal of Operational Research, 271(2), pp. 420–435.

PDF Cite Dataset DOI

Guillaume Sagnol, M. Blanco, T. Sauvage (2018). Approximation Hierarchies for the Cone of Flow Matrices. Electronic Notes in Discrete Mathematics 64, Proceedings of the 8th International Network Optimization Conference (INOC 2017), pp. 275 – 284.

PDF Cite DOI

B.P.M. Duarte, Guillaume Sagnol, W.K. Wong (2018). An algorithm based on Semidefinite Programming for finding minimax optimal designs. Computational Statistics & Data Analysis, 119, pp. 99–117.

PDF Cite

R. Borndörfer, Guillaume Sagnol, T. Schlechte, E. Swarat (2017). Optimal duty rostering for toll enforcement inspectors. Annals of Operations Research, 252(2), pp. 383–406.

PDF Cite DOI

Guillaume Sagnol, H.-C. Hege, M. Weiser (2016). Using sparse kernels to design computer experiments with tunable precision. Proceedings of the 22nd International Conference on Computational Statistics, pp. 397–408.

PDF Cite

Guillaume Sagnol, R. Borndörfer, M. Grima, M. Seeling, C. Spies (2016). Robust Allocation of Operating Rooms with Lognormal case Durations. Proceedings of the 15th International Conference on Project Management and Scheduling (PMS 2016), pp. 52-55.

PDF Cite

Guillaume Sagnol, F. Balzer, R. Borndörfer, C. Spies, F. von Dincklage (2016). Makespan and Tardiness in Activity Networks with Lognormal Activity Durations.

PDF Cite

R. Borndörfer, Guillaume Sagnol, S. Schwartz (2016). An Extended Network Interdiction Problem for Optimal Toll Control. Electronic Notes in Discrete Mathematics 52, Proceedings of the 7th International Network Optimization Conference (INOC 2015), pp. 301 – 308.

PDF Cite DOI

Guillaume Sagnol, R. Harman (2015). Optimal Designs for Steady-state Kalman filters. Springer Proceedings in Mathematics & Statistics 122, Proccedings of the 12th Workshop on Stochastic Models, Statistics and Their Applications, pp. 149 – 157.

PDF Cite DOI

R. Borndörfer, J. Buwaya, Guillaume Sagnol, E. Swarat (2015). Network spot-checking games: Theory and application to toll enforcing in transportation networks. Networks, 65, pp. 312–328.

PDF Cite DOI

Guillaume Sagnol, R. Harman (2015). Computing exact D-optimal designs by mixed integer second order cone programming. The Annals of Statistics, 43(5), pp. 2198–2224.

PDF Cite DOI

R. Harman, Guillaume Sagnol (2015). Computing D-optimal experimental designs for estimating treatment contrasts under the presence of a nuisance time trend. Springer Proceedings in Mathematics & Statistics 122, Proccedings of the 12th Workshop on Stochastic Models, Statistics and Their Applications, pp. 83 – 91.

PDF Cite DOI

B.P.M. Duarte, Guillaume Sagnol, N.M.C. Oliveira (2015). A robust minimax Semidefinite Programming formulation for optimal design of experiments for model parametrization. Proceedings of the 12th International Symposium on Process Systems Engineering and 25th European Symposium on Computer Aided Process Engineering, pp. 905–910.

PDF Cite DOI

Guillaume Sagnol, R. Borndörfer, T. Schlechte, E. Swarat (2014). The Price of Spite in Spot-checking games. Lecture Notes in Computer Science (LNCS) 8768, Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT'2014), p. 293.

PDF Cite DOI

R. Borndörfer, Julia Buwaya, Guillaume Sagnol, Elmar Swarat (2013). Optimizing Toll Enforcement in Transportation Networks: a Game-Theoretic Approach. Electronic Notes in Discrete Mathematics 41, Proceedings of INOC'2013, pp. 253 – 260.

PDF Cite DOI

Guillaume Sagnol (2013). Approximation of a maximum-submodular-coverage problem involving spectral functions, with application to experimental designs. Discrete Applied Mathematics, 161(1-2), pp. 258 – 276.

PDF Cite DOI

Guillaume Sagnol (2012). On the semidefinite representations of real functions applied to symmetric matrices. Linear Algebra and its Applications, 439(10), pp. 2829 – 2843.

PDF Cite DOI

Guillaume Sagnol (2012). Network-related problems in optimal experimental design and second order cone programming. Tatra Mountains Mathematical Publications 51, Proceedings of PROBASTAT'2011, pp. 161 – 171.

PDF Cite DOI

R. Borndörfer, Guillaume Sagnol, E. Swarat (2012). An IP Approach to Toll Enforcement Optimization on German Motorways. Operations Research Proceedings 2011, pp. 317 – 322.

PDF Cite DOI

R. Borndörfer, B. Omont, Guillaume Sagnol, E. Swarat (2012). A Stackelberg game to optimize the distribution of controls in transportation networks. Lecture Notes of the ICST 105, Proceedings of the 3rd International Conference on Game Theory for Networks (GAMENETS 2012), pp. 224 – 235.

PDF Cite DOI

R. Borndörfer, Guillaume Sagnol, E. Swarat (2012). A Case Study on Optimizing Toll Enforcements on Motorways. OpenAccess Series in Informatics (OASIcs) 22, Proceedings of the 3rd Student Conference on Operational Research, pp. 1 – 10.

PDF Cite DOI

Guillaume Sagnol (2011). A class of Semidefinite Programs with rank-one solutions. Linear Algebra and its Applications, 435(6), pp. 1446 – 1463.

PDF Cite DOI

Guillaume Sagnol, M. Bouhtou, S. Gaubert (2010). Successive c-Optimal Designs: A scalable technique to optimize the measurements on large networks. Proceedings of the ACM SIGMETRICS 2010 Conference on Measurement and Modeling of Computer Systems.

PDF Cite DOI

M. Bouhtou, S. Gaubert, Guillaume Sagnol (2010). Submodularity and Randomized rounding techniques applied to Optimal Experimental Design. Electronic Notes on Discrete Mathematics (ENDM) 36, Proceedings of the International Symposium on Combinatorial Optimization (ISCO 2010), pp. 679 – 686.

PDF Cite DOI

Guillaume Sagnol, S. Gaubert, M. Bouhtou (2010). Optimal Monitoring in Large Networks by Successive c-Optimal Designs. Proceedings of the 22nd International Teletraffic Congress (ITC 22), pp. 1–8.

PDF Cite DOI

Guillaume Sagnol (2010). Optimal Design of Experiments with Application to the Inference of Traffic Matrices – Second Order Cone Programming and Submodularity. Manuscript in English with a bilingual introduction (French-English). Thesis defended on December 13, 2010.

PDF Cite

Guillaume Sagnol (2010). Computing Optimal Designs of multiresponse Experiments reduces to Second-Order Cone Programming. Journal of Statistical Planning and Inference, 141(5), pp. 1684 – 1708.

PDF Cite DOI

M. Bouhtou, S. Gaubert, Guillaume Sagnol (2008). Optimization of Network Traffic Measurement: a Semidefinite Programming Approach. Proceedings of the International Conference on Engineering Optimization EngOpt 2008.

PDF Cite