Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 157
Volume 157, Number 1, January 2009
- Jun Yan, Jun-Ming Xu, Chao Yang
:
Forwarding index of cube-connected cycles. 1-7
- Yaojun Chen, T. C. Edwin Cheng, Ran Xu:
The Ramsey number for a cycle of length six versus a clique of order eight. 8-12 - Dániel Marx, Marcus Schaefer:
The complexity of nonrepetitive coloring. 13-18 - Frédéric Gardi:
Mutual exclusion scheduling with interval graphs or related classes, Part I. 19-35 - Lali Barrière, Francesc Comellas, Cristina Dalfó, Miguel Angel Fiol:
The hierarchical product of graphs. 36-48 - Chase Rainwater, Joseph Geunes, H. Edwin Romeijn:
The generalized assignment problem with flexible jobs. 49-67 - Alexandre Dolgui, I. Ihnatsenka:
Balancing modular transfer lines with serial-parallel activation of spindle heads at stations. 68-89 - Aubin Jarry, Stéphane Pérennes:
Disjoint paths in symmetric digraphs. 90-97 - Michele Flammini, Alfredo Navarra:
Layouts for mobility management in wireless ATM networks. 98-111 - Zeev Nutov:
Listing minimal edge-covers of intersecting families with applications to connectivity problems. 112-117 - Xujin Chen, Guoli Ding, Wenan Zang:
The box-TDI system associated with 2-edge connected spanning subgraphs. 118-125 - Robert Elsässer, Ulf Lorenz, Thomas Sauerwald:
On randomized broadcasting in Star graphs. 126-139 - Ji-Cherng Lin, Ming-Yi Chiu:
Short correctness proofs for two self-stabilizing algorithms under the distributed daemon model. 140-148 - Chandan K. Dubey, Shashank K. Mehta:
Critically indecomposable graphs. 149-163 - F. H. Chang, Hung-Lin Fu, Frank K. Hwang, B. C. Lin:
The minimum number of e-vertex-covers among hypergraphs with e edges of given ranks. 164-169 - Jun-Yo Chen, Ko-Wei Lih, Jiaojiao Wu:
Coloring the square of the Kneser graph I and the Schrijver graph I. 170-176 - Henning Fernau, Juan Alberto Rodríguez-Velázquez, José María Sigarreta:
Offensive r-alliances in graphs. 177-182 - André Renato Sales Amaral:
A new lower bound for the single row facility layout problem. 183-190 - Qizhong Lin, Yusheng Li:
On Ramsey numbers of fans. 191-194 - Weigen Yan, Yeong-Nan Yeh:
On the matching polynomial of subdivision graphs. 195-200
Volume 157, Number 2, January 2009
- Mark H. Siggers:
Dichotomy for bounded degree H-colouring. 201-210 - Juan Alberto Rodríguez-Velázquez, José María Sigarreta:
Global defensive k-alliances in graphs. 211-218 - José María Sigarreta, Juan Alberto Rodríguez-Velázquez:
On the global offensive alliance number of a graph. 219-226 - Hans-Jürgen Bandelt, Arne Röhl:
Quasi-median hulls in Hamming space are Steiner hulls. 227-233 - Ersoy Subasi, Munevver Mine Subasi, András Prékopa:
On strong unimodality of multivariate discrete distributions. 234-246 - Robin Nunkesser, Philipp Woelfel:
Representation of graphs by OBDDs. 247-261 - T. C. Edwin Cheng, Liying Kang, Erfang Shan:
A polynomial-time algorithm for the paired-domination problem on permutation graphs. 262-271 - Cristina G. Fernandes, Orlando Lee, Yoshiko Wakabayashi:
Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width. 272-279 - Claire Hanen, Alix Munier Kordon:
Periodic schedules for linear precedence constraints. 280-291 - Dong Ye, Heping Zhang:
2-extendability of toroidal polyhexes and Klein-bottle polyhexes. 292-299 - Lavanya Kannan, Arthur M. Hobbs, Hong-Jian Lai, Hongyuan Lai:
Transforming a graph into a 1-balanced graph. 300-308 - Paul N. Balister, Béla Bollobás, Amites Sarkar, Mark Walters:
Highly connected random geometric graphs. 309-320 - Adrian Kosowski:
Forwarding and optical indices of a graph. 321-329 - Renu C. Laskar, Jeremy Lyle:
Fall colouring of bipartite graphs and cartesian products of graphs. 330-338 - Vladimir Kats, Eugene Levner:
A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case. 339-355 - Morteza Esmaeili, Ali Zaghian:
On the combinatorial structure of a class of I shortened Hamming codes and their dual-codes. 356-363 - Andrei Tchernykh, Denis Trystram, Carlos A. Brizuela, Isaac D. Scherson:
Idle regulation in non-clairvoyant scheduling of parallel jobs. 364-376 - Robert E. L. Aldred, Dries Van Dyck, Gunnar Brinkmann, Veerle Fack, Brendan D. McKay:
Graph structural properties of non-Yutsis graphs allowing fast recognition. 377-386 - Hong-Bin Chen, Yongxi Cheng, Qian He, Chongchong Zhong:
Transforming an error-tolerant separable matrix to an error-tolerant disjunct matrix. 387-390 - Jianping Ou:
On extremal unicyclic molecular graphs with maximal Hosoya index. 391-397 - Shinya Fujita, Ken-ichi Kawarabayashi:
Note on non-separating and removable cycles in highly connected graphs. 398-399 - Sogol Jahanbekam:
A comment to: Two classes of edge domination in graphs. 400-401 - Manjusri Basu, Md. M. Rahaman, Satya Bagchi:
On a new code, [2n-1, n, 2n-1]. 402-405 - Frédéric Giroire:
Order statistics and estimating cardinalities of massive data sets. 406-427 - Hyeonjin Kim, Sung-Mo Park, Sang Geun Hahn:
On the weight and nonlinearity of homogeneous rotation symmetric Boolean functions of degree 2. 428-432 - Wei Dong, Baogang Xu:
A note on list improper coloring of plane graphs. 433-436
Volume 157, Number 3, February 2009
- László G. Nyúl, Kálmán Palágyi:
Preface. 437 - Kees Joost Batenburg, Jan Sijbers:
Generic iterative subset algorithms for discrete tomography. 438-451 - Valentin E. Brimkov:
Formulas for the number of (n-2)-gaps of binary objects in arbitrary dimension. 452-463 - Srecko Brlek, Xavier Provençal, Jean-Marc Fedou:
On the tiling by translation problem. 464-475 - Martine Dexet, Eric Andres:
A generalized preimage for the digital analytical hyperplane recognition. 476-489 - Rocío González-Díaz, María José Jiménez, Belén Medrano, Pedro Real:
Chain homotopies for object topological representations. 490-499 - Damien Jamet, Jean-Luc Toutant:
Minimal arithmetic thickness connecting discrete planes. 500-509 - Gaëlle Largeteau-Skapin, Eric Andres:
Discrete-Euclidean operations. 510-523 - Hans Meine, Ullrich Köthe, Peer Stelldinger:
A topological sampling theorem for Robust boundary reconstruction and image segmentation. 524-541 - Samuel Peltier, Laurent Fuchs, Pascal Lienhardt:
Simploidals sets: Definitions, operations and comparison with simplicial sets. 542-557 - Isabelle Sivignon, David Coeurjolly:
Minimum decomposition of a digital surface into digital plane segments is NP-hard. 558-570 - Peter Veelaert, Kristof Teelen:
Feature controlled adaptive difference operators. 571-582
Volume 157, Number 4, February 2009
- Frank Gurski, Egon Wanke:
The NLC-width and clique-width for powers of graphs of bounded tree-width. 583-595 - Chunling Tong, Xiaohui Lin, Yuansheng Yang, Zhihe Li:
Equitable total coloring of CmCn. 596-601 - Ghassan Firro, Toufik Mansour:
Restricted k-ary words and functional equations. 602-616 - Akihisa Kako, Takao Ono, Tomio Hirata, Magnús M. Halldórsson:
Approximation algorithms for the weighted independent set problem in sparse graphs. 617-626 - Bruno Courcelle, Mamadou Moustapha Kanté:
Graph operations characterizing rank-width. 627-640 - Robin Strand:
Weighted distances based on neighborhood sequences for point-lattices. 641-652 - Jixiang Meng, Zhao Zhang:
Super-connected arc-transitive digraphs. 653-658 - Ken-ichi Kawarabayashi:
List-coloring graphs without K4, k-minors. 659-662 - Yuehua Bu, Dong Chen, André Raspaud, Weifan Wang:
Injective coloring of planar graphs. 663-672 - Siamak Tazari, Matthias Müller-Hannemann:
Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation. 673-684 - Qinghai Liu, Yanmei Hong, Zhao Zhang:
Minimally 3-restricted edge connected graphs. 685-690 - Takuro Fukunaga, Hiroshi Nagamochi:
Eulerian detachments with local edge-connectivity. 691-698 - Boris A. Romov:
Homogeneous and strictly homogeneous criteria for partial structures. 699-709 - Xuding Zhu:
Bipartite density of triangle-free subcubic graphs. 710-714 - Hannes Moser, Somnath Sikdar:
The parameterized complexity of the induced matching problem. 715-727 - Alain Quilliot, Fatiha Bendali, Jean Mailfert:
Extended cooperative networks games. 728-737 - Christophe Meyer, Periklis A. Papakonstantinou:
On the complexity of constructing Golomb Rulers. 738-748 - Hong Seo Ryoo, In-Yong Jang:
MILP approach to pattern generation in logical analysis of data. 749-761 - David E. Brown, J. Richard Lundgren, Li Sheng:
A characterization of cycle-free unit probe interval graphs. 762-767 - Martin Gavalec, Ján Plávka:
Structure and dimension of the eigenspace of a concave Monge matrix. 768-773 - Siham Bekkai, Mekkia Kouider:
On pseudo 2-factors. 774-779 - Frédéric Meunier, András Sebö:
Paintshop, odd cycles and necklace splitting. 780-793 - Mehdi Eliasi, Bijan Taeri:
Four new sums of graphs and their Wiener indices. 794-803 - M. H. Khalifeh, Hassan Yousefi-Azari, A. R. Ashrafi:
The first and second Zagreb indices of some graph operations. 804-811 - V. N. Muralidhara, Sandeep Sen:
Improvements on the Johnson bound for Reed-Solomon codes. 812-818 - Dominique de Werra, Marc Demange, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos:
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation. 819-832 - M. R. Darafsheh:
Groups with the same non-commuting graph. 833-837 - Helmuth R. Malonek, Graça Tomaz:
Bernoulli polynomials and Pascal matrices in the context of Clifford analysis. 838-847
- Svetlana A. Kravchenko, Frank Werner:
On a parallel machine scheduling problem with equal processing times. 848-852 - Frantisek Galcík:
A note on the lower bound of centralized radio broadcasting for planar reachability graphs. 853-857 - Pierangela Veneziani:
Upper bounds of degree 3 for the probability of the union of events via linear programming. 858-863 - Mariusz Startek, Andrzej Wloch, Iwona Wloch:
Fibonacci numbers and Lucas numbers in graphs. 864-868 - Xueliang Li, Jianbin Zhang, Lusheng Wang:
On bipartite graphs with minimal energy. 869-873
Volume 157, Number 5, March 2009
- Zhengbing Bian, Qian-Ping Gu, Xiao Zhou:
Efficient algorithms for wavelength assignment on trees of rings. 875-889 - Francine Blanchet-Sadri, C. D. Davis, Joel Dodge, Robert Mercas, Margaret Moorefield:
Unbordered partial words. 890-900 - Jack Brimberg, Henrik Juel, Anita Schöbel:
Locating a minisum circle in the plane. 901-912 - Yinmei Cao, Anhua Lin, Rong Luo, Xiaoya Zha:
On the minimal energy of unicyclic Hückel molecular graphs possessing Kekulé structures. 913-919 - Gi-Sang Cheon, Hana Kim, Louis W. Shapiro:
A generalization of Lucas polynomial sequence. 920-927 - Giovanni Di Crescenzo, Clemente Galdi:
Hypergraph decomposition and secret sharing. 928-946 - Joanna Górska, Zdzislaw Skupien:
Inducing regulation of any digraphs. 947-952 - Stepan Holub, Kalle Saari:
On highly palindromic words. 953-959 - Raja Jothi, Balaji Raghavachari:
Degree-bounded minimum spanning trees. 960-970 - Mahdad Khatirinejad, Petr Lisonek:
Linear codes for high payload steganography. 971-981 - Hong-Jian Lai, Yehong Shao, Gexin Yu, Mingquan Zhan:
Hamiltonian connectedness in 3-connected line graphs. 982-990 - Isabella Lari, Maurizio Maravalle, Bruno Simeone:
Computing sharp bounds for hard clustering problems on trees. 991-1008 - Hao Li, Mei Lu:
Bi-cycle extendable through a given set in balanced bipartite graphs. 1009-1015 - Xiaohui Lin, Yuansheng Yang, Wenping Zheng, Lei Shi, Weiming Lu:
The crossing numbers of generalized Petersen graphs with small order. 1016-1023 - Aygul Mamut, Qiongxiang Huang, Fenjin Liu:
Enumeration of 2-regular circulant graphs and directed double networks. 1024-1033 - Dániel Marx:
Complexity results for minimum sum edge coloring. 1034-1045 - Stefan Porschen, Ewald Speckenmeyer, Xishun Zhao:
Linear CNF formulas and satisfiability. 1046-1068 - Justo Puerto, Federica Ricca, Andrea Scozzari:
Extensive facility location problems on networks with equity measures. 1069-1085 - Palash Sarkar:
Domain extender for collision resistant hash functions: Improving upon Merkle-Damgård iteration. 1086-1097 - Erfang Shan, T. C. Edwin Cheng:
Upper bounds on the upper signed total domination number of graphs. 1098-1103 - Munevver Mine Subasi, Ersoy Subasi, Martin Anthony, Peter L. Hammer:
Using a similarity measure for credible classification. 1104-1112 - Fang Tian, Jun-Ming Xu:
Average distances and distance domination numbers. 1113-1127 - Alfredo Marín, Stefan Nickel, Justo Puerto, Sebastian Velten:
A flexible model and efficient solution strategies for discrete location problems. 1128-1145 - Katalin M. Hangos, Zsolt Tuza, Anders Yeo:
Some complexity problems on single input double output controllers. 1146-1158 - Li-Da Tong:
The forcing hull and forcing geodetic numbers of graphs. 1159-1163
Volume 157, Number 6, March 2009
- Leo Liberti, Nelson Maculan:
Reformulation techniques in mathematical programming. 1165-1166 - Hatem Ben Amor, Jacques Desrosiers, Antonio Frangioni:
On the choice of explicit stabilizing terms in column generation. 1167-1184 - Alain Billionnet, Sourour Elloumi, Marie-Christine Plateau:
Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method. 1185-1197 - Alexandre Salles da Cunha, Abilio Lucena, Nelson Maculan, Mauricio G. C. Resende:
A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs. 1198-1217 - Peter Damaschke:
Ranking hypotheses to minimize the search cost in probabilistic inference models. 1218-1228 - Antonio Frangioni, Bernard Gendron:
0-1 reformulations of the multicommodity capacitated network design problem. 1229-1241 - András Frank:
Rooted k-connections in digraphs. 1242-1254 - Serigne Gueye, Philippe Michelon:
A linearization framework for unconstrained quadratic (0-1) problems. 1255-1266 - Pierre Hansen, Christophe Meyer:
Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem. 1267-1290 - Brigitte Jaumard, Christophe Meyer, Babacar Thiongane:
On column generation formulations for the RWA problem. 1291-1308 - Leo Liberti, Carlile Lavor, Nelson Maculan, Marco Antonio Chaer Nascimento:
Reformulation in mathematical programming: An application to quantum chemistry. 1309-1318 - Hanif D. Sherali, Warren P. Adams:
A Reformulation-Linearization Technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions. 1319-1333
Volume 157, Number 7, April 2009
- Alain Hertz, Matthieu Plumettaz, Nicolas Zufferey:
Corrigendum to "Variable space search for graph coloring" [Discrete Appl. Math. 156 (2008) 2551-2560]. 1335-1336 - Bo-Jr Li, Gerard J. Chang:
The competition number of a graph with exactly h holes, all of which are independent. 1337-1341