Guyslain Naves
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Modules and PQ-trees in Robinson spaces Information and Computation | 2025-05-19 | Paper |
| Two simple but efficient algorithms to recognize Robinson dissimilarities Journal of Classification | 2025-01-07 | Paper |
| Modules in Robinson Spaces SIAM Journal on Discrete Mathematics | 2024-01-10 | Paper |
| Integer multiflows in acyclic planar digraphs Combinatorica | 2023-10-04 | Paper |
| A Simple and Optimal Algorithm for Strict Circular Seriation SIAM Journal on Mathematics of Data Science | 2023-04-24 | Paper |
| Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators Mathematical Programming. Series A. Series B | 2023-03-14 | Paper |
| When do Gomory-Hu subtrees exist? SIAM Journal on Discrete Mathematics | 2022-07-13 | Paper |
| Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators Integer Programming and Combinatorial Optimization | 2021-12-21 | Paper |
| scientific article; zbMATH DE number 7053371 (Why is no real title available?) | 2019-05-10 | Paper |
| Approximating rooted Steiner networks ACM Transactions on Algorithms | 2018-10-30 | Paper |
| Packing and covering with balls on Busemann surfaces Discrete & Computational Geometry | 2017-06-16 | Paper |
| Multiflow Feasibility: An Annotated Tableau Research Trends in Combinatorial Optimization | 2017-04-07 | Paper |
| Isometric embedding of Busemann surfaces into L₁ Discrete & Computational Geometry | 2015-02-19 | Paper |
| Balancing Lists: A Proof Pearl Interactive Theorem Proving | 2014-09-08 | Paper |
| Maximum edge-disjoint paths in k-sums of graphs Automata, Languages, and Programming | 2013-08-06 | Paper |
| The hardness of routing two pairs on one face Mathematical Programming. Series A. Series B | 2012-02-22 | Paper |
| Maximum flows on disjoint paths Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
Research outcomes over time
This page was built for person: Guyslain Naves
