Digital Library
Close Browse articles from a journal
     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
                                       All articles of the corresponding issues
 
                             13 results found
no title author magazine year volume issue page(s) type
1 Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes Foucaud, Florent
2015
31 C p. 48-68
21 p.
article
2 Editorial Lecroq, Thierry
2015
31 C p. 1-
1 p.
article
3 Editorial Board 2015
31 C p. iii-
1 p.
article
4 Maximum spectral radius of graphs with given connectivity, minimum degree and independence number Lu, Hongliang
2015
31 C p. 113-119
7 p.
article
5 On the hardness of maximum rank aggregation problems Bachmaier, Christian
2015
31 C p. 2-13
12 p.
article
6 On the maximum independent set problem in subclasses of subcubic graphs Lozin, Vadim
2015
31 C p. 104-112
9 p.
article
7 Partial Information Network Queries Pinter, Ron Y.
2015
31 C p. 129-145
17 p.
article
8 Phase transition of random non-uniform hypergraphs de Panafieu, Élie
2015
31 C p. 26-39
14 p.
article
9 SAT and IP based algorithms for magic labeling including a complete search for total magic labelings Jäger, Gerold
2015
31 C p. 87-103
17 p.
article
10 String shuffle: Circuits and graphs Mhaskar, Neerja
2015
31 C p. 120-128
9 p.
article
11 Structural properties of subdivided-line graphs Hasunuma, Toru
2015
31 C p. 69-86
18 p.
article
12 The incidence game chromatic number of ( a , d ) -decomposable graphs Charpentier, C.
2015
31 C p. 14-25
12 p.
article
13 The shortest path problem in the Knödel graph Grigoryan, Hayk
2015
31 C p. 40-47
8 p.
article
                             13 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands