|
6
|
Directed Hypergraphs as a Modelling Paradigm
– Giorgio Gallo, Maria Grazia Scutellà
- 1999
|
|
18
|
Optimal Traversal of Directed Hypergraphs
– Giorgio Ausiello, Roberto Giaccio, Giuseppe F. Italiano, Umberto Nanni
- 1992
|
|
141
|
Improvements To Propositional Satisfiability Search Algorithms
– Jon William Freeman
- 1995
|
|
|
Decremental maintenance of reachability in hypergraphs and minimum models of Horn formulae
– Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio
|
|
2
|
Linear Connectivity Problems in Directed Hypergraphs
– Mayur Thakur, Rahul Tripathi
|
|
5
|
Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms
– Giorgio Ausiello, Giuseppe F. Italiano, Umberto Nanni
- 1998
|
|
107
|
Algorithms for the Satisfiability (SAT) Problem: A Survey
– Jun Gu, Paul W. Purdom, John Franco, Benjamin W. Wah
- 1996
|
|
4
|
The Satisfiability problem for the Schöenfinkel-Bernays fragment: Partial Instantiation and Hypergraph Algorithms
– Giorgio Gallo, Gabriella Rago
- 1994
|
|
97
|
An Incremental Algorithm for a Generalization of the Shortest-Path Problem
– G. Ramalingam, Thomas Reps
- 1992
|
|
2
|
Exploiting Functional Dependence in Query Optimization
– Glenn Norman Paulley
- 2000
|
|
35
|
Reconstructing a History of Recombinations From a Set of Sequences
– John Kececioglu, Dan Gusfield
- 1998
|
|
5
|
Logical Inference and Polyhedral Projection
– J.N. Hooker
- 1992
|
|
1
|
Finding Tractable Formulas in NNF
– E. Altamirano, G. Escalada-imaz
- 2000
|
|
|
On the Complexity of Minimizing the Number . . .
– Ondčej Čepek, Petr Kučera
- 2008
|
|
31
|
Algorithms To Schedule Tasks With And/or Precedence Constraints
– Donald William Gillies, Donald William Gillies, Ph. D
- 1993
|
|
80
|
Tractable Reasoning via Approximation
– Marco Schaerf, Marco Cadoli
- 1995
|
|
194
|
Hard and Easy Distributions of SAT Problems
– David Mitchell, Bart Selman, Hector Levesque
- 1992
|
|
87
|
Generating Hard Satisfiability Problems
– Bart Selman, David Mitchell, Hector Levesque
- 1996
|
|
3
|
Horn Minimization by Iterative Decomposition
– Endre Boros, Ondrej Cepek, Alexander Kogan
- 1998
|
