Discrete Applied Mathematics, Volume 158

Volume 158, Number 1, January 2010

• 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
  

• 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

• 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
  

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

Volume 158, Number 3, February 2010

• Christian Bachmaier, Hedi Buchner, Michael Forster, Seok-Hee Hong:
  Crossing minimization in extended level drawings of graphs. 159-179
  
• Jesús Mario Bilbao, M. 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
  

• M. Atapour, Seyed Mahmoud Sheikholeslami, A. 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
  

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

Volume 158, Number 4, February 2010

• Ulrich Faigle, Johann 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 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
  

• 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
  
• B. Ries:
  Complexity of two coloring problems in cubic planar bipartite mixed graphs. 592-596
  

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

Volume 158, Number 6, March 2010

• 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 G. 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
  

• 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
  

• 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
  

• 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
  

• 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 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
  

• 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

• Andrew R. Curtis, Clemente Izurieta, Benson L. Joeris, Scott 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 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
  

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

Volume 158, Number 9, May 2010

• Jesús Mario Bilbao, J. R. Fernández, N. Jiménez, J. J. López:
  The Banzhaf power index for ternary bicooperative games. 967-980
  
• A. 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
  

• 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
  

• 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

• 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
  

• 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

• E. 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 Ch. Das:
  Atom-bond connectivity index of graphs. 1181-1188
  
• Michael Ferrara, Ronald J. Gould, Michal Karonski, Florian Pfender:
  An iterative approach to graph irregularity strength. 1189-1194
  
• Martin Sauerhoff:
  An asymptotically optimal lower bound on the OBDD size of the middle bit of multiplication for the pairwise ascending variable order. 1195-1204
  
• Ismael González Yero, Juan Alberto Rodríguez-Velazquez:
  Boundary defensive k-alliances in graphs. 1205-1211
  

Volume 158, Number 12, June 2010

• Guillermo Durán, Thomas M. Liebling, Martín Matamala, Jayme Luiz Szwarcfiter:
  Traces from LAGOS'07: IV Latin American Algorithms, Graphs, and Optimization Symposium Puerto Varas - 2007. 1213-1215
  
• Jean Cardinal, Vlady Ravelomanana, Mario Valencia-Pabon:
  Minimum sum edge colorings of multicycles. 1216-1223
  
• Arthur S. Finbow, Douglas F. Rall:
  On the packing chromatic number of some lattices. 1224-1228
  
• Ana Silva, Aline Alves da Silva, Cláudia Linhares Sales:
  A bound on the treewidth of planar even-hole-free graphs. 1229-1239
  
• Bernardo M. Ábrego, Mario Cetina, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar:
  3-symmetric and 3-decomposable geometric drawings of K_n. 1240-1258
  
• Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
  The clique operator on circular-arc graphs. 1259-1267
  
• Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter:
  Complexity results related to monophonic convexity. 1268-1274
  
• Alberto Alexandre Assis Miranda, Cláudio Leonardo Lucchesi:
  Recognizing near-bipartite Pfaffian graphs in polynomial time. 1275-1278
  
• Liliana Alcón, Luerbio Faria, Celina M. Herrera de Figueiredo, Marisa Gutierrez:
  On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs. 1279-1285
  
• Rafael B. Teixeira, Simone Dantas, Celina M. Herrera de Figueiredo:
  The polynomial dichotomy for three nonempty part sandwich problems. 1286-1304
  
• Frederico Paiva Quintão, Alexandre Salles da Cunha, Geraldo Robson Mateus, Abilio Lucena:
  The k-Cardinality Tree Problem: Reformulations and Lagrangian Relaxation. 1305-1314
  
• Said Sadique Adi, Marília D. V. Braga, Cristina G. Fernandes, Carlos Eduardo Ferreira, Fábio Viduani Martinez, Marie-France Sagot, Marco A. Stefanes, Christian Tjandraatmadja, Yoshiko Wakabayashi:
  Repetition-free longest common subsequence. 1315-1324
  
