Discrete Applied Mathematics, Volume 158

Volume 158, Number 1, January 2010

Contributions

• 
  Sarah Spence Adams, Alex Trazkovich, Denise Sakai Troxell, Bradford Westgate:
  On island sequences of labelings with a condition at distance two. 1-7
• 
  Gerard J. Chang, Jiaojiao Wu, Xuding Zhu:
  Rainbow domination on trees. 8-12
• 
  Guoli Ding, Robert F. Lax, Jianhua Chen, Peter P. Chen, Brian D. Marx:
  Transforms of pseudo-Boolean random variables. 13-24
• 
  Emma Yu Jin, Christian M. Reidys:
  RNA pseudoknot structures with arc-length >=3 and stack-length >=sigma. 25-36
• 
  Zhaohong Niu, Liming Xiong:
  Supereulerianity of k-edge-connected graphs with a restriction on small bonds. 37-43
• 
  Ricardo Riaza, Alfonso J. Encinas:
  Augmented nodal matrices and normal trees. 44-61
• 
  Yonghong Xiang, Iain A. Stewart:
  One-to-many node-disjoint paths in (n, k)-star graphs. 62-70

Notes

• 
  Elisabeth Gassner, Johannes Hatzl, Sven Oliver Krumke, Sleman Saliba:
  clever or smart: Strategies for the online target date assignment problem. 71-79

Volume 158, Number 2, January 2010

Contributions

• 
  Endre Boros, Ondrej Cepek, Alexander Kogan, Petr Kucera:
  Exclusive and essential sets of implicates of Boolean functions. 81-96
• 
  Sylvain Boussier, Michel Vasquez, Yannick Vimont, Saïd Hanafi, Philippe Michelon:
  A multi-level search strategy for the 0-1 Multidimensional Knapsack Problem. 97-109
• 
  Andreas Brandstädt, Peter Wagner:
  Characterising (k, l)-leaf powers. 110-122
• 
  Dirk Briskorn, Sigrid Knust:
  Constructing fair sports league schedules with regard to strength groups. 123-135
• 
  Nicholas J. Cavenagh, Ian M. Wanless:
  On the number of transversals in Cayley tables of cyclic groups. 136-146
• 
  Michael A. Henning, Lucas C. van der Merwe:
  Properties of total domination edge-critical graphs. 147-153

Note

• 
  Akira Kamibeppu:
  An upper bound for the competition numbers of graphs. 154-157

Volume 158, Number 3, February 2010

Contributions

• 
  Christian Bachmaier, Hedi Buchner, Michael Forster, Seok-Hee Hong:
  Crossing minimization in extended level drawings of graphs. 159-179
• 
  Jesús Mario Bilbao, Manuel Ordóñez:
  The core and the Weber set of games on augmenting systems. 180-188
• 
  Michael Ferrara, Michael S. Jacobson, Angela Harris:
  The game of F-saturator. 189-197
• 
  Ioan Tomescu, Syed Ahtsham Ul Haq Bokhary:
  Series-parallel chromatic hypergraphs. 198-203
• 
  Zhongxun Zhu, Shuchao Li, Liansheng Tan:
  Tricyclic graphs with maximum Merrifield-Simmons index. 204-212

Notes

• 
  M. Atapour, Seyed Mahmoud Sheikholeslami, Arezoo N. Ghameshlou, Lutz Volkmann:
  Signed star domatic number of a graph. 213-218
• 
  Ali Behtoei, Mohsen Jannesari, Bijan Taeri:
  A characterization of block graphs. 219-221
• 
  Malte Fliedner, Nils Boysen, Armin Scholl:
  Solving symmetric mixed-model multi-level just-in-time scheduling problems. 222-231
• 
  Hossein Hajiabolhassan:
  On the b-chromatic number of Kneser graphs. 232-234

Communications

• 
  Kyungsik Lee:
  Integral polyhedra related to integer multicommodity flows on a cycle. 235-238

Volume 158, Number 4, February 2010

• 
  Ulrich Faigle, Johann L. Hurink:
  Cologne/Twente workshop on graphs and combinatorial optimization CTW 2007. 239
• 
  Deepak Ajwani, Tobias Friedrich:
  Average-case analysis of incremental topological ordering. 240-250
• 
  Stephan Dominique Andres:
  Directed defective asymmetric graph coloring games. 251-260
• 
  Paul S. Bonsma:
  Most balanced minimum cuts. 261-276
• 
  Florentine Bunke, Horst W. Hamacher, Francesco Maffioli, Anne M. Schwahn:
  Minimum cut bases in undirected networks. 277-290
• 
  Dimitri Drapkin, Rüdiger Schultz:
  An algorithm for stochastic programs with first-order dominance constraints induced by linear recourse. 291-297
