Parallel symmetry-breaking in sparse graphs
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Note on the independence number of triangle-free graphs, II
Journal of Combinatorial Theory Series A
Improved distributed algorithms for coloring and network decomposition problems
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A (&Dgr;/2)-approximation algorithm for the maximum independent set problem
Information Processing Letters
Approximating maximum independent set in bounded degree graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
An efficient parallel algorithm that finds independent sets of guaranteed size
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Some Further Approximation Algorithms for the Vertex Cover Problem
CAAP '83 Proceedings of the 8th Colloquium on Trees in Algebra and Programming
Exploiting regularity for low-power design
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
A survey of approximately optimal solutions to some covering and packing problems
ACM Computing Surveys (CSUR)
The algorithmic aspects of uncrowded hypergraphs
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A new model for packet scheduling in multihop wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Instruction generation for hybrid reconfigurable systems
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
A Note on the Approximation of a Minimum-Weight Maximal Independent Set
Computational Optimization and Applications
Improved approximations of independent sets in bounded-degree graphs via subgraph removal
Nordic Journal of Computing
Improving Static Compression Schemes by Alphabet Extension
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
A graph covering algorithm for a coarse grain reconfigurable system
Proceedings of the 2003 ACM SIGPLAN conference on Language, compiler, and tool for embedded systems
A packet scheduling approach to QoS support in multihop wireless networks
Mobile Networks and Applications
Improving data quality: consistency and accuracy
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Scheduling algorithms for conducting conflict-free measurements in overlay networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Minimum Entropy Combinatorial Optimization Problems
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
The greedier the better: an efficient algorithm for approximating maximum independent set
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
On the schedulability of measurement conflict in overlay networks
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Near-optimal mosaic selection for rotating and zooming video cameras
ACCV'07 Proceedings of the 8th Asian conference on Computer vision - Volume Part II
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume II
Distributed coloring depending on the chromatic number or the neighborhood growth
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
IEEE/ACM Transactions on Networking (TON)
Complexity and approximation of fixing numerical attributes in databases under integrity constraints
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Distributed weighted vertex cover via maximal matchings
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
The max quasi-independent set problem
Journal of Combinatorial Optimization
Filtering algorithms for the NVALUE constraint
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
The max quasi-independent set problem
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Energy efficient special instruction support in an embedded processor with compact isa
Proceedings of the 2012 international conference on Compilers, architectures and synthesis for embedded systems
Comparable dependencies over heterogeneous data
The VLDB Journal — The International Journal on Very Large Data Bases
ACM Transactions on Architecture and Code Optimization (TACO)
Symmetry breaking depending on the chromatic number or the neighborhood growth
Theoretical Computer Science
Rapid evaluation of custom instruction selection approaches with FPGA estimation
ACM Transactions on Embedded Computing Systems (TECS)
| Hi-index | 0.00 |