Drops (schloss Dagstuhl – Leibniz Center for Informatics) 2021
Top Research Directions
The 1 research directions with Drops (schloss Dagstuhl – Leibniz Center for Informatics) 2021 papers, ranked by paper count. Share is the fraction of the edition’s papers in the direction.
| # | Direction | Papers | Share |
|---|---|---|---|
| 1 | Scaling Combinatorial Optimization via Large Neighborhood Search | 1 | 100.0% |
Download all directions as CSV
Institutions
Institutions credited by Drops (schloss Dagstuhl – Leibniz Center for Informatics) 2021 papers: a paper credits every institution named in its affiliations, once. 3 institutions share 1 credited papers.
| # | Institution | Papers | Share | 2016 | 2016 rank |
|---|---|---|---|---|---|
| 1 | 02tsqtg57 | 1 | 100.0% | 0 | — |
| 2 | Heriot-Watt University | 1 | 100.0% | 0 | — |
| 3 | University of Edinburgh | 1 | 100.0% | 0 | — |
Download all institutions as CSV
About this data
Papers. Drops (schloss Dagstuhl – Leibniz Center for Informatics) 2021 lists 1 papers on Lacuna, duplicate versions counted once; rejected and withdrawn submissions are left out.
Directions. Directions are Lacuna’s clustering of the concept elements extracted from each paper, so a paper can belong to several and direction counts add up to more than the paper count. A direction’s share is its papers divided by the edition’s papers.
Institutions. A paper credits each institution named in its affiliations, resolved to a ROR record, once. 1 of 1 papers (100.0%) credit at least one institution and are the base for institution shares; the rest have no resolved affiliation yet.
Data. Counts come from Lacuna’s data build of 2026-11-19 and change as papers are added. Tables as CSV: directions · institutions. Cite as: Lacuna, “Drops (schloss Dagstuhl – Leibniz Center for Informatics) 2021”, https://lacuna.tiptreesystems.com/venue/drops-schloss-dagstuhl-leibniz-center-for-informatics/2021.
Top Authors
| Author | Papers |
|---|---|
| Akshay Gupte | 1 |
| Syu Ning Johnn | 1 |
| Yiran Zhu | 1 |
Papers
| Title |
|---|
| Solving the home service assignment, routing, and appointment scheduling (H-SARA) problem with uncertainties |