Demo Data from EDBT 2026 / reviewers in the wild / expert
Rajneesh Hegde
dblp:71/717
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 2007
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
2 papers |
Algorithms and data structures · 60% Graph algorithms and graph theory · 34% Mathematical optimization · 6% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithms and data structures
clustering |
0.1 | 1 | 2007 | Deterministic pivoting algorithms for constrained ranking and clustering problems · SODA 2007 |
Algorithms and data structures › clustering
constrained clustering |
0.1 | 1 | 2007 | Deterministic pivoting algorithms for constrained ranking and clustering problems · SODA 2007 |
Algorithms and data structures
ranking |
0.1 | 1 | 2007 | Deterministic pivoting algorithms for constrained ranking and clustering problems · SODA 2007 |
Graph algorithms and graph theory
graph algorithms |
0.1 | 1 | 2006 | Finding 3-shredders efficiently · ACM Trans. Algorithms 2006 |
Graph algorithms and graph theory
graph connectivity |
0.1 | 1 | 2006 | Finding 3-shredders efficiently · ACM Trans. Algorithms 2006 |
Mathematical optimization › linear programming
pivoting algorithm |
0.0 | 1 | 2007 | Deterministic pivoting algorithms for constrained ranking and clustering problems · SODA 2007 |
Methods — techniques the papers use, named apart from their topics
deterministic pivoting · 0.1RAM model · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2007 | Deterministic pivoting algorithms for constrained ranking and clustering problems
Anke van Zuylen, Rajneesh Hegde, Kamal Jain, David P. Williamson |
SODA | 2 |
| 2006 | Finding 3-shredders efficientlyabstractA shredder in an undirected graph is a set of vertices whose removal results in at least three components. A 3-shredder is a shredder of size three. We present an algorithm that, given a 3-connected graph, finds its 3-shredders in time proportional to the number of vertices and edges, when implemented on a RAM (random access machine). Rajneesh Hegde |
ACM Trans. Algorithms | 1 |