Skip to Main Content (Press Enter)
×
Home
Corsi
Insegnamenti
Persone
Pubblicazioni
Strutture
Terza Missione
Attività
Competenze
IT
EN
☰
UNI-FIND
|
UNI-FIND
unibg.it
IT
EN
×
Home
Corsi
Insegnamenti
Persone
Pubblicazioni
Strutture
Terza Missione
Attività
Competenze
☰
Pubblicazioni
THEORETICAL COMPUTER SCIENCE
Rivista
Codice:
E167142
ISSN:
0304-3975
Dati Generali
Dati Generali
Pubblicazioni (19)
Pulisci
Ordina Pubblicazioni:
ascendente
decrescente
A randomized PTAS for the minimum Consensus Clustering with a fixed number of clusters
Articolo
A theory of implementation and refinement in timed Petri nets
Articolo
An operational quantum information framework for experimental studies on color perception
Articolo
Comparing incomplete sequences via longest common subsequence
Articolo
Complexity insights of the Minimum Duplication problem
Articolo
Corrigendum to “Parameterized tractability of the maximum-duo preservation string mapping problem” [Theoret. Comput. Sci. 646 (2016) 16–25]
Articolo
Editorial [to Theoretical computer Science, vol. 717]
Articolo
Finding approximate and constrained motifs in graphs
Articolo
Fixed-parameter algorithms for scaffold filling
Articolo
MUL-tree pruning for consistency and optimal reconciliation - complexity and algorithms
Articolo
On the complexity of temporal arborescence reconfiguration
Articolo
On the tractability of finding disjoint clubs in a network
Articolo
Parameterized complexity and approximation issues for the colorful components problems
Articolo
Parameterized tractability of the maximum-duo preservation string mapping problem
Articolo
Quantum structures in qudit spaces
Articolo
The binary perfect phylogeny with persistent characters
Articolo
The l-Diversity problem: tractability and approximability
Articolo
Turing video-based cognitive tests to handle entangled concepts
Articolo
Untangling temporal graphs of bounded degree
Articolo
No Results Found
«
‹
{pageNumber}
›
»
{startItem} - {endItem} di {itemsNumber}
5 per pagina
10 per pagina
30 per pagina
vedi tutti
