Journal: Discrete Applied Mathematics

Volume 155, Issue 9

1077 -- 0Giuseppe Liotta, Henk Meijer. Advances in graph drawing: The 11th International Symposium on Graph Drawing
1079 -- 1095Hubert de Fraysseix, Patrice Ossona de Mendez. Barycentric systems and stretchability
1096 -- 1105Jakub Cerný, Zdenek Dvorak, Vít Jelínek, Jan Kára. Noncrossing Hamiltonian paths in geometric graphs
1106 -- 1115Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto. On k-planar crossing numbers
1116 -- 1140Ashim Garg, Adrian Rusu. Area-efficient planar straight-line drawings of outerplanar graphs
1141 -- 1154Toru Hasunuma. Queue layouts of iterated line directed graphs
1155 -- 1174Hiroshi Nagamochi, Katsutoshi Kuroya. Drawing c-planar biconnected clustered graphs

Volume 155, Issue 8

889 -- 897Stavros G. Kolliopoulos, George Steiner. Partially ordered knapsack and applications to scheduling
898 -- 903Gianluca De Marco, Marco Pellegrini, Giovanni Sburlati. Faster deterministic wakeup in multiple access channels
904 -- 913Kejun Chen, Ruizhong Wei. Super-simple (v, 5, 4) designs
914 -- 928Magnus Bordewich, Charles Semple. Computing the minimum number of hybridization events for a consistent evolutionary history
929 -- 944Sergey Kitaev. Introduction to partially ordered patterns
945 -- 970Joseph Y.-T. Leung, Haibing Li, Michael Pinedo. Scheduling orders for multiple product types to minimize total weighted completion time
971 -- 978Seog-Jin Kim, Suh-Ryung Kim, Yoomi Rho. On CCE graphs of doubly partial orders
979 -- 988Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten. Efficient algorithms for decomposing graphs under degree constraints
989 -- 1006Elizabeth Goode, Dennis Pixton. Recognizing splicing languages: Syntactic monoids and simultaneous pumping
1007 -- 1013. Distance-two labelings of digraphs
1014 -- 1030Chiara Epifanio, Filippo Mignosi, Jeffrey Shallit, Ilaria Venturini. On Sturmian graphs
1031 -- 1037Sunghyu Han, June Bok Lee. Nonexistence of near-extremal formally self-dual even codes of length divisible by 8
1038 -- 1043Jiping Liu, Yuejian Peng, Cheng Zhao. Characterization of P::6::-free graphs
1044 -- 1054Yumei Hu, Xueliang Li, Yongtang Shi, Tianyi Xu. Connected (n, m)-graphs with minimum and maximum zeroth-order general Randic index
1055 -- 1065Brian Lucena. Achievable sets, brambles, and sparse treewidth obstructions
1066 -- 1070A. M. Youssef. Generalized hyper-bent functions over GF(p)
1071 -- 1075W. Kook. Edge-rooted forests and the alpha-invariant of cone graphs

Volume 155, Issue 6-7

673 -- 674Sorin Istrail, Pavel A. Pevzner, Ron Shamir. Preface
676 -- 685Tatsuya Akutsu, Hideo Bannai, Satoru Miyano, Sascha Ott. On the complexity of deriving position specific score matrices from positive and negative sequences
686 -- 694Liliana Alcón, Márcia R. Cerioli, Celina M. Herrera de Figueiredo, Marisa Gutierrez, Joao Meidanis. Tree loop graphs
695 -- 706Alberto Apostolico, Cinzia Pizzi. Motif discovery by monotone scores
707 -- 718Nikhil Bansal, Mark Cieliebak, Zsuzsanna Lipták. Finding submasses in weighted strings with Fast Fourier Transform
719 -- 732Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robert H. Sloan, György Turán, Yi Zhang. The inverse protein folding problem on 2D and 3D lattices
733 -- 749Piotr Berman, Bhaskar DasGupta, Eduardo D. Sontag. Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks
750 -- 758Benny Chor, Michael D. Hendy, David Penny. Analytic solutions for three taxon ML trees with variable rates across sites
759 -- 787Peter Clote, Evangelos Kranakis, Danny Krizanc, Ladislav Stacho. Asymptotic expected number of base pairs in optimal secondary structure for random RNA using the Nussinov-Jacobson energy model
788 -- 805Jens Gramm, Till Nierhoff, Roded Sharan, Till Tantau. Haplotyping with missing data via perfect path phylogenies
806 -- 830Dan Gusfield, Dean Hickerson, Satish Eddhu. An efficiently computed lower bound on the number of recombinations in phylogenetic networks: Theory and empirical study
831 -- 839Oliver D. King, Philippe Gaborit. Binary templates for comma-free DNA codes
840 -- 856Gunnar W. Klau, Sven Rahmann, Alexander Schliep, Martin Vingron, Knut Reinert. Integer linear programming approaches for non-unique probe selection
857 -- 867Steven Skiena, Sagi Snir. Restricting SBH ambiguity via restriction enzymes
868 -- 880Valery T. Stefanov, Stéphane Robin, Sophie Schbath. Waiting times for clumps of patterns and for structured motifs in random sequences
881 -- 888Eric Tannier, Anne Bergeron, Marie-France Sagot. Advances on sorting by reversals

