Volume 156,
Number 1,
January 2008
Communications
Notes
Volume 156,
Number 2,
January 2008
Computational Methods for Graph Coloring and it's Generalizations
- David S. Johnson, Anuj Mehrotra, Michael A. Trick:
Special issue on computational methods for graph coloring and its generalizations.
145-146
Electronic Edition (link) BibTeX
- Steven David Prestwich:
Generalised graph colouring by a hybrid of local search and constraint programming.
148-158
Electronic Edition (link) BibTeX
- Isabel Méndez-Díaz, Paula Zabala:
A cutting plane algorithm for graph coloring.
159-179
Electronic Edition (link) BibTeX
- Igor Dukanovic, Franz Rendl:
A semidefinite programming-based heuristic for graph coloring.
180-189
Electronic Edition (link) BibTeX
- Thang Nguyen Bui, ThanhVu H. Nguyen, Chirag M. Patel, Kim-Anh T. Phan:
An ant-based algorithm for coloring graphs.
190-200
Electronic Edition (link) BibTeX
- Massimiliano Caramia, Paolo Dell'Olmo:
Coloring graphs by iterated local search traversing feasible and infeasible solutions.
201-217
Electronic Edition (link) BibTeX
- Kazunori Mizuno, Seiichi Nishihara:
Constructive generation of very hard 3-colorability instances.
218-229
Electronic Edition (link) BibTeX
- Allen Van Gelder:
Another look at graph coloring via propositional satisfiability.
230-243
Electronic Edition (link) BibTeX
- Christian Desrosiers, Philippe Galinier, Alain Hertz:
Efficient algorithms for finding critical subgraphs.
244-266
Electronic Edition (link) BibTeX
- Philippe Galinier, Alain Hertz, Nicolas Zufferey:
An adaptive memory algorithm for the k-coloring problem.
267-279
Electronic Edition (link) BibTeX
- Shahadat Hossain, Trond Steihaug:
Graph coloring in the estimation of sparse derivative matrices: Instances and applications.
280-288
Electronic Edition (link) BibTeX
Volume 156,
Number 3,
February 2008
Combinatorial Optimization 2004,
CO2004
- Alistair R. Clark, Richard W. Eglese, Adam N. Letchford, Michael B. Wright:
Preface.
289-290
Electronic Edition (link) BibTeX
- Miroslav Chlebík, Janka Chlebíková:
Crown reductions for the Minimum Weighted Vertex Cover problem.
292-312
Electronic Edition (link) BibTeX
- Kathryn A. Dowsland, Jonathan M. Thompson:
An improved ant colony optimisation heuristic for graph colouring.
313-324
Electronic Edition (link) BibTeX
- Le Thi Hoai An, Pham Dinh Tao:
A continuous approach for the concave cost supply problem via DC programming and DCA.
325-338
Electronic Edition (link) BibTeX
- Carlo Mannino, Fabrizio Rossi, Antonio Sassano, Stefano Smriglio:
Time offset optimization in digital broadcasting.
339-351
Electronic Edition (link) BibTeX
- Cristóbal Miralles, José Pedro García-Sabater, Carlos Andrés, Manuel Cardós:
Branch and bound procedures for solving the Assembly Line Worker Assignment and Balancing Problem: Application to Sheltered Work centres for Disabled.
352-367
Electronic Edition (link) BibTeX
- Gerhard Reinelt, Dirk Oliver Theis:
On the general routing polytope.
368-384
Electronic Edition (link) BibTeX
- Gerhard Reinelt, Dirk Oliver Theis, Klaus Michael Wenger:
Computing finest mincut partitions of a graph and application to routing problems.
385-396
Electronic Edition (link) BibTeX
- Gerhard J. Woeginger:
Open problems around exact algorithms.
397-405
Electronic Edition (link) BibTeX
Volume 156,
Number 4,
February 2008
Third Haifa Workshop on Interdisciplinary Applications of Graph Theory,
Combinatorics & Algorithm
- Irith Ben-Arroyo Hartman, Seffi Naor, Michal Penn, Uriel G. Rothblum:
The Third Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms.
407-408
Electronic Edition (link) BibTeX
- Irith Ben-Arroyo Hartman, Seffi Naor, Michal Penn, Uriel G. Rothblum:
Editorial.
410-411
Electronic Edition (link) BibTeX
- Michal Penn, Tal Raviv:
A polynomial time algorithm for solving a quality control station configuration problem.
412-419
Electronic Edition (link) BibTeX
- Aviezri S. Fraenkel:
Games played by Boole and Galois.
420-427
Electronic Edition (link) BibTeX
- Uriel G. Rothblum, Yoav Tangir:
The partition bargaining problem.
428-443
Electronic Edition (link) BibTeX
- Ephraim Korach, Michal Stern:
The complete optimal stars-clustering-tree problem.
444-450
Electronic Edition (link) BibTeX
- Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
The k-edge intersection graphs of paths in a tree.
451-461
Electronic Edition (link) BibTeX
- Ephraim Korach, Uri N. Peled, Udi Rotics:
Equistable distance-hereditary graphs.
462-477
Electronic Edition (link) BibTeX
- Vadim E. Levit, Eugen Mandrescu:
On the roots of independence polynomials of almost all very well-covered graphs.
478-491
Electronic Edition (link) BibTeX
- Yulia Kempner, Ilya B. Muchnik:
Quasi-concave functions on meet-semilattices.
492-499
Electronic Edition (link) BibTeX
- Vladimir R. Rosenfeld:
The circuit polynomial of the restricted rooted product G(Gamma) of graphs with a bipartite core G.
500-510
Electronic Edition (link) BibTeX
- Eldar Fischer, Johann A. Makowsky, Elena V. Ravve:
Counting truth assignments of formulas of bounded tree-width or clique-width.
511-529
Electronic Edition (link) BibTeX
- Robert H. Sloan, Balázs Szörényi, György Turán:
Projective DNF formulae and their revision.
530-544
Electronic Edition (link) BibTeX
Copyright © Wed Jun 4 19:06:43 2008
by Michael Ley (ley@uni-trier.de)
