Gcb 2012

2 papers

Top Research Directions

The 4 research directions with Gcb 2012 papers, ranked by paper count. Share is the fraction of the edition’s papers in the direction.

#DirectionPapersShare
1Hierarchical Topic Modeling for Nested Text Representations150.0%
2Joint Latent State and Parameter Estimation150.0%
3Probabilistic Boundary Refinement for Semantic Segmentation150.0%
4The Even Length Gap in Optimal Sequence Design150.0%

Download all directions as CSV

Institutions

Institutions credited by Gcb 2012 papers: a paper credits every institution named in its affiliations, once. 5 institutions share 2 credited papers.

#InstitutionPapersShare
1St. Petersburg Department of Steklov Institute of Mathematics 150.0%
2Steklov Mathematical Institute 150.0%
3TU Dortmund University 150.0%
4University of Bremen 150.0%
5University of Duisburg-Essen 150.0%

Download all institutions as CSV

About this data

Papers. Gcb 2012 lists 2 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. 2 of 2 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, “Gcb 2012”, https://lacuna.tiptreesystems.com/venue/gcb/2012.

Top Authors

AuthorPapers
Nils Morten Kriege1
Sergey Nikolenko1

Impactful Papers

Papers from Gcb 2012 that shaped research clusters.

Foundational

Papers

Title
A Two-Step Soft Segmentation Procedure for MALDI Imaging Mass Spectrometry Data
Designing q-Unique DNA Sequences with Integer Linear Programs and Euler Tours in De Bruijn Graphs