Meinolf Sellmann

2.4k total citations
38 papers, 477 citations indexed

About

Meinolf Sellmann is a scholar working on Computer Networks and Communications, Artificial Intelligence and Industrial and Manufacturing Engineering. According to data from OpenAlex, Meinolf Sellmann has authored 38 papers receiving a total of 477 indexed citations (citations by other indexed papers that have themselves been cited), including 26 papers in Computer Networks and Communications, 11 papers in Artificial Intelligence and 10 papers in Industrial and Manufacturing Engineering. Recurrent topics in Meinolf Sellmann's work include Constraint Satisfaction and Optimization (23 papers), Optimization and Search Problems (7 papers) and Vehicle Routing Optimization Methods (6 papers). Meinolf Sellmann is often cited by papers focused on Constraint Satisfaction and Optimization (23 papers), Optimization and Search Problems (7 papers) and Vehicle Routing Optimization Methods (6 papers). Meinolf Sellmann collaborates with scholars based in United States, Germany and Spain. Meinolf Sellmann's co-authors include Torsten Fahle, Yuri Malitsky, Carlos Ansótegui, Stefan Schamberger, Horst Samulowitz, Carla P. Gomes, Harold M. van Es, Casper Es, Kevin Tierney and Serdar Kadıoğlu and has published in prestigious journals such as Geoderma, Artificial Intelligence and Computers & Operations Research.

In The Last Decade

Meinolf Sellmann

35 papers receiving 450 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Meinolf Sellmann United States 12 243 165 155 116 87 38 477
Albert Yu United States 6 271 1.1× 62 0.4× 38 0.2× 17 0.1× 106 1.2× 12 550
Ruizhi Li China 11 148 0.6× 87 0.5× 123 0.8× 27 0.2× 160 1.8× 42 418
Wolfgang Bein United States 10 134 0.6× 37 0.2× 85 0.5× 102 0.9× 80 0.9× 49 371
Mikel D. Petty United States 10 139 0.6× 56 0.3× 24 0.2× 117 1.0× 21 0.2× 54 303
Jakob Bossek Germany 11 59 0.2× 240 1.5× 126 0.8× 39 0.3× 157 1.8× 47 355
Marek Kisiel‐Dorohinicki Poland 12 142 0.6× 241 1.5× 40 0.3× 32 0.3× 56 0.6× 69 452
Daniele Pretolani Italy 11 62 0.3× 83 0.5× 54 0.3× 21 0.2× 74 0.9× 26 331
Sebástien Vérel France 11 30 0.1× 290 1.8× 59 0.4× 34 0.3× 231 2.7× 49 472
Ramón Béjar Spain 10 280 1.2× 113 0.7× 17 0.1× 25 0.2× 58 0.7× 41 427

Countries citing papers authored by Meinolf Sellmann

Since Specialization
Citations

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

Fields of papers citing papers by Meinolf Sellmann

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Meinolf Sellmann

This figure shows the co-authorship network connecting the top 25 collaborators of Meinolf Sellmann. A scholar is included among the top collaborators of Meinolf Sellmann 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 Meinolf Sellmann. Meinolf Sellmann 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.
Kadıoğlu, Serdar, Yuri Malitsky, & Meinolf Sellmann. (2021). Non-Model-Based Search Guidance for Set Partitioning Problems. Proceedings of the AAAI Conference on Artificial Intelligence. 26(1). 493–498. 3 indexed citations
2.
Schichl, Hermann & Meinolf Sellmann. (2019). Consensual Affine Transformations for Partial Valuation Aggregation. Proceedings of the AAAI Conference on Artificial Intelligence. 33(1). 2612–2619.
3.
Ansótegui, Carlos, et al.. (2016). MaxSAT by improved instance-specific algorithm configuration. Artificial Intelligence. 235. 26–39. 24 indexed citations
4.
Vanschoren, Joaquin & Meinolf Sellmann. (2016). Learning and Intelligent Optimization. Lecture notes in computer science. 4 indexed citations
5.
Ansótegui, Carlos, Yuri Malitsky, Horst Samulowitz, Meinolf Sellmann, & Kevin Tierney. (2015). Model-based genetic algorithms for algorithm configuration. International Conference on Artificial Intelligence. 733–739. 38 indexed citations
6.
Ciré, André A., Serdar Kadıoğlu, & Meinolf Sellmann. (2014). Parallel Restarted Search. Proceedings of the AAAI Conference on Artificial Intelligence. 28(1). 7 indexed citations
7.
Gomes, Carla P. & Meinolf Sellmann. (2013). Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems : 10th International Conference, CPAIOR 2013, Yorktown Heights, NY, USA, May 18-22, 2013, Proceedings. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)). 1 indexed citations
8.
Malitsky, Yuri, Ashish Sabharwal, Horst Samulowitz, & Meinolf Sellmann. (2013). Algorithm portfolios based on cost-sensitive hierarchical clustering. International Joint Conference on Artificial Intelligence. 608–614. 36 indexed citations
9.
Kadıoğlu, Serdar & Meinolf Sellmann. (2009). Grammar constraints. Constraints. 15(1). 117–144. 10 indexed citations
10.
Kadıoğlu, Serdar & Meinolf Sellmann. (2008). Efficient context-free grammar constraints. National Conference on Artificial Intelligence. 310–316. 7 indexed citations
11.
Flener, Pierre, Justin Pearson, Meinolf Sellmann, Pascal Van Hentenryck, & Magnus S. Ågren. (2008). Dynamic structural symmetry breaking for constraint satisfaction problems. Constraints. 14(4). 506–538. 6 indexed citations
12.
Sellmann, Meinolf. (2008). Approximated consistency for the automatic recording constraint. Computers & Operations Research. 36(8). 2341–2347. 3 indexed citations
13.
Katriel, Irit, Meinolf Sellmann, Eli Upfal, & Pascal Van Hentenryck. (2007). Propagating knapsack constraints in sublinear time. National Conference on Artificial Intelligence. 231–236. 4 indexed citations
14.
Sellmann, Meinolf & Warwick Harvey. (2007). Heuristic Constraint Propagation. 3 indexed citations
15.
Es, Harold M. van, Carla P. Gomes, Meinolf Sellmann, & Casper Es. (2007). Spatially-Balanced Complete Block designs for field experiments. Geoderma. 140(4). 346–352. 54 indexed citations
16.
Sellmann, Meinolf & Carlos Ansótegui. (2006). Disco - Novo - GoGo: integrating local search and complete search with restarts. National Conference on Artificial Intelligence. 1051–1056. 8 indexed citations
17.
Sellmann, Meinolf & Pascal Van Hentenryck. (2005). Structural symmetry breaking. International Joint Conference on Artificial Intelligence. 298–303. 18 indexed citations
18.
Sellmann, Meinolf. (2004). The practice of approximated consistency for Knapsack constraints. National Conference on Artificial Intelligence. 179–184. 4 indexed citations
19.
Sellmann, Meinolf, et al.. (2002). Lagrangian Cardinality Cuts and Variable Fixing for Capacitated Network Design. 1 indexed citations
20.
Fahle, Torsten, Stefan Schamberger, & Meinolf Sellmann. (2001). Symmetry Breaking. 93–107. 68 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