Articles

Manuscripts/Preprints:

  1. Linear Time Algorithm for Update Games via Strongly-Trap-Connected Components (A 2-Player Infinite Pebble Game Generalization of Strongly-Connected Components). Download: manuscript, presentation.
  2. Faster O(|V|^2|E|W)-Time Energy Algorithm for Optimal Strategy Synthesis in Mean Payoff Games. Download: manuscript.
  3. Energy Structure of Optimal Positional Strategies in MPGs. Download: manuscript.
  4. Sorting with Forbidden Intermediates (improved and extended journal version). Download: manuscript.

On International Journals:

      1. An Improved Upper Bound on Maximal Clique Listing via Rectangular Fast Matrix Multiplication. Algorithmica, Springer-US (it will appear during 2017) Download: manuscript.
      2. Checking Dynamic Consistency of Conditional Hyper Temporal Networks via Mean Payoff Games (Hardness and (pseudo) Singly-Exponential Time Algorithm). In Information and Computation, Elsevier (it will appear during 2017). Download: manuscript.
      3. Improved Pseudo-Polynomial Bound for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games. In Algorithmica, Springer, pp 1-27, February 2016. Download: manuscript.
      4. Hyper Temporal Networks. In Constraints, an International Journal, Springer, pp 1-39 March 2016. Download: manuscript.
      5. Algebraic Characterization of the Class of Languages Recognized by Measure Only Quantum Automata, in Fundamenta Informaticae, Annales Societatis Mathematicae Polonae, IOS Press, 335–353, vol 134, 2014.
        Download: manuscript.
      6. Towards the Standardization of Industrial Scientific and Engineering Workflows with QVT Transformations, in International Journal on Advances in Software, IARIA Journals, 131-141, vol 6, no 1&2, 2013.
        Download: manuscript.

In International Conference Proceedings:

      1. Instantaneous Reaction-Time in Dynamic-Consistency Checking of Conditional Simple Temporal Networks. with Massimo Cairo and Romeo Rizzi. In 23rd International Symposium on Temporal Representation and Reasoning (TIME 2016), Copenhagen, Denmark, October 2016.
        Download: paper, presentation.
      2. Sorting with Forbidden Intermediates (On (s,t)-Paths with Forbidden Vertices in Hypercube Graphs), in 3rd International Conference on Algorithms for Computational Biology (AlCoB 2016), Trujillo, Spain, June 21-22, 2016.
        Download: paper, presentation.
      3. Dynamic Consistency of Conditional Simple Temporal Networks via Mean Payoff Games: a Singly-Exponential Time DC-Checking. In 22nd International Symposium on Temporal Representation and Reasoning (TIME 2015), Kassel, Germany, September 2015.
        Download: paper, presentation.
      4. Energy Structure and Improved Complexity Upper Bound for Optimal Positional Strategies in Mean Payoff Games. In 3rd International Workshop on Strategic Reasoning (SR 2015), University of Oxford, U.K., 21-22 September 2015.
        Download: paper, presentation.
      5. A Tractable Generalization of Simple Temporal Networks and its relation to Mean Payoff Games. In 21st International Symposium on Temporal Representation and Reasoning (TIME 2014). Verona, Italy, September 2014.
        Download: paper, presentation, handout.
      6. Towards a Standard Approach for Optimization in Science and Engineering, In ICSOFT: 8th International Joint Conference on Software Technologies, Reykjavik, Iceland, 2013. Download: paper.
      7. Data Transformations Using QVT Between Industrial Workflows and Business Models in BPMN2, et al., In ICSEA: 7th International Conference on Software Engineering Advances, Lisbon, Portugal, 2012. Dowload: paper.
      8. Algebraic Characterization of the Class of Languages Recognized by Measure Only Quantum Automata, In 13th Italian Conference on Theoretical Computer Science (ICTCS 2012), pp. 90–93. Varese, Italy, 2012. Download: paper, presentation.

Theses:

      1. Complexity in Infinite Games on Graphs and Temporal Constraint Networks. Ph.D. Thesis in Mathematics (University of Trento, Italy) and Computer Science (Université Paris-Est Marne-la-Vallée, Paris, France). Download: manuscript.
      2. Measure Only Quantum Automata. M.Sc. Thesis in Computer Science (Tesi di Laurea Magistrale in Computer Science), University of Milano, Milano, Italy, October 2011. G.P.A. 30/30. Final: 110/110 cum Laude.
        Download (in Italian language): manuscript.
      3. Computationally Intractable Problems and some of their Applications in Cryptography. B.Sc. Thesis in Computer Science (Tesi di Laurea in Computer Science), University of Milano-Bicocca, Milano, Italy, October 2008. G.P.A. 29/30. Final: 110/110 cum Laude. Download (in Italian language): manuscript.

Citations: on google scholar.

Reviewer Service for:

    • Acta Informatica (Special Issue of CONCUR 2015)
    • The 26th International Workshop on Combinatorial Algorithms (IWOCA 2015)

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s