Volume 155, Issue 5

585 -- 597C. N. Campos, Célia Picinin de Mello. A result on the total colouring of powers of cycles
598 -- 610Tamar Eilam, Cyril Gavoille, David Peleg. Average stretch analysis of compact routing schemes
611 -- 622Martin Gavalec, Ján Plávka. Simple image set of linear mappings in a max-min algebra
623 -- 648David Pisinger. The quadratic knapsack problem - a survey
649 -- 653Piotr Berman, Marek Karpinski, Alexander D. Scott. Computational complexity of some restricted instances of 3-SAT
654 -- 661Haiyan Chen, Fuji Zhang. Resistance distance and the normalized Laplacian spectrum
662 -- 664Hong-Bin Chen, Frank K. Hwang. Exploring the missing link among d-separable, d:::_:::-separable and d-disjunct matrices
665 -- 669Qingshu Meng, Huanguo Zhang, Min Yang, Jingsong Cui. On the degree of homogeneous bent functions
670 -- 671Amitabha Tripathi, Sujith Vijay. A short proof of a theorem on degree sets of graphs

Volume 155, Issue 4

429 -- 441Moncef Abbas, Marc Pirlot, Philippe Vincke. Tangent circle graphs and orders
442 -- 456Jørgen Bang-Jensen, Jing Huang, Louis Ibarra. Recognizing and representing proper interval graphs in parallel using merging and sorting
457 -- 467Sergey Bereg, Hao Wang. Wiener indices of balanced binary trees
468 -- 495Valentin E. Brimkov, David Coeurjolly, Reinhard Klette. Digital planarity - A review
496 -- 505Francesc Carreras. Automorphisms and blocking in simple games
506 -- 514Tomás Dvorák. Dense sets and embedding binary trees into hypercubes
515 -- 522Mohamed H. El-Zahar, Soheir M. Khamis, Kh. M. Nazzal. On the domination number of the cartesian product of the cycle of length n and any graph
523 -- 537Hiroshi Nagamochi, Yuusuke Abe. An approximation algorithm for dissecting a rectangle into rectangles with specified areas
538 -- 547Nigel P. Smart, Frederik Vercauteren. On computable isomorphisms in efficient asymmetric pairing-based systems
548 -- 557Robin Strand, Benedek Nagy. Distances based on neighbourhood sequences in non-standard three-dimensional grids
558 -- 565Manouchehr Zaker. Maximum transversal in partial Latin squares and rainbow matchings
566 -- 571Ting Chen, Frank K. Hwang. A competitive algorithm in searching for many edges in a hypergraph
572 -- 578Refael Hassin, Asaf Levin. Flow trees for vertex-capacitated networks
579 -- 583Mohit Singh, Amitabha Tripathi. On an extremal problem related to a theorem of Whitney

Volume 155, Issue 3

