Serge Gaspers

2.1k total citations
70 papers, 620 citations indexed

About

Serge Gaspers is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Serge Gaspers has authored 70 papers receiving a total of 620 indexed citations (citations by other indexed papers that have themselves been cited), including 47 papers in Computational Theory and Mathematics, 23 papers in Artificial Intelligence and 20 papers in Computer Networks and Communications. Recurrent topics in Serge Gaspers's work include Advanced Graph Theory Research (36 papers), Complexity and Algorithms in Graphs (31 papers) and Game Theory and Voting Systems (13 papers). Serge Gaspers is often cited by papers focused on Advanced Graph Theory Research (36 papers), Complexity and Algorithms in Graphs (31 papers) and Game Theory and Voting Systems (13 papers). Serge Gaspers collaborates with scholars based in Australia, France and Austria. Serge Gaspers's co-authors include Haris Aziz, Fedor V. Fomin, Toby Walsh, Saket Saurabh, Simon Mackenzie, Mathieu Liedloff, A. V. Pyatkin, Igor Razgon, Dieter Kratsch and Stefan Szeider and has published in prestigious journals such as SHILAP Revista de lepidopterología, Artificial Intelligence and Theoretical Computer Science.

In The Last Decade

Serge Gaspers

67 papers receiving 598 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Serge Gaspers Australia 14 396 166 158 140 110 70 620
Frances Rosamond Australia 16 698 1.8× 258 1.6× 110 0.7× 76 0.5× 159 1.4× 64 878
Telikepalli Kavitha India 13 356 0.9× 150 0.9× 293 1.9× 186 1.3× 110 1.0× 56 581
Deeparnab Chakrabarty United States 12 195 0.5× 226 1.4× 71 0.4× 196 1.4× 104 0.9× 45 492
Bernard Monjardet France 11 225 0.6× 74 0.4× 99 0.6× 139 1.0× 94 0.9× 34 435
Stefan Kratsch Germany 15 553 1.4× 188 1.1× 32 0.2× 35 0.3× 110 1.0× 56 672
Walter Stromquist United States 10 80 0.2× 51 0.3× 197 1.2× 233 1.7× 50 0.5× 21 464
Nadja Betzler Germany 14 235 0.6× 66 0.4× 289 1.8× 189 1.4× 198 1.8× 21 490
Elitza Maneva United States 10 143 0.4× 450 2.7× 83 0.5× 190 1.4× 120 1.1× 16 718
André Nichterlein Germany 12 162 0.4× 84 0.5× 29 0.2× 47 0.3× 68 0.6× 39 325
Micha A. Perles Israel 12 238 0.6× 14 0.1× 157 1.0× 101 0.7× 96 0.9× 38 547

Countries citing papers authored by Serge Gaspers

Since Specialization
Citations

This map shows the geographic impact of Serge Gaspers'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 Serge Gaspers with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Serge Gaspers more than expected).

Fields of papers citing papers by Serge Gaspers

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Serge Gaspers. 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 Serge Gaspers. The network helps show where Serge Gaspers may publish in the future.

Co-authorship network of co-authors of Serge Gaspers

This figure shows the co-authorship network connecting the top 25 collaborators of Serge Gaspers. A scholar is included among the top collaborators of Serge Gaspers 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 Serge Gaspers. Serge Gaspers 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.
Asghar, Hassan Jameel, et al.. (2022). Making the Most of Parallel Composition in Differential Privacy. SHILAP Revista de lepidopterología. 3 indexed citations
2.
Aziz, Haris, et al.. (2020). Mechanism Design for School Choice with Soft Diversity Constraints. 1756–1758. 3 indexed citations
3.
Gaspers, Serge, et al.. (2019). Minimizing and Computing the Inverse Geodesic Length on Trees. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 19. 1 indexed citations
4.
Aziz, Haris, et al.. (2018). Stability and Pareto Optimality in Refugee Allocation Matchings. Adaptive Agents and Multi-Agents Systems. 964–972. 19 indexed citations
5.
Aziz, Haris, et al.. (2018). Defender Stackelberg Game with Inverse Geodesic Length as Utility Metric. Adaptive Agents and Multi-Agents Systems. 694–702. 5 indexed citations
6.
Aziz, Haris, Péter Bíró, Tamás Fleiner, et al.. (2017). Stable Matching with Uncertain Pairwise Preferences. Adaptive Agents and Multi-Agents Systems. 344–352. 8 indexed citations
7.
Aziz, Haris, Serge Gaspers, Simon Mackenzie, et al.. (2015). Manipulating the Probabilistic Serial Rule. arXiv (Cornell University). 1451–1459. 9 indexed citations
8.
Gaspers, Serge, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, & Stefan Szeider. (2015). On finding optimal polytrees. Theoretical Computer Science. 592. 49–58. 3 indexed citations
9.
Aziz, Haris, Serge Gaspers, Simon Mackenzie, & Toby Walsh. (2015). Fair assignment of indivisible objects under ordinal preferences. Artificial Intelligence. 227. 71–92. 51 indexed citations
10.
Aziz, Haris, Serge Gaspers, Simon Mackenzie, & Toby Walsh. (2014). Fair assignment of indivisible objects under ordinal preferences. Adaptive Agents and Multi-Agents Systems. 1305–1312. 13 indexed citations
11.
Gaspers, Serge, Mathieu Liedloff, Maya Stein, & Karol Suchan. (2014). Complexity of splits reconstruction for low-degree trees. Discrete Applied Mathematics. 180. 89–100.
12.
Chu, Geoffrey, Serge Gaspers, Nina Narodytska, Andreas Schutt, & Toby Walsh. (2013). On the complexity of global scheduling constraints under structural restrictions. International Joint Conference on Artificial Intelligence. 503–509. 4 indexed citations
13.
Gaspers, Serge, Thomas Kalinowski, Nina Narodytska, & Toby Walsh. (2013). Coalitional manipulation for Schulze's rule. arXiv (Cornell University). 431–438. 3 indexed citations
14.
Gaspers, Serge & Mathieu Liedloff. (2012). A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set. Discrete Mathematics & Theoretical Computer Science. Vol. 14 no. 1(Graph and Algorithms). 4 indexed citations
15.
Gaspers, Serge & Stefan Szeider. (2011). The Parameterized Complexity of Local Consistency.. Electronic colloquium on computational complexity. 18. 71. 1 indexed citations
16.
Gaspers, Serge. (2010). Exponential Time Algorithms. VDM Verlag Dr. Müller eBooks. 2 indexed citations
17.
Bessy, Stéphane, Fedor V. Fomin, Serge Gaspers, et al.. (2010). Kernels for feedback arc set in tournaments. Journal of Computer and System Sciences. 77(6). 1071–1078. 24 indexed citations
18.
Gaspers, Serge & Gregory B. Sorkin. (2009). A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between. Symposium on Discrete Algorithms. 606–615. 5 indexed citations
19.
Fomin, Fedor V., Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, & Saket Saurabh. (2009). Iterative compression and exact algorithms. Theoretical Computer Science. 411(7-9). 1045–1053. 11 indexed citations
20.
Fomin, Fedor V., Serge Gaspers, & A. V. Pyatkin. (2006). Finding a minimum feedback vertex set in time O(1.7548 n. 4 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

Rankless by CCL
2026