![PDF) Approximation of min coloring by moderately exponential algorithms | Vangelis Paschos - Academia.edu PDF) Approximation of min coloring by moderately exponential algorithms | Vangelis Paschos - Academia.edu](https://0.academia-photos.com/attachment_thumbnails/50831148/mini_magick20190127-22107-1blggyg.png?1548609453)
PDF) Approximation of min coloring by moderately exponential algorithms | Vangelis Paschos - Academia.edu
![Approximation polynomiale des problèmes NP-difficiles - optima locaux et rapport différentiel, optima locaux et rapport différentiel - Jérôme Monnot, Vangelis T. Paschos, Sophie Toulouse - Le Carnet à spirales Approximation polynomiale des problèmes NP-difficiles - optima locaux et rapport différentiel, optima locaux et rapport différentiel - Jérôme Monnot, Vangelis T. Paschos, Sophie Toulouse - Le Carnet à spirales](https://cdn.leslibraires.fr/SPpobDPIDdnHUqyGY0Sm9JFNa203GDNwUqlxXVaN8GU/s:337:400/OTc3MTAy.webp)
Approximation polynomiale des problèmes NP-difficiles - optima locaux et rapport différentiel, optima locaux et rapport différentiel - Jérôme Monnot, Vangelis T. Paschos, Sophie Toulouse - Le Carnet à spirales
![Vangelis Th. Paschos Combinatorial Optimization and Theoretical Computer Science by Vangelis Th. Paschos, Hardcover | Indigo Chapters | Niagara Pen Centre Vangelis Th. Paschos Combinatorial Optimization and Theoretical Computer Science by Vangelis Th. Paschos, Hardcover | Indigo Chapters | Niagara Pen Centre](https://dynamic.indigoimages.ca/books/9781848210219.jpg?scaleup=true&width=600&quality=85&lang=en)
Vangelis Th. Paschos Combinatorial Optimization and Theoretical Computer Science by Vangelis Th. Paschos, Hardcover | Indigo Chapters | Niagara Pen Centre
Combinatorial Optimization: Third International Symposium, ISCO 2014, Lisbon, Portugal, March 5-7, 2014, Revised Selected Papers | SpringerLink
Beyond polynomial approximation - Moderately exponential, subexponential and parameterized approximability
A postdoctoral researcher is needed for the research project Time vs. Optimality in Discrete Optimization (TODO) funded by the F
![Talagrand's Isoperimetric Inequality (Chapter 11) - Concentration of Measure for the Analysis of Randomized Algorithms Talagrand's Isoperimetric Inequality (Chapter 11) - Concentration of Measure for the Analysis of Randomized Algorithms](https://static.cambridge.org/content/id/urn%3Acambridge.org%3Aid%3Abook%3A9780511581274/resource/name/firstPage-9780511581274c11_p136-150_CBO.jpg)