257 -- 259José R. Correa, Samuel Fiorini, Nicolás E. Stier Moses. A note on the precedence-constrained class sequencing problem
260 -- 270Omran Ahmadi, Darrel Hankerson, Alfred Menezes. Formulas for cube roots in F::3:::m:::::
271 -- 278Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Clemens Huemer. Connecting colored point sets
279 -- 287Francine Blanchet-Sadri, Arundhati R. Anavekar. Testing primitivity on partial words
288 -- 299Ferdinando Cicalese, Peter Damaschke, Libertad Tansini, Sören Werth. Overlaps help: Improved bounds for group testing with interval queries
300 -- 311Antonio Fernández, Tom Leighton, José Luis López-Presa. Containment properties of product and power graphs
312 -- 326Philippe Galinier, Alain Hertz. Solution techniques for the Large Set Covering Problem
327 -- 336Petr Kolman, Tomasz Walen. Approximating reversal distance for strings with bounded number of duplicates
337 -- 355Christian Liebchen, Romeo Rizzi. Classes of cycle bases
356 -- 364Ortrud R. Oellermann, Joel Peters-Fransen. The strong metric dimension of graphs and digraphs
365 -- 373Alan P. Sprague. O(1) query time algorithm for all pairs shortest distances on permutation graphs
374 -- 385László A. Székely, Hua Wang. Binary trees with the largest number of subtrees
386 -- 393Boaz Tsaban. Decompositions of graphs of functions and fast iterations of lookup tables
394 -- 399Faryad Ali. On the ranks of O N and Ly
400 -- 404Guantao Chen, Richard H. Schelp. Decomposition of bipartite graphs into special subgraphs
405 -- 409Yuanqiu Huang, Yuming Chu. A note on the computational complexity of graph vertex partition
410 -- 415Vladimir Nikiforov, Richard H. Schelp. Making the components of a graph k-connected
416 -- 422Xiangtong Qi. A note on worst-case performance of heuristics for maintenance scheduling problems
423 -- 427Bhalchandra D. Thatte. A correct proof of the McMorris-Powers theorem on the consensus of phylogenies

Volume 155, Issue 2

79 -- 80Jan Kratochvíl, Josep Díaz, Jirí Fiala. Editorial
82 -- 91Zeev Nutov, Raphael Yuster. Packing directed cycles efficiently
92 -- 102Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic, Gerhard J. Woeginger. Eliminating graphs by means of parallel knock-out schemes
103 -- 118Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi. Complexity results in graph reconstruction
119 -- 136Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou. Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs
137 -- 149Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino. Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
150 -- 160Robert Elsässer, Ulf Lorenz, Thomas Sauerwald. Agent-based randomized broadcasting in large networks
161 -- 171Nadine Baumann, Ekkehard Köhler. Approximating earliest arrival flows with flow-dependent transit times
172 -- 179Miroslav Chlebík, Janka Chlebíková. Minimum 2SAT-DELETION: Inapproximability results and relations to Minimum Vertex Cover
180 -- 193Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia. Polynomial time approximation schemes and parameterized complexity
194 -- 209Andre Gronemeier. Approximating Boolean functions by OBDDs
210 -- 229Henrik Björklund, Sergei G. Vorobyov. A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
230 -- 256Hans-Joachim Böckenhauer, Dirk Bongartz. Protein folding in the HP model on grid lattices with diagonals

Volume 155, Issue 18