• Gabriela R. Argiroffo, Silvia M. Bianchi:
  The nonidealness index of rank-ideal matrices. 1325-1335
  
• Raphael C. S. Machado, Celina M. Herrera de Figueiredo:
  Decompositions for edge-coloring join graphs and cobipartite graphs. 1336-1342
  
• Néstor E. Aguilera:
  On packing and covering polyhedra of consecutive ones circulant clutters. 1343-1356
  
• Robert Gallant, Georg Gunther, Bert Hartnell, Douglas F. Rall:
  Limited packings in graphs. 1357-1364
  
• Amanda Montejano, Pascal Ochem, Alexandre Pinlou, André Raspaud, Eric Sopena:
  Homomorphisms of 2-edge-colored graphs. 1365-1379
  

Volume 158, Number 13, July 2010

• János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin:
  On the sum minimization version of the online bin covering problem. 1381-1393
  
• Christian Glaßer, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr:
  Satisfiability of algebraic circuits over sets of natural numbers. 1394-1403
  
• Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot:
  The minimum reload s-t path, trail and walk problems. 1404-1417
  
• Vadim E. Levit, Eugen Mandrescu:
  Graph operations that are good for greedoids. 1418-1423
  
• Yael Maduel, Zeev Nutov:
  Covering a laminar family by leaf to leaf links. 1424-1432
  
• Metrose Metsidik, Weijuan Zhang, Fang Duan:
  Hyper- and reverse-Wiener indices of F-sums of graphs. 1433-1440
  
• Rico Zenklusen:
  Network flow interdiction on planar graphs. 1441-1455
  

• Suh-Ryung Kim, Jung Yeun Lee, Yoshio Sano:
  The competition number of a graph whose holes do not overlap much. 1456-1460
  
• Hans-Joachim Kroll, Rita Vincenti:
  Antiblocking decoding. 1461-1464
  

Volume 158, Number 14, July 2010

• M. H. Akhbari, R. Hasni, Odile Favaron, Hosein Karami, Seyed Mahmoud Sheikholeslami:
  Inequalities of Nordhaus-Gaddum type for doubly connected domination number. 1465-1470
  
• An-Chiang Chu, Bang Ye Wu, Hung-Lung Wang, Kun-Mao Chao:
  A tight bound on the min-ratio edge-partitioning problem of a tree. 1471-1478
  
• Ales Drápal, Carlo Hämäläinen:
  An enumeration of equilateral triangle dissections. 1479-1495
  
• Vladimir Gurvich:
  Metric and ultrametric spaces of resistances. 1496-1505
  
• Adriana Hansberg:
  Bounds on the connected k-domination number in graphs. 1506-1510
  
• Arthur M. Hobbs, Lavanya Kannan, Hong-Jian Lai, Hongyuan Lai, Guoqing Weng:
  Balanced and 1-balanced graph constructions. 1511-1523
  
• Elmar Teufl, Stephan G. Wagner:
  Enumeration of matchings in families of self-similar graphs. 1524-1535
  
• Rundan Xing, Bo Zhou, Zhibin Du:
  Further results on atom-bond connectivity index of trees. 1536-1545
  
• Bing Xue, Liancui Zuo:
  On the linear (n-1)-arboricity of K_n(m). 1546-1550
  
• Zahra Yarahmadi, Tomislav Doslic, Ali Reza Ashrafi:
  The bipartite edge frustration of composite graphs. 1551-1558
  
• Heping Zhang, Saihua Liu:
  2-resonance of plane bipartite graphs and its applications to boron-nitrogen fullerenes. 1559-1569
  

Volume 158, Number 15, August 2010

• Ali Reza Ashrafi, Tomislav Doslic, A. Hamzeh:
  The Zagreb coindices of graph operations. 1571-1578
  
• Therese C. Biedl, Alexander Golynski, Angèle M. Hamel, Alejandro López-Ortiz, J. Ian Munro:
  Sorting with networks of data structures. 1579-1586
  
• Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning:
  Total domination critical and stable graphs upon edge removal. 1587-1592
  
