The ultimate interval graph recognition algorithm?
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
LBFS orderings and cocomparability graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Greedy algorithms for tracking mobile users in special mobility graphs
Discrete Applied Mathematics
On Subfamilies of AT-Free Graphs
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Satisfying a maximum number of pre-routed requests in all-optical rings
Computer Networks: The International Journal of Computer and Telecommunications Networking - Small and home networks
Information Sciences: an International Journal
Discrete Applied Mathematics
Minimal interval completion through graph exploration
Theoretical Computer Science
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Discrete Applied Mathematics
Hardness and approximation of minimum distortion embeddings
Information Processing Letters
Efficient algorithms for disjoint matchings among intervals and related problems
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
The LBFS Structure and Recognition of Interval Graphs
SIAM Journal on Discrete Mathematics
Theoretical Computer Science
Routing and wavelength assignment in generalized WDM tree networks of bounded degree
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Nash equilibria in all-optical networks
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Lexicographic breadth first search – a survey
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Minimal interval completion through graph exploration
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Drawing graphs with vertices at specified positions and crossings at large angles
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
An optimal time slot assignment algorithm for CRMA high-speed networks
Computer Communications
The stable set problem and the thinness of a graph
Operations Research Letters
The worst case behavior of randomized gossip
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Scheduling light-trails on WDM rings
Journal of Parallel and Distributed Computing
Optimal algorithms for the batch scheduling problem in OBS networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the L(h, k)-labeling of co-comparability graphs
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
A polynomial kernel for proper interval vertex deletion
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
| Hi-index | 0.89 |