• 
  Birgit Engels:
  The Transitive Minimum Manhattan Subnetwork Problem in 3 dimensions. 298-307
• 
  Henning Fernau:
  minimum dominating set of queens: A trivial programming exercise? 308-318
• 
  Gregory Z. Gutin, Eun Jung Kim:
  The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops. 319-330
• 
  Ruijuan Li, Shengjia Li, Yubao Guo:
  Degree conditions on distance 2 vertices that imply k-ordered Hamiltonian. 331-339
• 
  Shengjia Li, Wei Meng, Yubao Guo:
  Three supplements to Reid's theorem in multipartite tournaments. 340-348
• 
  Isabel Méndez-Díaz, Paula Zabala:
  Solving a multicoloring problem with overlaps using integer programming. 349-354
• 
  Carla Silva Oliveira, Leonardo Silva de Lima, Nair Maria Maia de Abreu, Pierre Hansen:
  Bounds on the index of the signless Laplacian of a graph. 355-360
• 
  Joachim Spoerhase, Hans-Christoph Wirth:
  Relaxed voting and competitive location under monotonous gain functions on trees. 361-373

Volume 158, Number 5, March 2010

• 
  Hernán G. Abeledo, Gary W. Atkinson:
  A min-max theorem for plane bipartite graphs. 375-378
• 
  Néstor E. Aguilera, Mariana S. Escalante:
  A polyhedral approach to the stability of a family of coalitions. 379-396
• 
  Camino Balbuena, Kim Marshall, Luis Pedro Montejano:
  On the connectivity and superconnected graphs with small diameter. 397-403
• 
  Giuseppe Cattaneo, Pompeo Faruolo, Umberto Ferraro Petrillo, Giuseppe F. Italiano:
  Maintaining dynamic minimum spanning trees: An experimental study. 404-425
• 
  Manoj Changat, Joseph Mathews, Henry Martyn Mulder:
  The induced path function, monotonicity and betweenness. 426-433
• 
  Derek G. Corneil, Ekkehard Köhler, Jean-Marc Lanlignel:
  On end-vertices of Lexicographic Breadth First Searches. 434-443
• 
  Alicia Dickenstein, Enrique A. Tobis:
  Additive edge labelings. 444-452
• 
  Adriana Felicia Gabor, Jan-Kees C. W. van Ommeren:
  A new approximation algorithm for the multilevel facility location problem. 453-460
• 
  Hortensia Galeana-Sánchez, Bernardo Llano, Juan José Montellano-Ballesteros:
  Kernels by monochromatic paths in m-colored unions of quasi-transitive digraphs. 461-466
• 
  Serge Gaspers, Margaret-Ellen Messinger, Richard J. Nowakowski, Pawel Pralat:
  Parallel cleaning of a network with brushes. 467-478
• 
  Michel Grabisch:
  The lattice of embedded subsets. 479-488
• 
  Markus Kuba, Alois Panholzer:
  On the distribution of distances between specified nodes in increasing trees. 489-506
• 
  Xiangwen Li, Vicky H. Mak, Sanming Zhou:
  Optimal radio labellings of complete m-ary trees. 507-515
• 
  Qinghai Liu, Zhao Zhang:
  The existence and upper bound for two types of restricted connectivity. 516-521
• 
  Carlos Mendes, Emerson L. Monte Carmelo, Marcus Poggi:
  Bounds for short covering codes and reactive tabu search. 522-533
• 
  Jozef Miskuf, Riste Skrekovski, Martin Tancer:
  Backbone colorings of graphs with bounded degree. 534-542
• 
  Yoram Revah, Michael Segal, Liron Yedidsion:
  Real-time data gathering in sensor networks. 543-550
• 
  Vladimir R. Rosenfeld:
  The independence polynomial of rooted products of graphs. 551-558
• 
  Thomas C. Sharkey, H. Edwin Romeijn:
  Greedy approaches for a class of nonlinear Generalized Assignment Problems. 559-572
• 
  Heping Zhang, Dong Ye, Wai Chee Shiu:
  Forcing matching numbers of fullerene graphs. 573-582

Notes

• 
  Philippe Baptiste:
  A note on scheduling identical coupled tasks in logarithmic time. 583-587
• 
  Patric R. J. Östergård, Vesa P. Vaskelainen:
  A tournament of order 14 with disjoint Banks and Slater sets. 588-591
• 
  Bernard Ries:
  Complexity of two coloring problems in cubic planar bipartite mixed graphs. 592-596

Communication

• 
  Michel Minoux:
  Robust network optimization under polyhedral demand uncertainty is NP-hard. 597-603

Volume 158, Number 6, March 2010

Contributions

