Skip to Main Content (Press Enter)
×
Home
Persone
Pubblicazioni
Strutture
Competenze
IT
EN
☰
UNI-FIND
|
UNI-FIND
cnr.it
IT
EN
×
Home
Persone
Pubblicazioni
Strutture
Competenze
☰
Pubblicazioni
DISCRETE APPLIED MATHEMATICS
Rivista
Codice:
E052607
ISSN:
0166-218X
Dati Generali
Dati Generali
Pubblicazioni (25)
Pulisci
Ordina Pubblicazioni:
ascendente
decrescente
"A posteriori" evaluation of bin packing approximation algorithms
Articolo
2-clique-bond of stable set polyhedra
Articolo
A branch-and-price algorithm for the Minimum Sum Coloring Problem
Articolo
A nice class for the vertex packing problem
Articolo
An Approximation Result for a Periodic Allocation Problem
Articolo
An Approximation Result for the Interval Coloring Problem on Claw-free Chordal Graphs
Articolo
An approximation result for a periodic allocation problem
Articolo
Bicolored graph partitioning, or: gerrymandering at its worst.
Articolo
Bipartite finite Toeplitz graphs
Articolo
Faster deterministic wakeup in multiple access channels
Articolo
Greedy algorithms for tracking mobile users in special mobility graphs
Articolo
On a class of functions attaining their maximum at the vertices of a polyhedron
Articolo
On computing the Galois Lattice of Bipartite Distance Hereditary graphs
Articolo
On the Galois lattice of bipartite distance hereditary graphs
Articolo
On the chromatic number of Toeplitz graphs
Articolo
On the chromatic number of Toeplitz graphs
Articolo
On the complexity of recognizing directed path families.
Articolo
On uniform $k$-partition problems
Articolo
Optimal pathway reconstruction on 3D NMR maps
Articolo
Preface: Combinatorial Optimization ISCO 2018
Curatela
Recognizing Helly Edge-Path-Tree graphs and their clique graphs.
Articolo
Solving vertex coloring problems as maximum weight stable set problems
Articolo
Stability number of bulla and chair free graphs
Articolo
The maximum vertex coverage problem on bipartite graphs
Articolo
Vertex-colouring of 3-chromatic circulant graphs
Articolo
No Results Found
«
‹
{pageNumber}
›
»
{startItem} - {endItem} di {itemsNumber}
5 per pagina
10 per pagina
30 per pagina
vedi tutti
