EDBT 2026 Demo / reviewers in the wild / expert
Udaiprakash I. Gupta
dblp:55/607
· DBLP profile ↗
3ranked-venue papers
3as first author
0since 2021 · last 1982
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 first-authorComputer networks · 1 · 1 first-authorTheory of computation · 1 · 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
1 paper |
Mathematical optimization · 50% Graph algorithms and graph theory · 50% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Graph algorithms and graph theory › graph coloring
channel assignment |
0.0 | 1 | 1979 | An Optimal Solution for the Channel-Assignment Problem · IEEE Trans. Computers 1979 |
Graph algorithms and graph theory › graph coloring
interval graph coloring |
0.0 | 1 | 1979 | An Optimal Solution for the Channel-Assignment Problem · IEEE Trans. Computers 1979 |
Mathematical optimization › optimization
interval scheduling |
0.0 | 1 | 1979 | An Optimal Solution for the Channel-Assignment Problem · IEEE Trans. Computers 1979 |
Mathematical optimization › combinatorial optimization › partitioning problems
optimal partitioning |
0.0 | 1 | 1979 | An Optimal Solution for the Channel-Assignment Problem · IEEE Trans. Computers 1979 |
Methods — techniques the papers use, named apart from their topics
greedy algorithm · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1982 | Efficient algorithms for interval graphs and circular-arc graphsabstractAbstract We show that for an interval graph given in the form of a family of intervals, a maximum independent set, a minimum covering by disjoint completely connected sets or cliques, and a maximum clique can all be found in O(n log n) time [O(n) time if the endpoints of the intervals are sorted]. For the more general circular‐arc graphs, a maximum independent set and a minimum covering by disjoint completely connected sets or cliques can be found in O(n2) time, provided again that a corresponding family of arcs is given. Udaiprakash I. Gupta, D. T. Lee, Joseph Y.-T. Leung |
Networks | 1 |
| 1981 | Record Allocation for Minimizing Seek Delay
Udaiprakash I. Gupta, D. T. Lee, Joseph Y.-T. Leung, J. W. Pruitt, Chak-Kuen Wong |
Theor. Comput. Sci. | 1 |
| 1979 | An Optimal Solution for the Channel-Assignment ProblemabstractGiven a set of intervals (pairs of real numbers), we look at the problem of finding a minimal partition of this set such that no element of the partition contains two overlapping intervals. We exhibit a Θ(N log N) algorithm which is optimal. The problem has applications in LSI layout design and job scheduling. Udaiprakash I. Gupta, D. T. Lee, Joseph Y.-T. Leung |
IEEE Trans. Computers | 1 |