• 
  Sergey V. Avgustinovich, Amy Glen, Bjarni V. Halldórsson, Sergey Kitaev:
  On shortest crucial words avoiding abelian powers. 605-607
• 
  Peng Cheng, Shigeru Masuyama:
  A proof of unimodality on the numbers of connected spanning subgraphs in an n-vertex graph with at least ... edges. 608-619
• 
  Sheshayya A. Choudum, T. Karthick:
  First-Fit coloring of {P₅, K₄-e}-free graphs. 620-626
• 
  Weijie Cong, Hongwei Liu:
  Modified algorithms for the minimum volume enclosing axis-aligned ellipsoid problem. 627-635
• 
  Lars Eirik Danielsen, Matthew Geoffrey Parker:
  Interlace polynomials: Enumeration, unimodality and connections to codes. 636-648
• 
  Robert B. Ellis, James P. Ferry:
  Variance of the subgraph count for sparse Erdos-Rényi graphs. 649-658
• 
  Hossein Hajiabolhassan, Abbas Cheraghi:
  Bounds for visual cryptography schemes. 659-665
• 
  Jing Huang, Baogang Xu:
  A forbidden subgraph characterization of line-polar bipartite graphs. 666-680
• 
  Charles R. Johnson, Christopher Jordan-Squire, David A. Sher:
  Eigenvalue assignments and the two largest multiplicities in a Hermitian matrix whose graph is a tree. 681-691
• 
  Justie Su-tzu Juan, Daphne Der-Fen Liu, Li-Yueh Chen:
  L(j, k)-labelling and maximum ordering-degrees for trees. 692-698
• 
  Muhuo Liu, Bolian Liu:
  On the kth smallest and kth greatest modified Wiener indices of trees. 699-705
• 
  Yaokun Wu, Junjie Lu:
  Dimension-2 poset competition numbers and dimension-2 poset double competition numbers. 706-717

Notes

• 
  Subir Kumar Ghosh:
  Approximation algorithms for art gallery problems in polygons. 718-722
• 
  Zoltán Király, Ben Cosh, Bill Jackson:
  Local edge-connectivity augmentation in hypergraphs is NP-complete. 723-727

Erratum

• 
  Stephan Dominique Andres:
  Erratum to: The incidence game chromatic number [Discrete Appl. Math. 157(9) (2009) 1980-1987]. 728

Volume 158, Number 7, April 2010

• 
  Pinar Heggernes, Jan Kratochvíl, Andrzej Proskurowski:
  Guest Editors' Foreword. 729-730

Header: Graph classes

• 
  Pim van 't Hof, Daniël Paulusma:
  A new characterization of P₆-free graphs. 731-740
• 
  Daniel Meister, Jan Arne Telle, Martin Vatshelle:
  Recognizing digraphs of Kelly-width 2. 741-746
• 
  Federico Mancini:
  Minimum fill-in and treewidth of split+ke and split+kv graphs. 747-754
• 
  Daniel Lokshtanov, Federico Mancini, Charis Papadopoulos:
  Characterizing and computing minimal cograph completions. 755-764

Header: Optimization

• 
  Louigi Addario-Berry, W. Sean Kennedy, Andrew D. King, Zhentao Li, Bruce A. Reed:
  Finding a maximum-weight induced k-partite subgraph of an i-triangulated graph. 765-770
• 
  Jirí Fiala, Petr A. Golovach:
  Complexity of the packing coloring problem for trees. 771-778
• 
  Benson L. Joeris, Scott M. Lundberg, Ross M. McConnell:
  O(mlogn) split decomposition of strongly-connected graphs. 779-799
• 
  Frederic Dorn:
  Dynamic programming and planarity: Improved tree-decomposition based algorithms. 800-808
• 
  Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle:
  H-join decomposable graphs and algorithms with runtime single exponential in rankwidth. 809-819

Header: Width Parameters

• 
  Daniel Lokshtanov:
  On the complexity of computing treelength. 820-827
• 
  Haiko Müller, Ruth Urner:
  On a disparity between relative cliquewidth and relative NLC-width. 828-840
• 
  Vít Jelínek:
  The rank-width of the square grid. 841-850
• 
  Robert Ganian, Petr Hlinený:
  On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width. 851-867

Volume 158, Number 8, April 2010

Contributions

• 
  Andrew R. Curtis, Clemente Izurieta, Benson L. Joeris, Scott M. Lundberg, Ross M. McConnell:
  An implicit representation of chordal comparability graphs in linear time. 869-875
• 
  Ardeshir Dolati, Imaneh Motevalian, Akram Ehyaee:
  Szeged index, edge Szeged index, and semi-star trees. 876-881
• 
  Tomás Feder, Rajeev Motwani:
  Finding large cycles in Hamiltonian graphs. 882-893
