Theory of Computing2012 2012

2 papers

Top Research Directions

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

#DirectionPapersShare
1Balancing Fairness and Throughput in Job Scheduling150.0%
2Generalizing Algorithmic Frameworks to Arbitrary Norms150.0%
3Resource Augmentation for Online Algorithms150.0%
4Slack-Based Scheduling for Deadline-Constrained Workloads150.0%
5Taming the Combinatorial Explosion in Matrix Biclustering150.0%

Download all directions as CSV

About this data

Papers. Theory of Computing2012 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.

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, “Theory of Computing2012 2012”, https://lacuna.tiptreesystems.com/venue/theory-of-computing2012/2012.

Top Authors

AuthorPapers
Anirban Dasgupta1
Benjamin Moseley1
Chandra Chekuri1
Ravi Kumar1
Sungjin Im1

Impactful Papers

Papers from Theory of Computing2012 2012 that shaped research clusters.

Influential

Papers

Title
A Constant-Factor Approximation Algorithm for Co-clustering.
Online Scheduling to Minimize Maximum Response Time and Maximum Delay Factor.