![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Pietro Maugeri
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c9]Domenico Cantone, Andrea De Domenico, Pietro Maugeri:
The Decision Problem for Undirected Graphs with Reachability and Acyclicity. CiE 2024: 431-446 - 2023
- [j3]Domenico Cantone
, Pietro Maugeri, Eugenio G. Omodeo:
Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages. Theor. Comput. Sci. 954: 113786 (2023) - [c8]Domenico Cantone, Alfio Giarlotta, Pietro Maugeri, Stephen Watson:
The Satisfiability Problem for Boolean Set Theory with a Rational Choice Correspondence. ICTCS 2023: 1-14 - [c7]Domenico Cantone, Pietro Maugeri:
Complexity Results for Some Fragments of Set Theory Involving the Unordered Cartesian Product Operator. ICTCS 2023: 283-298 - 2021
- [j2]Domenico Cantone, Andrea De Domenico, Pietro Maugeri, Eugenio G. Omodeo:
Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case. Fundam. Informaticae 181(1): 37-69 (2021) - [c6]Domenico Cantone, Pietro Maugeri, Eugenio G. Omodeo:
Two Crucial Cubic-Time Components of Polynomial-Maximal Decidable Boolean Languages. ICTCS 2021: 164-178 - [c5]Domenico Cantone, Andrea De Domenico, Pietro Maugeri:
On the Convexity of a Fragment of Pure Set Theory with Applications within a Nelson-Oppen Framework. GandALF 2021: 195-210 - [i1]Domenico Cantone, Andrea De Domenico, Pietro Maugeri, Eugenio G. Omodeo:
Complexity assessments for decidable fragments of Set Theory. III: A quadratic reduction of constraints over nested sets to Boolean formulae. CoRR abs/2112.04797 (2021) - 2020
- [j1]Domenico Cantone, Pietro Maugeri, Eugenio G. Omodeo
:
Complexity assessments for decidable fragments of set theory. II: A taxonomy for 'small' languages involving membership. Theor. Comput. Sci. 848: 28-46 (2020) - [c4]Domenico Cantone, Andrea De Domenico, Pietro Maugeri, Eugenio G. Omodeo:
A Quadratic Reduction of Constraints over Nested Sets to Purely Boolean Formulae in CNF. CILC 2020: 214-230
2010 – 2019
- 2019
- [c3]Domenico Cantone, Andrea De Domenico, Pietro Maugeri, Eugenio G. Omodeo:
Polynomial-Time Satisfiability Tests for Boolean Fragments of Set Theory. CILC 2019: 123-137 - [c2]Domenico Cantone, Pietro Maugeri, Stefano Scafiti:
A Potential-Based Variant of the Bellman-Ford Algorithm. ICTCS 2019: 122-135 - [c1]Domenico Cantone, Pietro Maugeri:
Polynomial-Time Satisfiability Tests for 'Small' Membership Theories. ICTCS 2019: 261-273
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
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-07-21 21:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint