default search action
Catarina Carvalho
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
- [j7]Catarina Carvalho, Florent R. Madelaine, Barnaby Martin, Dmitriy Zhuk:
The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation. ACM Trans. Comput. Log. 24(1): 5:1-5:26 (2023) - 2022
- [j6]Kristen M. Meiburger, Francesco Marzola, Guillaume Zahnd, Francesco Faita, Christos P. Loizou, Nolann Lainé, Catarina Carvalho, David A. Steinman, Lorenzo Gibello, Rosa Maria Bruno, Ricarda Clarenbach, Martina Francesconi, Andrew Nicolaides, Hervé Liebgott, Aurélio Campilho, Reza Ghotbi, Efthyvoulos Kyriacou, Nassir Navab, Maura Griffin, Andrie G. Panayiotou, Rachele Gherardini, Gianfranco Varetto, Elisabetta Bianchini, Constantinos S. Pattichis, Lorenzo Ghiadoni, José Rouco, Maciej Orkisz, Filippo Molinari:
Carotid Ultrasound Boundary Study (CUBS): Technical considerations on an open multi-center analysis of computerized measurement systems for intima-media thickness measurement on common carotid artery longitudinal B-mode ultrasound scans. Comput. Biol. Medicine 144: 105333 (2022) - [j5]Catarina Carvalho, Barnaby Martin:
The lattice and semigroup structure of multipermutations. Int. J. Algebra Comput. 32(2): 211-235 (2022) - 2016
- [j4]Catarina Carvalho, Andrei A. Krokhin:
On algebras with many symmetric operations. Int. J. Algebra Comput. 26(5): 1019-1031 (2016) - 2015
- [j3]Catarina Carvalho, László Egri, Marcel Jackson, Todd Niven:
On Maltsev Digraphs. Electron. J. Comb. 22(1): 1 (2015) - 2011
- [j2]Catarina Carvalho, Víctor Dalmau, Andrei A. Krokhin:
Two new homomorphism dualities and lattice operations. J. Log. Comput. 21(6): 1065-1092 (2011) - 2010
- [j1]Catarina Carvalho, Víctor Dalmau, Andrei A. Krokhin:
CSP duality and trees of bounded pathwidth. Theor. Comput. Sci. 411(34-36): 3188-3208 (2010)
Conference and Workshop Papers
- 2017
- [c4]Catarina Carvalho, Barnaby Martin, Dmitriy Zhuk:
The Complexity of Quantified Constraints Using the Algebraic Formulation. MFCS 2017: 27:1-27:14 - 2015
- [c3]Catarina Carvalho, Florent R. Madelaine, Barnaby Martin:
From Complexity to Algebra and Back: Digraph Classes, Collapsibility, and the PGP. LICS 2015: 462-474 - 2011
- [c2]Catarina Carvalho, László Egri, Marcel Jackson, Todd Niven:
On Maltsev Digraphs. CSR 2011: 181-194 - 2008
- [c1]Catarina Carvalho, Víctor Dalmau, Andrei A. Krokhin:
Caterpillar Duality for Constraint Satisfaction Problems. LICS 2008: 307-316
Informal and Other Publications
- 2021
- [i4]Catarina Carvalho, Florent R. Madelaine, Barnaby Martin, Dmitriy Zhuk:
The complexity of quantified constraints: collapsibility, switchability and the algebraic formulation. CoRR abs/2106.13154 (2021) - 2017
- [i3]Catarina Carvalho, Barnaby Martin, Dmitriy Zhuk:
The complexity of quantified constraints. CoRR abs/1701.04086 (2017) - 2015
- [i2]Catarina Carvalho, Florent R. Madelaine, Barnaby Martin:
From complexity to algebra and back: digraph classes, collapsibility and the PGP. CoRR abs/1501.04558 (2015) - 2007
- [i1]Catarina Carvalho, Víctor Dalmau, Petar Markovic, Miklós Maróti:
CD(4) has bounded width. CoRR abs/0709.1934 (2007)
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-04-25 05:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint