default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCarlo Comin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j7]Carlo Comin, Anthony Labarre, Romeo Rizzi, Stéphane Vialette:
Sorting with forbidden intermediates. Discret. Appl. Math. 279: 49-68 (2020)- [j6]Massimo Cairo, Carlo Comin, Romeo Rizzi:
Instantaneous reaction-time in dynamic consistency checking of conditional simple temporal networks. J. Log. Algebraic Methods Program. 113: 100542 (2020)
2010 – 2019
- 2018
- [j5]Carlo Comin
, Romeo Rizzi:
An Improved Upper Bound on Maximal Clique Listing via Rectangular Fast Matrix Multiplication. Algorithmica 80(12): 3525-3562 (2018) - [j4]Carlo Comin, Romeo Rizzi:
Checking dynamic consistency of conditional hyper temporal networks via mean payoff games: Hardness and (pseudo) singly-exponential time algorithm. Inf. Comput. 259(3): 348-374 (2018) - [c7]Carlo Comin, Romeo Rizzi:
On Restricted Disjunctive Temporal Problems: Faster Algorithms and Tractability Frontier. TIME 2018: 10:1-10:20 - [i13]Carlo Comin, Romeo Rizzi:
On Restricted Disjunctive Temporal Problems: Faster Algorithms and Tractability Frontier. CoRR abs/1805.02183 (2018) - 2017
- [b1]Carlo Comin:
Complexity in Infinite Games on Graphs and Temporal Constraint Networks. (Complexité dans les Jeux Infinis sur les Graphes et les Réseaux de Contraintes Temporelles). University of Paris-Est, France, 2017 - [j3]Carlo Comin, Romeo Rizzi:
Improved Pseudo-polynomial Bound for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games. Algorithmica 77(4): 995-1021 (2017) - [j2]Carlo Comin, Roberto Posenato, Romeo Rizzi:
Hyper temporal networks - A tractable generalization of simple temporal networks and its relation to mean payoff games. Constraints An Int. J. 22(2): 152-190 (2017) - [c6]Massimo Cairo, Carlo Combi, Carlo Comin, Luke Hunsberger, Roberto Posenato, Romeo Rizzi, Matteo Zavatteri:
Incorporating Decision Nodes into Conditional Simple Temporal Networks. TIME 2017: 9:1-9:18 - 2016
- [c5]Carlo Comin, Anthony Labarre, Romeo Rizzi, Stéphane Vialette:
Sorting with Forbidden Intermediates. AlCoB 2016: 133-144 - [c4]Massimo Cairo, Carlo Comin, Romeo Rizzi:
Instantaneous Reaction-Time in Dynamic-Consistency Checking of Conditional Simple Temporal Networks. TIME 2016: 80-89 - [i12]Carlo Comin, Romeo Rizzi:
Checking Dynamic Consistency of Conditional Hyper Temporal Networks via Mean Payoff Games (Hardness and (pseudo) Singly-Exponential Time Algorithm). CoRR abs/1602.06260 (2016) - [i11]Carlo Comin, Anthony Labarre, Romeo Rizzi, Stéphane Vialette:
Sorting With Forbidden Intermediates. CoRR abs/1602.06283 (2016) - [i10]Massimo Cairo, Carlo Comin, Romeo Rizzi:
Instantaneous Reaction-Time in Dynamic-Consistency Checking of Conditional Simple Temporal Networks. CoRR abs/1608.04132 (2016) - [i9]Carlo Comin, Romeo Rizzi:
Faster O(|V|^2|E|W)-Time Energy Algorithms for Optimal Strategy Synthesis in Mean Payoff Games. CoRR abs/1609.01517 (2016) - [i8]Carlo Comin, Romeo Rizzi:
Alternating DFS and Strongly Connected Components (Linear time algorithms with applications to infinite pebble games). CoRR abs/1610.09679 (2016) - 2015
- [c3]Carlo Comin, Romeo Rizzi:
Dynamic Consistency of Conditional Simple Temporal Networks via Mean Payoff Games: A Singly-Exponential Time DC-checking. TIME 2015: 19-28 - [i7]Carlo Comin, Roberto Posenato, Romeo Rizzi:
Hyper Temporal Networks. CoRR abs/1503.03974 (2015) - [i6]Carlo Comin, Romeo Rizzi:
An Improved Pseudo-Polynomial Upper Bound for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games. CoRR abs/1503.04426 (2015) - [i5]Carlo Comin, Romeo Rizzi:
Dynamic Consistency of Conditional Simple Temporal Networks via Mean Payoff Games: a Singly-Exponential Time DC-Checking. CoRR abs/1505.00828 (2015) - [i4]Carlo Comin, Romeo Rizzi:
An Improved Upper Bound on Maximal Clique Listing via Rectangular Fast Matrix Multiplication. CoRR abs/1506.01082 (2015) - [i3]Carlo Comin:
Energy Structure of Optimal Positional Strategies in Mean Payoff Games. CoRR abs/1508.02440 (2015) - 2014
- [j1]Carlo Comin:
Algebraic Characterization of the Class of Languages Recognized by Measure Only Quantum Automata. Fundam. Informaticae 134(3-4): 335-353 (2014) - [c2]Carlo Comin, Roberto Posenato, Romeo Rizzi:
A Tractable Generalization of Simple Temporal Networks and Its Relation to Mean Payoff Games. TIME 2014: 7-16 - 2013
- [c1]Carlo Comin, Luka Onesti, Carlos Kavka:
Towards a Standard Approach for Optimization in Science and Engineering. ICSOFT 2013: 169-177 - [i2]Carlo Comin:
(Extended Version) Algebraic Characterization of the Class of Languages recognized by Measure Only Quantum Automata. CoRR abs/1301.3931 (2013) - 2012
- [i1]Carlo Comin, Maria Paola Bianchi:
Algebraic Characterization of the Class of Languages recognized by Measure Only Quantum Automata. CoRR abs/1206.1702 (2012)
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:58 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:
