Demo Data from EDBT 2026 / reviewers in the wild / expert
Barun Chandra
dblp:27/5919
· DBLP profile ↗
6ranked-venue papers
6as first author
0since 2021 · last 1999
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 6 · 6 first-authorDatabases, data management, data science and information retrieval · 2 · 2 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
4 papers |
Mathematical optimization · 60% Approximation and online algorithms · 26% Graph algorithms and graph theory · 10% |
Topics — the 12 heaviest of 12, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Mathematical optimization
combinatorial optimization |
0.0 | 2 | 1999 | New Results on the Old k-opt Algorithm for the Traveling Salesman Problem · SIAM J. Comput. 1999 New Results on the Old k-Opt Algorithm for the TSP · SODA 1994 |
Mathematical optimization › combinatorial optimization › vehicle routing › traveling salesman problem
k-opt heuristic |
0.0 | 2 | 1999 | New Results on the Old k-opt Algorithm for the Traveling Salesman Problem · SIAM J. Comput. 1999 New Results on the Old k-Opt Algorithm for the TSP · SODA 1994 |
Mathematical optimization › combinatorial optimization
local search |
0.0 | 2 | 1999 | New Results on the Old k-opt Algorithm for the Traveling Salesman Problem · SIAM J. Comput. 1999 New Results on the Old k-Opt Algorithm for the TSP · SODA 1994 |
Mathematical optimization › combinatorial optimization › vehicle routing
traveling salesman problem |
0.0 | 2 | 1999 | New Results on the Old k-opt Algorithm for the Traveling Salesman Problem · SIAM J. Comput. 1999 New Results on the Old k-Opt Algorithm for the TSP · SODA 1994 |
Approximation and online algorithms
approximation algorithms |
0.0 | 1 | 1999 | Greedy Local Improvement and Weighted Set Packing Approximation · SODA 1999 |
Mathematical optimization › combinatorial optimization
greedy algorithm |
0.0 | 1 | 1999 | Greedy Local Improvement and Weighted Set Packing Approximation · SODA 1999 |
Approximation and online algorithms
set packing |
0.0 | 1 | 1999 | Greedy Local Improvement and Weighted Set Packing Approximation · SODA 1999 |
Approximation and online algorithms › set packing
weighted set packing |
0.0 | 1 | 1999 | Greedy Local Improvement and Weighted Set Packing Approximation · SODA 1999 |
Algorithms and data structures
heuristic algorithms |
0.0 | 1 | 1994 | New Results on the Old k-Opt Algorithm for the TSP · SODA 1994 |
Graph algorithms and graph theory
graph spanners |
0.0 | 1 | 1992 | New Sparseness Results on Graph Spanners · SCG 1992 |
Graph algorithms and graph theory › graph spanners
sparse spanners |
0.0 | 1 | 1992 | New Sparseness Results on Graph Spanners · SCG 1992 |
Graph algorithms and graph theory › graph spanners
weighted spanners |
0.0 | 1 | 1992 | New Sparseness Results on Graph Spanners · SCG 1992 |
Methods — techniques the papers use, named apart from their topics
worst-case analysis · 0.0probabilistic analysis · 0.0greedy local improvement · 0.0approximation analysis · 0.0local search analysis · 0.0k-opt · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1999 | Greedy Local Improvement and Weighted Set Packing Approximation
Barun Chandra, Magnús M. Halldórsson |
SODA | 1 |
| 1999 | New Results on the Old k-opt Algorithm for the Traveling Salesman ProblemabstractLocal search with k-change neighborhoods is perhaps the oldest and most widely used heuristic method for the traveling salesman problem, yet almost no theoretical performance guarantees for it were previously known. This paper develops several results, some worst-case and some probabilistic, on the performance of 2- and k-opt local search for the traveling salesman problem, with respect to both the quality of the solution and the speed with which it is obtained. Barun Chandra, Howard J. Karloff, Craig A. Tovey |
SIAM J. Comput. | 1 |
| 1994 | New Results on the Old k-Opt Algorithm for the TSP
Barun Chandra, Howard J. Karloff, Craig A. Tovey |
SODA | 1 |
| 1994 | Constructing Sparse Spanners for Most Graphs in Higher Dimensions
Barun Chandra |
Inf. Process. Lett. | 1 |
| 1992 | New Sparseness Results on Graph SpannersabstractLet G=(V,E) be an n-vertex connected graph with positive edge weights. A subgraph G′ = (V,E′) is a t-spanner of G if for all u, v ε V,the weighted distance between u and v in G′ is at most t times the weighted distance between u and v in G. We consider the problem of constructing sparse spanners, and the weight, defined as the sum of the edge weights in the spanner. In this paper, we concentrate on constructing spanners of small weight. Barun Chandra, Gautam Das 0001, Giri Narasimhan, José Soares |
SCG | 1 |
| 1992 | Does Randomization Help in On-Line Bin Packing?
Barun Chandra |
Inf. Process. Lett. | 1 |