Étienne Objois

Orcid: 0000-0002-5311-8577

According to our database1, Étienne Objois authored at least 6 papers between 2022 and 2026.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Approximating q → p Norms of Non-Negative Matrices in Nearly-Linear Time.
Proceedings of the 43rd International Symposium on Theoretical Aspects of Computer Science, 2026

A Polynomial Bound on the Pathwidth of Graphs Edge-Coverable by k Shortest Paths.
Proceedings of the 43rd International Symposium on Theoretical Aspects of Computer Science, 2026

2025
Adaptive Sparsification for Linear Programming.
CoRR, October, 2025

A polynomial bound on the pathwidth of graphs edge-coverable by <i>k</i> shortest paths.
CoRR, October, 2025

2022
PoGaIN: Poisson-Gaussian Image Noise Modeling From Paired Samples.
IEEE Signal Process. Lett., 2022

Target Aware Poisson-Gaussian Noise Parameters Estimation from Noisy Images.
CoRR, 2022


  Loading...