Journal: Discrete Applied Mathematics

Volume 154, Issue 9

1315 -- 0Ulrich Faigle, Johann Hurink, Stefan Wolfgang Pickl. Preface
1317 -- 1323Stephan Dominique Andres. The game chromatic index of forests of maximum degree Delta>=5
1324 -- 1334Gabriela R. Argiroffo, Silvia M. Bianchi, Graciela L. Nasini. Clutter nonidealness
1335 -- 1343Paul S. Bonsma, Thomas Epping, Winfried Hochstättler. Complexity results on restricted instances of a paint shop problem for words
1344 -- 1357Maurizio Bruglieri, Matthias Ehrgott, Horst W. Hamacher, Francesco Maffioli. An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
1358 -- 1371Gruia Calinescu, Sanjiv Kapoor, Mohammad Sarwat. Bounded-hops power assignment in ad hoc wireless networks
1372 -- 1379Aneta Dudek, Gyula Y. Katona, A. Pawel Wojda. Hamiltonian path saturated graphs with small size
1380 -- 1391Ulrich Faigle, Gereon Frahling. A combinatorial algorithm for weighted stable sets in bipartite graphs
1392 -- 1400Toshihiro Fujito, Tsuyoshi Okumura. A modified greedy algorithm for dispersively weighted 3-set cover
1401 -- 1407Francesco Maffioli, Norma Zagaglia Salvi. On some properties of base-matroids
1408 -- 1415Arnaud Pêcher, Annegret Wagler. On non-rank facets of stable set polytopes of webs with clique number four
1416 -- 1428Bert Randerath, Preben D. Vestergaard. Well-covered graphs and factors
1429 -- 1436A. N. M. Salman, Hajo Broersma. Path-fan Ramsey numbers
1437 -- 1452Lutz Volkmann, Stefan Winzen. On the connectivity of close to regular multipartite tournaments
1453 -- 1463Liming Xiong, Hajo Broersma. Subpancyclicity of line graphs and degree sums along paths

Volume 154, Issue 8

1157 -- 1172Vitaly I. Voloshin, Heinz-Jürgen Voss. Circular mixed hypergraphs II: The upper chromatic number
1173 -- 1182Wensong Lin, Jianzhuan Wu, Peter Che Bor Lam, Guohua Gu. Several parameters of generalized Mycielskians
1183 -- 1197Qing-Hu Hou, Toufik Mansour. Horse paths, restricted 132-avoiding permutations, continued fractions, and Chebyshev polynomials
1198 -- 1209Dariusz Dereniowski. Edge ranking of weighted trees
1210 -- 1222Petr Hlinený. Equivalence-free exhaustive generation of matroid representations
1223 -- 1235T. Bornand-Jaccard, David Schindl, Dominique de Werra. Some simple optimization techniques for self-organized public key management in mobile ad hoc networks
1236 -- 1245Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten. The satisfactory partition problem
1246 -- 1253Irène Charon, Sylvain Gravier, Olivier Hudry, Antoine Lobstein, Michel Mollard, Julien Moncel. A linear algorithm for minimum 1-identifying codes in oriented trees
1254 -- 1263Hiroshi Nagamochi, Taizo Kawada. Minmax subtree cover problem on cacti
1264 -- 1278Rahul Santhanam, Kamala Krithivasan. Graph splicing systems
1279 -- 1292Yuuki Tanaka, Yukio Shibata. On the pagenumber of trivalent Cayley graphs
1293 -- 1300Teresa W. Haynes, Michael A. Henning, Jamie Howard. Locating and total dominating sets in trees
1301 -- 1308James Mc Laughlin, Nancy J. Wyshinski. Further combinatorial identities deriving from the ::::n::::th power of a 2×2 matrix
1309 -- 1313T. S. Michael, Thomas Quint. Sphericity, cubicity, and edge clique covers of graphs

Volume 154, Issue 7

