Yann Disser

712 total citations
31 papers, 152 citations indexed

About

Yann Disser is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Computer Vision and Pattern Recognition. According to data from OpenAlex, Yann Disser has authored 31 papers receiving a total of 152 indexed citations (citations by other indexed papers that have themselves been cited), including 21 papers in Computer Networks and Communications, 9 papers in Computational Theory and Mathematics and 8 papers in Computer Vision and Pattern Recognition. Recurrent topics in Yann Disser's work include Optimization and Search Problems (21 papers), Complexity and Algorithms in Graphs (8 papers) and Robotic Path Planning Algorithms (7 papers). Yann Disser is often cited by papers focused on Optimization and Search Problems (21 papers), Complexity and Algorithms in Graphs (8 papers) and Robotic Path Planning Algorithms (7 papers). Yann Disser collaborates with scholars based in Germany, Switzerland and France. Yann Disser's co-authors include Matúš Mihaľák, Peter Widmayer, Martin Skutella, Dominik Pająk, Przemysław Uznański, Dariusz Dereniowski, Adrian Kosowski, Max Klimm, Shantanu Das and G. Alber and has published in prestigious journals such as Physical Review A, Mathematical Programming and Annals of Operations Research.

In The Last Decade

Yann Disser

27 papers receiving 149 citations

Peers

Yann Disser
Byoungro So United States
Steve Poole United States
Anna Adamaszek Denmark
Stéphane Ubéda France
Bradley J. Clement United States
Milan Ružić Denmark
Sherif Moussa United Arab Emirates
Myeong-Wuk Jang South Korea
R. J. Swan United States
Xianyue Li China
Byoungro So United States
Yann Disser
Citations per year, relative to Yann Disser Yann Disser (= 1×) peers Byoungro So

Countries citing papers authored by Yann Disser

Since Specialization
Citations

This map shows the geographic impact of Yann Disser's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Yann Disser with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Yann Disser more than expected).

Fields of papers citing papers by Yann Disser

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Yann Disser. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Yann Disser. The network helps show where Yann Disser may publish in the future.

Co-authorship network of co-authors of Yann Disser

This figure shows the co-authorship network connecting the top 25 collaborators of Yann Disser. A scholar is included among the top collaborators of Yann Disser based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Yann Disser. Yann Disser is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Disser, Yann, et al.. (2024). Unified Greedy Approximability beyond Submodular Maximization. SIAM Journal on Discrete Mathematics. 38(1). 348–379.
2.
Disser, Yann, et al.. (2022). An exponential lower bound for Zadeh’s pivot rule. Mathematical Programming. 199(1-2). 865–936. 5 indexed citations
3.
Emde, Simon, et al.. (2022). Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition. Annals of Operations Research. 322(1). 467–496. 5 indexed citations
4.
Chalopin, Jérémie, Shantanu Das, Yann Disser, Arnaud Labourel, & Matúš Mihaľák. (2021). Collaborative delivery on a fixed path with homogeneous energy-constrained agents. Theoretical Computer Science. 868. 87–96.
5.
Disser, Yann, et al.. (2020). Tight Bounds for Online TSP on the Line. ACM Transactions on Algorithms. 17(1). 1–58. 4 indexed citations
6.
Bärtschi, Andreas, Jérémie Chalopin, Shantanu Das, et al.. (2017). Collaborative delivery with energy-constrained mobile robots. Theoretical Computer Science. 810. 2–14. 8 indexed citations
7.
Disser, Yann, et al.. (2016). Undirected graph exploration with Θ(log log n) pebbles. Symposium on Discrete Algorithms. 25–39. 2 indexed citations
8.
Disser, Yann & Martin Skutella. (2015). The simplex algorithm is NP-mighty. Symposium on Discrete Algorithms. 858–872. 6 indexed citations
9.
Disser, Yann, Andreas Emil Feldmann, Max Klimm, & Matúš Mihaľák. (2014). Improving the Hk-bound on the price of stability in undirected Shapley network design games. Theoretical Computer Science. 562. 557–564. 5 indexed citations
10.
Dereniowski, Dariusz, Yann Disser, Adrian Kosowski, Dominik Pająk, & Przemysław Uznański. (2014). Fast collaborative graph exploration. Information and Computation. 243. 37–49. 32 indexed citations
11.
Disser, Yann, et al.. (2014). Degree-constrained orientations of embedded graphs. Journal of Combinatorial Optimization. 31(2). 758–773. 2 indexed citations
12.
Disser, Yann, et al.. (2014). Bidirectional Scheduling on a Path. 1 indexed citations
13.
Disser, Yann, Max Klimm, Nicole Megow, & Sebastian Stiller. (2014). Packing a Knapsack of Unknown Capacity. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 276–287. 6 indexed citations
14.
Disser, Yann, Subir Kumar Ghosh, Matúš Mihaľák, & Peter Widmayer. (2013). Mapping a polygon with holes using a compass. Theoretical Computer Science. 553. 106–113. 4 indexed citations
15.
Chalopin, Jérémie, Shantanu Das, Yann Disser, Matúš Mihaľák, & Peter Widmayer. (2013). Simple agents learn to find their way: An introduction on mapping polygons. Discrete Applied Mathematics. 161(10-11). 1287–1307. 2 indexed citations
16.
Dereniowski, Dariusz, Yann Disser, Adrian Kosowski, Dominik Pająk, & Przemysław Uznański. (2013). Fast Collaborative Graph Exploration. HAL (Le Centre pour la Communication Scientifique Directe). 1–4. 3 indexed citations
17.
Disser, Yann & Martin Skutella. (2013). In defense of the Simplex Algorithm's worst-case behavior.. 1 indexed citations
18.
Bilò, Davide, Yann Disser, Matúš Mihaľák, et al.. (2012). Reconstructing visibility graphs with simple robots. Theoretical Computer Science. 444. 52–59. 9 indexed citations
19.
Disser, Yann, Matúš Mihaľák, & Peter Widmayer. (2011). A polygon is determined by its angles. Computational Geometry. 44(8). 418–426. 8 indexed citations
20.
Disser, Yann, et al.. (2010). Reconstruction of a polygon from angles without prior knowledge of the size. Repository for Publications and Research Data (ETH Zurich). 700. 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Byoungro So Breakdown of academic impact, for papers by Steve Poole Breakdown of academic impact, for papers by Anna Adamaszek Breakdown of academic impact, for papers by Stéphane Ubéda Breakdown of academic impact, for papers by Bradley J. Clement Breakdown of academic impact, for papers by Milan Ružić Breakdown of academic impact, for papers by Sherif Moussa Breakdown of academic impact, for papers by Myeong-Wuk Jang Breakdown of academic impact, for papers by R. J. Swan Breakdown of academic impact, for papers by Xianyue Li
Rankless by CCL
2026