|
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
102 gevonden resultaten
| nr | titel | auteur | tijdschrift | jaar | jaarg. | afl. | pagina('s) | type |
| 1 | A benchmark set for the reconstruction of h v -convex discrete sets |
Balázs, Péter |
2009 |
31-40 | 16 |
p. 3447-3456 10 p. |
artikel |
|
| 2 | A Boolean measure of similarity |
Anthony, Martin |
2006 |
31-40 | 16 |
p. 2242-2246 5 p. |
artikel |
|
| 3 | A comparison of lower bounds for the symmetric circulant traveling salesman problem |
de Klerk, Etienne |
2011 |
31-40 | 16 |
p. 1815-1826 12 p. |
artikel |
|
| 4 | A competitive and cooperative approach to propositional satisfiability |
Inoue, Katsumi |
2006 |
31-40 | 16 |
p. 2291-2306 16 p. |
artikel |
|
| 5 | A cops and robber game in multidimensional grids |
Bhattacharya, Sayan |
2010 |
31-40 | 16 |
p. 1745-1751 7 p. |
artikel |
|
| 6 | Acyclic and star colorings of cographs |
Lyons, Andrew |
2011 |
31-40 | 16 |
p. 1842-1850 9 p. |
artikel |
|
| 7 | A generalization of interval edge-colorings of graphs |
Petrosyan, P.A. |
2010 |
31-40 | 16 |
p. 1827-1837 11 p. |
artikel |
|
| 8 | An approximation algorithm for the pickup and delivery vehicle routing problem on trees |
Katoh, Naoki |
2006 |
31-40 | 16 |
p. 2335-2349 15 p. |
artikel |
|
| 9 | An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation |
Khachiyan, Leonid |
2006 |
31-40 | 16 |
p. 2350-2372 23 p. |
artikel |
|
| 10 | An extremal problem on non-full colorable graphs |
Lu, Changhong |
2007 |
31-40 | 16 |
p. 2165-2173 9 p. |
artikel |
|
| 11 | An O ( n log 2 n ) algorithm for the optimal sink location problem in dynamic tree networks |
Mamada, Satoko |
2006 |
31-40 | 16 |
p. 2387-2401 15 p. |
artikel |
|
| 12 | A polyhedral study of triplet formulation for single row facility layout problem |
Sanjeevi, Sujeevraja |
2010 |
31-40 | 16 |
p. 1861-1867 7 p. |
artikel |
|
| 13 | A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems |
Ben-Ameur, Walid |
2011 |
31-40 | 16 |
p. 1689-1698 10 p. |
artikel |
|
| 14 | Applications of algebra to cryptography |
González Vasco, María Isabel |
2008 |
31-40 | 16 |
p. 3071- 1 p. |
artikel |
|
| 15 | Applications to cryptography of twisting commutative algebraic groups |
Silverberg, A. |
2008 |
31-40 | 16 |
p. 3122-3138 17 p. |
artikel |
|
| 16 | Approximating a real number by a rational number with a limited denominator: A geometric approach |
Charrier, Emilie |
2009 |
31-40 | 16 |
p. 3473-3484 12 p. |
artikel |
|
| 17 | A single-copy minimal-time simulation of a torus of automata by a ring of automata |
Martin, Bruno |
2007 |
31-40 | 16 |
p. 2130-2139 10 p. |
artikel |
|
| 18 | A system-theoretic model for cooperation, interaction and allocation |
Faigle, Ulrich |
2011 |
31-40 | 16 |
p. 1736-1750 15 p. |
artikel |
|
| 19 | Average update times for fully-dynamic all-pairs shortest paths |
Friedrich, Tobias |
2011 |
31-40 | 16 |
p. 1751-1758 8 p. |
artikel |
|
| 20 | Codes from lattice and related graphs, and permutation decoding |
Key, J.D. |
2010 |
31-40 | 16 |
p. 1807-1815 9 p. |
artikel |
|
| 21 | Combinatorial approach to image analysis |
Brimkov, Valentin E. |
2009 |
31-40 | 16 |
p. 3359-3361 3 p. |
artikel |
|
| 22 | Competitive subset selection with two agents |
Nicosia, Gaia |
2011 |
31-40 | 16 |
p. 1865-1877 13 p. |
artikel |
|
| 23 | Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface |
Kochol, Martin |
2010 |
31-40 | 16 |
p. 1856-1860 5 p. |
artikel |
|
| 24 | Computing regions of interest for geometric features in digital images |
Teelen, Kristof |
2009 |
31-40 | 16 |
p. 3457-3472 16 p. |
artikel |
|
| 25 | Connectivity preserving transformations for higher dimensional binary images |
Komuravelli, Anvesh |
2009 |
31-40 | 16 |
p. 3372-3385 14 p. |
artikel |
|
| 26 | Construction of universal one-way hash functions: Tree hashing revisited |
Sarkar, Palash |
2007 |
31-40 | 16 |
p. 2174-2180 7 p. |
artikel |
|
| 27 | Contents |
2009 |
31-40 | 16 |
p. vii- 1 p. |
artikel |
||
| 28 | Contents |
2010 |
31-40 | 16 |
p. v-vi nvt p. |
artikel |
||
| 29 | Contents |
2006 |
31-40 | 16 |
p. vii-viii nvt p. |
artikel |
||
| 30 | Contents |
2007 |
31-40 | 16 |
p. vii-viii nvt p. |
artikel |
||
| 31 | Contents |
2008 |
31-40 | 16 |
p. v- 1 p. |
artikel |
||
| 32 | Contents |
2011 |
31-40 | 16 |
p. v-vi nvt p. |
artikel |
||
| 33 | Counting disjoint 2-partitions for points in the plane |
Chang, F.H. |
2007 |
31-40 | 16 |
p. 2087-2092 6 p. |
artikel |
|
| 34 | Cover-incomparability graphs and chordal graphs |
Brešar, Boštjan |
2010 |
31-40 | 16 |
p. 1752-1759 8 p. |
artikel |
|
| 35 | Density condensation of Boolean formulas |
Hanatani, Youichi |
2006 |
31-40 | 16 |
p. 2263-2270 8 p. |
artikel |
|
| 36 | Distance spectral radius of trees with given matching number |
Ilić, Aleksandar |
2010 |
31-40 | 16 |
p. 1799-1806 8 p. |
artikel |
|
| 37 | Edge-connectivity and edge-superconnectivity in sequence graphs |
Balbuena, C. |
2007 |
31-40 | 16 |
p. 2053-2060 8 p. |
artikel |
|
| 38 | Editorial Board |
2009 |
31-40 | 16 |
p. v-vi nvt p. |
artikel |
||
| 39 | Editorial Board |
2006 |
31-40 | 16 |
p. v-vi nvt p. |
artikel |
||
| 40 | Editorial Board |
2007 |
31-40 | 16 |
p. v-vi nvt p. |
artikel |
||
| 41 | Efficient solutions to the braid isotopy problem |
Dehornoy, Patrick |
2008 |
31-40 | 16 |
p. 3091-3112 22 p. |
artikel |
|
| 42 | Equitable colorings of Kronecker products of graphs |
Lin, Wu-Hsiung |
2010 |
31-40 | 16 |
p. 1816-1826 11 p. |
artikel |
|
| 43 | Excessive factorizations of bipartite multigraphs |
Cariolaro, David |
2010 |
31-40 | 16 |
p. 1760-1766 7 p. |
artikel |
|
| 44 | Extremal P 4 -stable graphs |
Horváth, Illés |
2011 |
31-40 | 16 |
p. 1786-1792 7 p. |
artikel |
|
| 45 | Finite turns and the regular closure of linear context-free languages |
Kutrib, Martin |
2007 |
31-40 | 16 |
p. 2152-2164 13 p. |
artikel |
|
| 46 | Flow hypergraph reducibility |
Guedes, A.L.P. |
2011 |
31-40 | 16 |
p. 1775-1785 11 p. |
artikel |
|
| 47 | Frugal, acyclic and star colourings of graphs |
Kang, Ross J. |
2011 |
31-40 | 16 |
p. 1806-1814 9 p. |
artikel |
|
| 48 | Generalized Fibonacci broadcasting: An efficient VOD scheme with user bandwidth limit |
Edward Yan, Mingjun |
2006 |
31-40 | 16 |
p. 2418-2429 12 p. |
artikel |
|
| 49 | Generalized knight’s tour on 3D chessboards |
Bai, Sen |
2010 |
31-40 | 16 |
p. 1727-1731 5 p. |
artikel |
|
| 50 | Generalized metarationalities in the graph model for conflict resolution |
Zeng, Dao-Zhi |
2006 |
31-40 | 16 |
p. 2430-2443 14 p. |
artikel |
|
| 51 | Global optimization for first order Markov Random Fields with submodular priors |
Darbon, Jérôme |
2009 |
31-40 | 16 |
p. 3412-3423 12 p. |
artikel |
|
| 52 | Group theoretic properties of Rijndael-like ciphers |
Sparr, Rüdiger |
2008 |
31-40 | 16 |
p. 3139-3149 11 p. |
artikel |
|
| 53 | Guest Editors |
2006 |
31-40 | 16 |
p. 2241- 1 p. |
artikel |
||
| 54 | Guide for authors |
2006 |
31-40 | 16 |
p. I-IV nvt p. |
artikel |
||
| 55 | Hamiltonian properties of locally connected graphs with bounded vertex degree |
Gordon, Valery S. |
2011 |
31-40 | 16 |
p. 1759-1774 16 p. |
artikel |
|
| 56 | How to collect balls moving in the Euclidean plane |
Asahiro, Yuichi |
2006 |
31-40 | 16 |
p. 2247-2262 16 p. |
artikel |
|
| 57 | Integer matrices with constraints on leading partial row and column sums |
Wright, Stephen E. |
2010 |
31-40 | 16 |
p. 1838-1847 10 p. |
artikel |
|
| 58 | k - L ( 2 , 1 ) -labelling for planar graphs is NP-complete for k ≥ 4 |
Eggemann, Nicole |
2010 |
31-40 | 16 |
p. 1777-1788 12 p. |
artikel |
|
| 59 | L ( 2 , 1 ) -labeling of perfect elimination bipartite graphs |
Panda, B.S. |
2011 |
31-40 | 16 |
p. 1878-1888 11 p. |
artikel |
|
| 60 | Local protein threading by Mixed Integer Programming |
Collet, G. |
2011 |
31-40 | 16 |
p. 1707-1716 10 p. |
artikel |
|
| 61 | Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs |
Ishii, Toshimasa |
2006 |
31-40 | 16 |
p. 2307-2329 23 p. |
artikel |
|
| 62 | Minimum edge ranking spanning trees of split graphs |
Makino, Kazuhisa |
2006 |
31-40 | 16 |
p. 2373-2386 14 p. |
artikel |
|
| 63 | NP -completeness of generalized multi-Skolem sequences |
Nordh, Gustav |
2007 |
31-40 | 16 |
p. 2061-2068 8 p. |
artikel |
|
| 64 | Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem |
Miyata, Keizo |
2006 |
31-40 | 16 |
p. 2402-2410 9 p. |
artikel |
|
| 65 | On octahedral fulleroids |
Jendrol’, Stanislav |
2007 |
31-40 | 16 |
p. 2181-2186 6 p. |
artikel |
|
| 66 | On packing and coloring hyperedges in a cycle |
Li, Jianping |
2007 |
31-40 | 16 |
p. 2140-2151 12 p. |
artikel |
|
| 67 | On resistance of graphs |
Petrosyan, P.A. |
2011 |
31-40 | 16 |
p. 1889-1900 12 p. |
artikel |
|
| 68 | On RSA moduli with almost half of the bits prescribed |
Graham, Sidney W. |
2008 |
31-40 | 16 |
p. 3150-3154 5 p. |
artikel |
|
| 69 | On the connectivity of diamond-free graphs |
Dankelmann, Peter |
2007 |
31-40 | 16 |
p. 2111-2117 7 p. |
artikel |
|
| 70 | On the cycling operation in braid groups |
González-Meneses, Juan |
2008 |
31-40 | 16 |
p. 3072-3090 19 p. |
artikel |
|
| 71 | On the forbidden induced subgraph sandwich problem |
Dantas, Simone |
2011 |
31-40 | 16 |
p. 1717-1725 9 p. |
artikel |
|
| 72 | On the range maximum-sum segment query problem |
Chen, Kuan-Yu |
2007 |
31-40 | 16 |
p. 2043-2052 10 p. |
artikel |
|
| 73 | On the sizes of graphs and their powers: The undirected case |
Auger, David |
2011 |
31-40 | 16 |
p. 1666-1675 10 p. |
artikel |
|
| 74 | On two-stage stochastic knapsack problems |
Kosuch, S. |
2011 |
31-40 | 16 |
p. 1827-1841 15 p. |
artikel |
|
| 75 | Paired domination on interval and circular-arc graphs |
Cheng, T.C.E. |
2007 |
31-40 | 16 |
p. 2077-2086 10 p. |
artikel |
|
| 76 | Pairings for cryptographers |
Galbraith, Steven D. |
2008 |
31-40 | 16 |
p. 3113-3121 9 p. |
artikel |
|
| 77 | Partial characterizations of circle graphs |
Bonomo, Flavia |
2011 |
31-40 | 16 |
p. 1699-1706 8 p. |
artikel |
|
| 78 | Path-based distance functions in n-dimensional generalizations of the face- and body-centered cubic grids |
Strand, Robin |
2009 |
31-40 | 16 |
p. 3386-3400 15 p. |
artikel |
|
| 79 | Paths, trees and matchings under disjunctive constraints |
Darmann, Andreas |
2011 |
31-40 | 16 |
p. 1726-1735 10 p. |
artikel |
|
| 80 | Polyhedral approximation and practical convex hull algorithm for certain classes of voxel sets |
Schulz, Henrik |
2009 |
31-40 | 16 |
p. 3485-3493 9 p. |
artikel |
|
| 81 | Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs |
Mak, Vicky |
2007 |
31-40 | 16 |
p. 2093-2110 18 p. |
artikel |
|
| 82 | Polynomial kernels for 3-leaf power graph modification problems |
Bessy, Stéphane |
2010 |
31-40 | 16 |
p. 1732-1744 13 p. |
artikel |
|
| 83 | Preface |
Katoh, Naoki |
2006 |
31-40 | 16 |
p. 2239-2240 2 p. |
artikel |
|
| 84 | Pure 2D picture grammars and languages |
Subramanian, K.G. |
2009 |
31-40 | 16 |
p. 3401-3411 11 p. |
artikel |
|
| 85 | Reducibility number |
Kharat, V.S. |
2007 |
31-40 | 16 |
p. 2069-2076 8 p. |
artikel |
|
| 86 | Region merging with topological control |
Dupas, Alexandre |
2009 |
31-40 | 16 |
p. 3435-3446 12 p. |
artikel |
|
| 87 | Searching for mobile intruders in circular corridors by two 1-searchers |
Jiang, Bo |
2011 |
31-40 | 16 |
p. 1793-1805 13 p. |
artikel |
|
| 88 | Some theoretical challenges in digital geometry: A perspective |
Asano, Tetsuo |
2009 |
31-40 | 16 |
p. 3362-3371 10 p. |
artikel |
|
| 89 | Sparse connectivity certificates via MA orderings in graphs |
Nagamochi, Hiroshi |
2006 |
31-40 | 16 |
p. 2411-2417 7 p. |
artikel |
|
| 90 | ‘Strong’–‘weak’ precedence in scheduling: Extensions to series–parallel orders |
Dror, Moshe |
2010 |
31-40 | 16 |
p. 1767-1776 10 p. |
artikel |
|
| 91 | 8th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009) |
Cafieri, Sonia |
2011 |
31-40 | 16 |
p. 1659- 1 p. |
artikel |
|
| 92 | The game chromatic index of wheels |
Andres, Stephan Dominique |
2011 |
31-40 | 16 |
p. 1660-1665 6 p. |
artikel |
|
| 93 | The hardness of approximating the boxicity, cubicity and threshold dimension of a graph |
Adiga, Abhijin |
2010 |
31-40 | 16 |
p. 1719-1726 8 p. |
artikel |
|
| 94 | The number of excellent discrete Morse functions on graphs |
Ayala, R. |
2011 |
31-40 | 16 |
p. 1676-1688 13 p. |
artikel |
|
| 95 | The ring-star problem: A new integer programming formulation and a branch-and-cut algorithm |
Simonetti, L. |
2011 |
31-40 | 16 |
p. 1901-1914 14 p. |
artikel |
|
| 96 | The stable fixtures problem—A many-to-many extension of stable roommates |
Irving, Robert W. |
2007 |
31-40 | 16 |
p. 2118-2129 12 p. |
artikel |
|
| 97 | The t -discrepancy of a poset |
Howard, David |
2010 |
31-40 | 16 |
p. 1789-1798 10 p. |
artikel |
|
| 98 | The vehicle routing problem with flexible time windows and traveling times |
Hashimoto, Hideki |
2006 |
31-40 | 16 |
p. 2271-2290 20 p. |
artikel |
|
| 99 | Thinning on cell complexes from polygonal tilings |
Wiederhold, P. |
2009 |
31-40 | 16 |
p. 3424-3434 11 p. |
artikel |
|
| 100 | Total chromatic number of unichord-free graphs |
Machado, R.C.S. |
2011 |
31-40 | 16 |
p. 1851-1864 14 p. |
artikel |
|
| 101 | Two equivalent measures on weighted hypergraphs |
Ito, Hiro |
2006 |
31-40 | 16 |
p. 2330-2334 5 p. |
artikel |
|
| 102 | Wiener and vertex P I indices of Kronecker products of graphs |
Hoji, Marhaba |
2010 |
31-40 | 16 |
p. 1848-1855 8 p. |
artikel |
102 gevonden resultaten