|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
123 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | Achievable sets, brambles, and sparse treewidth obstructions |
Lucena, Brian |
2007 |
96-97 | 8 |
p. 1055-1065 11 p. |
article |
|
| 2 | A direct barter model for course add/drop process |
Özer, Ali Haydar |
2011 |
96-97 | 8 |
p. 812-825 14 p. |
article |
|
| 3 | Algorithms for media |
Eppstein, David |
2008 |
96-97 | 8 |
p. 1308-1320 13 p. |
article |
|
| 4 | A linear algorithm for minimum 1-identifying codes in oriented trees |
Charon, Irène |
2006 |
96-97 | 8 |
p. 1246-1253 8 p. |
article |
|
| 5 | A new characterization of group action-based perfect nonlinearity |
Poinsot, Laurent |
2009 |
96-97 | 8 |
p. 1848-1857 10 p. |
article |
|
| 6 | An implicit representation of chordal comparability graphs in linear time |
Curtis, Andrew R. |
2010 |
96-97 | 8 |
p. 869-875 7 p. |
article |
|
| 7 | A note on the hardness of Skolem-type sequences |
Nordh, Gustav |
2010 |
96-97 | 8 |
p. 964-966 3 p. |
article |
|
| 8 | An s – t connection problem with adaptability |
Adjiashvili, David |
2011 |
96-97 | 8 |
p. 695-705 11 p. |
article |
|
| 9 | Approximating minimum-power edge-covers and 2 , 3 -connectivity |
Kortsarz, Guy |
2009 |
96-97 | 8 |
p. 1840-1847 8 p. |
article |
|
| 10 | A simple algorithm for multicuts in planar graphs with outer terminals |
Bentz, Cédric |
2009 |
96-97 | 8 |
p. 1959-1964 6 p. |
article |
|
| 11 | A sufficient connectivity condition for generic rigidity in the plane |
Jackson, Bill |
2009 |
96-97 | 8 |
p. 1965-1968 4 p. |
article |
|
| 12 | A tight bound on the number of mobile servers to guarantee transferability among dominating configurations |
Fujita, Satoshi |
2010 |
96-97 | 8 |
p. 913-920 8 p. |
article |
|
| 13 | Best semi-online algorithms for unbounded parallel batch scheduling |
Yuan, Jinjiang |
2011 |
96-97 | 8 |
p. 838-847 10 p. |
article |
|
| 14 | Binary clustering |
Barthélemy, Jean-Pierre |
2008 |
96-97 | 8 |
p. 1237-1250 14 p. |
article |
|
| 15 | Bounding the feedback vertex number of digraphs in terms of vertex degrees |
Gruber, Hermann |
2011 |
96-97 | 8 |
p. 872-875 4 p. |
article |
|
| 16 | Bounds on the locating-total domination number of a tree |
Chen, Xue-gang |
2011 |
96-97 | 8 |
p. 769-773 5 p. |
article |
|
| 17 | Characterization of P 6 -free graphs |
Liu, Jiping |
2007 |
96-97 | 8 |
p. 1038-1043 6 p. |
article |
|
| 18 | Circular mixed hypergraphs II:The upper chromatic number |
Voloshin, Vitaly |
2006 |
96-97 | 8 |
p. 1157-1172 16 p. |
article |
|
| 19 | Cluster structures and collections of Galois closed entity subsets |
Benayade, Mohammed |
2008 |
96-97 | 8 |
p. 1295-1307 13 p. |
article |
|
| 20 | Collision-free path coloring with application to minimum-delay gathering in sensor networks |
Gargano, Luisa |
2009 |
96-97 | 8 |
p. 1858-1872 15 p. |
article |
|
| 21 | Combinatorial constructions of fault-tolerant routings with levelled minimum optical indices |
Zhang, Xiande |
2010 |
96-97 | 8 |
p. 951-963 13 p. |
article |
|
| 22 | Comparing bacterial genomes from linear orders of patterns |
Guyon, Frédéric |
2008 |
96-97 | 8 |
p. 1251-1262 12 p. |
article |
|
| 23 | Computing the minimum number of hybridization events for a consistent evolutionary history |
Bordewich, Magnus |
2007 |
96-97 | 8 |
p. 914-928 15 p. |
article |
|
| 24 | Connected ( n , m ) -graphs with minimum and maximum zeroth-order general Randić index |
Hu, Yumei |
2007 |
96-97 | 8 |
p. 1044-1054 11 p. |
article |
|
| 25 | Constrained k -center and movement to independence |
Dumitrescu, Adrian |
2011 |
96-97 | 8 |
p. 859-865 7 p. |
article |
|
| 26 | Contact information for Guest Editors of OSDA Janowitz |
2008 |
96-97 | 8 |
p. 1182- 1 p. |
article |
||
| 27 | Contents |
2009 |
96-97 | 8 |
p. vii-viii nvt p. |
article |
||
| 28 | Contents |
2010 |
96-97 | 8 |
p. v- 1 p. |
article |
||
| 29 | Contents |
2006 |
96-97 | 8 |
p. vii-viii nvt p. |
article |
||
| 30 | Contents |
2007 |
96-97 | 8 |
p. vii-viii nvt p. |
article |
||
| 31 | Contents |
2008 |
96-97 | 8 |
p. v-vi nvt p. |
article |
||
| 32 | Contents |
2011 |
96-97 | 8 |
p. v-vi nvt p. |
article |
||
| 33 | Degree distance of unicyclic and bicyclic graphs |
Ilić, Aleksandar |
2011 |
96-97 | 8 |
p. 779-788 10 p. |
article |
|
| 34 | Disjoint congruence classes and a timetabling application |
Dahl, Geir |
2009 |
96-97 | 8 |
p. 1702-1710 9 p. |
article |
|
| 35 | Distance-two labelings of digraphs |
Chang, Gerard J. |
2007 |
96-97 | 8 |
p. 1007-1013 7 p. |
article |
|
| 36 | Distance-two labellings of Hamming graphs |
Chang, Gerard J. |
2009 |
96-97 | 8 |
p. 1896-1904 9 p. |
article |
|
| 37 | Edge ranking of weighted trees |
Dereniowski, Dariusz |
2006 |
96-97 | 8 |
p. 1198-1209 12 p. |
article |
|
| 38 | Edge-rooted forests and the α -invariant of cone graphs |
Kook, W. |
2007 |
96-97 | 8 |
p. 1071-1075 5 p. |
article |
|
| 39 | Edge searching weighted graphs |
Yaşar, Öznur |
2009 |
96-97 | 8 |
p. 1913-1923 11 p. |
article |
|
| 40 | Editorial Board |
2009 |
96-97 | 8 |
p. v-vi nvt p. |
article |
||
| 41 | Editorial Board |
2006 |
96-97 | 8 |
p. v-vi nvt p. |
article |
||
| 42 | Editorial Board |
2007 |
96-97 | 8 |
p. v-vi nvt p. |
article |
||
| 43 | Efficient algorithms for decomposing graphs under degree constraints |
Bazgan, Cristina |
2007 |
96-97 | 8 |
p. 979-988 10 p. |
article |
|
| 44 | Embedding processes in combinatorial game theory |
dos Santos, Carlos Pereira |
2011 |
96-97 | 8 |
p. 675-682 8 p. |
article |
|
| 45 | Equivalence-free exhaustive generation of matroid representations |
Hliněný, Petr |
2006 |
96-97 | 8 |
p. 1210-1222 13 p. |
article |
|
| 46 | 2-extendability and k -resonance of non-bipartite Klein-bottle polyhexes |
Li, Qiuli |
2011 |
96-97 | 8 |
p. 800-811 12 p. |
article |
|
| 47 | Faster deterministic wakeup in multiple access channels |
De Marco, Gianluca |
2007 |
96-97 | 8 |
p. 898-903 6 p. |
article |
|
| 48 | Finding large cycles in Hamiltonian graphs |
Feder, Tomás |
2010 |
96-97 | 8 |
p. 882-893 12 p. |
article |
|
| 49 | Fractional weak discrepancy and interval orders |
Shuchat, Alan |
2009 |
96-97 | 8 |
p. 1873-1884 12 p. |
article |
|
| 50 | Further combinatorial identities deriving from the nth power of a 2 × 2 matrix |
Mc Laughlin, James |
2006 |
96-97 | 8 |
p. 1301-1308 8 p. |
article |
|
| 51 | Generalization of matching extensions in graphs (III) |
Bai, Bing |
2011 |
96-97 | 8 |
p. 727-732 6 p. |
article |
|
| 52 | Generalized hyper-bent functions over GF ( p ) |
Youssef, A.M. |
2007 |
96-97 | 8 |
p. 1066-1070 5 p. |
article |
|
| 53 | Global defensive alliances in star graphs |
Hsu, Cheng-Ju |
2009 |
96-97 | 8 |
p. 1924-1931 8 p. |
article |
|
| 54 | Graph splicing systems |
Santhanam, Rahul |
2006 |
96-97 | 8 |
p. 1264-1278 15 p. |
article |
|
| 55 | Guide for authors |
2006 |
96-97 | 8 |
p. I-IV nvt p. |
article |
||
| 56 | Horse paths, restricted 132-avoiding permutations, continued fractions, and Chebyshev polynomials |
Hou, Qing-Hu |
2006 |
96-97 | 8 |
p. 1183-1197 15 p. |
article |
|
| 57 | Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches |
Lin, Jyh-Jye |
2010 |
96-97 | 8 |
p. 932-942 11 p. |
article |
|
| 58 | Improved bounds for acyclic chromatic index of planar graphs |
Hou, Jianfeng |
2011 |
96-97 | 8 |
p. 876-881 6 p. |
article |
|
| 59 | Independence polynomials of k-tree related graphs |
Song, Lanzhen |
2010 |
96-97 | 8 |
p. 943-950 8 p. |
article |
|
| 60 | Independent sets in bounded-degree hypergraphs |
Halldórsson, Magnús M. |
2009 |
96-97 | 8 |
p. 1773-1786 14 p. |
article |
|
| 61 | Integrated production and delivery scheduling with disjoint windows |
Huo, Yumei |
2010 |
96-97 | 8 |
p. 921-931 11 p. |
article |
|
| 62 | Introduction to partially ordered patterns |
Kitaev, Sergey |
2007 |
96-97 | 8 |
p. 929-944 16 p. |
article |
|
| 63 | Labeling bipartite permutation graphs with a condition at distance two |
Araki, Toru |
2009 |
96-97 | 8 |
p. 1677-1686 10 p. |
article |
|
| 64 | LDPC codes from Singer cycles |
Giuzzi, Luca |
2009 |
96-97 | 8 |
p. 1723-1728 6 p. |
article |
|
| 65 | Local condition for planar graphs of maximum degree 7 to be 8-totally colorable |
Chang, Gerard Jennhwa |
2011 |
96-97 | 8 |
p. 760-768 9 p. |
article |
|
| 66 | Locating and total dominating sets in trees |
Haynes, Teresa W. |
2006 |
96-97 | 8 |
p. 1293-1300 8 p. |
article |
|
| 67 | L ( p , q ) -labeling of digraphs |
Chen, Yi-Ting |
2009 |
96-97 | 8 |
p. 1750-1759 10 p. |
article |
|
| 68 | Media theory: Representations and examples |
Ovchinnikov, Sergei |
2008 |
96-97 | 8 |
p. 1197-1219 23 p. |
article |
|
| 69 | Minmax subtree cover problem on cacti |
Nagamochi, Hiroshi |
2006 |
96-97 | 8 |
p. 1254-1263 10 p. |
article |
|
| 70 | Necessary conditions for the existence of two classes of ZCPS-Wh( v ) |
Abel, R. Julian R. |
2011 |
96-97 | 8 |
p. 848-851 4 p. |
article |
|
| 71 | New permutation statistics: Variation and a variant |
Mansour, Toufik |
2009 |
96-97 | 8 |
p. 1974-1978 5 p. |
article |
|
| 72 | Nonexistence of near-extremal formally self-dual even codes of length divisible by 8 |
Han, Sunghyu |
2007 |
96-97 | 8 |
p. 1031-1037 7 p. |
article |
|
| 73 | Norm statistics and the complexity of clustering problems |
Novick, Beth |
2009 |
96-97 | 8 |
p. 1831-1839 9 p. |
article |
|
| 74 | Note on the m-step competition numbers of paths and cycles |
Zhao, Yongqiang |
2009 |
96-97 | 8 |
p. 1953-1958 6 p. |
article |
|
| 75 | Occurrence of structured motifs in random sequences: Arbitrary number of boxes |
Stefanov, Valeri T. |
2011 |
96-97 | 8 |
p. 826-831 6 p. |
article |
|
| 76 | On a conjecture of the Randić index |
You, Zhifu |
2009 |
96-97 | 8 |
p. 1766-1772 7 p. |
article |
|
| 77 | On a labeling problem in graphs |
Chandrasekaran, R. |
2011 |
96-97 | 8 |
p. 746-759 14 p. |
article |
|
| 78 | On b -colorings in regular graphs |
Blidia, Mostafa |
2009 |
96-97 | 8 |
p. 1787-1793 7 p. |
article |
|
| 79 | On CCE graphs of doubly partial orders |
Kim, Seog-Jin |
2007 |
96-97 | 8 |
p. 971-978 8 p. |
article |
|
| 80 | On explicit formulas for bandwidth and antibandwidth of hypercubes |
Wang, Xiaohan |
2009 |
96-97 | 8 |
p. 1947-1952 6 p. |
article |
|
| 81 | On minimal Sturmian partial words |
Blanchet-Sadri, F. |
2011 |
96-97 | 8 |
p. 733-745 13 p. |
article |
|
| 82 | On Sturmian graphs |
Epifanio, Chiara |
2007 |
96-97 | 8 |
p. 1014-1030 17 p. |
article |
|
| 83 | On the complement graph and defensive k -alliances |
Sigarreta, J.M. |
2009 |
96-97 | 8 |
p. 1687-1695 9 p. |
article |
|
| 84 | On the NBC-complexes and β -invariants of abstract convex geometries |
Nakamura, Masataka |
2009 |
96-97 | 8 |
p. 1799-1805 7 p. |
article |
|
| 85 | On the number of components of ( k , g ) -cages after vertex deletion |
Lin, Yuqing |
2009 |
96-97 | 8 |
p. 1760-1765 6 p. |
article |
|
| 86 | On the pagenumber of trivalent Cayley graphs |
Tanaka, Yuuki |
2006 |
96-97 | 8 |
p. 1279-1292 14 p. |
article |
|
| 87 | On the two-dimensional orthogonal drawing of series-parallel graphs |
Tayu, Satoshi |
2009 |
96-97 | 8 |
p. 1885-1895 11 p. |
article |
|
| 88 | On the Zagreb index inequality of graphs with prescribed vertex degrees |
Andova, Vesna |
2011 |
96-97 | 8 |
p. 852-858 7 p. |
article |
|
| 89 | On total domination vertex critical graphs of high connectivity |
Henning, Michael A. |
2009 |
96-97 | 8 |
p. 1969-1973 5 p. |
article |
|
| 90 | On well-covered triangulations: Part III |
Finbow, Arthur S. |
2010 |
96-97 | 8 |
p. 894-912 19 p. |
article |
|
| 91 | Optimal clustering of multipartite graphs |
Charon, Irène |
2008 |
96-97 | 8 |
p. 1330-1341 12 p. |
article |
|
| 92 | Optimal strong ( κ , d ) -orientation of complete k -partite graphs |
Miao, Huifang |
2009 |
96-97 | 8 |
p. 1729-1736 8 p. |
article |
|
| 93 | Partially ordered knapsack and applications to scheduling |
Kolliopoulos, Stavros G. |
2007 |
96-97 | 8 |
p. 889-897 9 p. |
article |
|
| 94 | Preface |
Hudry, Olivier |
2008 |
96-97 | 8 |
p. 1181- 1 p. |
article |
|
| 95 | 2-rainbow domination of generalized Petersen graphs P ( n , 2 ) |
Tong, Chunling |
2009 |
96-97 | 8 |
p. 1932-1937 6 p. |
article |
|
| 96 | Recognizing splicing languages: Syntactic monoids and simultaneous pumping |
Goode, Elizabeth |
2007 |
96-97 | 8 |
p. 989-1006 18 p. |
article |
|
| 97 | Reinforcement numbers of digraphs |
Huang, Jia |
2009 |
96-97 | 8 |
p. 1938-1946 9 p. |
article |
|
| 98 | Riordan group involutions and the Δ -sequence |
Cheon, Gi-Sang |
2009 |
96-97 | 8 |
p. 1696-1701 6 p. |
article |
|
| 99 | Scheduling jobs with release dates on parallel batch processing machines |
Liu, L.L. |
2009 |
96-97 | 8 |
p. 1825-1830 6 p. |
article |
|
| 100 | Scheduling orders for multiple product types to minimize total weighted completion time |
Leung, Joseph Y.-T. |
2007 |
96-97 | 8 |
p. 945-970 26 p. |
article |
|
| 101 | Separator orders in interval, cocomparability, and AT-free graphs |
Backer, Jonathan |
2011 |
96-97 | 8 |
p. 717-726 10 p. |
article |
|
| 102 | Several parameters of generalized Mycielskians |
Lin, Wensong |
2006 |
96-97 | 8 |
p. 1173-1182 10 p. |
article |
|
| 103 | Some results related to the tenacity and existence of k -trees |
Moazzami, Dara |
2009 |
96-97 | 8 |
p. 1794-1798 5 p. |
article |
|
| 104 | Some simple optimization techniques for self-organized public key management in mobile ad hoc networks |
Bornand-Jaccard, T. |
2006 |
96-97 | 8 |
p. 1223-1235 13 p. |
article |
|
| 105 | Spatial classification |
Diday, Edwin |
2008 |
96-97 | 8 |
p. 1271-1294 24 p. |
article |
|
| 106 | Sphericity, cubicity, and edge clique covers of graphs |
Michael, T.S. |
2006 |
96-97 | 8 |
p. 1309-1313 5 p. |
article |
|
| 107 | Stochastic applications of media theory: Random walks on weak orders or partial orders |
Falmagne, Jean-Claude |
2008 |
96-97 | 8 |
p. 1183-1196 14 p. |
article |
|
| 108 | Super-simple ( v , 5 , 4 ) designs |
Chen, Kejun |
2007 |
96-97 | 8 |
p. 904-913 10 p. |
article |
|
| 109 | Systems of sets such that each set properly intersects at most one other set—Application to cluster analysis |
Bertrand, P. |
2008 |
96-97 | 8 |
p. 1220-1236 17 p. |
article |
|
| 110 | Szeged index, edge Szeged index, and semi-star trees |
Dolati, Ardeshir |
2010 |
96-97 | 8 |
p. 876-881 6 p. |
article |
|
| 111 | The clique-separator graph for chordal graphs |
Ibarra, Louis |
2009 |
96-97 | 8 |
p. 1737-1749 13 p. |
article |
|
| 112 | The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications |
Ng, C.T. |
2009 |
96-97 | 8 |
p. 1806-1824 19 p. |
article |
|
| 113 | The hyper-Wiener index of the generalized hierarchical product of graphs |
Eliasi, Mehdi |
2011 |
96-97 | 8 |
p. 866-871 6 p. |
article |
|
| 114 | The incidence game chromatic number of paths and subgraphs of wheels |
Kim, John Y. |
2011 |
96-97 | 8 |
p. 683-694 12 p. |
article |
|
| 115 | The 22 minimal dichotomy decompositions of the K 5 -distance |
Fichet, Bernard |
2008 |
96-97 | 8 |
p. 1263-1270 8 p. |
article |
|
| 116 | The satisfactory partition problem |
Bazgan, Cristina |
2006 |
96-97 | 8 |
p. 1236-1245 10 p. |
article |
|
| 117 | The signed domatic number of some regular graphs |
Meierling, Dirk |
2009 |
96-97 | 8 |
p. 1905-1912 8 p. |
article |
|
| 118 | Treelike comparability graphs |
Cornelsen, Sabine |
2009 |
96-97 | 8 |
p. 1711-1722 12 p. |
article |
|
| 119 | Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees |
Alizadeh, Behrooz |
2011 |
96-97 | 8 |
p. 706-716 11 p. |
article |
|
| 120 | Unique intersectability of diamond-free graphs |
Guo, Jun-Lin |
2011 |
96-97 | 8 |
p. 774-778 5 p. |
article |
|
| 121 | Untangling planar graphs from a specified vertex position—Hard cases |
Kang, M. |
2011 |
96-97 | 8 |
p. 789-799 11 p. |
article |
|
| 122 | Upper bounds on the signed total domatic number of graphs |
Volkmann, Lutz |
2011 |
96-97 | 8 |
p. 832-837 6 p. |
article |
|
| 123 | Wilson's theorem for consensus functions on hierarchies |
Powers, R.C. |
2008 |
96-97 | 8 |
p. 1321-1329 9 p. |
article |
123 results found