• Tinaz Ekim, Jing Huang:
  Recognizing line-polar bipartite graphs in time O(n). 1593-1598
  
• Günes Erdogan, Jean-François Cordeau, Gilbert Laporte:
  A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem. 1599-1614
  
• Michael A. Henning, Christian Löwenstein, Dieter Rautenbach, Justin Southey:
  Disjoint dominating and total dominating sets in graphs. 1615-1623
  
• Ján Katrenic, Gabriel Semanisin:
  Finding monotone paths in edge-ordered graphs. 1624-1632
  
• Jianxi Li, Ji-Ming Guo, Wai Chee Shiu:
  The smallest values of algebraic connectivity for unicyclic graphs. 1633-1643
  
• W. Liu, Nicolas Trotignon:
  The k-in-a-tree problem for graphs of girth at least k. 1644-1649
  
• Anish Man Singh Shrestha, Satoshi Tayu, Shuichi Ueno:
  On orthogonal ray graphs. 1650-1659
  
• Ken Takata:
  Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph. 1660-1667
  
• Binzhou Xia, Zhiyi Tan:
  Tighter bounds of the First Fit algorithm for the bin-packing problem. 1668-1675
  
• Rico Zenklusen:
  Matching interdiction. 1676-1690
  

• Haiyan Chen:
  Random walks and the effective resistance sum rules. 1691-1700
  
• Aleksey A. Imaev, Robert P. Judd:
  Computing an eigenvector of an inverse Monge matrix in max-plus algebra. 1701-1707
  
• Joanna Raczek, Magdalena Lemanska:
  A note on the weakly convex and convex domination numbers of a torus. 1708-1713
  
• Ioan Tomescu:
  Ordering connected graphs having small degree distances. 1714-1717
  

Volume 158, Number 16, August 2010

• Abhijin Adiga, Diptendu Bhowmick, L. Sunil Chandran:
  The hardness of approximating the boxicity, cubicity and threshold dimension of a graph. 1719-1726
  
• Sen Bai, Xiaofan Yang, Guibin Zhu, De-Lei Jiang, Jian Huang:
  Generalized knight's tour on 3D chessboards. 1727-1731
  
• Stéphane Bessy, Christophe Paul, Anthony Perez:
  Polynomial kernels for 3-leaf power graph modification problems. 1732-1744
  
• Sayan Bhattacharya, Goutam Paul, Swagato Sanyal:
  A cops and robber game in multidimensional grids. 1745-1751
  
• Bostjan Bresar, Manoj Changat, Tanja Gologranc, Joseph Mathews, Antony Mathews:
  Cover-incomparability graphs and chordal graphs. 1752-1759
  
• David Cariolaro, Romeo Rizzi:
  Excessive factorizations of bipartite multigraphs. 1760-1766
  
• Moshe Dror, George Steiner:
  'Strong'-'weak' precedence in scheduling: Extensions to series-parallel orders. 1767-1776
  
• Nicole Eggemann, Frédéric Havet, Steven D. Noble:
  k-L(2, 1)-labelling for planar graphs is NP-complete for k>=4. 1777-1788
  
• David Howard, Ann N. Trenk:
  The t-discrepancy of a poset. 1789-1798
  
• Aleksandar Ilic:
  Distance spectral radius of trees with given matching number. 1799-1806
  
• Jennifer D. Key, Bernardo Gabriel Rodrigues:
  Codes from lattice and related graphs, and permutation decoding. 1807-1815
  
• Wu-Hsiung Lin, Gerard J. Chang:
  Equitable colorings of Kronecker products of graphs. 1816-1826
  
• Petros A. Petrosyan, H. Z. Arakelyan, V. M. Baghdasaryan:
  A generalization of interval edge-colorings of graphs. 1827-1837
  
• Stephen E. Wright:
  Integer matrices with constraints on leading partial row and column sums. 1838-1847
  

• Marhaba Hoji, Zhaoyang Luo, Elkin Vumar:
  Wiener and vertex PI indices of Kronecker products of graphs. 1848-1855
  
