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
 
                             29 results found
no title author magazine year volume issue page(s) type
1 A branch-and-cut-and-price approach for the capacitated m -ring–star problem Hoshino, Edna A.
2012
160 18 p. 2728-2741
14 p.
article
2 A note on permutation regularity Hoppen, Carlos
2012
160 18 p. 2716-2727
12 p.
article
3 A polyhedral study of the acyclic coloring problem Braga, Mónica
2012
160 18 p. 2606-2617
12 p.
article
4 A polyhedral study of the maximum edge subgraph problem Bonomo, Flavia
2012
160 18 p. 2573-2590
18 p.
article
5 A set partitioning approach to shunting Cardonha, Carlos
2012
160 18 p. 2636-2644
9 p.
article
6 b -coloring of tight graphs Havet, Frédéric
2012
160 18 p. 2709-2715
7 p.
article
7 Boltzmann samplers for first-order differential specifications Bodini, Olivier
2012
160 18 p. 2563-2572
10 p.
article
8 Computing the Laplacian spectra of some graphs Cardoso, Domingos M.
2012
160 18 p. 2645-2654
10 p.
article
9 Contents 2012
160 18 p. v-vi
nvt p.
article
10 Distance-hereditary comparability graphs Di Stefano, Gabriele
2012
160 18 p. 2669-2680
12 p.
article
11 Enumeration and asymptotics of restricted compositions having the same number of parts Banderier, Cyril
2012
160 18 p. 2542-2554
13 p.
article
12 Good edge-labelling of graphs Araujo, J.
2012
160 18 p. 2502-2513
12 p.
article
13 Graph transformations preserving the stability number Lévêque, Benjamin
2012
160 18 p. 2752-2759
8 p.
article
14 Hardness results on the gapped consecutive-ones property problem Maňuch, Ján
2012
160 18 p. 2760-2768
9 p.
article
15 2 K 2 -partition of some classes of graphs Dantas, Simone
2012
160 18 p. 2662-2668
7 p.
article
16 Lift-and-project ranks of the set covering polytope of circulant matrices Bianchi, Silvia M.
2012
160 18 p. 2555-2562
8 p.
article
17 Minimal separators in extended P 4 -laden graphs Pedrotti, Vagner
2012
160 18 p. 2769-2777
9 p.
article
18 Models for fare planning in public transport Borndörfer, Ralf
2012
160 18 p. 2591-2605
15 p.
article
19 On edge-sets of bicliques in graphs Groshaus, Marina
2012
160 18 p. 2698-2708
11 p.
article
20 On L ( 2 , 1 ) -coloring split, chordal bipartite, and weakly chordal graphs Cerioli, Márcia R.
2012
160 18 p. 2655-2661
7 p.
article
21 On minimal vertex separators of dually chordal graphs: Properties and characterizations De Caria, Pablo
2012
160 18 p. 2627-2635
9 p.
article
22 On the Grundy number of graphs with few P 4 ’s Araujo, J.
2012
160 18 p. 2514-2522
9 p.
article
23 On the metric dimension of infinite graphs Cáceres, J.
2012
160 18 p. 2618-2626
9 p.
article
24 The basis graph of a bicolored matroid Figueroa, Ana Paulina
2012
160 18 p. 2694-2697
4 p.
article
25 The maximum common edge subgraph problem: A polyhedral investigation Bahiense, Laura
2012
160 18 p. 2523-2541
19 p.
article
26 The P versus NP–complete dichotomy of some challenging problems in graph theory de Figueiredo, Celina M.H.
2012
160 18 p. 2681-2693
13 p.
article
27 Towards a comprehensive theory of conflict–tolerance graphs Jamison, Robert E.
2012
160 18 p. 2742-2751
10 p.
article
28 V Latin-American Algorithms, Graphs, and Optimization Symposium — Gramado, Brazil, 2009 Ferreira, Carlos Eduardo
2012
160 18 p. 2499-2501
3 p.
article
29 Wirelength of hypercubes into certain trees Rajasingh, Indra
2012
160 18 p. 2778-2786
9 p.
article
                             29 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands