Volume 155,
Number 1,
January 2007
Contributions
Notes
Volume 155,
Number 2,
January 2007
29th Symposium on Mathematical Foundations of Computer Science MFCS 2004
- Jan Kratochvíl, Josep Díaz, Jirí Fiala:
Editorial.
79-80
Electronic Edition (link) BibTeX
- Zeev Nutov, Raphael Yuster:
Packing directed cycles efficiently.
82-91
Electronic Edition (link) BibTeX
- Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic, Gerhard J. Woeginger:
Eliminating graphs by means of parallel knock-out schemes.
92-102
Electronic Edition (link) BibTeX
- Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi:
Complexity results in graph reconstruction.
103-118
Electronic Edition (link) BibTeX
- Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou:
Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs.
119-136
Electronic Edition (link) BibTeX
- Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
Enumerating disjunctions and conjunctions of paths and cuts in reliability theory.
137-149
Electronic Edition (link) BibTeX
- Robert Elsässer, Ulf Lorenz, Thomas Sauerwald:
Agent-based randomized broadcasting in large networks.
150-160
Electronic Edition (link) BibTeX
- Nadine Baumann, Ekkehard Köhler:
Approximating earliest arrival flows with flow-dependent transit times.
161-171
Electronic Edition (link) BibTeX
- Miroslav Chlebík, Janka Chlebíková:
Minimum 2SAT-DELETION: Inapproximability results and relations to Minimum Vertex Cover.
172-179
Electronic Edition (link) BibTeX
- Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia:
Polynomial time approximation schemes and parameterized complexity.
180-193
Electronic Edition (link) BibTeX
- Andre Gronemeier:
Approximating Boolean functions by OBDDs.
194-209
Electronic Edition (link) BibTeX
- Henrik Björklund, Sergei G. Vorobyov:
A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games.
210-229
Electronic Edition (link) BibTeX
- Hans-Joachim Böckenhauer, Dirk Bongartz:
Protein folding in the HP model on grid lattices with diagonals.
230-256
Electronic Edition (link) BibTeX
Volume 155,
Number 3,
February 2007
Contributions
- Omran Ahmadi, Darrel Hankerson, Alfred Menezes:
Formulas for cube roots in F3m.
260-270
Electronic Edition (link) BibTeX
- Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Clemens Huemer:
Connecting colored point sets.
271-278
Electronic Edition (link) BibTeX
- Francine Blanchet-Sadri, Arundhati R. Anavekar:
Testing primitivity on partial words.
279-287
Electronic Edition (link) BibTeX
- Ferdinando Cicalese, Peter Damaschke, Libertad Tansini, Sören Werth:
Overlaps help: Improved bounds for group testing with interval queries.
288-299
Electronic Edition (link) BibTeX
- Antonio Fernández, Tom Leighton, José Luis López-Presa:
Containment properties of product and power graphs.
300-311
Electronic Edition (link) BibTeX
- Philippe Galinier, Alain Hertz:
Solution techniques for the Large Set Covering Problem.
312-326
Electronic Edition (link) BibTeX
- Petr Kolman, Tomasz Walen:
Approximating reversal distance for strings with bounded number of duplicates.
327-336
Electronic Edition (link) BibTeX
- Christian Liebchen, Romeo Rizzi:
Classes of cycle bases.
337-355
Electronic Edition (link) BibTeX
- Ortrud R. Oellermann, Joel Peters-Fransen:
The strong metric dimension of graphs and digraphs.
356-364
Electronic Edition (link) BibTeX
- Alan P. Sprague:
O(1) query time algorithm for all pairs shortest distances on permutation graphs.
365-373
Electronic Edition (link) BibTeX
- László A. Székely, Hua Wang:
Binary trees with the largest number of subtrees.
374-385
Electronic Edition (link) BibTeX
- Boaz Tsaban:
Decompositions of graphs of functions and fast iterations of lookup tables.
386-393
Electronic Edition (link) BibTeX
Notes
Volume 155,
Number 4,
February 2007
- Moncef Abbas, Marc Pirlot, Philippe Vincke:
Tangent circle graphs and 'orders'.
429-441
Electronic Edition (link) BibTeX
- Jørgen Bang-Jensen, Jing Huang, Louis Ibarra:
Recognizing and representing proper interval graphs in parallel using merging and sorting.
442-456
Electronic Edition (link) BibTeX
- Sergey Bereg, Hao Wang:
Wiener indices of balanced binary trees.
457-467
Electronic Edition (link) BibTeX
- Valentin E. Brimkov, David Coeurjolly, Reinhard Klette:
Digital planarity - A review.
468-495
Electronic Edition (link) BibTeX
- Francesc Carreras:
Automorphisms and blocking in simple games.
496-505
Electronic Edition (link) BibTeX
- Tomás Dvorák:
Dense sets and embedding binary trees into hypercubes.
506-514
Electronic Edition (link) BibTeX
- Mohamed 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.
515-522
Electronic Edition (link) BibTeX
- Hiroshi Nagamochi, Yuusuke Abe:
An approximation algorithm for dissecting a rectangle into rectangles with specified areas.
523-537
Electronic Edition (link) BibTeX
- Nigel P. Smart, Frederik Vercauteren:
On computable isomorphisms in efficient asymmetric pairing-based systems.
538-547
Electronic Edition (link) BibTeX
- Robin Strand, Benedek Nagy:
Distances based on neighbourhood sequences in non-standard three-dimensional grids.
548-557
Electronic Edition (link) BibTeX
- Manouchehr Zaker:
Maximum transversal in partial Latin squares and rainbow matchings.
558-565
Electronic Edition (link) BibTeX
Notes
Volume 155,
Number 5,
March 2007
Notes
Volume 155,
Numbers 6-7,
April 2007
Computational Molecular Biology Series,
Issue V
- Sorin Istrail, Pavel A. Pevzner, Ron Shamir:
Preface.
673-674
Electronic Edition (link) BibTeX
- Tatsuya Akutsu, Hideo Bannai, Satoru Miyano, Sascha Ott:
On the complexity of deriving position specific score matrices from positive and negative sequences.
676-685
Electronic Edition (link) BibTeX
- Liliana Alcón, Márcia R. Cerioli, Celina M. Herrera de Figueiredo, Marisa Gutierrez, João Meidanis:
Tree loop graphs.
686-694
Electronic Edition (link) BibTeX
- Alberto Apostolico, Cinzia Pizzi:
Motif discovery by monotone scores.
695-706
Electronic Edition (link) BibTeX
- Nikhil Bansal, Mark Cieliebak, Zsuzsanna Lipták:
Finding submasses in weighted strings with Fast Fourier Transform.
707-718
Electronic Edition (link) BibTeX
- Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robert H. Sloan, György Turán, Yi Zhang:
The inverse protein folding problem on 2D and 3D lattices.
719-732
Electronic Edition (link) BibTeX
- Piotr Berman, Bhaskar DasGupta, Eduardo D. Sontag:
Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks.
733-749
Electronic Edition (link) BibTeX
- Benny Chor, Michael D. Hendy, David Penny:
Analytic solutions for three taxon ML trees with variable rates across sites.
750-758
Electronic Edition (link) BibTeX
- Peter 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.
759-787
Electronic Edition (link) BibTeX
- Jens Gramm, Till Nierhoff, Roded Sharan, Till Tantau:
Haplotyping with missing data via perfect path phylogenies.
788-805
Electronic Edition (link) BibTeX
- Dan Gusfield, Dean Hickerson, Satish Eddhu:
An efficiently computed lower bound on the number of recombinations in phylogenetic networks: Theory and empirical study.
806-830
Electronic Edition (link) BibTeX
- Oliver D. King, Philippe Gaborit:
Binary templates for comma-free DNA codes.
831-839
Electronic Edition (link) BibTeX
- Gunnar W. Klau, Sven Rahmann, Alexander Schliep, Martin Vingron, Knut Reinert:
Integer linear programming approaches for non-unique probe selection.
840-856
Electronic Edition (link) BibTeX
- Steven Skiena, Sagi Snir:
Restricting SBH ambiguity via restriction enzymes.
857-867
Electronic Edition (link) BibTeX
- Valery T. Stefanov, Stéphane Robin, Sophie Schbath:
Waiting times for clumps of patterns and for structured motifs in random sequences.
868-880
Electronic Edition (link) BibTeX
- Eric Tannier, Anne Bergeron, Marie-France Sagot:
Advances on sorting by reversals.
881-888
Electronic Edition (link) BibTeX
Volume 155,
Number 8,
April 2007
- Stavros G. Kolliopoulos, George Steiner:
Partially ordered knapsack and applications to scheduling.
889-897
Electronic Edition (link) BibTeX
- Gianluca De Marco, Marco Pellegrini, Giovanni Sburlati:
Faster deterministic wakeup in multiple access channels.
898-903
Electronic Edition (link) BibTeX
- Kejun Chen, Ruizhong Wei:
Super-simple (v, 5, 4) designs.
904-913
Electronic Edition (link) BibTeX
- Magnus Bordewich, Charles Semple:
Computing the minimum number of hybridization events for a consistent evolutionary history.
914-928
Electronic Edition (link) BibTeX
- Sergey Kitaev:
Introduction to partially ordered patterns.
929-944
Electronic Edition (link) BibTeX
- Joseph Y.-T. Leung, Haibing Li, Michael Pinedo:
Scheduling orders for multiple product types to minimize total weighted completion time.
945-970
Electronic Edition (link) BibTeX
- Seog-Jin Kim, Suh-Ryung Kim, Yoomi Rho:
On CCE graphs of doubly partial orders.
971-978
Electronic Edition (link) BibTeX
- Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten:
Efficient algorithms for decomposing graphs under degree constraints.
979-988
Electronic Edition (link) BibTeX
- Elizabeth Goode, Dennis Pixton:
Recognizing splicing languages: Syntactic monoids and simultaneous pumping.
989-1006
Electronic Edition (link) BibTeX
- Gerard J. Chang, Jer-Jeong Chen, David Kuo, Sheng-Chyang Liaw:
Distance-two labelings of digraphs.
1007-1013
Electronic Edition (link) BibTeX
- Chiara Epifanio, Filippo Mignosi, Jeffrey Shallit, Ilaria Venturini:
On Sturmian graphs.
1014-1030
Electronic Edition (link) BibTeX
- Sunghyu Han, June Bok Lee:
Nonexistence of near-extremal formally self-dual even codes of length divisible by 8.
1031-1037
Electronic Edition (link) BibTeX
- Jiping Liu, Yuejian Peng, Cheng Zhao:
Characterization of P6-free graphs.
1038-1043
Electronic Edition (link) BibTeX
- Yumei Hu, Xueliang Li, Yongtang Shi, Tianyi Xu:
Connected (n, m)-graphs with minimum and maximum zeroth-order general Randic index.
1044-1054
Electronic Edition (link) BibTeX
- Brian Lucena:
Achievable sets, brambles, and sparse treewidth obstructions.
1055-1065
Electronic Edition (link) BibTeX
Notes
Volume 155,
Number 9,
May 2007
Advances in Graph Drawing:
The 11th International Symposium on Graph Drawing,
- Giuseppe Liotta, Henk Meijer:
Advances in graph drawing: The 11th International Symposium on Graph Drawing.
1077
Electronic Edition (link) BibTeX
- Hubert de Fraysseix, Patrice Ossona de Mendez:
Barycentric systems and stretchability.
1079-1095
Electronic Edition (link) BibTeX
- Jakub Cerný, Zdenek Dvorak, Vít Jelínek, Jan Kára:
Noncrossing Hamiltonian paths in geometric graphs.
1096-1105
Electronic Edition (link) BibTeX
- Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto:
On k-planar crossing numbers.
1106-1115
Electronic Edition (link) BibTeX
- Ashim Garg, Adrian Rusu:
Area-efficient planar straight-line drawings of outerplanar graphs.
1116-1140
Electronic Edition (link) BibTeX
- Toru Hasunuma:
Queue layouts of iterated line directed graphs.
1141-1154
Electronic Edition (link) BibTeX
- Hiroshi Nagamochi, Katsutoshi Kuroya:
Drawing c-planar biconnected clustered graphs.
1155-1174
Electronic Edition (link) BibTeX
Volume 155,
Number 10,
May 2007
- Arnold Knopfmacher, Robert F. Tichy, Stephan Wagner, Volker Ziegler:
Graphs, partitions and Fibonacci numbers.
1175-1187
Electronic Edition (link) BibTeX
- Ma-Lian Chia, David Kuo, Mei-Feng Tung:
The multiple originator broadcasting problem in graphs.
1188-1199
Electronic Edition (link) BibTeX
- Wen-Qing Xu, Solomon W. Golomb:
Optimal interleaving schemes for correcting two-dimensional cluster errors.
1200-1212
Electronic Edition (link) BibTeX
- Bang Ye Wu, Hung-Lung Wang, Shih Ta Kuan, Kun-Mao Chao:
On the uniform edge-partition of a tree.
1213-1223
Electronic Edition (link) BibTeX
- Kazuyuki Amano, Akira Maruoka:
Better upper bounds on the QOBDD size of integer multiplication.
1224-1232
Electronic Edition (link) BibTeX
- Dieter Rautenbach, Christian Szegedy, Jürgen Werber:
The delay of circuits whose inputs have specified arrival times.
1233-1243
Electronic Edition (link) BibTeX
- Abdo Y. Alfakih:
On dimensional rigidity of bar-and-joint frameworks.
1244-1253
Electronic Edition (link) BibTeX
- Ligong Wang, Hajo Broersma, Cornelis Hoede, Xueliang Li, Georg Still:
Integral trees of diameter 6.
1254-1266
Electronic Edition (link) BibTeX
- Zemin Jin, Huifang Yan, Qinglin Yu:
Generalization of matching extensions in graphs (II).
1267-1274
Electronic Edition (link) BibTeX
- Dekel Tsur:
Tree-edges deletion problems with bounded diameter obstruction sets.
1275-1293
Electronic Edition (link) BibTeX
- Tomislav Doslic, Damir Vukicevic:
Computing the bipartite edge frustration of fullerene graphs.
1294-1301
Electronic Edition (link) BibTeX
- Changhong Lu, Lei Chen, Mingqing Zhai:
Extremal problems on consecutive L(2, 1)-labelling.
1302-1313
Electronic Edition (link) BibTeX
- Sarah Spence Adams, Jonathan Cass, Matthew Tesch, Denise Sakai Troxell, Cody Wheeland:
The minimum span of L(2, 1)-labelings of certain generalized Petersen graphs.
1314-1325
Electronic Edition (link) BibTeX
- Roberto Cordone:
A subexponential algorithm for the coloured tree partition problem.
1326-1335
Electronic Edition (link) BibTeX
- Douglas Bauer, Hajo Broersma, Nathan Kahl, Aurora Morgana, Edward F. Schmeichel, T. Surowiec:
Tutte sets in graphs II: The complexity of finding maximum Tutte sets.
1336-1343
Electronic Edition (link) BibTeX
Volume 155,
Number 11,
June 2007
Contributions
- Hans L. Bodlaender, Arie M. C. A. Koster:
On the maximum cardinality search lower bound for treewidth.
1348-1372
Electronic Edition (link) BibTeX
- Nir Halman, Shmuel Onn, Uriel G. Rothblum:
The convex dimension of a graph.
1373-1383
Electronic Edition (link) BibTeX
- Peter Hamburger, Robert C. Vandell, Matt Walsh:
Routing sets in the integer lattice.
1384-1394
Electronic Edition (link) BibTeX
- Csilla Bujtás, Zsolt Tuza:
Orderings of uniquely colorable hypergraphs.
1395-1407
Electronic Edition (link) BibTeX
- Stefan Porschen, Ewald Speckenmeyer:
Satisfiability of mixed Horn formulas.
1408-1419
Electronic Edition (link) BibTeX
- Mirko Hornák, Zsolt Tuza, Mariusz Wozniak:
On-line arbitrarily vertex decomposable trees.
1420-1429
Electronic Edition (link) BibTeX
- Toufik Mansour, Vincent Vajnovszki:
Restricted 123-avoiding Baxter permutations and the Padovan numbers.
1430-1440
Electronic Edition (link) BibTeX
- Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi:
Bisecting a 4-connected graph with three resource sets.
1441-1450
Electronic Edition (link) BibTeX
- Axel Kohnert:
Constructing two-weight codes with prescribed groups of automorphisms.
1451-1457
Electronic Edition (link) BibTeX
- Feodor F. Dragan, Irina Lomonosov:
On compact and efficient routing in certain graph classes.
1458-1470
Electronic Edition (link) BibTeX
- Yusuke Kobayashi, Kazuo Murota:
Induction of M-convex functions by linking systems.
1471-1480
Electronic Edition (link) BibTeX
- Miklós Bóna, Hyeong-Kwan Ju, Ruriko Yoshida:
On the enumeration of certain weighted graphs.
1481-1496
Electronic Edition (link) BibTeX
- Changping Wang:
The signed star domination numbers of the Cartesian product graphs.
1497-1505
Electronic Edition (link) BibTeX
Communications
Volume 155,
Number 12,
June 2007
SAT 2001,
the Fourth International Symposium on the Theory and Applications of Satisfiability Testing
- Henry A. Kautz, Bart Selman:
The state of SAT.
1514-1524
Electronic Edition (link) BibTeX
- Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou, Malvina Vamvakari, Michele Zito:
The unsatisfiability threshold revisited.
1525-1538
Electronic Edition (link) BibTeX
- Ilya Shlyakhter:
Generating effective symmetry-breaking predicates for search problems.
1539-1548
Electronic Edition (link) BibTeX
- Eugene Goldberg, Yakov Novikov:
BerkMin: A fast and robust Sat-solver.
1549-1561
Electronic Edition (link) BibTeX
- Brian C. Williams, Robert J. Ragno:
Conflict-directed A* and its role in model-based embedded systems.
1562-1595
Electronic Edition (link) BibTeX
- Kazuo Iwama, Suguru Tamaki:
Exploiting partial knowledge of satisfying assignments.
1596-1603
Electronic Edition (link) BibTeX
- Inês Lynce, João P. Marques Silva:
Random backtracking in backtrack search algorithms for satisfiability.
1604-1612
Electronic Edition (link) BibTeX
- Ramón Béjar, Felip Manyà, Alba Cabiscol, Cèsar Fernández, Carla P. Gomes:
Regular-SAT: A many-valued approach to solving combinatorial problems.
1613-1626
Electronic Edition (link) BibTeX
- Delbert D. Bailey, Víctor Dalmau, Phokion G. Kolaitis:
Phase transitions of PP-complete satisfiability problems.
1627-1639
Electronic Edition (link) BibTeX
Volume 155,
Number 13,
August 2007
Communications
- Dvir Shabtay, George Steiner:
A survey of scheduling with controllable processing times.
1643-1666
Electronic Edition (link) BibTeX
- Lars Engebretsen:
Bipartite multigraphs with expander-like properties.
1667-1677
Electronic Edition (link) BibTeX
- Wenzhong Liu, Yanpei Liu, Yan Xu:
A census of boundary cubic rooted planar maps.
1678-1688
Electronic Edition (link) BibTeX
- David Avis, Tsuyoshi Ito:
New classes of facets of the cut polytope and tightness of Imm22 Bell inequalities.
1689-1699
Electronic Edition (link) BibTeX
- M. Atapour, Abdollah Khodkar, S. M. Sheikholeslami:
Characterization of double domination subdivision number of trees.
1700-1707
Electronic Edition (link) BibTeX
- Robert C. Brigham, Ronald D. Dutton, Stephen T. Hedetniemi:
Security in graphs.
1708-1714
Electronic Edition (link) BibTeX
- Maxim A. Babenko, Alexander V. Karzanov:
Free multiflows in bidirected and skew-symmetric graphs.
1715-1730
Electronic Edition (link) BibTeX
- Michael J. Todd, E. Alper Yildirim:
On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids.
1731-1744
Electronic Edition (link) BibTeX
- Camino Balbuena, Pedro García-Vázquez:
A sufficient condition for Pk-path graphs being r-connected.
1745-1751
Electronic Edition (link) BibTeX
- Wenjun Xiao, Behrooz Parhami:
Further mathematical properties of Cayley digraphs applied to hexagonal and honeycomb meshes.
1752-1760
Electronic Edition (link) BibTeX
- Dominique Barth, Johanne Cohen, Taoufik Faik:
On the b-continuity property of graphs.
1761-1768
Electronic Edition (link) BibTeX
- Anton Cerný:
On fairness of D0L systems.
1769-1773
Electronic Edition (link) BibTeX
- Branko Curgus, Krzysztof Kolodziejczyk:
On a convex operator for finite sets.
1774-1792
Electronic Edition (link) BibTeX
Volume 155,
Number 14,
September 2007
3rd Cologne/ Twente Workshop on Graphs and Combinatorial Optimization - CTW2004
- Timothée Bossart, Alix Munier Kordon, Francis Sourd:
Memory management optimization problems for integrated circuit simulators.
1795-1811
Electronic Edition (link) BibTeX
- Valentin E. Brimkov:
Algorithmic and explicit determination of the Lovász number for certain circulant graphs.
1812-1825
Electronic Edition (link) BibTeX
- Vânia M. F. Dias, Celina M. Herrera de Figueiredo, Jayme Luiz Szwarcfiter:
On the generation of bicliques of a graph.
1826-1832
Electronic Edition (link) BibTeX
- Guido Helden:
Each maximal planar graph with exactly two separating triangles is Hamiltonian.
1833-1836
Electronic Edition (link) BibTeX
- Sergei Kucherenko, Pietro Belotti, Leo Liberti, Nelson Maculan:
New formulations for the Kissing Number Problem.
1837-1841
Electronic Edition (link) BibTeX
- Shengjia Li, Ruijuan Li, Jinfeng Feng:
An efficient condition for a graph to be Hamiltonian.
1842-1845
Electronic Edition (link) BibTeX
- Dmitrii Lozovanu, Stefan Pickl:
Algorithms for solving multiobjective discrete control problems and dynamic c-games on networks.
1846-1857
Electronic Edition (link) BibTeX
- Stavros D. Nikolopoulos, Leonidas Palios:
On the parallel computation of the biconnected and strongly connected co-components of graphs.
1858-1877
Electronic Edition (link) BibTeX
- A. N. M. Salman, H. J. Broersma:
Path-kipas Ramsey numbers.
1878-1884
Electronic Edition (link) BibTeX
- Karol Suchan, Ioan Todinca:
On powers of graphs of bounded NLC-width (clique-width).
1885-1893
Electronic Edition (link) BibTeX
Volume 155,
Number 15,
September 2007
Communications
- Tian-Xiao He, Leetsch C. Hsu, Peter Jau-Shyong Shiue:
The Sheffer group and the Riordan group.
1895-1909
Electronic Edition (link) BibTeX
- Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno:
Matroid representation of clique complexes.
1910-1929
Electronic Edition (link) BibTeX
- Vera Kurková, Marcello Sanguineti:
Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets.
1930-1942
Electronic Edition (link) BibTeX
- Christine T. Cheng:
The test suite generation problem: Optimal instances and their implications.
1943-1957
Electronic Edition (link) BibTeX
- Francesco Maffioli, Romeo Rizzi, Stefano Benati:
Least and most colored bases.
1958-1970
Electronic Edition (link) BibTeX
- Hung-Chang Chan, Jou-Ming Chang, Yue-Li Wang, Shi-Jinn Horng:
Geodesic-pancyclic graphs.
1971-1978
Electronic Edition (link) BibTeX
- Yash P. Aneja, Ramaswamy Chandrasekaran, Santosh N. Kabadi, K. P. K. Nair:
Flows over edge-disjoint mixed multipaths and applications.
1979-2000
Electronic Edition (link) BibTeX
- Gwénaël Richomme, Francis Wlazinski:
Existence of finite test-sets for k-power-freeness of uniform morphisms.
2001-2016
Electronic Edition (link) BibTeX
- Pavel Trojovský:
On some identities for the Fibonomial coefficients via generating function.
2017-2024
Electronic Edition (link) BibTeX
Notes
Volume 155,
Number 16,
October 2007
Communications
- Kuan-Yu Chen, Kun-Mao Chao:
On the range maximum-sum segment query problem.
2043-2052
Electronic Edition (link) BibTeX
- Camino Balbuena, Josep Fàbrega, Pedro García-Vázquez:
Edge-connectivity and edge-superconnectivity in sequence graphs.
2053-2060
Electronic Edition (link) BibTeX
- Gustav Nordh:
NP-completeness of generalized multi-Skolem sequences.
2061-2068
Electronic Edition (link) BibTeX
- Vilas S. Kharat, B. N. Waphare, N. K. Thakare:
Reducibility number.
2069-2076
Electronic Edition (link) BibTeX
- T. C. Edwin Cheng, L. Y. Kang, C. T. Ng:
Paired domination on interval and circular-arc graphs.
2077-2086
Electronic Edition (link) BibTeX
- F. H. Chang, J. Y. Guo, Frank K. Hwang, J. S. Lee:
Counting disjoint 2-partitions for points in the plane.
2087-2092
Electronic Edition (link) BibTeX
- Vicky Mak, Natashia Boland:
Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs.
2093-2110
Electronic Edition (link) BibTeX
- Peter Dankelmann, Angelika Hellwig, Lutz Volkmann:
On the connectivity of diamond-free graphs.
2111-2117
Electronic Edition (link) BibTeX
- Robert W. Irving, Sandy Scott:
The stable fixtures problem - A many-to-many extension of stable roommates.
2118-2129
Electronic Edition (link) BibTeX
- Bruno Martin, Claudine Peyrat:
A single-copy minimal-time simulation of a torus of automata by a ring of automata.
2130-2139
Electronic Edition (link) BibTeX
- Jianping Li, Lusheng Wang, Hao Zhao:
On packing and coloring hyperedges in a cycle.
2140-2151
Electronic Edition (link) BibTeX
- Martin Kutrib, Andreas Malcher:
Finite turns and the regular closure of linear context-free languages.
2152-2164
Electronic Edition (link) BibTeX
- Changhong Lu, Mingqing Zhai:
An extremal problem on non-full colorable graphs.
2165-2173
Electronic Edition (link) BibTeX
Notes
Volume 155,
Number 17,
October 2007
Communications
- William Y. C. Chen, Nelson Y. Li, Louis W. Shapiro:
The butterfly decomposition of plane trees.
2187-2201
Electronic Edition (link) BibTeX
- Robert J. Cimikowski, Brendan Mumey:
Approximating the fixed linear crossing number.
2202-2210
Electronic Edition (link) BibTeX
- David Abelson, Seok-Hee Hong, Donald E. Taylor:
Geometric automorphism groups of graphs.
2211-2226
Electronic Edition (link) BibTeX
- Alan Shuchat, Randy Shull, Ann N. Trenk:
The fractional weak discrepancy of a partially ordered set.
2227-2235
Electronic Edition (link) BibTeX
- Wei Cao, Qi Sun:
A new characterization of dual bases in finite fields and its applications.
2236-2241
Electronic Edition (link) BibTeX
- Ruo-Wei Hung, Maw-Shang Chang:
Finding a minimum path cover of a distance-hereditary graph in polynomial time.
2242-2256
Electronic Edition (link) BibTeX
- Mike Develin, Stephen G. Hartke:
Fire containment in grids of dimension three and higher.
2257-2268
Electronic Edition (link) BibTeX
- Haizhen Ren, Fuji Zhang:
Extremal double hexagonal chains with respect to k-matchings and k-independent sets.
2269-2281
Electronic Edition (link) BibTeX
- José María Alonso-Meijide, Francesc Carreras, María Albina Puente:
Axiomatic characterizations of the symmetric coalitional binomial semivalues.
2282-2293
Electronic Edition (link) BibTeX
- Douglas J. Klein, Tomislav Doslic, Danail Bonchev:
Vertex-weightings for distance moments and thorny graphs.
2294-2302
Electronic Edition (link) BibTeX
- Bostjan Bresar, Sandi Klavzar, Douglas F. Rall:
On the packing chromatic number of Cartesian products, hexagonal lattice, and trees.
2303-2311
Electronic Edition (link) BibTeX
- Rui Wang, Francis C. M. Lau, Yingchao Zhao:
Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices.
2312-2320
Electronic Edition (link) BibTeX
- Yongde Feng, Qiongxiang Huang:
Consecutive edge-coloring of the generalized theta-graph.
2321-2327
Electronic Edition (link) BibTeX
- Mamadou Moustapha Kanté:
Vertex-minor reductions can simulate edge contractions.
2328-2340
Electronic Edition (link) BibTeX
- George Steiner, Paul Stephenson:
Pareto optima for total weighted completion time and maximum lateness on a single machine.
2341-2354
Electronic Edition (link) BibTeX
Notes
- Minghui Jiang:
On finding a large number of 3D points with a small diameter.
2355-2361
Electronic Edition (link) BibTeX
- Wilfried Imrich, Sandi Klavzar, Douglas F. Rall:
Cancellation properties of products of graphs.
2362-2364
Electronic Edition (link) BibTeX
- Xueliang Li, Yongtang Shi:
Corrections of proofs for Hansen and Mélot's two theorems.
2365-2370
Electronic Edition (link) BibTeX
- Zhizheng Zhang, Xin Wang:
A factorization of the symmetric Pascal matrix involving the Fibonacci matrix.
2371-2376
Electronic Edition (link) BibTeX
- Katerina Asdre, Kyriaki Ioannidou, Stavros D. Nikolopoulos:
The harmonious coloring problem is NP-complete for interval and permutation graphs.
2377-2382
Electronic Edition (link) BibTeX
- Yota Otachi, Yoshio Okamoto, Koichi Yamazaki:
Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs.
2383-2390
Electronic Edition (link) BibTeX
- Sarah Spence Adams, Matthew Tesch, Denise Sakai Troxell, Bradford Westgate, Cody Wheeland:
On the hole index of L(2, 1)-labelings of r-regular graphs.
2391-2393
Electronic Edition (link) BibTeX
- Bostjan Bresar, Tadeja Kraner Sumenjak:
On the 2-rainbow domination in graphs.
2394-2400
Electronic Edition (link) BibTeX
Volume 155,
Number 18,
November 2007
Communications
- Adrien Richard, Jean-Paul Comet:
Necessary conditions for multistationarity in discrete dynamical systems.
2403-2413
Electronic Edition (link) BibTeX
- Vadim E. Levit, Eugen Mandrescu:
Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids.
2414-2425
Electronic Edition (link) BibTeX
- Elena V. Konstantinova:
Reconstruction of permutations distorted by reversal errors.
2426-2434
Electronic Edition (link) BibTeX
- Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter:
Characterization and recognition of generalized clique-Helly graphs.
2435-2443
Electronic Edition (link) BibTeX
- Camino 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.
2444-2455
Electronic Edition (link) BibTeX
- Jung Jin Cho, Yong Chen, Yu Ding:
On the (co)girth of a connected matroid.
2456-2470
Electronic Edition (link) BibTeX
- Yun Sheng Chung, Chin Lung Lu, Chuan Yi Tang:
Constrained sequence alignment: A general model and the hardness results.
2471-2486
Electronic Edition (link) BibTeX
- Arthur H. Busch, Michael Ferrara, Nathan Kahl:
Generalizing D-graphs.
2487-2495
Electronic Edition (link) BibTeX
- Mohammad Javaheri:
Dirichlet problem on locally finite graphs.
2496-2506
Electronic Edition (link) BibTeX
- András Hajdu, Lajos Hajdu, Robert Tijdeman:
General neighborhood sequences in Zn.
2507-2522
Electronic Edition (link) BibTeX
- Toshimasa Ishii, Hitoshi Fujita, Hiroshi Nagamochi:
The source location problem with local 3-vertex-connectivity requirements.
2523-2538
Electronic Edition (link) BibTeX
- Stefan Hougardy, Ivo Köthnig:
Computation of best possible low degree expanders.
2539-2545
Electronic Edition (link) BibTeX
- Judith Nagy-György, Csanád Imreh:
Online scheduling with machine cost and rejection.
2546-2554
Electronic Edition (link) BibTeX
- Jesse Bingham, Brad Bingham:
Hybrid one-dimensional reversible cellular automata are regular.
2555-2566
Electronic Edition (link) BibTeX
- Manouchehr Zaker:
Inequalities for the Grundy chromatic number of graphs.
2567-2572
Electronic Edition (link) BibTeX
- Gi-Sang Cheon, Suk-Geun Hwang, Sang-Gu Lee:
Several polynomials associated with the harmonic numbers.
2573-2584
Electronic Edition (link) BibTeX
- Dong Chen, Weifan Wang:
(2, 1)-Total labelling of outerplanar graphs.
2585-2593
Electronic Edition (link) BibTeX
- Glenn H. Hurlbert:
On encodings of spanning trees.
2594-2600
Electronic Edition (link) BibTeX
- Dariusz Dereniowski:
Easy and hard instances of arc ranking in directed graphs.
2601-2611
Electronic Edition (link) BibTeX
- Bruce Elenbogen, John Frederick Fink:
Distance distributions for graphs modeling computer networks.
2612-2624
Electronic Edition (link) BibTeX
- Fanica Gavril:
3D-interval-filament graphs.
2625-2636
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:55:18 2009
by Michael Ley (ley@uni-trier.de)