• Martin Kochol:
  Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface. 1856-1860
  
• Sujeevraja Sanjeevi, Kiavash Kianfar:
  A polyhedral study of triplet formulation for single row facility layout problem. 1861-1867
  

Volume 158, Number 17, October 2010

• E. Abajo, Ana Diánez:
  Exact values of ex(nu;{C₃, C₄, ..., C_n}). 1869-1878
  
• Claudia Archetti, Luca Bertazzi, Maria Grazia Speranza:
  Reoptimizing the 0-1 knapsack problem. 1879-1887
  
• Siham Bekkai, Mekkia Kouider:
  On mean distance and girth. 1888-1893
  
• Zhi-Zhong Chen, Sayuri Konno, Yuki Matsushita:
  Approximating maximum edge 2-coloring in simple graphs. 1894-1901
  
• Louis Esperet, John Gimbel, Andrew D. King:
  Covering line graphs with equivalence relations. 1902-1907
  
• Mikhail Y. Kovalyov, Erwin Pesch:
  A generic approach to proving NP-hardness of partition type problems. 1908-1912
  
• B. S. Panda, Anita Das:
  Tree 3-spanners in 2-sep chordal graphs: Characterization and algorithms. 1913-1935
  
• Tomaz Pisanski, Milan Randic:
  Use of the Szeged index and the revised Szeged index for measuring network bipartivity. 1936-1944
  
• Xinmao Wang, Yaokun Wu:
  Lit-only sigma-game on pseudo-trees. 1945-1952
  
• Qin Zhao, Shuchao Li:
  Sharp bounds for the Zagreb indices of bicyclic graphs with k-pendant vertices. 1953-1962
  

• Louis Esperet:
  Dynamic list coloring of bipartite graphs. 1963-1965
  
• Iwona Wloch, Andrzej Wloch:
  Generalized sequences and k-independent sets in graphs. 1966-1970
  
• Mingquan Zhan:
  Hamiltonicity of 6-connected line graphs. 1971-1975
  

Volume 158, Number 18, November 2010

• Robert Brijder, Hendrik Jan Hoogeboom:
  Maximal pivots on graphs with an application to gene assembly. 1977-1985
  
• Yukun Cheng, Liying Kang:
  The p-maxian problem on interval graphs. 1986-1993
  
• Rok Erman, Lukasz Kowalik, Matjaz Krnc, Tomasz Walen:
  Improved induced matchings in sparse graphs. 1994-2003
  
• Shamik Ghosh, Maitry Podder, Malay K. Sen:
  Adjacency matrices of probe interval graphs. 2004-2013
  
• Alain Goupil, Hugo Cloutier, Fathallah Nouboud:
  Enumeration of polyominoes inscribed in a rectangle. 2014-2023
  
• Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto:
  On the Boolean connectivity problem for Horn relations. 2024-2030
  
• Michel Minoux, Hacene Ouzia:
  DRL*: A hierarchy of strong block-decomposable linear relaxations for 0-1 MIPs. 2031-2048
  
• Panagiotis Rizomiliotis:
  Improving the high order nonlinearity lower bound for Boolean functions with given algebraic immunity. 2049-2055
  
• Damir Vukicevic:
  Which generalized Randic indices are suitable measures of molecular branching? 2056-2065
  
• Shiying Wang, Ruixia Wang, Shangwei Lin, Jing Li:
  Matching preclusion for k-ary n-cubes. 2066-2070
  

• Kenji Kimura, Masayuki Koyama, Akira Saito:
  Small alliances in a weighted graph. 2071-2074
  
• Gintaras Palubeckis:
  Facet-inducing web and antiweb inequalities for the graph coloring polytope. 2075-2080
  
• Yehong Shao:
  Connectivity of iterated line graphs. 2081-2087
  

• Jack Brimberg, Henrik Juel, Anita Schöbel:
  Erratum to "Locating a minisum circle in the plane" [Discrete Appl. Math. 157 (5) (2009) 901-912]. 2088
  

Last update Thu May 23 14:40:59 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page