|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
98 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | A census of boundary cubic rooted planar maps |
Liu, Wenzhong |
2007 |
96-97 | 13 |
p. 1678-1688 11 p. |
article |
|
| 2 | A clique algorithm for standard quadratic programming |
Scozzari, Andrea |
2008 |
96-97 | 13 |
p. 2439-2448 10 p. |
article |
|
| 3 | A closed-form solution for the optimal release times for the F 2 | deteriorating jobs | ∑ w j C j problem |
Wagneur, Edouard |
2011 |
96-97 | 13 |
p. 1367-1376 10 p. |
article |
|
| 4 | A concentration bound for the longest increasing subsequence of a randomly chosen involution |
Kiwi, Marcos |
2006 |
96-97 | 13 |
p. 1816-1823 8 p. |
article |
|
| 5 | A general model for cyclic machine scheduling problems |
Brucker, Peter |
2008 |
96-97 | 13 |
p. 2561-2572 12 p. |
article |
|
| 6 | Algebraic and topological closure conditions for classes of pseudo-Boolean functions |
Foldes, Stephan |
2009 |
96-97 | 13 |
p. 2818-2827 10 p. |
article |
|
| 7 | Algorithms for clique-independent sets on subclasses of circular-arc graphs |
Durán, Guillermo |
2006 |
96-97 | 13 |
p. 1783-1790 8 p. |
article |
|
| 8 | A note on the minimum bounded edge-partition of a tree |
Dye, Shane |
2009 |
96-97 | 13 |
p. 2958-2963 6 p. |
article |
|
| 9 | Antiblocking decoding |
Kroll, Hans-Joachim |
2010 |
96-97 | 13 |
p. 1461-1464 4 p. |
article |
|
| 10 | An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree |
Hattingh, Johannes H. |
2009 |
96-97 | 13 |
p. 2846-2858 13 p. |
article |
|
| 11 | A pseudo-Boolean consensus approach to nonlinear 0–1 optimization |
Simeone, Bruno |
2008 |
96-97 | 13 |
p. 2449-2458 10 p. |
article |
|
| 12 | A sufficient condition for P k -path graphs being r-connected |
Balbuena, C. |
2007 |
96-97 | 13 |
p. 1745-1751 7 p. |
article |
|
| 13 | A survey of scheduling with controllable processing times |
Shabtay, Dvir |
2007 |
96-97 | 13 |
p. 1643-1666 24 p. |
article |
|
| 14 | Atom–bond connectivity index of trees |
Furtula, Boris |
2009 |
96-97 | 13 |
p. 2828-2835 8 p. |
article |
|
| 15 | Bipartite multigraphs with expander-like properties |
Engebretsen, Lars |
2007 |
96-97 | 13 |
p. 1667-1677 11 p. |
article |
|
| 16 | Broadcasting from multiple originators |
Liestman, Arthur L. |
2009 |
96-97 | 13 |
p. 2886-2891 6 p. |
article |
|
| 17 | Characterization of double domination subdivision number of trees |
Atapour, M. |
2007 |
96-97 | 13 |
p. 1700-1707 8 p. |
article |
|
| 18 | Characterizations of competition multigraphs |
Sano, Yoshio |
2009 |
96-97 | 13 |
p. 2978-2982 5 p. |
article |
|
| 19 | Clique-critical graphs: Maximum size and recognition |
Alcón, Liliana |
2006 |
96-97 | 13 |
p. 1799-1802 4 p. |
article |
|
| 20 | Complete catalogue of graphs of maximum degree 3 and defect at most 4 |
Miller, Mirka |
2009 |
96-97 | 13 |
p. 2983-2996 14 p. |
article |
|
| 21 | Complexity of ( p , 1 ) -total labelling |
Havet, Frédéric |
2009 |
96-97 | 13 |
p. 2859-2870 12 p. |
article |
|
| 22 | Contents |
2009 |
96-97 | 13 |
p. vii-viii nvt p. |
article |
||
| 23 | Contents |
2010 |
96-97 | 13 |
p. v- 1 p. |
article |
||
| 24 | Contents |
2006 |
96-97 | 13 |
p. vii-viii nvt p. |
article |
||
| 25 | Contents |
2007 |
96-97 | 13 |
p. vii- 1 p. |
article |
||
| 26 | Contents |
2008 |
96-97 | 13 |
p. v-vi nvt p. |
article |
||
| 27 | Contents |
2011 |
96-97 | 13 |
p. v- 1 p. |
article |
||
| 28 | Counting and enumerating aggregate classifiers |
Adem, Jan |
2008 |
96-97 | 13 |
p. 2459-2468 10 p. |
article |
|
| 29 | Covering a laminar family by leaf to leaf links |
Maduel, Yael |
2010 |
96-97 | 13 |
p. 1424-1432 9 p. |
article |
|
| 30 | Cyclic and negacyclic codes over the Galois ring GR ( p 2 , m ) |
Sobhani, R. |
2009 |
96-97 | 13 |
p. 2892-2903 12 p. |
article |
|
| 31 | Domination in a digraph and in its reverse |
Niepel, L’udovít |
2009 |
96-97 | 13 |
p. 2973-2977 5 p. |
article |
|
| 32 | Domination, radius, and minimum degree |
Henning, Michael A. |
2009 |
96-97 | 13 |
p. 2964-2968 5 p. |
article |
|
| 33 | Edge ranking and searching in partial orders |
Dereniowski, Dariusz |
2008 |
96-97 | 13 |
p. 2493-2500 8 p. |
article |
|
| 34 | Editorial Board |
2009 |
96-97 | 13 |
p. v-vi nvt p. |
article |
||
| 35 | Editorial Board |
2006 |
96-97 | 13 |
p. v-vi nvt p. |
article |
||
| 36 | Editorial Board |
2007 |
96-97 | 13 |
p. v-vi nvt p. |
article |
||
| 37 | Fast computation of Andrews’ smallest part statistic and conjectured congruences |
Garrett, K.C. |
2011 |
96-97 | 13 |
p. 1377-1380 4 p. |
article |
|
| 38 | Finding Hamiltonian circuits in quasi-adjoint graphs |
Blazewicz, Jacek |
2008 |
96-97 | 13 |
p. 2573-2580 8 p. |
article |
|
| 39 | Foreword |
de Werra, Dominique |
2008 |
96-97 | 13 |
p. 2437-2438 2 p. |
article |
|
| 40 | Free multiflows in bidirected and skew-symmetric graphs |
Babenko, Maxim A. |
2007 |
96-97 | 13 |
p. 1715-1730 16 p. |
article |
|
| 41 | Full orientability of graphs with at most one dependent arc |
Lai, Hsin-Hao |
2009 |
96-97 | 13 |
p. 2969-2972 4 p. |
article |
|
| 42 | Further mathematical properties of Cayley digraphs applied to hexagonal and honeycomb meshes |
Xiao, Wenjun |
2007 |
96-97 | 13 |
p. 1752-1760 9 p. |
article |
|
| 43 | Graph operations that are good for greedoids |
Levit, Vadim E. |
2010 |
96-97 | 13 |
p. 1418-1423 6 p. |
article |
|
| 44 | Guest Editors |
2006 |
96-97 | 13 |
p. 1773- 1 p. |
article |
||
| 45 | Guide for authors |
2006 |
96-97 | 13 |
p. I-IV nvt p. |
article |
||
| 46 | Hyper- and reverse-Wiener indices of F-sums of graphs |
Metsidik, Metrose |
2010 |
96-97 | 13 |
p. 1433-1440 8 p. |
article |
|
| 47 | Identical part production in cyclic robotic cells: Concepts, overview and open questions |
Brauner, Nadia |
2008 |
96-97 | 13 |
p. 2480-2492 13 p. |
article |
|
| 48 | Kirchhoff index of composite graphs |
Zhang, Heping |
2009 |
96-97 | 13 |
p. 2918-2927 10 p. |
article |
|
| 49 | Maximizing breaks and bounding solutions to the mirrored traveling tournament problem |
Urrutia, Sebastián |
2006 |
96-97 | 13 |
p. 1932-1938 7 p. |
article |
|
| 50 | More on “Connected (n, m)-graphs with minimum and maximum zeroth-order general Randić index” |
Pavlović, Ljiljana |
2009 |
96-97 | 13 |
p. 2938-2944 7 p. |
article |
|
| 51 | Neighborhood hypergraphs of digraphs and some matrix permutation problems |
Gurvich, Vladimir |
2009 |
96-97 | 13 |
p. 2836-2845 10 p. |
article |
|
| 52 | Network flow interdiction on planar graphs |
Zenklusen, R. |
2010 |
96-97 | 13 |
p. 1441-1455 15 p. |
article |
|
| 53 | New classes of facets of the cut polytope and tightness of I mm 22 Bell inequalities |
Avis, David |
2007 |
96-97 | 13 |
p. 1689-1699 11 p. |
article |
|
| 54 | NP-completeness results for edge modification problems |
Burzyn, Pablo |
2006 |
96-97 | 13 |
p. 1824-1844 21 p. |
article |
|
| 55 | On a certain class of nonideal clutters |
Argiroffo, Gabriela R. |
2006 |
96-97 | 13 |
p. 1854-1864 11 p. |
article |
|
| 56 | On a convex operator for finite sets |
Ćurgus, Branko |
2007 |
96-97 | 13 |
p. 1774-1792 19 p. |
article |
|
| 57 | On a problem related to the Vandermonde determinant |
Sogabe, Tomohiro |
2009 |
96-97 | 13 |
p. 2997-2999 3 p. |
article |
|
| 58 | On complexity of Minimum Leaf Out-Branching problem |
Dankelmann, Peter |
2009 |
96-97 | 13 |
p. 3000-3004 5 p. |
article |
|
| 59 | On cryptographic protocols employing asymmetric pairings — The role of Ψ revisited |
Chatterjee, Sanjit |
2011 |
96-97 | 13 |
p. 1311-1322 12 p. |
article |
|
| 60 | On disconnected cuts and separators |
Ito, Takehiro |
2011 |
96-97 | 13 |
p. 1345-1351 7 p. |
article |
|
| 61 | On fairness of D 0 L systems |
Černý, Anton |
2007 |
96-97 | 13 |
p. 1769-1773 5 p. |
article |
|
| 62 | On finding augmenting graphs |
Lozin, Vadim V. |
2008 |
96-97 | 13 |
p. 2517-2529 13 p. |
article |
|
| 63 | On graphs of defect at most 2 |
Feria-Purón, Ramiro |
2011 |
96-97 | 13 |
p. 1331-1344 14 p. |
article |
|
| 64 | On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids |
Todd, Michael J. |
2007 |
96-97 | 13 |
p. 1731-1744 14 p. |
article |
|
| 65 | Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models |
Friese, Philipp |
2006 |
96-97 | 13 |
p. 1908-1931 24 p. |
article |
|
| 66 | On maximum planar induced subgraphs |
Faria, Luerbio |
2006 |
96-97 | 13 |
p. 1774-1782 9 p. |
article |
|
| 67 | On single-machine scheduling without intermediate delays |
Chrétienne, Philippe |
2008 |
96-97 | 13 |
p. 2543-2550 8 p. |
article |
|
| 68 | On the b-chromatic number of regular graphs |
Cabello, Sergio |
2011 |
96-97 | 13 |
p. 1303-1310 8 p. |
article |
|
| 69 | On the b-continuity property of graphs |
Barth, Dominique |
2007 |
96-97 | 13 |
p. 1761-1768 8 p. |
article |
|
| 70 | On the characterization of the domination of a diameter-constrained network reliability model |
Cancela, Héctor |
2006 |
96-97 | 13 |
p. 1885-1896 12 p. |
article |
|
| 71 | On the combinatorial structure of chromatic scheduling polytopes |
Marenco, Javier |
2006 |
96-97 | 13 |
p. 1865-1876 12 p. |
article |
|
| 72 | On the commutativity of antiblocker diagrams under lift-and-project operators |
Escalante, M. |
2006 |
96-97 | 13 |
p. 1845-1853 9 p. |
article |
|
| 73 | On the complexity of paths avoiding forbidden pairs |
Kolman, Petr |
2009 |
96-97 | 13 |
p. 2871-2876 6 p. |
article |
|
| 74 | On the degree distance of a graph |
Dankelmann, P. |
2009 |
96-97 | 13 |
p. 2773-2777 5 p. |
article |
|
| 75 | On the extremal Merrifield–Simmons index and Hosoya index of quasi-tree graphs |
Li, Shuchao |
2009 |
96-97 | 13 |
p. 2877-2885 9 p. |
article |
|
| 76 | On the sum minimization version of the online bin covering problem |
Csirik, János |
2010 |
96-97 | 13 |
p. 1381-1393 13 p. |
article |
|
| 77 | On well-covered triangulations: Part II |
Finbow, Arthur S. |
2009 |
96-97 | 13 |
p. 2799-2817 19 p. |
article |
|
| 78 | Optical grooming with grooming ratio eight |
Colbourn, Charles J. |
2009 |
96-97 | 13 |
p. 2763-2772 10 p. |
article |
|
| 79 | Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable |
Du, Dingzhu |
2009 |
96-97 | 13 |
p. 2778-2784 7 p. |
article |
|
| 80 | Polarity of chordal graphs |
Ekim, Tınaz |
2008 |
96-97 | 13 |
p. 2469-2479 11 p. |
article |
|
| 81 | Reoptimization gaps versus model errors in online-dispatching of service units for ADAC |
Hiller, Benjamin |
2006 |
96-97 | 13 |
p. 1897-1907 11 p. |
article |
|
| 82 | Resource augmented semi-online bounded space bin packing |
Epstein, Leah |
2009 |
96-97 | 13 |
p. 2785-2798 14 p. |
article |
|
| 83 | Satisfiability of algebraic circuits over sets of natural numbers |
Glaßer, Christian |
2010 |
96-97 | 13 |
p. 1394-1403 10 p. |
article |
|
| 84 | Security in graphs |
Brigham, Robert C. |
2007 |
96-97 | 13 |
p. 1708-1714 7 p. |
article |
|
| 85 | Size of random Galois lattices and number of closed frequent itemsets |
Emilion, Richard |
2009 |
96-97 | 13 |
p. 2945-2957 13 p. |
article |
|
| 86 | Some basic properties of multiple Hamiltonian covers |
Fetter, Hans L. |
2006 |
96-97 | 13 |
p. 1803-1815 13 p. |
article |
|
| 87 | Some formulations for the group steiner tree problem |
Ferreira, Carlos E. |
2006 |
96-97 | 13 |
p. 1877-1884 8 p. |
article |
|
| 88 | Some inequalities for the atom-bond connectivity index of graph operations |
Fath-Tabar, G.H. |
2011 |
96-97 | 13 |
p. 1323-1330 8 p. |
article |
|
| 89 | The competition number of a graph whose holes do not overlap much |
Kim, Suh-Ryung |
2010 |
96-97 | 13 |
p. 1456-1460 5 p. |
article |
|
| 90 | The complexity of dissociation set problems in graphs |
Orlovich, Yury |
2011 |
96-97 | 13 |
p. 1352-1366 15 p. |
article |
|
| 91 | The 0–1 inverse maximum stable set problem |
Chung, Yerim |
2008 |
96-97 | 13 |
p. 2501-2516 16 p. |
article |
|
| 92 | The mathematical solution of a cellular automaton model which simulates traffic flow with a slow-to-start effect |
Tian, Ran |
2009 |
96-97 | 13 |
p. 2904-2917 14 p. |
article |
|
| 93 | The minimum reload s – t path, trail and walk problems |
Gourvès, Laurent |
2010 |
96-97 | 13 |
p. 1404-1417 14 p. |
article |
|
| 94 | The sandwich problem for cutsets: Clique cutset, k -star cutset |
Teixeira, Rafael B. |
2006 |
96-97 | 13 |
p. 1791-1798 8 p. |
article |
|
| 95 | The signless Laplacian spectral radius of graphs with given degree sequences |
Zhang, Xiao-Dong |
2009 |
96-97 | 13 |
p. 2928-2937 10 p. |
article |
|
| 96 | Traces of the Latin American Conference on Combinatorics, Graphs and Applications |
Durán, Guillermo |
2006 |
96-97 | 13 |
p. 1771-1772 2 p. |
article |
|
| 97 | Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number |
Aouchiche, Mustapha |
2008 |
96-97 | 13 |
p. 2530-2542 13 p. |
article |
|
| 98 | Variable space search for graph coloring |
Hertz, Alain |
2008 |
96-97 | 13 |
p. 2551-2560 10 p. |
article |
98 results found