( en | de | ru )

 

Disambiguation of "Disser, Yann"

Author of the publication

copydeleteadd this publication to your clipboard
Degree-Constrained Orientations of Embedded Graphs.

, and . ISAAC, volume 7676 of Lecture Notes in Computer Science, page 506-516. Springer, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Yann Disser

Bernd Disser

Stephan Disser

Georgios Yannis

Christos Yannissis

 

Other publications of authors with the same name

Undirected Graph Exploration with ⊝(log log n) Pebbles., , and . SODA, page 25-39. SIAM, (2016)Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition., , and . Ann. Oper. Res., 322 (1): 467-496 (March 2023)Exploration of Graphs with Excluded Minors., , , and . ESA, volume 274 of LIPIcs, page 11:1-11:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Incremental Maximization via Continuization., , , and . ICALP, volume 261 of LIPIcs, page 47:1-47:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)A (5/3+ε)-Approximation for Tricolored Non-Crossing Euclidean TSP., , , and . ESA, volume 308 of LIPIcs, page 15:1-15:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Travelling on Graphs with Small Highway Dimension., , , and . WG, volume 11789 of Lecture Notes in Computer Science, page 175-189. Springer, (2019)Unified Greedy Approximability Beyond Submodular Maximization., and . ISCO, volume 13526 of Lecture Notes in Computer Science, page 299-311. Springer, (2022)An Improved Algorithm for Open Online Dial-a-Ride., , , and . WAOA, volume 13538 of Lecture Notes in Computer Science, page 154-171. Springer, (2022)An improved lower bound for competitive graph exploration., , , and . Theor. Comput. Sci., (2021)An exponential lower bound for Zadeh's pivot rule., , and . Math. Program., 199 (1): 865-936 (May 2023)