1037 -- 0Martin Anthony, Endre Boros, Peter L. Hammer, Alexander Kogan. Preface
1039 -- 1049Gabriela Alexe, Peter L. Hammer. Spanned patterns for the logical analysis of data
1050 -- 1063Sorin Alexe, Peter L. Hammer. Accelerated algorithm for pattern detection in logical analysis of data
1064 -- 1084Anne Berry, Eric SanJuan, Alain Sigayret. Generalized domination in closure systems
1085 -- 1099François Brucker. Sub-dominant theory in numerical taxonomy
1100 -- 1112Rajeev Kohli, Ramesh Krishnamurti, Kamel Jedidi. Subset-conjunctive rules for breast cancer diagnosis
1113 -- 1139Taneli Mielikäinen. Frequency-based views to pattern collections
1140 -- 1156Jutta Gebert, Martin Lätsch, Stefan Wolfgang Pickl, Gerhard-Wilhelm Weber, R. Wünschiers. An algorithm to analyze stability of gene-expression patterns

Volume 154, Issue 6

881 -- 889Gregory Gutin, Arash Rafiey, Anders Yeo, Michael Tso. Level of repair analysis and minimum cost homomorphisms of graphs
890 -- 897Gregory Gutin, Arash Rafiey, Anders Yeo. Minimum cost and list homomorphisms to semicomplete digraphs
898 -- 899Julien Moncel. Monotonicity of the minimum cardinality of an identifying code in the hypercube
900 -- 911Gautam Appa, Dimitris Magos, Ioannis Mourtos. A new class of facets for the Latin square polytope
912 -- 929Wensong Chu, Charles J. Colbourn, Peter Dukes. On constant composition codes
930 -- 941Beiliang Du. Existence of resolvable optimal strong partially balanced designs
942 -- 949Keqin Feng. Unextendible product bases and 1-factorization of complete graphs
950 -- 970Satoru Fujishige, Akihisa Tamura. A general two-sided matching market with discrete concave utility functions
971 -- 979Refael Hassin, Shlomi Rubinstein. An approximation algorithm for maximum triangle packing
980 -- 994Reinhard Laubenbacher, Bodo Pareigis. Update schedules of sequential dynamical systems
995 -- 1002Dániel Marx. Precoloring extension on unit interval graphs
1003 -- 1010Sheng-Lung Peng, Chi-Kang Chen. On the interval completion of chordal graphs
1011 -- 1018Zhao Zhang, Jixiang Meng. On optimally-::::lambda:::::::(3)::: transitive graphs
1019 -- 1022T. C. Edwin Cheng, Yaojun Chen, C. T. Ng. A note on acyclic domination number in graphs of diameter two
1023 -- 1027Michael Dorfling, Michael A. Henning. A note on power domination in grid graphs
1028 -- 1031Grzegorz Malewicz. Latin squares with bounded size of row prefix intersections
1032 -- 1036Lorenzo Traldi. On the colored Tutte polynomial of a graph of bounded treewidth

Volume 154, Issue 5

693 -- 0Celso C. Ribeiro. Preface
695 -- 702Dario J. Aloise, Daniel Aloise, Caroline T. M. Rocha, Celso C. Ribeiro, José C. Ribeiro Filho, Luiz S. S. Moura. Scheduling workover rigs for onshore oil production
703 -- 717Rafael Andrade, Abilio Lucena, Nelson Maculan. Using Lagrangian dual information to generate degree constrained spanning trees
718 -- 729Jacek Blazewicz, Marta Kasprzak. Computational complexity of isothermic DNA sequencing by hybridization
730 -- 737Alfredo Candia-Véjar, Hugo Bravo-Azlán. Worst-case performance of Wong s Steiner tree heuristic
738 -- 753Alberto Caprara, Michele Monaci, Paolo Toth, Pier Luigi Guida. A Lagrangian heuristic algorithm for a real-world train timetabling problem
754 -- 769Irène Charon, Olivier Hudry. Noising methods for a clique partitioning problem
770 -- 801Pablo E. Coll, Celso C. Ribeiro, Cid C. de Souza. Multiprocessor scheduling under precedence constraints: Polyhedral results
802 -- 817Pierre Hansen, Nenad Mladenovic. First vs. best improvement: An empirical study
818 -- 825Lilian Markenzon, C. M. Justel, N. Paciornik. Subclasses of ::::k::::-trees: Characterization and recognition
826 -- 847Isabel Méndez-Díaz, Paula Zabala. A Branch-and-Cut algorithm for graph coloring
848 -- 860Nikola S. Nikolov, Alexandre Tarassov. Graph layering by promotion of nodes
861 -- 866Nei Y. Soma, J. P. Melo. On irreversibility of von Neumann additive cellular automata on grids
867 -- 879Andres Weintraub, Alan T. Murray. Review of combinatorial problems induced by spatial forest harvesting planning

