On Bufferless Routing of Variable Length Messages in Leveled Networks
IEEE Transactions on Computers
Tight bounds for dynamic storage allocation
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Invited Lecture: Online Algorithms: A Study of Graph-Theoretic Concepts
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
OPT versus LOAD in dynamic storage allocation
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Buffer minimization using max-coloring
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Bounded families for the on-line t-relaxed coloring
Information Processing Letters
Approximating interval coloring and max-coloring in chordal graphs
Journal of Experimental Algorithmics (JEA)
Online promise problems with online width metrics
Journal of Computer and System Sciences
Inequalities for the Grundy chromatic number of graphs
Discrete Applied Mathematics
Online interval coloring with packing constraints
Theoretical Computer Science
A note on the online First-Fit algorithm for coloring k-inductive graphs
Information Processing Letters
Variants of Online Chain Partition Problem of Posets
Electronic Notes in Theoretical Computer Science (ENTCS)
Bounded families for the on-line t-relaxed coloring
Information Processing Letters
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Online conflict-free colouring for hypergraphs
Combinatorics, Probability and Computing
First-Fit coloring of bounded tolerance graphs
Discrete Applied Mathematics
First-Fit Algorithm for the On-Line Chain Partitioning Problem
SIAM Journal on Discrete Mathematics
Max-coloring and online coloring with bandwidths on interval graphs
ACM Transactions on Algorithms (TALG)
Variable sized online interval coloring with bandwidth
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Online interval coloring and variants
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Single and multiple device DSA problems, complexities and online algorithms
Theoretical Computer Science
ACM Transactions on Architecture and Code Optimization (TACO)
On-line coloring of h-free bipartite graphs
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Online interval coloring with packing constraints
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Some new directions and questions in parameterized complexity
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Theoretical Computer Science
Online capacitated interval coloring
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
On first-fit coloring of ladder-free posets
European Journal of Combinatorics
| Hi-index | 0.01 |