default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBenoît Larose
Person information
- affiliation: Université du Québec à Montréal, Laboratoire de Combinatoire et d'Informatique Mathématique (LACIM), Canada
- affiliation: Champlain College, St-Lambert, QC, Canada
- affiliation (former): Concordia University, Montreal, QC, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j28]Benoît Larose, Barnaby Martin
, Petar Markovic, Daniël Paulusma, Siani Smith, Stanislav Zivný:
QCSP on Reflexive Tournaments. ACM Trans. Comput. Log. 23(3): 14:1-14:22 (2022)- [i10]Isabelle Larivière, Benoît Larose, David Emmanuel Pazmiño Pullas:
Surjective polymorphisms of reflexive cycles. CoRR abs/2206.11390 (2022) - 2021
- [j27]Raimundo Briceño, Andrei Bulatov, Víctor Dalmau, Benoît Larose:
Dismantlability, connectedness, and mixing in relational structures. J. Comb. Theory B 147: 37-70 (2021) - [c17]Benoît Larose, Petar Markovic, Barnaby Martin, Daniël Paulusma, Siani Smith, Stanislav Zivný:
QCSP on Reflexive Tournaments. ESA 2021: 58:1-58:15 - [i9]Benoît Larose, Petar Markovic, Barnaby Martin, Daniël Paulusma, Siani Smith, Stanislav Zivný:
QCSP on Reflexive Tournaments. CoRR abs/2104.10570 (2021)
2010 – 2019
- 2019
- [j26]Benoît Larose, Barnaby Martin, Daniël Paulusma:
Surjective H-Colouring over Reflexive Digraphs. ACM Trans. Comput. Theory 11(1): 3:1-3:21 (2019) - [c16]Raimundo Briceño, Andrei A. Bulatov, Víctor Dalmau, Benoît Larose:
Dismantlability, Connectedness, and Mixing in Relational Structures. ICALP 2019: 29:1-29:15 - [i8]Raimundo Briceño, Andrei Bulatov, Víctor Dalmau, Benoît Larose:
Long range actions, connectedness, and dismantlability in relational structures. CoRR abs/1901.04398 (2019) - 2018
- [j25]Benoît Larose, Mark H. Siggers:
NU Polymorphisms on Reflexive Digraphs. SIAM J. Discret. Math. 32(1): 728-749 (2018) - [c15]Benoît Larose, Barnaby Martin, Daniël Paulusma:
Surjective H-Colouring over Reflexive Digraphs. STACS 2018: 49:1-49:14 - 2017
- [j24]Hubie Chen, Benoît Larose:
Asking the Metaquestions in Constraint Tractability. ACM Trans. Comput. Theory 9(3): 11:1-11:27 (2017) - [p1]Benoît Larose:
Algebra and the Complexity of Digraph CSPs: a Survey. The Constraint Satisfaction Problem 2017: 267-285 - [i7]Benoît Larose, Barnaby Martin, Daniël Paulusma:
Surjective H-Colouring over Reflexive Digraphs. CoRR abs/1709.09486 (2017) - 2016
- [i6]Hubie Chen, Benoît Larose:
Asking the metaquestions in constraint tractability. CoRR abs/1604.00932 (2016) - 2015
- [c14]Víctor Dalmau, László Egri, Pavol Hell, Benoît Larose, Arash Rafiey:
Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy. LICS 2015: 487-498 - 2014
- [j23]Tomás Feder, Pavol Hell, Benoît Larose, Mark H. Siggers, Claude Tardif:
Graphs Admitting k-NU Operations. Part 2: The Irreflexive Case. SIAM J. Discret. Math. 28(2): 817-834 (2014) - [c13]László Egri, Pavol Hell, Benoît Larose, Arash Rafiey:
Space complexity of list H-colouring: a dichotomy. SODA 2014: 349-365 - 2013
- [j22]Benoît Larose, Adrien Lemaître:
List-homomorphism problems on graphs and arc consistency. Discret. Math. 313(22): 2525-2537 (2013) - [j21]Tomás Feder, Pavol Hell, Benoît Larose, Cynthia Loten, Mark H. Siggers, Claude Tardif:
Graphs Admitting k-NU Operations. Part 1: The Reflexive Case. SIAM J. Discret. Math. 27(4): 1940-1963 (2013) - [i5]László Egri, Pavol Hell, Benoît Larose, Arash Rafiey:
Space complexity of list H-colouring: a dichotomy. CoRR abs/1308.0180 (2013) - 2012
- [j20]László Egri, Andrei A. Krokhin, Benoît Larose, Pascal Tesson:
The Complexity of the List Homomorphism Problem for Graphs. Theory Comput. Syst. 51(2): 143-178 (2012) - [c12]Benoît Larose, Adrien Lemaître:
List-Homomorphism Problems on Graphs and Arc Consistency. ISMVL 2012: 343-348 - 2010
- [c11]László Egri, Andrei A. Krokhin, Benoît Larose, Pascal Tesson:
The Complexity of the List Homomorphism Problem for Graphs. STACS 2010: 335-346
2000 – 2009
- 2009
- [j19]Gábor Kun, Benoît Larose:
Maximum stable sets in analogs of Kneser and complete graphs. Eur. J. Comb. 30(1): 17-29 (2009) - [j18]Benoît Larose, Matthew Valeriote, László Zádori:
Omitting Types, Bounded Width and the Ability to Count. Int. J. Algebra Comput. 19(5): 647-668 (2009) - [j17]Benoît Larose, Pascal Tesson:
Universal algebra and hardness results for constraint satisfaction problems. Theor. Comput. Sci. 410(18): 1629-1647 (2009) - [i4]László Egri, Andrei A. Krokhin, Benoît Larose, Pascal Tesson:
The complexity of the list homomorphism problem for graphs. CoRR abs/0912.3802 (2009) - 2008
- [j16]Víctor Dalmau, Andrei A. Krokhin, Benoît Larose:
Retractions onto series-parallel posets. Discret. Math. 308(11): 2104-2114 (2008) - [j15]Andrei A. Krokhin, Benoît Larose:
Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction. SIAM J. Discret. Math. 22(1): 312-328 (2008) - [c10]Andrei A. Bulatov, Andrei A. Krokhin, Benoît Larose:
Dualities for Constraint Satisfaction Problems. Complexity of Constraints 2008: 93-124 - [c9]László Egri, Benoît Larose, Pascal Tesson:
Directed st-Connectivity Is Not Expressible in Symmetric Datalog. ICALP (2) 2008: 172-183 - [c8]Víctor Dalmau, Benoît Larose:
Maltsev + Datalog --> Symmetric Datalog. LICS 2008: 297-306 - 2007
- [j14]Benoît Larose, Cynthia Loten, Claude Tardif:
A Characterisation of First-Order Constraint Satisfaction Problems. Log. Methods Comput. Sci. 3(4) (2007) - [j13]Víctor Dalmau, Andrei A. Krokhin, Benoît Larose:
First-order Definable Retraction Problems for Posets and Reflexive Graphs. J. Log. Comput. 17(1): 31-51 (2007) - [c7]Benoît Larose, Pascal Tesson:
Universal Algebra and Hardness Results for Constraint Satisfaction Problems. ICALP 2007: 267-278 - [c6]László Egri, Benoît Larose, Pascal Tesson:
Symmetric Datalog and Constraint Satisfaction Problems in Logspace. LICS 2007: 193-202 - [i3]Benoît Larose, Cynthia Loten, Claude Tardif:
A Characterisation of First-Order Constraint Satisfaction Problems. CoRR abs/0707.2562 (2007) - [i2]László Egri, Benoît Larose, Pascal Tesson:
Symmetric Datalog and Constraint Satisfaction Problems in Logspace. Electron. Colloquium Comput. Complex. TR07 (2007) - [i1]Benoît Larose, Pascal Tesson:
Universal Algebra and Hardness Results for Constraint Satisfaction Problems. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j12]Benoît Larose, László Zádori:
Taylor Terms, Constraint Satisfaction and the Complexity of Polynomial Equations over Finite Algebras. Int. J. Algebra Comput. 16(3): 563-582 (2006) - [c5]Benoît Larose, Cynthia Loten, Claude Tardif:
A Characterisation of First-Order Constraint Satisfaction Problems. LICS 2006: 201-210 - [c4]Ondrej Klíma, Benoît Larose, Pascal Tesson:
Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture. MFCS 2006: 584-595 - 2005
- [j11]Benoît Larose, Cynthia Loten, László Zádori:
A polynomial-time algorithm for near-unanimity graphs. J. Algorithms 55(2): 177-191 (2005) - [c3]Andrei A. Krokhin, Benoît Larose:
Maximum Constraint Satisfaction on Diamonds. CP 2005: 388-402 - 2004
- [j10]Benoît Larose, Claudia Malvenuto:
Stable sets of maximal size in Kneser-type graphs. Eur. J. Comb. 25(5): 657-673 (2004) - [c2]Víctor Dalmau, Andrei A. Krokhin, Benoît Larose:
First-Order Definable Retraction Problems for Posets and Reflexive Graph. LICS 2004: 232-241 - 2003
- [j9]Benoît Larose, László Zádori:
The Complexity of the Extendibility Problem for Finite Posets. SIAM J. Discret. Math. 17(1): 114-121 (2003) - [c1]Andrei A. Krokhin, Benoît Larose:
Solving Order Constraints in Logarithmic Space. STACS 2003: 379-390 - 2002
- [j8]Benoît Larose:
Families of strongly projective graphs. Discuss. Math. Graph Theory 22(2): 271-292 (2002) - [j7]Benoît Larose, Claude Tardif:
Projectivity and independent sets in powers of graphs. J. Graph Theory 40(3): 162-171 (2002) - 2000
- [j6]Benoît Larose, Claude Tardif:
Hedetniemi's Conjecture and the Retracts of a Product of Graphs. Comb. 20(4): 531-544 (2000)
1990 – 1999
- 1999
- [j5]Gábor Czédli, Benoît Larose, György Pollák:
Notes on Coalition Lattices. Order 16(1): 19-29 (1999) - 1998
- [j4]Benoît Larose, François Laviolette, Claude Tardif:
On Normal Cayley Graphs and Hom-idempotent Graphs. Eur. J. Comb. 19(7): 867-881 (1998) - 1997
- [j3]Benoît Larose, László Zádori:
Algebraic properties and dismantlability of finite posets. Discret. Math. 163(1-3): 89-99 (1997) - 1995
- [j2]Benoît Larose:
Minimal automorphic Posets and the Projection Property. Int. J. Algebra Comput. 5(1): 65-80 (1995) - 1992
- [j1]Benoît Larose:
A property of projective ordered sets. Eur. J. Comb. 13(5): 371-378 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-12 22:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