Volume 154, Issue 4

609 -- 0Evripidis Bampis, Klaus Jansen. Introduction
611 -- 621Leah Epstein, Rob van Stee. Optimal on-line flow time with resource augmentation
622 -- 639Foto N. Afrati, Ioannis Milis. Designing PTASs for MIN-SUM scheduling problems
640 -- 649Monaldo Mastrolilli, Marcus Hutter. Hybrid rounding techniques for knapsack problems
650 -- 659Benjamin Doerr. Non-independent randomized rounding and coloring
660 -- 672Daniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss. Coloring mixed hypertrees
673 -- 683Thomas Erlebach, Danica Vukadinovic. Path problems in generalized stars, complete graphs, and brick wall graphs
684 -- 691Taneli Mielikäinen, Esko Ukkonen. The complexity of maximum matroid-greedoid intersection and weighted greedoid maximization:::, :::

Volume 154, Issue 3

437 -- 446Peter Butkovic, Karel Zimmermann. A strongly polynomial algorithm for solving two-sided linear systems in max-algebra
447 -- 451Vesa Halava, Tero Harju, Mika Hirvensalo. Positivity of second order linear recurrent sequences
452 -- 470Paola Bonizzoni, Clelia de Felice, Giancarlo Mauri, Rosalba Zizza. Linear splicing and syntactic monoid
471 -- 477Arthur H. Busch. A characterization of triangle-free tolerance graphs
478 -- 484Peter Damaschke. Randomized vs. deterministic distance query strategies for point location on the line
485 -- 492Célia Picinin de Mello, Aurora Morgana, M. Liverani. The clique operator on graphs with few ::::P::::::4:: s
493 -- 507Jean Diatta. Description-meet compatible multiway dissimilarities
508 -- 524Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko. The Hamiltonian problem on distance-hereditary graphs
525 -- 536Chuan-Min Lee, Maw-Shang Chang. Distance-hereditary graphs are clique-perfect
537 -- 551Valery A. Liskovets. Exact enumeration of acyclic deterministic automata
552 -- 563Jaume Martí-Farré, Carles Padró. Secret sharing schemes on access structures with intersection number equal to one
564 -- 586Cécile Murat, Vangelis Th. Paschos. On the probabilistic minimum coloring and minimum ::::k::::-coloring
587 -- 593Victor J. W. Guo, Jiang Zeng. The number of convex polyominoes and the generating function of Jacobi polynomials
594 -- 597Sonoko Moriyama, Masahiro Hachimori. ::::h::::-Assignments of simplicial complexes and reverse search
598 -- 603Wei-Fan Wang. The ::::L::::(2, 1)-labelling of trees

Volume 154, Issue 2

