|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1 occurrences of 1 keywords
|
|
|
|
|
Results
Found 30 publication records. Showing 30 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | László Egri, Andrei A. Krokhin, Benoit Larose, Pascal Tesson |
The Complexity of the List Homomorphism Problem for Graphs.  |
Theory Comput. Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | László Egri, Andrei A. Krokhin, Benoit Larose, Pascal Tesson |
The Complexity of the List Homomorphism Problem for Graphs. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Benoit Larose, Pascal Tesson |
Universal algebra and hardness results for constraint satisfaction problems. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Benoit Larose, Matt Valeriote, László Zádori |
Omitting Types, Bounded Width and the Ability to Count. |
IJAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Gábor Kun, Benoit Larose |
Maximum stable sets in analogs of Kneser and complete graphs. |
Eur. J. Comb. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | László Egri, Andrei A. Krokhin, Benoit Larose, Pascal Tesson |
The complexity of the list homomorphism problem for graphs |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Víctor Dalmau, Andrei A. Krokhin, Benoit Larose |
Retractions onto series-parallel posets. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Krokhin, Benoit Larose |
Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction. |
SIAM J. Discrete Math. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | László Egri, Benoit Larose, Pascal Tesson |
Directed st-Connectivity Is Not Expressible in Symmetric Datalog. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Andrei A. Krokhin, Benoit Larose |
Dualities for Constraint Satisfaction Problems. |
Complexity of Constraints |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Víctor Dalmau, Benoit Larose |
Maltsev + Datalog --> Symmetric Datalog. |
LICS |
2008 |
DBLP DOI BibTeX RDF |
Maltsev term, Dstalog, Symmetric Datalog |
| 1 | Benoit Larose, Pascal Tesson |
Universal Algebra and Hardness Results for Constraint Satisfaction Problems. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | László Egri, Benoit Larose, Pascal Tesson |
Symmetric Datalog and Constraint Satisfaction Problems in Logspace. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Benoit Larose, Cynthia Loten, Claude Tardif |
A Characterisation of First-Order Constraint Satisfaction Problems. |
Logical Methods in Computer Science |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Víctor Dalmau, Andrei A. Krokhin, Benoit Larose |
First-order Definable Retraction Problems for Posets and Reflexive Graphs. |
J. Log. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Benoit Larose, Cynthia Loten, Claude Tardif |
A Characterisation of First-Order Constraint Satisfaction Problems |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Benoit Larose, Pascal Tesson |
Universal Algebra and Hardness Results for Constraint Satisfaction Problems. |
ICALP |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | László Egri, Benoit Larose, Pascal Tesson |
Symmetric Datalog and Constraint Satisfaction Problems in Logspace. |
LICS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Benoit Larose, László Zádori |
Taylor Terms, Constraint Satisfaction and the Complexity of Polynomial Equations over Finite Algebras. |
IJAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Ondrej Klíma, Benoit Larose, Pascal Tesson |
Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture. |
MFCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Benoit Larose, Cynthia Loten, Claude Tardif |
A Characterisation of First-Order Constraint Satisfaction Problems. |
LICS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Benoit Larose, Cynthia Loten, László Zádori |
A polynomial-time algorithm for near-unanimity graphs. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Krokhin, Benoit Larose |
Maximum Constraint Satisfaction on Diamonds. |
CP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Benoit Larose, Claudia Malvenuto |
Stable sets of maximal size in Kneser-type graphs. |
Eur. J. Comb. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Víctor Dalmau, Andrei A. Krokhin, Benoit Larose |
First-Order Definable Retraction Problems for Posets and Reflexive Graph. |
LICS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Benoit Larose, László Zádori |
The Complexity of the Extendibility Problem for Finite Posets. |
SIAM J. Discrete Math. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Andrei A. Krokhin, Benoit Larose |
Solving Order Constraints in Logarithmic Space. |
STACS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Benoit Larose, Claude Tardif |
Hedetniemi's Conjecture and the Retracts of a Product of Graphs. |
Combinatorica |
2000 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 05C15, 08A40, 05C75 |
| 1 | Benoit Larose, François Laviolette, Claude Tardif |
On Normal Cayley Graphs and Hom-idempotent Graphs. |
Eur. J. Comb. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Benoit Larose, László Zádori |
Algebraic properties and dismantlability of finite posets. |
Discrete Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #30 of 30 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")