Experimental analysis of dynamic algorithms for the single source shortest paths problem
Journal of Experimental Algorithmics (JEA)
Efficient algorithms for debugging timing constraint violations
Proceedings of the 8th ACM/IEEE international workshop on Timing issues in the specification and synthesis of digital systems
Optimal Labelling of Point Features in the Slider Model
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Proceedings of the tenth international symposium on Hardware/software codesign
Experimental analysis of the fastest optimum cycle ratio and mean algorithms
ACM Transactions on Design Automation of Electronic Systems (TODAES)
A greedy strategy for detecting negative cost cycles in networks
Future Generation Computer Systems - Special issue: High-speed networks and services for data-intensive grids: The DataTAG project
Global difference constraint propagation for finite domain solvers
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Provably efficient algorithms for resolving temporal and spatial difference constraint violations
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Combinatorial Benders Cuts for the Minimum Tollbooth Problem
Operations Research
An Efficient Nelson-Oppen Decision Procedure for Difference Constraints over Rationals
Electronic Notes in Theoretical Computer Science (ENTCS)
A greedy strategy for detecting negative cost cycles in networks
Future Generation Computer Systems - Special issue: High-speed networks and services for data-intensive grids: The DataTAG project
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartIII
A tutorial on satisfiability modulo theories
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Incremental Satisfiability and Implication for UTVPI Constraints
INFORMS Journal on Computing
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Zap: automated theorem proving for software analysis
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Negative cycle detection problem
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Solving sparse linear constraints
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
An efficient decision procedure for UTVPI constraints
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I
Fast and flexible difference constraint propagation for DPLL(T)
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Characterization and automation of matching-based neighborhoods
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
SDSAT: tight integration of small domain encoding and lazy approaches in a separation logic solver
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 0.00 |