173 -- 0Pascale Charpin, Gregory Kabatianski. Special Issue on Coding and Cryptography
175 -- 188Jan Camenisch, Maciej Koprowski. Fine-grained forward-secure signature schemes without random oracles
189 -- 201Sébastien Canard, Berry Schoenmakers, Martijn Stam, Jacques Traoré. List signature schemes
202 -- 218Anne Canteaut, Magnus Daum, Hans Dobbertin, Gregor Leander. Finding nonnormal bent functions
219 -- 233Paolo D Arco, Wataru Kishimoto, Douglas R. Stinson. Properties and constraints of cheating-immune secret sharing schemes
234 -- 252Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci. Unconditionally secure key assignment schemes
253 -- 269Ilya Dumer, Kirill Shabunov. Recursive error correction for general Reed-Muller codes
270 -- 276Régis Dupont, Andreas Enge. Provably secure non-interactive key distribution based on pairings
277 -- 293Sandy Ferret, Leo Storme. A classification result on weighted {::::delta::::::::v::::::::::µ::::+1::, ::::delta::::::::v::::::::::µ::::::;::::N::::, ::::p:::::::3:::}-minihypers
294 -- 304Jürgen Freudenberger, Victor V. Zyablov. On the complexity of suboptimal decoding for list and decision feedback schemes
305 -- 312Ernst M. Gabidulin, Nina I. Pilipchuk. Symmetric matrices and codes correcting rank errors beyond the [(::::d::::-1)/2] bound
313 -- 325Xiang-dong Hou. Affinity of permutations of P::2:::::n:::
326 -- 336Eike Kiltz, Arne Winterhof. Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem
337 -- 345Alexey S. Kuzmin, Viktor T. Markov, Alexander A. Nechaev, A. S. Neljubin. A generalization of the binary Preparata code
346 -- 356San Ling, Chaoping Xing, Ferruh Özbudak. An explicit class of codes with good parameters and their duals
357 -- 369Subhamoy Maitra, Enes Pasalic. A Maiorana-McFarland type construction for resilient Boolean functions on ::::n:::: variables (::::n:::: even) with nonlinearity >2:::::::n::::-1:::-2:::::::n::::/2:::+2:::::::n::::/2-2:::
370 -- 381Ueli M. Maurer. Secure multi-party computation made simple
382 -- 391Tommi Meskanen, Ari Renvall. A wrap error attack against NTRUEncrypt
392 -- 398Ronan Quarez. Some subsets of points in the plane associated to truncated Reed-Muller codes with good parameters
399 -- 412John A. Ryan, Patrick Fitzpatrick. Enumeration of inequivalent irreducible Goppa codes
413 -- 419Ana Salagean. Repeated-root cyclic and negacyclic codes over a finite chain ring
420 -- 436Hervé Sibert, Patrick Dehornoy, Marc Girault. Entity authentication schemes using braid word reduction

Volume 154, Issue 18

2545 -- 2564Marcus Brazil, D. A. Thomas, J. F. Weng. Locally minimal uniformly oriented shortest networks
2565 -- 2576Bart De Schuymer, Hans De Meyer, Bernard De Baets. Optimal strategies for equal-sum dice games
2577 -- 2589Tassos Dimitriou, Sotiris E. Nikoletseas, Paul G. Spirakis. The infection time of graphs
2590 -- 2598Guang Gong, Hong-Yeop Song. Two-tuple balance of non-binary sequences with ideal two-level autocorrelation
2599 -- 2608Fred R. McMorris, Henry Martyn Mulder, Robert C. Powers. The t-median function on graphs
2609 -- 2612Jinfeng Feng, Shengjia Li, Ruijuan Li. An s-strong tournament with s>=3 has s+1 vertices whose out-arcs are 4-pancyclic
2613 -- 2619Gregory Gutin, Tommy R. Jensen, Anders Yeo. Domination analysis for minimum multiprocessor scheduling
2620 -- 0Refael Hassin, Shlomi Rubinstein. Erratum to An approximation algorithm for maximum triangle packing : [Discrete Applied Mathematics 154 (2006) 971-979]

Volume 154, Issue 17

2445 -- 2457Tiziana Calamoneri, Rossella Petreschi. lambda-Coloring matrogenic graphs
2458 -- 2469Tomás Feder, Pavol Hell, Kim Tucker-Nally. Digraph matrix partitions and trigraph homomorphisms
2470 -- 2483Stefan Felsner, Ferran Hurtado, Marc Noy, Ileana Streinu. Hamiltonicity and colorings of arrangement graphs
2484 -- 2498Boris Hollas. An analysis of the redundancy of graph invariants used in chemoinformatics
2499 -- 2510Tero Laihonen. On robust identification in the square and king grids
2511 -- 2529Oleg Pikhurko, Helmut Veith, Oleg Verbitsky. The first order definability of graphs: Upper bounds for quantifier depth
2530 -- 2536Amitabha Tripathi, Sujith Vijay. On the least size of a graph with a given degree set
2537 -- 2543Ying Zhao, Huiling Li. On bent functions with some symmetric properties

Volume 154, Issue 16

