Beiträge 2012
Top Research Directions
The 2 research directions with Beiträge 2012 papers, ranked by paper count, next to 2011. Share is the fraction of the edition’s papers in the direction.
| # | Direction | 2012 | 2011 | Share 2012 | Share 2011 | 2011 rank |
|---|---|---|---|---|---|---|
| 1 | Combinatorial Complexity Bounds for Constrained Polytopes | 1 | 0 | 100.0% | 0.0% | — |
| 2 | Simplifying Complex Proofs for Mathematical Accessibility | 1 | 0 | 100.0% | 0.0% | — |
Download all directions as CSV
About this data
Papers. Beiträge 2012 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. Comparisons with 2011 use shares, since the edition went from 1 to 1 papers.
Data. Counts come from Lacuna’s data build of 2026-11-19 and change as papers are added. Tables as CSV: directions. Cite as: Lacuna, “Beiträge 2012”, https://lacuna.tiptreesystems.com/venue/beitrage/2012.
Top Authors
| Author | Papers |
|---|---|
| Gennadiy Averkov | 1 |
Papers
| Title |
|---|
| A proof of Lovász’s theorem on maximal lattice-free sets |