2401 -- 2402Ali Ünlü, Silke Brandt, Dietrich Albert. Corrigendum to Surmise relations between tests - mathematical considerations : [Discrete Applied Mathematics 127 (2003) 221-239]
2403 -- 2413Adrien Richard, Jean-Paul Comet. Necessary conditions for multistationarity in discrete dynamical systems
2414 -- 2425Vadim E. Levit, Eugen Mandrescu. Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids
2426 -- 2434Elena V. Konstantinova. Reconstruction of permutations distorted by reversal errors
2435 -- 2443Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter. Characterization and recognition of generalized clique-Helly graphs
2444 -- 2455Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez, Xavier Marcote. On the edge-connectivity and restricted edge-connectivity of a product of graphs
2456 -- 2470Jung Jin Cho, Yong Chen, Yu Ding. On the (co)girth of a connected matroid
2471 -- 2486Yun Sheng Chung, Chin Lung Lu, Chuan Yi Tang. Constrained sequence alignment: A general model and the hardness results
2487 -- 2495Arthur H. Busch, Michael Ferrara, Nathan Kahl. Generalizing D-graphs
2496 -- 2506Mohammad Javaheri. Dirichlet problem on locally finite graphs
2507 -- 2522András Hajdu, Lajos Hajdu, Robert Tijdeman. General neighborhood sequences in Z:::n:::
2523 -- 2538Toshimasa Ishii, Hitoshi Fujita, Hiroshi Nagamochi. The source location problem with local 3-vertex-connectivity requirements
2539 -- 2545Stefan Hougardy, Ivo Köthnig. Computation of best possible low degree expanders
2546 -- 2554Judith Nagy-György, Csanád Imreh. Online scheduling with machine cost and rejection
2555 -- 2566Jesse D. Bingham, Brad Bingham. Hybrid one-dimensional reversible cellular automata are regular
2567 -- 2572Manouchehr Zaker. Inequalities for the Grundy chromatic number of graphs
2573 -- 2584Gi-Sang Cheon, Suk-Geun Hwang, Sang-Gu Lee. Several polynomials associated with the harmonic numbers
2585 -- 2593Dong Chen, Weifan Wang. (2, 1)-Total labelling of outerplanar graphs
2594 -- 2600Glenn H. Hurlbert. On encodings of spanning trees
2601 -- 2611Dariusz Dereniowski. Easy and hard instances of arc ranking in directed graphs
2612 -- 2624Bruce Elenbogen, John Frederick Fink. Distance distributions for graphs modeling computer networks
2625 -- 2636Fanica Gavril. 3D-interval-filament graphs

Volume 155, Issue 17

2187 -- 2201William Y. C. Chen, Nelson Y. Li, Louis W. Shapiro. The butterfly decomposition of plane trees
2202 -- 2210Robert J. Cimikowski, Brendan Mumey. Approximating the fixed linear crossing number
2211 -- 2226David Abelson, Seok-Hee Hong, Donald E. Taylor. Geometric automorphism groups of graphs
2227 -- 2235Alan Shuchat, Randy Shull, Ann N. Trenk. The fractional weak discrepancy of a partially ordered set
2236 -- 2241Wei Cao, Qi Sun. A new characterization of dual bases in finite fields and its applications
2242 -- 2256Ruo-Wei Hung, Maw-Shang Chang. Finding a minimum path cover of a distance-hereditary graph in polynomial time
2257 -- 2268Mike Develin, Stephen G. Hartke. Fire containment in grids of dimension three and higher
2269 -- 2281Haizhen Ren, Fuji Zhang. Extremal double hexagonal chains with respect to k-matchings and k-independent sets
2282 -- 2293José María Alonso-Meijide, Francesc Carreras, María Albina Puente. Axiomatic characterizations of the symmetric coalitional binomial semivalues
2294 -- 2302Douglas J. Klein, Tomislav Doslic, Danail Bonchev. Vertex-weightings for distance moments and thorny graphs
2303 -- 2311Bostjan Bresar, Sandi Klavzar, Douglas F. Rall. On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
2312 -- 2320Rui Wang, Francis C. M. Lau, Yingchao Zhao. Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices
2321 -- 2327Yongde Feng, Qiongxiang Huang. Consecutive edge-coloring of the generalized theta-graph
2328 -- 2340Mamadou Moustapha Kanté. Vertex-minor reductions can simulate edge contractions
2341 -- 2354George Steiner, Paul Stephenson. Pareto optima for total weighted completion time and maximum lateness on a single machine
2355 -- 2361Minghui Jiang. On finding a large number of 3D points with a small diameter
2362 -- 2364Wilfried Imrich, Sandi Klavzar, Douglas F. Rall. Cancellation properties of products of graphs
2365 -- 2370Xueliang Li, Yongtang Shi. Corrections of proofs for Hansen and Mélot s two theorems
2371 -- 2376Zhizheng Zhang, Xin Wang. A factorization of the symmetric Pascal matrix involving the Fibonacci matrix
2377 -- 2382Katerina Asdre, Kyriaki Ioannidou, Stavros D. Nikolopoulos. The harmonious coloring problem is NP-complete for interval and permutation graphs
2383 -- 2390Yota Otachi, Yoshio Okamoto, Koichi Yamazaki. Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs
2391 -- 2393Sarah Spence Adams, Matthew Tesch, Denise Sakai Troxell, Bradford Westgate, Cody Wheeland. On the hole index of L(2, 1)-labelings of r-regular graphs
2394 -- 2400Bostjan Bresar, Tadeja Kraner Sumenjak. On the 2-rainbow domination in graphs

