4-edge-coloring graphs of maximum degree 3 in linear time
Information Processing Letters
A faster and simpler fully dynamic transitive closure
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Delta-List Vertex Coloring in Linear Time
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Finding dominators revisited: extended abstract
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A fully dynamic reachability algorithm for directed graphs with an almost linear update time
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Δ-List vertex coloring in linear time
Information Processing Letters
Generalized structured programs and loop trees
Science of Computer Programming
Efficient field-sensitive pointer analysis of C
ACM Transactions on Programming Languages and Systems (TOPLAS)
Applying hierarchical graphs to pedestrian indoor navigation
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Yet another optimal algorithm for 3-edge-connectivity
Journal of Discrete Algorithms
An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Δ-List vertex coloring in linear time
Information Processing Letters
Optimal edge deletions for signed graph balancing
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
An nlogn algorithm for hyper-minimizing a (minimized) deterministic automaton
Theoretical Computer Science
A simple algorithm for triconnectivity of a multigraph
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Separator-based data reduction for signed graph balancing
Journal of Combinatorial Optimization
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance
ACM Transactions on Algorithms (TALG)
Using mathematics to improve ada compiled code
Ada-Europe'06 Proceedings of the 11th Ada-Europe international conference on Reliable Software Technologies
On-the-Fly reachability and cycle detection for recursive state machines
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A note on on-the-fly verification algorithms
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A simple test on 2-vertex- and 2-edge-connectivity
Information Processing Letters
Decomposing a multigraph into split components
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
| Hi-index | 0.90 |