The following pages link to Graeme Gange (Q264987):
Displaying 32 items.
- A complete refinement procedure for regular separability of context-free languages (Q264992) (← links)
- MDD propagators with explanation (Q429805) (← links)
- Propagating \textsc{lex}, \textsc{find} and \textsc{replace} with dashed strings (Q1626699) (← links)
- Breaking symmetries with lex implications (Q1648885) (← links)
- Exploiting sparsity in difference-bound matrices (Q1664386) (← links)
- A Benders decomposition approach to deciding modular linear integer arithmetic (Q1680266) (← links)
- Minimizing landscape resistance for habitat conservation (Q2011583) (← links)
- Dashed strings for string constraint solving (Q2046015) (← links)
- Pairwise symmetry reasoning for multi-agent path finding search (Q2060696) (← links)
- Core-guided and core-boosted search for CP (Q2110407) (← links)
- Algorithm selection for dynamic symbolic execution: a preliminary study (Q2119113) (← links)
- Coupling different integer encodings for SAT (Q2170178) (← links)
- Nutmeg: a MIP and CP hybrid solver using branch-and-check (Q2226478) (← links)
- Constraint programming for dynamic symbolic execution of JavaScript (Q2327235) (← links)
- Compiling CP subproblems to MDDs and d-DNNFs (Q2331104) (← links)
- An Abstract Domain of Uninterpreted Functions (Q2796038) (← links)
- On CNF Encodings of Decision Diagrams (Q2815090) (← links)
- Lagrangian Decomposition via Sub-problem Search (Q2815096) (← links)
- Weighted Spanning Tree Constraint with Explanations (Q2815098) (← links)
- Analyzing Array Manipulating Programs by Program Transformation (Q2949696) (← links)
- Optimal k-Level Planarization and Crossing Minimization (Q3073676) (← links)
- Automatic Minimal-Height Table Layout (Q3458745) (← links)
- Fast Set Bounds Propagation Using a BDD-SAT Hybrid (Q3579357) (← links)
- An iterative approach to precondition inference using constrained Horn clauses (Q4559813) (← links)
- Horn clauses as an intermediate representation for program analysis and transformation (Q4592995) (← links)
- Reference Abstract Domains and Applications to String Analysis (Q4637861) (← links)
- Solving Difference Constraints over Modular Arithmetic (Q4928440) (← links)
- Fixing the State Budget: Approximation of Regular Languages with Small DFAs (Q5096078) (← links)
- Unbounded Model-Checking with Interpolation for Regular Language Constraints (Q5326331) (← links)
- Failure tabled constraint logic programming by interpolation (Q5398297) (← links)
- Transformation-Enabled Precondition Inference (Q6063861) (← links)
- Dissecting widening: separating termination from information (Q6536310) (← links)