Volume 155, Issue 16

2043 -- 2052Kuan-Yu Chen, Kun-Mao Chao. On the range maximum-sum segment query problem
2053 -- 2060Camino Balbuena, Josep Fàbrega, Pedro García-Vázquez. Edge-connectivity and edge-superconnectivity in sequence graphs
2061 -- 2068Gustav Nordh. NP-completeness of generalized multi-Skolem sequences
2069 -- 2076Vilas S. Kharat, B. N. Waphare, N. K. Thakare. Reducibility number
2077 -- 2086T. C. Edwin Cheng, L. Y. Kang, C. T. Ng. Paired domination on interval and circular-arc graphs
2087 -- 2092F. H. Chang, J. Y. Guo, Frank K. Hwang, J. S. Lee. Counting disjoint 2-partitions for points in the plane
2093 -- 2110Vicky Mak, Natashia Boland. Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs
2111 -- 2117Peter Dankelmann, Angelika Hellwig, Lutz Volkmann. On the connectivity of diamond-free graphs
2118 -- 2129Robert W. Irving, Sandy Scott. The stable fixtures problem - A many-to-many extension of stable roommates
2130 -- 2139Bruno Martin, Claudine Peyrat. A single-copy minimal-time simulation of a torus of automata by a ring of automata
2140 -- 2151Jianping Li, Lusheng Wang, Hao Zhao. On packing and coloring hyperedges in a cycle
2152 -- 2164Martin Kutrib, Andreas Malcher. Finite turns and the regular closure of linear context-free languages
2165 -- 2173Changhong Lu, Mingqing Zhai. An extremal problem on non-full colorable graphs
2174 -- 2180Palash Sarkar. Construction of universal one-way hash functions: Tree hashing revisited
2181 -- 2186Stanislav Jendrol, Frantisek Kardos. On octahedral fulleroids

Volume 155, Issue 15

1895 -- 1909Tian-Xiao He, Leetsch C. Hsu, Peter Jau-Shyong Shiue. The Sheffer group and the Riordan group
1910 -- 1929Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno. Matroid representation of clique complexes
1930 -- 1942Vera Kurková, Marcello Sanguineti. Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets
1943 -- 1957Christine T. Cheng. The test suite generation problem: Optimal instances and their implications
1958 -- 1970Francesco Maffioli, Romeo Rizzi, Stefano Benati. Least and most colored bases
1971 -- 1978Hung-Chang Chan, Jou-Ming Chang, Yue-Li Wang, Shi-Jinn Horng. Geodesic-pancyclic graphs
1979 -- 2000Yash P. Aneja, Ramaswamy Chandrasekaran, Santosh N. Kabadi, K. P. K. Nair. Flows over edge-disjoint mixed multipaths and applications
2001 -- 2016Gwénaël Richomme, Francis Wlazinski. Existence of finite test-sets for k-power-freeness of uniform morphisms
2017 -- 2024Pavel Trojovský. On some identities for the Fibonomial coefficients via generating function
2025 -- 2030Sheng-Liang Yang, Hong You. On a connection between the Pascal, Stirling and Vandermonde matrices
2031 -- 2038Ulrich Faigle, Bernhard Fuchs, Britta Peis. Note on maximal split-stable subgraphs
2039 -- 2042Jinsoo Oh, Byung Ro Moon. On the L::2::-discrepancy

Volume 155, Issue 14

