Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Flowshop scheduling with limited temporary storage
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The complexity of facets (and some facets of complexity)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Fast algorithms for N-dimensional restrictions of hard problems
Journal of the ACM (JACM)
Simple characterizations of P(#P) and complete problems
Journal of Computer and System Sciences
ACM Transactions on Database Systems (TODS)
Relating Partial and Complete Solutions and the Complexity of Computing Smallest Solutions
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Model Checking CTL+ and FCTL is Hard
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
On Model Checking Durational Kripke Structures
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Abduction with Penalization in Logic Programming
AI*IA 01 Proceedings of the 7th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
Abductive logic programs with penalization: semantics, complexity and implementation
Theory and Practice of Logic Programming
Efficient timed model checking for discrete-time systems
Theoretical Computer Science
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P
Information Processing Letters
What causes a system to satisfy a specification?
ACM Transactions on Computational Logic (TOCL)
Formal Methods in System Design
Responsibility and blame: a structural-model approach
Journal of Artificial Intelligence Research
Responsibility and blame: a structural-model approach
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
The complexity of finding kth most probable explanations in probabilistic networks
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
On the computational complexity of the forcing chromatic number
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
The complexity of semilinear problems in succinct representation
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
| Hi-index | 0.02 |