A note on greedy algorithms for the maximum weighted independent set problem
Discrete Applied Mathematics
An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Exponential Lower Bound for Static Semi-algebraic Proofs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Complexity of Semi-algebraic Proofs
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Algebraic proof systems over formulas
Theoretical Computer Science - Logic and complexity in computer science
Combinatorics, Probability and Computing
Journal of Combinatorial Theory Series A
Flip-flop insertion with shifted-phase clocks for FPGA power reduction
ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
Algebraic characterization of uniquely vertex colorable graphs
Journal of Combinatorial Theory Series B
Hilbert's nullstellensatz and an algorithm for proving combinatorial infeasibility
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Expressing combinatorial problems by systems of polynomial equations and hilbert's nullstellensatz
Combinatorics, Probability and Computing
Theta Bodies for Polynomial Ideals
SIAM Journal on Optimization
Scheduling jobs on identical machines with agreement graph
Computers and Operations Research
Some combinatorial applications of Gröbner bases
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz
Journal of Symbolic Computation
SubMAP: aligning metabolic pathways with subnetwork mappings
RECOMB'10 Proceedings of the 14th Annual international conference on Research in Computational Molecular Biology
An algebraic characterization of rainbow connectivity
CASC'12 Proceedings of the 14th international conference on Computer Algebra in Scientific Computing
Most Tensor Problems Are NP-Hard
Journal of the ACM (JACM)
Hi-index | 0.00 |