Pietro Maugeri

According to our database1, Pietro Maugeri authored at least 13 papers between 2019 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
The Decision Problem for Undirected Graphs with Reachability and Acyclicity.
Proceedings of the Twenty Years of Theoretical and Practical Synergies, 2024

2023
Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages.
Theor. Comput. Sci., 2023

Complexity Results for Some Fragments of Set Theory Involving the Unordered Cartesian Product Operator.
Proceedings of the 24th Italian Conference on Theoretical Computer Science, 2023

The Satisfiability Problem for Boolean Set Theory with a Rational Choice Correspondence.
Proceedings of the 24th Italian Conference on Theoretical Computer Science, 2023

2021
Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case.
Fundam. Informaticae, 2021

Complexity assessments for decidable fragments of Set Theory. III: A quadratic reduction of constraints over nested sets to Boolean formulae.
CoRR, 2021

On the Convexity of a Fragment of Pure Set Theory with Applications within a Nelson-Oppen Framework.
Proceedings of the Proceedings 12th International Symposium on Games, 2021

Two Crucial Cubic-Time Components of Polynomial-Maximal Decidable Boolean Languages.
Proceedings of the 22nd Italian Conference on Theoretical Computer Science, 2021

2020
Complexity assessments for decidable fragments of set theory. II: A taxonomy for 'small' languages involving membership.
Theor. Comput. Sci., 2020

A Quadratic Reduction of Constraints over Nested Sets to Purely Boolean Formulae in CNF.
Proceedings of the 35th Italian Conference on Computational Logic, 2020

2019
A Potential-Based Variant of the Bellman-Ford Algorithm.
Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019

Polynomial-Time Satisfiability Tests for 'Small' Membership Theories.
Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019

Polynomial-Time Satisfiability Tests for Boolean Fragments of Set Theory.
Proceedings of the 34th Italian Conference on Computational Logic, 2019


  Loading...