4. CCS 1995:
Brest,
France
Michel Deza, Reinhardt Euler, Yannis Manoussakis (Eds.):
Combinatorics and Computer Science, 8th Franco-Japanese and 4th Franco-Chinese Conference, Brest, France, July 3-5, 1995, Selected Papers.
Lecture Notes in Computer Science 1120 Springer 1996, ISBN 3-540-61576-8 BibTeX
@proceedings{DBLP:conf/cococ/1995,
editor = {Michel Deza and
Reinhardt Euler and
Yannis Manoussakis},
title = {Combinatorics and Computer Science, 8th Franco-Japanese and 4th
Franco-Chinese Conference, Brest, France, July 3-5, 1995, Selected
Papers},
booktitle = {Combinatorics and Computer Science},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {1120},
year = {1996},
isbn = {3-540-61576-8},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Graph Theory
- Bor-Liang Chen, Ming-Tat Ko, Ko-Wei Lih:
Equitable and m-Bounded Coloring of Split Graphs.
1-5 BibTeX
- Philippe Rolland:
Four Coloring for a Subset of Maximal Planar Graphs with Minimum Degree Five.
6-17 BibTeX
- Yasuko Matsui, Tomomi Matsui:
Enumeration Algorithm for the Edge Coloring Problem on Bipartite Graphs.
18-26 BibTeX
- Wen-Lian Hsu:
On-Line Recognition of Interval Graphs in O(m + nlog n) Time.
27-38 BibTeX
- Chiuyuan Chen, Chin-Chen Chang:
Connected Proper Interval Graphs and the Guard Problem in Spiral Polygons.
39-47 BibTeX
- Hong-Gwa Yeh, Gerard J. Chang:
Weighted Connected Domination and Steiner Trees in Distance-Hereditary Graphs.
48-52 BibTeX
- Sergei L. Bezrukov, Firoz Kaderali, W. Poguntke:
On Central Spanning Trees of a Graph.
53-57 BibTeX
- Chiang Lin, Jenq-Jong Lin, Tay-Woei Shyu:
Complete Bipartite Decompositions of Crowns, with Applications to Complete Directed Graphs.
58-66 BibTeX
- Evripidis Bampis, Pavol Hell, Yannis Manoussakis, Moshe Rosenfeld:
Finding an Antidirected Hamiltonian Path Starting with a Forward Arc from a Given Vertex of a Tournament.
67-73 BibTeX
- Michel Deza, Tayuan Huang:
Complementary l1-Graphs and Related Combinatorial Structures.
74-90 BibTeX
Combinatorial Optimization
Selected Topics
- T. C. Hu, J. David Morgenthaler:
Optimum Alphabetic Binary Trees.
234-243 BibTeX
- Patrick Solé, Jean-Pierre Tillich:
Block Codes for Dyadic Phase Shift Keying.
244-262 BibTeX
- Bruno Patrou:
Zigzag Codes and Z-Free Hulls.
263-274 BibTeX
- Vincent Bouchitté, Abdelmajid Hilali, Roland Jégou, Jean-Xavier Rampon:
Contiguity Orders.
275-287 BibTeX
- József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger:
Worst-Case Analysis for On-Line Data Compression.
288-300 BibTeX
- Jean-Claude Bermond, Takako Kodate, Stephane Perennes:
Gossiping in Cayley Graphs by Packets.
301-315 BibTeX
- Thomas Andreae, Michael Nölle, Christof Rempel, Gerald Schreiber:
On Embedding 2-Dimensional Toroidal Grids into de Bruijn Graphs with Clocked Congestion One.
316-327 BibTeX
Parallel and Distributed Computing
Copyright © Sat May 16 23:02:45 2009
by Michael Ley (ley@uni-trier.de)
