|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
54 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | Advances in packing directed joins |
Williams, Aaron Michael |
2005 |
19 | C |
p. 249-255 7 p. |
article |
|
| 2 | A forbidden subgraph characterization of path graphs |
Tondato, Silvia B. |
2005 |
19 | C |
p. 281-287 7 p. |
article |
|
| 3 | A general approach to L(h, k)-label interconnection networks |
Calamoneri, Tiziana |
2005 |
19 | C |
p. 211-217 7 p. |
article |
|
| 4 | A Gray code for binary subtraction |
Sawada, Joe |
2005 |
19 | C |
p. 125-131 7 p. |
article |
|
| 5 | Algorithms for the degree-constrained minimum spanning tree problem |
da Cunha, Alexandre Salles |
2005 |
19 | C |
p. 403-409 7 p. |
article |
|
| 6 | Alignment with non-overlapping inversions in O ( n 3 log n ) -time |
Alves, Carlos E.R. |
2005 |
19 | C |
p. 365-371 7 p. |
article |
|
| 7 | A multistart constructive heuristic for sequencing by hybridization using adaptive memory |
Fernandes, Eraldo L.R. |
2005 |
19 | C |
p. 41-47 7 p. |
article |
|
| 8 | An all-substrings common subsequence algorithm |
Alves, C.E.R. |
2005 |
19 | C |
p. 133-139 7 p. |
article |
|
| 9 | A new family of K-divergent graphs |
Matamala, Martín |
2005 |
19 | C |
p. 357-363 7 p. |
article |
|
| 10 | A new refinement procedure for graph isomorphism algorithms |
de Oliveira Oliveira, Mateus |
2005 |
19 | C |
p. 373-379 7 p. |
article |
|
| 11 | A one-dimensional bin packing problem with shelf divisions |
Xavier, E.C. |
2005 |
19 | C |
p. 329-335 7 p. |
article |
|
| 12 | Between coloring and list-coloring: μ-coloring |
Bonomo, Flavia |
2005 |
19 | C |
p. 117-123 7 p. |
article |
|
| 13 | Building PQR trees in almost-linear time |
Telles, Guilherme P. |
2005 |
19 | C |
p. 33-39 7 p. |
article |
|
| 14 | Computing the integrality gap of the asymmetric travelling salesman problem |
Boyd, Sylvia |
2005 |
19 | C |
p. 241-247 7 p. |
article |
|
| 15 | Degree constrained subgraphs |
Addario-Berry, L. |
2005 |
19 | C |
p. 257-263 7 p. |
article |
|
| 16 | Detecting flows congesting a target network link |
Barth, D. |
2005 |
19 | C |
p. 233-239 7 p. |
article |
|
| 17 | Faster algorithms for feedback vertex set |
Raman, Venkatesh |
2005 |
19 | C |
p. 273-279 7 p. |
article |
|
| 18 | Forbidden subgraph characterization of split graphs that are UEH |
Cerioli, M.R. |
2005 |
19 | C |
p. 305-311 7 p. |
article |
|
| 19 | Fractionally total colouring G n , p |
Meagher, Conor |
2005 |
19 | C |
p. 297-303 7 p. |
article |
|
| 20 | Generating all the cubic graphs that have a 6-cycle double cover |
Leão, Rodrigo S.C. |
2005 |
19 | C |
p. 87-93 7 p. |
article |
|
| 21 | Globally bounded local edge colourings of hypergraphs |
Schacht, Mathias |
2005 |
19 | C |
p. 179-185 7 p. |
article |
|
| 22 | Improved bounds on acyclic edge colouring |
Muthu, Rahul |
2005 |
19 | C |
p. 171-177 7 p. |
article |
|
| 23 | Large k-independent sets of regular graphs |
Beis, Mihalis |
2005 |
19 | C |
p. 321-327 7 p. |
article |
|
| 24 | Lehman's equation on near-ideal clutters |
Argiroffo, G. |
2005 |
19 | C |
p. 219-224 6 p. |
article |
|
| 25 | Local cutpoints and iterated clique graphs |
Frías-Armenta, M.E. |
2005 |
19 | C |
p. 345-349 5 p. |
article |
|
| 26 | Non loop graphs with induced cycles |
Alcón, Liliana |
2005 |
19 | C |
p. 289-295 7 p. |
article |
|
| 27 | Non-separating cocircuits in matroids |
Lemos, Manoel |
2005 |
19 | C |
p. 149-153 5 p. |
article |
|
| 28 | On bags and bugs |
Hansen, Pierre |
2005 |
19 | C |
p. 111-116 6 p. |
article |
|
| 29 | On hereditary Helly self-clique graphs |
Larrión, F. |
2005 |
19 | C |
p. 351-356 6 p. |
article |
|
| 30 | On some applications of randomized memory |
Grolmusz, Vince |
2005 |
19 | C |
p. 203-209 7 p. |
article |
|
| 31 | On the asymmetric representatives formulation for the vertex coloring problem |
Campêlo, Manoel |
2005 |
19 | C |
p. 337-343 7 p. |
article |
|
| 32 | On the computational complexity of partial covers of Theta graphs |
Fiala, Jiří |
2005 |
19 | C |
p. 79-85 7 p. |
article |
|
| 33 | On the Hadwiger number of hypercubes and its generalizations |
Chandran, L. Sunil |
2005 |
19 | C |
p. 155-161 7 p. |
article |
|
| 34 | On the local splitting theorem |
Szigeti, Zoltán |
2005 |
19 | C |
p. 57-61 5 p. |
article |
|
| 35 | Optimal flow distribution among multiple channels with unknown capacities |
Karp, Richard |
2005 |
19 | C |
p. 225-231 7 p. |
article |
|
| 36 | Partial characterizations of clique-perfect graphs |
Bonomo, Flavia |
2005 |
19 | C |
p. 95-101 7 p. |
article |
|
| 37 | Perfect subgraph/supergraph |
da Silva, Murilo V.G. |
2005 |
19 | C |
p. 411-416 6 p. |
article |
|
| 38 | (p, k)-coloring problems in line graphs |
Demange, Marc |
2005 |
19 | C |
p. 49-55 7 p. |
article |
|
| 39 | Planar graph bipartization in linear time |
Fiorini, Samuel |
2005 |
19 | C |
p. 265-271 7 p. |
article |
|
| 40 | Preface |
Feofiloff, Paulo |
2005 |
19 | C |
p. 1-7 7 p. |
article |
|
| 41 | Probe interval bigraphs |
Chang, Gerard Jennhwa |
2005 |
19 | C |
p. 195-201 7 p. |
article |
|
| 42 | Randomized mechanisms for limited supply multi-item auctions |
Bornstein, Claudson F. |
2005 |
19 | C |
p. 141-147 7 p. |
article |
|
| 43 | Searching for geodetic boundary vertex sets |
Cáceres, J. |
2005 |
19 | C |
p. 25-31 7 p. |
article |
|
| 44 | Search locally to arrange cyclically |
Ganapathy, Murali K. |
2005 |
19 | C |
p. 187-193 7 p. |
article |
|
| 45 | Stabilized branch-and-cut-and-price for the generalized assignment problem |
Pigatti, Alexandre |
2005 |
19 | C |
p. 389-395 7 p. |
article |
|
| 46 | The 3-colored Ramsey number of odd cycles |
Kohayakawa, Yoshiharu |
2005 |
19 | C |
p. 397-402 6 p. |
article |
|
| 47 | The combinatorial stages of chromatic scheduling polytopes |
Marenco, Javier |
2005 |
19 | C |
p. 63-69 7 p. |
article |
|
| 48 | The distribution of the path edge-covering numbers for random trees |
Panholzer, Alois |
2005 |
19 | C |
p. 163-169 7 p. |
article |
|
| 49 | The Helly property on subhypergraphs |
Dourado, Mitre C. |
2005 |
19 | C |
p. 71-77 7 p. |
article |
|
| 50 | The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation |
Baïou, Mourad |
2005 |
19 | C |
p. 103-109 7 p. |
article |
|
| 51 | Three classes of minimal circular-imperfect graphs |
Pêcher, Arnaud |
2005 |
19 | C |
p. 9-15 7 p. |
article |
|
| 52 | Two- and three-dimensional parametric packing |
Miyazawa, F.K. |
2005 |
19 | C |
p. 313-319 7 p. |
article |
|
| 53 | Two aspects of the pallet loading problem |
Mascarenhas, Walter F. |
2005 |
19 | C |
p. 381-387 7 p. |
article |
|
| 54 | Upper bound on the non-colorability threshold of the 2+p-COL problem |
Cruz, Roberto |
2005 |
19 | C |
p. 17-23 7 p. |
article |
54 results found