2239 -- 2240Naoki Katoh, Hiro Ito. Preface
2242 -- 2246Martin Anthony, Peter L. Hammer. A Boolean measure of similarity
2247 -- 2262Yuichi Asahiro, Takashi Horiyama, Kazuhisa Makino, Hirotaka Ono, Toshinori Sakuma, Masafumi Yamashita. How to collect balls moving in the Euclidean plane
2263 -- 2270Youichi Hanatani, Takashi Horiyama, Kazuo Iwama. Density condensation of Boolean formulas
2271 -- 2290Hideki Hashimoto, Toshihide Ibaraki, Shinji Imahori, Mutsunori Yagiura. The vehicle routing problem with flexible time windows and traveling times
2291 -- 2306Katsumi Inoue, Takehide Soh, Seiji Ueda, Yoshito Sasaura, Mutsunori Banbara, Naoyuki Tamura. A competitive and cooperative approach to propositional satisfiability
2307 -- 2329Toshimasa Ishii, Masayuki Hagiwara. Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs
2330 -- 2334Hiro Ito, Hiroshi Nagamochi. Two equivalent measures on weighted hypergraphs
2335 -- 2349Naoki Katoh, Taihei Yano. An approximation algorithm for the pickup and delivery vehicle routing problem on trees
2350 -- 2372Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich. An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
2373 -- 2386Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki. Minimum edge ranking spanning trees of split graphs
2387 -- 2401Satoko Mamada, Takeaki Uno, Kazuhisa Makino, Satoru Fujishige. An O(n log:::2:::n) algorithm for the optimal sink location problem in dynamic tree networks
2402 -- 2410Keizo Miyata, Shigeru Masuyama, Shin-ichi Nakayama, Liang Zhao. Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem
2411 -- 2417Hiroshi Nagamochi. Sparse connectivity certificates via MA orderings in graphs
2418 -- 2429Mingjun Edward Yan, Tsunehiko Kameda. Generalized Fibonacci broadcasting: An efficient VOD scheme with user bandwidth limit
2430 -- 2443Dao-Zhi Zeng, Liping Fang, Keith W. Hipel, D. Marc Kilgour. Generalized metarationalities in the graph model for conflict resolution

Volume 154, Issue 15

2041 -- 2042Philippe Chrétienne. Preface
2044 -- 2063Alessandro Agnetis, Nicholas G. Hall, Dario Pacciarelli. Supply chain scheduling: Sequence coordination
2064 -- 2079Jean-Louis Bouquard, Christophe Lenté, Jean-Charles Billaut. Application of an optimization problem in Max-Plus algebra to scheduling problems
2080 -- 2096Stanislav Busygin. A new trust region technique for the maximum weight clique problem
2097 -- 2116Irène Charon, Olivier Hudry. A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
2117 -- 2127Michele Flammini, Gaia Nicosia. Competitive algorithms for the bicriteria k-server problem
2128 -- 2149Pierre Fouilhoux, Ali Ridha Mahjoub. Polyhedral results for the bipartite induced subgraph problem
2150 -- 2166Stanislaw Gawiejnowicz, Wieslaw Kurc, Lidia Pankowska. Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences
2167 -- 2177Vasilij Lebedev, Igor Averbakh. Complexity of minimizing the total flow time with interval data and minmax regret criterion
2178 -- 2199Natalia V. Shakhlevich, Vitaly A. Strusevich. Single machine scheduling with controllable release and processing parameters
2200 -- 2211Babacar Thiongane, Anass Nagih, Gérard Plateau. Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem
2212 -- 2238Andreas Westerlund, Maud Göthe-Lundgren, Torbjörn Larsson. A stabilized column generation scheme for the traveling salesman subtour problem

Volume 154, Issue 14