1795 -- 1811Timothée Bossart, Alix Munier Kordon, Francis Sourd. Memory management optimization problems for integrated circuit simulators
1812 -- 1825Valentin E. Brimkov. Algorithmic and explicit determination of the Lovász number for certain circulant graphs
1826 -- 1832Vânia M. F. Dias, Celina M. Herrera de Figueiredo, Jayme Luiz Szwarcfiter. On the generation of bicliques of a graph
1833 -- 1836Guido Helden. Each maximal planar graph with exactly two separating triangles is Hamiltonian
1837 -- 1841Sergei Kucherenko, Pietro Belotti, Leo Liberti, Nelson Maculan. New formulations for the Kissing Number Problem
1842 -- 1845Shengjia Li, Ruijuan Li, Jinfeng Feng. An efficient condition for a graph to be Hamiltonian
1846 -- 1857Dmitrii Lozovanu, Stefan Pickl. Algorithms for solving multiobjective discrete control problems and dynamic c-games on networks
1858 -- 1877Stavros D. Nikolopoulos, Leonidas Palios. On the parallel computation of the biconnected and strongly connected co-components of graphs
1878 -- 1884A. N. M. Salman, H. J. Broersma. Path-kipas Ramsey numbers
1885 -- 1893Karol Suchan, Ioan Todinca. On powers of graphs of bounded NLC-width (clique-width)

Volume 155, Issue 13

1643 -- 1666Dvir Shabtay, George Steiner. A survey of scheduling with controllable processing times
1667 -- 1677Lars Engebretsen. Bipartite multigraphs with expander-like properties
1678 -- 1688Wenzhong Liu, Yanpei Liu, Yan Xu. A census of boundary cubic rooted planar maps
1689 -- 1699David Avis, Tsuyoshi Ito. New classes of facets of the cut polytope and tightness of I::mm22:: Bell inequalities
1700 -- 1707M. Atapour, Abdollah Khodkar, Seyed Mahmoud Sheikholeslami. Characterization of double domination subdivision number of trees
1708 -- 1714Robert C. Brigham, Ronald D. Dutton, Stephen T. Hedetniemi. Security in graphs
1715 -- 1730Maxim A. Babenko, Alexander V. Karzanov. Free multiflows in bidirected and skew-symmetric graphs
1731 -- 1744Michael J. Todd, E. Alper Yildirim. On Khachiyan s algorithm for the computation of minimum-volume enclosing ellipsoids
1745 -- 1751Camino Balbuena, Pedro García-Vázquez. A sufficient condition for P::k::-path graphs being r-connected
1752 -- 1760Wenjun Xiao, Behrooz Parhami. Further mathematical properties of Cayley digraphs applied to hexagonal and honeycomb meshes
1761 -- 1768Dominique Barth, Johanne Cohen, Taoufik Faik. On the b-continuity property of graphs
1769 -- 1773Anton Cerný. On fairness of D0L systems
1774 -- 1792Branko Curgus, Krzysztof Kolodziejczyk. On a convex operator for finite sets

Volume 155, Issue 12

1514 -- 1524Henry A. Kautz, Bart Selman. The state of SAT
1525 -- 1538Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou, Malvina Vamvakari, Michele Zito. The unsatisfiability threshold revisited
1539 -- 1548Ilya Shlyakhter. Generating effective symmetry-breaking predicates for search problems
1549 -- 1561Eugene Goldberg, Yakov Novikov. BerkMin: A fast and robust Sat-solver
1562 -- 1595Brian C. Williams, Robert J. Ragno. Conflict-directed A:::*::: and its role in model-based embedded systems
1596 -- 1603Kazuo Iwama, Suguru Tamaki. Exploiting partial knowledge of satisfying assignments
1604 -- 1612Inês Lynce, João P. Marques Silva. Random backtracking in backtrack search algorithms for satisfiability
1613 -- 1626Ramón Béjar, Felip Manyà, Alba Cabiscol, Cèsar Fernández, Carla P. Gomes. Regular-SAT: A many-valued approach to solving combinatorial problems
1627 -- 1639Delbert D. Bailey, Víctor Dalmau, Phokion G. Kolaitis. Phase transitions of PP-complete satisfiability problems

Volume 155, Issue 11