• 
  Arthur S. Finbow, Bert L. Hartnell, Richard J. Nowakowski, Michael D. Plummer:
  On well-covered triangulations: Part III. 894-912
• 
  Satoshi Fujita:
  A tight bound on the number of mobile servers to guarantee transferability among dominating configurations. 913-920
• 
  Yumei Huo, Joseph Y.-T. Leung, Xin Wang:
  Integrated production and delivery scheduling with disjoint windows. 921-931
• 
  Jyh-Jye Lin, Chi-Yuan Chan, Biing-Feng Wang:
  Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches. 932-942
• 
  Lanzhen Song, William Staton, Bing Wei:
  Independence polynomials of k-tree related graphs. 943-950
• 
  Xiande Zhang, Gennian Ge:
  Combinatorial constructions of fault-tolerant routings with levelled minimum optical indices. 951-963

Note

• 
  Gustav Nordh:
  A note on the hardness of Skolem-type sequences. 964-966

Volume 158, Number 9, May 2010

Contributions

• 
  Jesús Mario Bilbao, Julio Rodrigo Fernández García, N. Jiménez, J. J. López:
  The Banzhaf power index for ternary bicooperative games. 967-980
• 
  Abdelaaziz El Hibaoui, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari:
  Uniform election in trees and polyominoids. 981-987
• 
  Dániel Gerbner, Dömötör Pálvölgyi, Balázs Patkós, Gábor Wiener:
  Finding the maximum and minimum elements with one lie. 988-995
• 
  Qiaoping Guo, Shengjia Li, Yubao Guo, Hongwei Li:
  Out-arc pancyclicity of vertices in tournaments. 996-1005
• 
  Michael A. Henning, Adel P. Kazemi:
  k-tuple total domination in graphs. 1006-1011
• 
  Juan Liu, Jixiang Meng, Zhao Zhang:
  Double-super-connected digraphs. 1012-1016
• 
  Zhilin Wu, Stéphane Grumbach:
  Feasibility of motion planning on acyclic and strongly connected directed graphs. 1017-1028
• 
  Tianxing Yao, Peter Che Bor Lam, Wensong Lin, Guofei Zhou:
  On time-relaxed broadcasting networks. 1029-1034

Notes

• 
  Imed Kacem:
  Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date. 1035-1040
• 
  Bert Randerath, Ingo Schiermeyer:
  On maximum independent sets in P₅-free graphs. 1041-1044

Erratum

• 
  Zhi-Zhong Chen, Ruka Tanahashi, Lusheng Wang:
  Erratum to "An improved randomized approximation algorithm for maximum triangle packing" [Discrete Appl. Math. 157 (2009) 1640-1646]. 1045-1047

Volume 158, Number 10, May 2010

Contributions

• 
  Daniel Andersson, Vladimir Gurvich, Thomas Dueholm Hansen:
  On acyclicity of games with cycles. 1049-1063
• 
  Ian F. Blake, Theodoulos Garefalakis:
  A transform property of Kloosterman sums. 1064-1072
• 
  Batmend Horoldagva, Sang-Gu Lee:
  Comparing Zagreb indices for connected graphs. 1073-1078
• 
  Kung-Jui Pai, Jou-Ming Chang, Yue-Li Wang:
  Restricted power domination and fault-tolerant power domination on grids. 1079-1089
• 
  Dvir Shabtay, George Steiner, Liron Yedidsion:
  Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments. 1090-1103

Notes

• 
  Hervé Hocquard, Mickaël Montassier, André Raspaud:
  A note on the acyclic 3-choosability of some planar graphs. 1104-1110
• 
  Qiang Meng, Lusheng Chen, Fang-Wei Fu:
  On homogeneous rotation symmetric bent functions. 1111-1117
• 
  Dirk Oliver Theis:
  A note on the relationship between the graphical traveling salesman polyhedron, the Symmetric Traveling Salesman Polytope, and the metric cone. 1118-1120
• 
  Liping Yuan:
  Acute triangulations of trapezoids. 1121-1125

Volume 158, Number 11, June 2010

Contributions

• 
  Encarnación Abajo, Camino Balbuena, Ana Diánez:
  New families of graphs without short cycles and large size. 1127-1135
• 
  Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson:
  New results on optimizing rooted triplets consistency. 1136-1147
• 
  Beifang Chen, Jue Wang:
  Torsion formulas for signed graphs. 1148-1157
• 
  Charles J. Colbourn, Gerzson Kéri, P. P. Rivas Soriano, Jan-Christoph Schlage-Puchta:
  Covering and radius-covering arrays: Constructions and classification. 1158-1180
• 
  Kinkar Chandra Das:
  Atom-bond connectivity index of graphs. 1181-1188
•