1939 -- 1946Frank E. Bennett, Gennian Ge. Existence of directedwhist tournaments with the three person property 3PDWh(v)
1947 -- 1959Scott T. Chapman, Pedro A. García-Sánchez, D. Llena, José Carlos Rosales. Presentations of finitely generated cancellative commutative monoids and nonnegative solutions of systems of linear equations
1960 -- 1965Miroslav Chlebík, Janka Chlebíková. Hard coloring problems in low degree planar bipartite graphs
1966 -- 1974Kristina Crona. Optimal key systems
1975 -- 1982Jason DeVinney, Carey E. Priebe. A new family of proximity graphs: Class cover catch digraphs
1983 -- 1995J. Mark Keil, Lorna Stewart. Approximating the minimum clique cover and other hard problems in subtree filament graphs
1996 -- 2009Wen An Liu, Hong Yong Ma. Minimal average cost of searching for a counterfeit coin: Restricted model
2010 -- 2023Wen An Liu, Huan Huan Cui, Bing Qing Ma. Searching for a counterfeit coin with b-balance
2024 -- 2031J. A. Rodríguez. The (alpha, beta, s, t)-diameter of graphs: A particular case of conditional diameter
2032 -- 2039Julien Moncel. On graphs on n vertices having an identifying code of cardinality [log::2::(n+1)]

Volume 154, Issue 13

1771 -- 1772Guillermo Durán, Thomas M. Liebling, Martín Matamala. Traces of the Latin American Conference on Combinatorics, Graphs and Applications: A selection of papers from LACGA 2004, Santiago, Chile
1774 -- 1782Luerbio Faria, Celina M. Herrera de Figueiredo, Sylvain Gravier, Candido Ferreira Xavier de Mendonça Neto, Jorge Stolfi. On maximum planar induced subgraphs
1783 -- 1790Guillermo Durán, Min Chih Lin, Sergio Mera, Jayme Luiz Szwarcfiter. Algorithms for clique-independent sets on subclasses of circular-arc graphs
1791 -- 1798Rafael B. Teixeira, Celina M. Herrera de Figueiredo. The sandwich problem for cutsets: Clique cutset, k-star cutset
1799 -- 1802Liliana Alcón. Clique-critical graphs: Maximum size and recognition
1803 -- 1815Hans L. Fetter. Some basic properties of multiple Hamiltonian covers
1816 -- 1823Marcos A. Kiwi. A concentration bound for the longest increasing subsequence of a randomly chosen involution
1824 -- 1844Pablo Burzyn, Flavia Bonomo, Guillermo Durán. NP-completeness results for edge modification problems
1845 -- 1853Mariana S. Escalante, Graciela L. Nasini, M. C. Varaldo. On the commutativity of antiblocker diagrams under lift-and-project operators
1854 -- 1864Gabriela R. Argiroffo, Silvia M. Bianchi, Graciela L. Nasini. On a certain class of nonideal clutters
1865 -- 1876Javier Marenco, Annegret Wagler. On the combinatorial structure of chromatic scheduling polytopes
1877 -- 1884Carlos Eduardo Ferreira, Fernando M. de Oliveira Filho. Some formulations for the group steiner tree problem
1885 -- 1896Héctor Cancela, Louis Petingi. On the characterization of the domination of a diameter-constrained network reliability model
1897 -- 1907Benjamin Hiller, Sven Oliver Krumke, Jörg Rambau. Reoptimization gaps versus model errors in online-dispatching of service units for ADAC
1908 -- 1931Philipp Friese, Jörg Rambau. Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models
1932 -- 1938Sebastián Urrutia, Celso C. Ribeiro. Maximizing breaks and bounding solutions to the mirrored traveling tournament problem

Volume 154, Issue 12

1649 -- 1673R. Julian R. Abel, Norman J. Finizio, Gennian Ge, Malcolm Greig. New Z-cyclic triplewhist frames and triplewhist tournament designs
1674 -- 1684Eyal Ackerman, Gill Barequet, Ron Y. Pinter. A bijection between permutations and floorplans, and its applications
1685 -- 1692Eric Angel, Evripidis Bampis, Laurent Gourvès. Approximation algorithms for the bi-criteria weighted MAX-CUT problem
1693 -- 1708Iliya Bouyukliev. On the binary projective codes with dimension 6
1709 -- 1721Fabien Coulon, Mathieu Raffinot. Fast algorithms for identifying maximal common connected sets of interval graphs
1722 -- 1741Christophe Crespelle, Christophe Paul. Fully dynamic recognition algorithm and certificate for directed cographs
1742 -- 1752Walter Morris. Coloring copoints of a planar point set
1753 -- 1758Weili Wu, Yaochun Huang, Xiao Huang, Yingshu Li. On error-tolerant DNA screening
1759 -- 1762Hung-Lin Fu, Frank K. Hwang. A novel use of t-packings to construct d-disjunct matrices
1763 -- 1765Simone Severini. On the structure of the adjacency matrix of the line digraph of a regular digraph
1766 -- 1770Yuqin Zhang, Yonghui Fan. M::2::-equipackable graphs

