Scheduling Block-Cyclic Array Redistribution
IEEE Transactions on Parallel and Distributed Systems
ISPD '00 Proceedings of the 2000 international symposium on Physical design
On permutations with limited independence
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
SMC: a symmetry-based model checker for verification of safety and liveness properties
ACM Transactions on Software Engineering and Methodology (TOSEM)
Mod 3 arithmetic on triangulated Riemann surfaces
Theoretical Computer Science
Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Largest planar matching in random bipartite graphs
Random Structures & Algorithms
Products of circulant graphs are metacirculant
Journal of Combinatorial Theory Series B
A new approximation algorithm for the asymmetric TSP with triangle inequality
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Approximation Algorithms for Minimum Size 2-Connectivity Problems
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
A Compressed Breadth-First Search for Satisfiability
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Two Approximation Algorithms for 3-Cycle Covers
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Computing Cycle Covers without Short Cycles
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
More on Scheduling Block-Cyclic Array Redistribution
LCR '98 Selected Papers from the 4th International Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers
Computing small partial coverings
Information Processing Letters
The large-scale structure of metabolic networks: a glimpse at life's origin?
Complexity - Special issue: Selection, tinkering, and emergence in complex networks
A new multilayered PCP and the hardness of hypergraph vertex cover
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Fast algorithms for fair dynamic load redistribution in heterogeneous environments
Applied Numerical Mathematics - Numerical algorithms, parallelism and applications
Materialization of fragmented views in multidimensional databases
Data & Knowledge Engineering
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Efficient approximation algorithms for the achromatic number
Theoretical Computer Science - Approximation and online algorithms
On cages admitting identifying codes
European Journal of Combinatorics
A new approximation algorithm for the asymmetric TSP with triangle inequality
ACM Transactions on Algorithms (TALG)
A parameterized view on matroid optimization problems
Theoretical Computer Science
Graph colouring heuristics guided by higher order graph properties
EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
Computers and Operations Research
Theory and application of width bounded geometric separators
Journal of Computer and System Sciences
Sets with large additive energy and symmetric sets
Journal of Combinatorial Theory Series A
On the competitive ratio of evaluating priced functions
Journal of the ACM (JACM)
Delaunay triangulations of point sets in closed euclidean d-manifolds
Proceedings of the twenty-seventh annual symposium on Computational geometry
An experimental comparison of single-sided preference matching algorithms
Journal of Experimental Algorithmics (JEA)
Theory and application of width bounded geometric separator
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
A PTAS for a disc covering problem using width-bounded separators
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Fault tolerant guarding of grids
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
A parameterized view on matroid optimization problems
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Sequences of radius k: how to fetch many huge objects into small memory for pairwise computations
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Efficient prüfer-like coding and counting labelled hypertrees
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
On algebraic immunity and annihilators
ICISC'06 Proceedings of the 9th international conference on Information Security and Cryptology
Computer Science Review
Appearance sharing for collective human pose estimation
ACCV'12 Proceedings of the 11th Asian conference on Computer Vision - Volume Part I
| Hi-index | 0.00 |