Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Larose, Benoit - Department of Mathematics and Statistics, Concordia University
BOUNDED WIDTH PROBLEMS AND ALGEBRAS BENOIT LAROSE AND LASZLO ZADORI
OMITTING TYPES, BOUNDED WIDTH AND THE ABILITY TO COUNT
The complexity of the list homomorphism problem for graphs
COLOURINGS OF HYPERGRAPHS, PERMUTATION GROUPS BENOIT LAROSE AND LUCIEN HADDAD
A CHARACTERISATION OF FIRST-ORDER CONSTRAINT SATISFACTION PROBLEMS
First-order definable retraction problems for posets and reflexive graphs
from: universite de montreal to: 1187 Avenue Van Horne, Outremon... http://maps.google.ca/maps?daddr=1187+Avenue+Van+Horne,+Ou... 1 of 1 04-Sep-07 10:19
Symmetric Datalog and Constraint Satisfaction Problems in Logspace Laszlo Egri
MAXIMIZING SUPERMODULAR FUNCTIONS ON PRODUCT LATTICES, WITH APPLICATION TO MAXIMUM CONSTRAINT
The complexity of the list homomorphism problem for graphs
LIST-HOMOMORPHISM PROBLEMS ON GRAPHS AND ARC CONSISTENCY