Volume 154, Issue 11

1547 -- 1562Klaus Holzapfel, Sven Kosub, Moritz G. Maaß, Hanjo Täubig. The complexity of detecting fixed-density clusters
1563 -- 1569Joan Hutchinson, André Kündgen. Orthogonal art galleries with interior walls
1570 -- 1577Dimitri Kagaris. A similarity transform for linear finite state machines
1578 -- 1592Ton Kloks, Dieter Kratsch, Chuan-Min Lee, Jiping Liu. Improved bottleneck domination algorithms
1593 -- 1605Toufik Mansour, Eva Yu-Ping Deng, Rosena R. X. Du. Dyck paths and restricted permutations
1606 -- 1614Huifang Miao, Xiaofeng Guo. Lower and upper orientable strong radius and strong diameter of complete k-partite graphs
1615 -- 1621Young-Soo Myung. Multicommodity flows in cycle graphs
1622 -- 1632Zhizheng Zhang, Jun Wang. Bernoulli matrix and its algebraic properties
1633 -- 1639Stephen G. Hartke. The elimination procedure for the competition number is not optimal
1640 -- 1644Wenjun Xiao. Some results on diameters of Cayley graphs
1645 -- 1646Eckhard Steffen, Tomaz Pisanski, Marko Boben, Natasa Ravnik. Erratum to Reduction of symmetric configurations n::3:: [Discrete Appl. Math. 99 (1-3) (2000) 401 -411]

Volume 154, Issue 10

1465 -- 1477Martin Charles Golumbic, Aviad Mintz, Udi Rotics. Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees
1478 -- 1499Jonathan K. Hodge. Permutations of separable preference orders
1500 -- 1509Christos Kaklamanis, Danny Krizanc, Manuela Montangero, Giuseppe Persiano. Efficient automatic simulation of parallel computation on networks of workstations
1510 -- 1521Jörn Quistorff. New upper bounds on Lee codes
1522 -- 1540Christopher Schwarz, Denise Sakai Troxell. L(2, 1)-labelings of Cartesian products of two cycles
1541 -- 1546Baogen Xu. Two classes of edge domination in graphs

Volume 154, Issue 1

1 -- 5Brian C. Dean. A simple expected running time analysis for randomized divide and conquer algorithms
6 -- 14Michael Laszlo, Sumitra Mukherjee. A class of heuristics for the constrained forest problem
15 -- 34Chandra Chekuri, Guy Even, Guy Kortsarz. A greedy approximation algorithm for the group Steiner problem
35 -- 46Marie-Christine Costa, Dominique de Werra, Christophe Picouleau. Using graphs for some discrete tomography problems
47 -- 58Dominique de Werra, Tinaz Ekim, C. Raess. Construction of sports schedules with multiple venues
59 -- 75Jean E. Dunbar, David J. Erwin, Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi. Broadcasts in graphs
76 -- 105Ruo-Wei Hung, Maw-Shang Chang. Solving the path cover problem on circular-arc graphs by using an approximation algorithm
106 -- 119Huiqing Liu, Mei Lu, Feng Tian. Trees of extremal connectivity index
120 -- 144Christophe Meyer, Brigitte Jaumard. Equivalence of some LP-based lower bounds for the ::::Golomb ruler:::: problem
145 -- 157Weigen Yan, Fuji Zhang. Enumeration of perfect matchings of a type of Cartesian products of graphs
158 -- 165Ivo Blöchliger, Dominique de Werra. Locally restricted colorings
166 -- 172Ko-Wei Lih, Chen-Ying Lin, Li-Da Tong. On an interpolation property of outerplanar graphs