Volume 154,
Number 1,
1 January 2006
Communications
Contributions
- Chandra Chekuri, Guy Even, Guy Kortsarz:
A greedy approximation algorithm for the group Steiner problem.
15-34
Electronic Edition (link) BibTeX
- Marie-Christine Costa, Dominique de Werra, Christophe Picouleau:
Using graphs for some discrete tomography problems.
35-46
Electronic Edition (link) BibTeX
- Dominique de Werra, Tinaz Ekim, C. Raess:
Construction of sports schedules with multiple venues.
47-58
Electronic Edition (link) BibTeX
- Jean E. Dunbar, David J. Erwin, Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi:
Broadcasts in graphs.
59-75
Electronic Edition (link) BibTeX
- Ruo-Wei Hung, Maw-Shang Chang:
Solving the path cover problem on circular-arc graphs by using an approximation algorithm.
76-105
Electronic Edition (link) BibTeX
- Huiqing Liu, Mei Lu, Feng Tian:
Trees of extremal connectivity index.
106-119
Electronic Edition (link) BibTeX
- Christophe Meyer, Brigitte Jaumard:
Equivalence of some LP-based lower bounds for the Golomb ruler problem.
120-144
Electronic Edition (link) BibTeX
- Weigen Yan, Fuji Zhang:
Enumeration of perfect matchings of a type of Cartesian products of graphs.
145-157
Electronic Edition (link) BibTeX
Notes
Volume 154,
Number 2,
1 February 2006
Coding and Cryptography
- Pascale Charpin, Gregory Kabatianski:
Special Issue on Coding and Cryptography.
173
Electronic Edition (link) BibTeX
- Jan Camenisch, Maciej Koprowski:
Fine-grained forward-secure signature schemes without random oracles.
175-188
Electronic Edition (link) BibTeX
- Sébastien Canard, Berry Schoenmakers, Martijn Stam, Jacques Traoré:
List signature schemes.
189-201
Electronic Edition (link) BibTeX
- Anne Canteaut, Magnus Daum, Hans Dobbertin, Gregor Leander:
Finding nonnormal bent functions.
202-218
Electronic Edition (link) BibTeX
- Paolo D'Arco, Wataru Kishimoto, Douglas R. Stinson:
Properties and constraints of cheating-immune secret sharing schemes.
219-233
Electronic Edition (link) BibTeX
- Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci:
Unconditionally secure key assignment schemes.
234-252
Electronic Edition (link) BibTeX
- Ilya Dumer, Kirill Shabunov:
Recursive error correction for general Reed-Muller codes.
253-269
Electronic Edition (link) BibTeX
- Régis Dupont, Andreas Enge:
Provably secure non-interactive key distribution based on pairings.
270-276
Electronic Edition (link) BibTeX
- Sandy Ferret, Leo Storme:
A classification result on weighted {deltavµ+1, deltavµ;N, p3}-minihypers.
277-293
Electronic Edition (link) BibTeX
- Jürgen Freudenberger, Victor V. Zyablov:
On the complexity of suboptimal decoding for list and decision feedback schemes.
294-304
Electronic Edition (link) BibTeX
- Ernst M. Gabidulin, Nina I. Pilipchuk:
Symmetric matrices and codes correcting rank errors beyond the [(d-1)/2] bound.
305-312
Electronic Edition (link) BibTeX
- Xiang-dong Hou:
Affinity of permutations of P2n.
313-325
Electronic Edition (link) BibTeX
- Eike Kiltz, Arne Winterhof:
Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem.
326-336
Electronic Edition (link) BibTeX
- Alexey S. Kuzmin, Viktor T. Markov, Alexander A. Nechaev, A. S. Neljubin:
A generalization of the binary Preparata code.
337-345
Electronic Edition (link) BibTeX
- San Ling, Chaoping Xing, Ferruh Özbudak:
An explicit class of codes with good parameters and their duals.
346-356
Electronic Edition (link) BibTeX
- Subhamoy Maitra, Enes Pasalic:
A Maiorana-McFarland type construction for resilient Boolean functions on n variables (n even) with nonlinearity >2n-1-2n/2+2n/2-2.
357-369
Electronic Edition (link) BibTeX
- Ueli M. Maurer:
Secure multi-party computation made simple.
370-381
Electronic Edition (link) BibTeX
- Tommi Meskanen, Ari Renvall:
A wrap error attack against NTRUEncrypt.
382-391
Electronic Edition (link) BibTeX
- Ronan Quarez:
Some subsets of points in the plane associated to truncated Reed-Muller codes with good parameters.
392-398
Electronic Edition (link) BibTeX
- John A. Ryan, Patrick Fitzpatrick:
Enumeration of inequivalent irreducible Goppa codes.
399-412
Electronic Edition (link) BibTeX
- Ana Salagean:
Repeated-root cyclic and negacyclic codes over a finite chain ring.
413-419
Electronic Edition (link) BibTeX
- Hervé Sibert, Patrick Dehornoy, Marc Girault:
Entity authentication schemes using braid word reduction.
420-436
Electronic Edition (link) BibTeX
Volume 154,
Number 3,
1 March 2006
Communications
Contributions
- Paola Bonizzoni, Clelia de Felice, Giancarlo Mauri, Rosalba Zizza:
Linear splicing and syntactic monoid.
452-470
Electronic Edition (link) BibTeX
- Arthur H. Busch:
A characterization of triangle-free tolerance graphs.
471-477
Electronic Edition (link) BibTeX
- Peter Damaschke:
Randomized vs. deterministic distance query strategies for point location on the line.
478-484
Electronic Edition (link) BibTeX
- Célia Picinin de Mello, Aurora Morgana, M. Liverani:
The clique operator on graphs with few P4's.
485-492
Electronic Edition (link) BibTeX
- Jean Diatta:
Description-meet compatible multiway dissimilarities.
493-507
Electronic Edition (link) BibTeX
- Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko:
The Hamiltonian problem on distance-hereditary graphs.
508-524
Electronic Edition (link) BibTeX
- Chuan-Min Lee, Maw-Shang Chang:
Distance-hereditary graphs are clique-perfect.
525-536
Electronic Edition (link) BibTeX
- Valery A. Liskovets:
Exact enumeration of acyclic deterministic automata.
537-551
Electronic Edition (link) BibTeX
- Jaume Martí-Farré, Carles Padró:
Secret sharing schemes on access structures with intersection number equal to one.
552-563
Electronic Edition (link) BibTeX
- Cécile Murat, Vangelis Th. Paschos:
On the probabilistic minimum coloring and minimum k-coloring.
564-586
Electronic Edition (link) BibTeX
Notes
Volume 154,
Number 4,
15 March 2006
Efficient Algorithms
- Evripidis Bampis, Klaus Jansen:
Introduction.
609
Electronic Edition (link) BibTeX
- Leah Epstein, Rob van Stee:
Optimal on-line flow time with resource augmentation.
611-621
Electronic Edition (link) BibTeX
- Foto N. Afrati, Ioannis Milis:
Designing PTASs for MIN-SUM scheduling problems.
622-639
Electronic Edition (link) BibTeX
- Monaldo Mastrolilli, Marcus Hutter:
Hybrid rounding techniques for knapsack problems.
640-649
Electronic Edition (link) BibTeX
- Benjamin Doerr:
Non-independent randomized rounding and coloring.
650-659
Electronic Edition (link) BibTeX
- Daniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss:
Coloring mixed hypertrees.
660-672
Electronic Edition (link) BibTeX
- Thomas Erlebach, Danica Vukadinovic:
Path problems in generalized stars, complete graphs, and brick wall graphs.
673-683
Electronic Edition (link) BibTeX
- Taneli Mielikäinen, Esko Ukkonen:
The complexity of maximum matroid-greedoid intersection and weighted greedoid maximization, .
684-691
Electronic Edition (link) BibTeX
Volume 154,
Number 5,
1 April 2006
IV ALIO/EURO Workshop on Applied Combinatorial Optimization
- Celso C. Ribeiro:
Preface.
693
Electronic Edition (link) BibTeX
- Dario 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.
695-702
Electronic Edition (link) BibTeX
- Rafael Andrade, Abilio Lucena, Nelson Maculan:
Using Lagrangian dual information to generate degree constrained spanning trees.
703-717
Electronic Edition (link) BibTeX
- Jacek Blazewicz, Marta Kasprzak:
Computational complexity of isothermic DNA sequencing by hybridization.
718-729
Electronic Edition (link) BibTeX
- Alfredo Candia-Véjar, Hugo Bravo-Azlán:
Worst-case performance of Wong's Steiner tree heuristic.
730-737
Electronic Edition (link) BibTeX
- Alberto Caprara, Michele Monaci, Paolo Toth, Pier Luigi Guida:
A Lagrangian heuristic algorithm for a real-world train timetabling problem.
738-753
Electronic Edition (link) BibTeX
- Irène Charon, Olivier Hudry:
Noising methods for a clique partitioning problem.
754-769
Electronic Edition (link) BibTeX
- Pablo E. Coll, Celso C. Ribeiro, Cid C. de Souza:
Multiprocessor scheduling under precedence constraints: Polyhedral results.
770-801
Electronic Edition (link) BibTeX
- Pierre Hansen, Nenad Mladenovic:
First vs. best improvement: An empirical study.
802-817
Electronic Edition (link) BibTeX
- Lilian Markenzon, C. M. Justel, N. Paciornik:
Subclasses of k-trees: Characterization and recognition.
818-825
Electronic Edition (link) BibTeX
- Isabel Méndez-Díaz, Paula Zabala:
A Branch-and-Cut algorithm for graph coloring.
826-847
Electronic Edition (link) BibTeX
- Nikola S. Nikolov, Alexandre Tarassov:
Graph layering by promotion of nodes.
848-860
Electronic Edition (link) BibTeX
- Nei Y. Soma, J. P. Melo:
On irreversibility of von Neumann additive cellular automata on grids.
861-866
Electronic Edition (link) BibTeX
- Andres Weintraub, Alan T. Murray:
Review of combinatorial problems induced by spatial forest harvesting planning.
867-879
Electronic Edition (link) BibTeX
Volume 154,
Number 6,
15 April 2006
Communications
Contributions
Notes
Volume 154,
Number 7,
1 May 2006
Discrete Mathematics and Data Mining II (DM and DM II)
- Martin Anthony, Endre Boros, Peter L. Hammer, Alexander Kogan:
Preface.
1037
Electronic Edition (link) BibTeX
- Gabriela Alexe, Peter L. Hammer:
Spanned patterns for the logical analysis of data.
1039-1049
Electronic Edition (link) BibTeX
- Sorin Alexe, Peter L. Hammer:
Accelerated algorithm for pattern detection in logical analysis of data.
1050-1063
Electronic Edition (link) BibTeX
- Anne Berry, Eric SanJuan, Alain Sigayret:
Generalized domination in closure systems.
1064-1084
Electronic Edition (link) BibTeX
- François Brucker:
Sub-dominant theory in numerical taxonomy.
1085-1099
Electronic Edition (link) BibTeX
- Rajeev Kohli, Ramesh Krishnamurti, Kamel Jedidi:
Subset-conjunctive rules for breast cancer diagnosis.
1100-1112
Electronic Edition (link) BibTeX
- Taneli Mielikäinen:
Frequency-based views to pattern collections.
1113-1139
Electronic Edition (link) BibTeX
- Jutta Gebert, Martin Lätsch, Stefan Wolfgang Pickl, Gerhard-Wilhelm Weber, R. Wünschiers:
An algorithm to analyze stability of gene-expression patterns.
1140-1156
Electronic Edition (link) BibTeX
Volume 154,
Number 8,
15 May 2006
Contributions
- Vitaly I. Voloshin, Heinz-Jürgen Voss:
Circular mixed hypergraphs II: The upper chromatic number.
1157-1172
Electronic Edition (link) BibTeX
- Wensong Lin, Jianzhuan Wu, Peter Che Bor Lam, Guohua Gu:
Several parameters of generalized Mycielskians.
1173-1182
Electronic Edition (link) BibTeX
- Qing-Hu Hou, Toufik Mansour:
Horse paths, restricted 132-avoiding permutations, continued fractions, and Chebyshev polynomials.
1183-1197
Electronic Edition (link) BibTeX
- Dariusz Dereniowski:
Edge ranking of weighted trees.
1198-1209
Electronic Edition (link) BibTeX
- Petr Hlinený:
Equivalence-free exhaustive generation of matroid representations.
1210-1222
Electronic Edition (link) BibTeX
- T. Bornand-Jaccard, David Schindl, Dominique de Werra:
Some simple optimization techniques for self-organized public key management in mobile ad hoc networks.
1223-1235
Electronic Edition (link) BibTeX
- Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten:
The satisfactory partition problem.
1236-1245
Electronic Edition (link) BibTeX
- Irène Charon, Sylvain Gravier, Olivier Hudry, Antoine Lobstein, Michel Mollard, Julien Moncel:
A linear algorithm for minimum 1-identifying codes in oriented trees.
1246-1253
Electronic Edition (link) BibTeX
- Hiroshi Nagamochi, Taizo Kawada:
Minmax subtree cover problem on cacti.
1254-1263
Electronic Edition (link) BibTeX
- Rahul Santhanam, Kamala Krithivasan:
Graph splicing systems.
1264-1278
Electronic Edition (link) BibTeX
- Yuuki Tanaka, Yukio Shibata:
On the pagenumber of trivalent Cayley graphs.
1279-1292
Electronic Edition (link) BibTeX
- Teresa W. Haynes, Michael A. Henning, Jamie Howard:
Locating and total dominating sets in trees.
1293-1300
Electronic Edition (link) BibTeX
Notes
Volume 154,
Number 9,
June 2006
2nd Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2003)
- Ulrich Faigle, Johann Hurink, Stefan Wolfgang Pickl:
Preface.
1315
Electronic Edition (link) BibTeX
- Stephan Dominique Andres:
The game chromatic index of forests of maximum degree Delta>=5.
1317-1323
Electronic Edition (link) BibTeX
- Gabriela R. Argiroffo, Silvia M. Bianchi, Graciela L. Nasini:
Clutter nonidealness.
1324-1334
Electronic Edition (link) BibTeX
- Paul S. Bonsma, Thomas Epping, Winfried Hochstättler:
Complexity results on restricted instances of a paint shop problem for words.
1335-1343
Electronic Edition (link) BibTeX
- Maurizio Bruglieri, Matthias Ehrgott, Horst W. Hamacher, Francesco Maffioli:
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints.
1344-1357
Electronic Edition (link) BibTeX
- Gruia Calinescu, Sanjiv Kapoor, Mohammad Sarwat:
Bounded-hops power assignment in ad hoc wireless networks.
1358-1371
Electronic Edition (link) BibTeX
- Aneta Dudek, Gyula Y. Katona, A. Pawel Wojda:
Hamiltonian path saturated graphs with small size.
1372-1379
Electronic Edition (link) BibTeX
- Ulrich Faigle, Gereon Frahling:
A combinatorial algorithm for weighted stable sets in bipartite graphs.
1380-1391
Electronic Edition (link) BibTeX
- Toshihiro Fujito, Tsuyoshi Okumura:
A modified greedy algorithm for dispersively weighted 3-set cover.
1392-1400
Electronic Edition (link) BibTeX
- Francesco Maffioli, Norma Zagaglia Salvi:
On some properties of base-matroids.
1401-1407
Electronic Edition (link) BibTeX
- Arnaud Pêcher, Annegret Wagler:
On non-rank facets of stable set polytopes of webs with clique number four.
1408-1415
Electronic Edition (link) BibTeX
- Bert Randerath, Preben D. Vestergaard:
Well-covered graphs and factors.
1416-1428
Electronic Edition (link) BibTeX
- A. N. M. Salman, Hajo Broersma:
Path-fan Ramsey numbers.
1429-1436
Electronic Edition (link) BibTeX
- Lutz Volkmann, Stefan Winzen:
On the connectivity of close to regular multipartite tournaments.
1437-1452
Electronic Edition (link) BibTeX
- Liming Xiong, Hajo Broersma:
Subpancyclicity of line graphs and degree sums along paths.
1453-1463
Electronic Edition (link) BibTeX
Volume 154,
Number 10,
June 2006
Notes
Volume 154,
Number 11,
July 2006
- Klaus Holzapfel, Sven Kosub, Moritz G. Maaß, Hanjo Täubig:
The complexity of detecting fixed-density clusters.
1547-1562
Electronic Edition (link) BibTeX
- Joan Hutchinson, André Kündgen:
Orthogonal art galleries with interior walls.
1563-1569
Electronic Edition (link) BibTeX
- Dimitri Kagaris:
A similarity transform for linear finite state machines.
1570-1577
Electronic Edition (link) BibTeX
- Ton Kloks, Dieter Kratsch, Chuan-Min Lee, Jiping Liu:
Improved bottleneck domination algorithms.
1578-1592
Electronic Edition (link) BibTeX
- Toufik Mansour, Eva Yu-Ping Deng, Rosena R. X. Du:
Dyck paths and restricted permutations.
1593-1605
Electronic Edition (link) BibTeX
- Huifang Miao, Xiaofeng Guo:
Lower and upper orientable strong radius and strong diameter of complete k-partite graphs.
1606-1614
Electronic Edition (link) BibTeX
- Young-Soo Myung:
Multicommodity flows in cycle graphs.
1615-1621
Electronic Edition (link) BibTeX
- Zhizheng Zhang, Jun Wang:
Bernoulli matrix and its algebraic properties.
1622-1632
Electronic Edition (link) BibTeX
Notes
Errata
Volume 154,
Number 12,
July 2006
- R. Julian R. Abel, Norman J. Finizio, Gennian Ge, Malcolm Greig:
New Z-cyclic triplewhist frames and triplewhist tournament designs.
1649-1673
Electronic Edition (link) BibTeX
- Eyal Ackerman, Gill Barequet, Ron Y. Pinter:
A bijection between permutations and floorplans, and its applications.
1674-1684
Electronic Edition (link) BibTeX
- Eric Angel, Evripidis Bampis, Laurent Gourvès:
Approximation algorithms for the bi-criteria weighted MAX-CUT problem.
1685-1692
Electronic Edition (link) BibTeX
- Iliya Bouyukliev:
On the binary projective codes with dimension 6.
1693-1708
Electronic Edition (link) BibTeX
- Fabien Coulon, Mathieu Raffinot:
Fast algorithms for identifying maximal common connected sets of interval graphs.
1709-1721
Electronic Edition (link) BibTeX
- Christophe Crespelle, Christophe Paul:
Fully dynamic recognition algorithm and certificate for directed cographs.
1722-1741
Electronic Edition (link) BibTeX
- Walter Morris:
Coloring copoints of a planar point set.
1742-1752
Electronic Edition (link) BibTeX
- Weili Wu, Yaochun Huang, Xiao Huang, Yingshu Li:
On error-tolerant DNA screening.
1753-1758
Electronic Edition (link) BibTeX
Notes
Volume 154,
Number 13,
August 2006
Traces of the Latin American Conference on Combinatorics,
Graphs and Applications - A selection of papers from LACGA 2004,
Santiago,
Chile
Graph theory and combinatorics
- Luerbio Faria, Celina M. Herrera de Figueiredo, Sylvain Gravier, Candido Ferreira Xavier de Mendonça Neto, Jorge Stolfi:
On maximum planar induced subgraphs.
1774-1782
Electronic Edition (link) BibTeX
- Guillermo Durán, Min Chih Lin, Sergio Mera, Jayme Luiz Szwarcfiter:
Algorithms for clique-independent sets on subclasses of circular-arc graphs.
1783-1790
Electronic Edition (link) BibTeX
- Rafael B. Teixeira, Celina M. Herrera de Figueiredo:
The sandwich problem for cutsets: Clique cutset, k-star cutset.
1791-1798
Electronic Edition (link) BibTeX
- Liliana Alcón:
Clique-critical graphs: Maximum size and recognition.
1799-1802
Electronic Edition (link) BibTeX
- Hans L. Fetter:
Some basic properties of multiple Hamiltonian covers.
1803-1815
Electronic Edition (link) BibTeX
- Marcos A. Kiwi:
A concentration bound for the longest increasing subsequence of a randomly chosen involution.
1816-1823
Electronic Edition (link) BibTeX
- Pablo Burzyn, Flavia Bonomo, Guillermo Durán:
NP-completeness results for edge modification problems.
1824-1844
Electronic Edition (link) BibTeX
Combinatorial optimization and polyhedral combinatorics
Applications
Volume 154,
Number 14,
September 2006
- Frank E. Bennett, Gennian Ge:
Existence of directedwhist tournaments with the three person property 3PDWh(v).
1939-1946
Electronic Edition (link) BibTeX
- Scott 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.
1947-1959
Electronic Edition (link) BibTeX
- Miroslav Chlebík, Janka Chlebíková:
Hard coloring problems in low degree planar bipartite graphs.
1960-1965
Electronic Edition (link) BibTeX
- Kristina Crona:
Optimal key systems.
1966-1974
Electronic Edition (link) BibTeX
- Jason DeVinney, Carey E. Priebe:
A new family of proximity graphs: Class cover catch digraphs.
1975-1982
Electronic Edition (link) BibTeX
- J. Mark Keil, Lorna Stewart:
Approximating the minimum clique cover and other hard problems in subtree filament graphs.
1983-1995
Electronic Edition (link) BibTeX
- Wen An Liu, Hong Yong Ma:
Minimal average cost of searching for a counterfeit coin: Restricted model.
1996-2009
Electronic Edition (link) BibTeX
- Wen An Liu, Huan Huan Cui, Bing Qing Ma:
Searching for a counterfeit coin with b-balance.
2010-2023
Electronic Edition (link) BibTeX
- J. A. Rodríguez:
The (alpha, beta, s, t)-diameter of graphs: A particular case of conditional diameter.
2024-2031
Electronic Edition (link) BibTeX
Notes
Volume 154,
Number 15,
October 2006
International Symposium on Combinatorial Optimization CO'02
- Philippe Chrétienne:
Preface.
2041-2042
Electronic Edition (link) BibTeX
- Alessandro Agnetis, Nicholas G. Hall, Dario Pacciarelli:
Supply chain scheduling: Sequence coordination.
2044-2063
Electronic Edition (link) BibTeX
- Jean-Louis Bouquard, Christophe Lenté, Jean-Charles Billaut:
Application of an optimization problem in Max-Plus algebra to scheduling problems.
2064-2079
Electronic Edition (link) BibTeX
- Stanislav Busygin:
A new trust region technique for the maximum weight clique problem.
2080-2096
Electronic Edition (link) BibTeX
- Irène Charon, Olivier Hudry:
A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments.
2097-2116
Electronic Edition (link) BibTeX
- Michele Flammini, Gaia Nicosia:
Competitive algorithms for the bicriteria k-server problem.
2117-2127
Electronic Edition (link) BibTeX
- Pierre Fouilhoux, Ali Ridha Mahjoub:
Polyhedral results for the bipartite induced subgraph problem.
2128-2149
Electronic Edition (link) BibTeX
- Stanislaw Gawiejnowicz, Wieslaw Kurc, Lidia Pankowska:
Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences.
2150-2166
Electronic Edition (link) BibTeX
- Vasilij Lebedev, Igor Averbakh:
Complexity of minimizing the total flow time with interval data and minmax regret criterion.
2167-2177
Electronic Edition (link) BibTeX
- Natalia V. Shakhlevich, Vitaly A. Strusevich:
Single machine scheduling with controllable release and processing parameters.
2178-2199
Electronic Edition (link) BibTeX
- Babacar Thiongane, Anass Nagih, Gérard Plateau:
Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem.
2200-2211
Electronic Edition (link) BibTeX
- Andreas Westerlund, Maud Göthe-Lundgren, Torbjörn Larsson:
A stabilized column generation scheme for the traveling salesman subtour problem.
2212-2238
Electronic Edition (link) BibTeX
Volume 154,
Number 16,
November 2006
Discrete Algorithms and Optimization,
in Honor of Professor Toshihide Ibaraki at His Retirement from Kyoto University
- Naoki Katoh, Hiro Ito:
Preface.
2239-2240
Electronic Edition (link) BibTeX
- Martin Anthony, Peter L. Hammer:
A Boolean measure of similarity.
2242-2246
Electronic Edition (link) BibTeX
- Yuichi Asahiro, Takashi Horiyama, Kazuhisa Makino, Hirotaka Ono, Toshinori Sakuma, Masafumi Yamashita:
How to collect balls moving in the Euclidean plane.
2247-2262
Electronic Edition (link) BibTeX
- Youichi Hanatani, Takashi Horiyama, Kazuo Iwama:
Density condensation of Boolean formulas.
2263-2270
Electronic Edition (link) BibTeX
- Hideki Hashimoto, Toshihide Ibaraki, Shinji Imahori, Mutsunori Yagiura:
The vehicle routing problem with flexible time windows and traveling times.
2271-2290
Electronic Edition (link) BibTeX
- Katsumi Inoue, Takehide Soh, Seiji Ueda, Yoshito Sasaura, Mutsunori Banbara, Naoyuki Tamura:
A competitive and cooperative approach to propositional satisfiability.
2291-2306
Electronic Edition (link) BibTeX
- Toshimasa Ishii, Masayuki Hagiwara:
Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs.
2307-2329
Electronic Edition (link) BibTeX
- Hiro Ito, Hiroshi Nagamochi:
Two equivalent measures on weighted hypergraphs.
2330-2334
Electronic Edition (link) BibTeX
- Naoki Katoh, Taihei Yano:
An approximation algorithm for the pickup and delivery vehicle routing problem on trees.
2335-2349
Electronic Edition (link) BibTeX
- Leonid 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.
2350-2372
Electronic Edition (link) BibTeX
- Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki:
Minimum edge ranking spanning trees of split graphs.
2373-2386
Electronic Edition (link) BibTeX
- Satoko Mamada, Takeaki Uno, Kazuhisa Makino, Satoru Fujishige:
An O(n log2n) algorithm for the optimal sink location problem in dynamic tree networks.
2387-2401
Electronic Edition (link) BibTeX
- Keizo Miyata, Shigeru Masuyama, Shin-ichi Nakayama, Liang Zhao:
Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem.
2402-2410
Electronic Edition (link) BibTeX
- Hiroshi Nagamochi:
Sparse connectivity certificates via MA orderings in graphs.
2411-2417
Electronic Edition (link) BibTeX
- Mingjun Edward Yan, Tsunehiko Kameda:
Generalized Fibonacci broadcasting: An efficient VOD scheme with user bandwidth limit.
2418-2429
Electronic Edition (link) BibTeX
- Dao-Zhi Zeng, Liping Fang, Keith W. Hipel, D. Marc Kilgour:
Generalized metarationalities in the graph model for conflict resolution.
2430-2443
Electronic Edition (link) BibTeX
Volume 154,
Number 17,
November 2006
Notes
Volume 154,
Number 18,
December 2006
Notes
Errata
Copyright © Sat May 16 23:55:18 2009
by Michael Ley (ley@uni-trier.de)