1345 -- 1347. Peter Ladislaw Hammer: December 23, 1936 to December 27, 2006
1348 -- 1372Hans Leo Bodlaender, Arie M. C. A. Koster. On the maximum cardinality search lower bound for treewidth
1373 -- 1383Nir Halman, Shmuel Onn, Uriel G. Rothblum. The convex dimension of a graph
1384 -- 1394Peter Hamburger, Robert C. Vandell, Matt Walsh. Routing sets in the integer lattice
1395 -- 1407Csilla Bujtás, Zsolt Tuza. Orderings of uniquely colorable hypergraphs
1408 -- 1419Stefan Porschen, Ewald Speckenmeyer. Satisfiability of mixed Horn formulas
1420 -- 1429Mirko Hornák, Zsolt Tuza, Mariusz Wozniak. On-line arbitrarily vertex decomposable trees
1430 -- 1440Toufik Mansour, Vincent Vajnovszki. Restricted 123-avoiding Baxter permutations and the Padovan numbers
1441 -- 1450Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi. Bisecting a 4-connected graph with three resource sets
1451 -- 1457Axel Kohnert. Constructing two-weight codes with prescribed groups of automorphisms
1458 -- 1470Feodor F. Dragan, Irina Lomonosov. On compact and efficient routing in certain graph classes
1471 -- 1480Yusuke Kobayashi, Kazuo Murota. Induction of M-convex functions by linking systems
1481 -- 1496Miklós Bóna, Hyeong-Kwan Ju, Ruriko Yoshida. On the enumeration of certain weighted graphs
1497 -- 1505Changping Wang. The signed star domination numbers of the Cartesian product graphs
1506 -- 1511Ioan Tomescu. On the number of words containing the factor (aba):::k:::

Volume 155, Issue 10

1175 -- 1187Arnold Knopfmacher, Robert F. Tichy, Stephan Wagner, Volker Ziegler. Graphs, partitions and Fibonacci numbers
1188 -- 1199Ma-Lian Chia, David Kuo, Mei-Feng Tung. The multiple originator broadcasting problem in graphs
1200 -- 1212Wen-Qing Xu, Solomon W. Golomb. Optimal interleaving schemes for correcting two-dimensional cluster errors
1213 -- 1223Bang Ye Wu, Hung-Lung Wang, Shih Ta Kuan, Kun-Mao Chao. On the uniform edge-partition of a tree
1224 -- 1232Kazuyuki Amano, Akira Maruoka. Better upper bounds on the QOBDD size of integer multiplication
1233 -- 1243Dieter Rautenbach, Christian Szegedy, Jürgen Werber. The delay of circuits whose inputs have specified arrival times
1244 -- 1253Abdo Y. Alfakih. On dimensional rigidity of bar-and-joint frameworks
1254 -- 1266Ligong Wang, Hajo Broersma, Cornelis Hoede, Xueliang Li, Georg Still. Integral trees of diameter 6
1267 -- 1274Zemin Jin, Huifang Yan, Qinglin Yu. Generalization of matching extensions in graphs (II)
1275 -- 1293Dekel Tsur. Tree-edges deletion problems with bounded diameter obstruction sets
1294 -- 1301Tomislav Doslic, Damir Vukicevic. Computing the bipartite edge frustration of fullerene graphs
1302 -- 1313Changhong Lu, Lei Chen, Mingqing Zhai. Extremal problems on consecutive L(2, 1)-labelling
1314 -- 1325Sarah Spence Adams, Jonathan Cass, Matthew Tesch, Denise Sakai Troxell, Cody Wheeland. The minimum span of L(2, 1)-labelings of certain generalized Petersen graphs
1326 -- 1335Roberto Cordone. A subexponential algorithm for the coloured tree partition problem
1336 -- 1343Douglas Bauer, Hajo Broersma, Nathan Kahl, Aurora Morgana, Edward F. Schmeichel, T. Surowiec. Tutte sets in graphs II: The complexity of finding maximum Tutte sets

Volume 155, Issue 1

1 -- 6B. Ries. Coloring some classes of mixed graphs
7 -- 25Manuel de la Sen, Asier Ibeas. On the stability properties of linear dynamic time-varying unforced systems involving switches between parameterizations from topologic considerations via graph theory
26 -- 43Jean-Luc Marichal, Ivan Kojadinovic, Katsushige Fujimoto. Axiomatic characterizations of generalized values
44 -- 52András Recski, Dávid Szeszlér. Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI
53 -- 60Michael Soltys. The proof theoretic strength of the Steinitz exchange theorem
61 -- 67Maria Isabel Gonzalez Vasco, David Pérez-García. Attacking a public key cryptosystem based on tree replacement
68 -- 73Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg. Finite metrics in switching classes
74 -- 78Baogang Xu, Haihui Zhang. Every toroidal graph without adjacent triangles is (4, 1):::*:::-choosable