4. CCS 1995: Brest, France

@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
  
• Philippe Rolland:
  Four Coloring for a Subset of Maximal Planar Graphs with Minimum Degree Five. 6-17
  
• Yasuko Matsui, Tomomi Matsui:
  Enumeration Algorithm for the Edge Coloring Problem on Bipartite Graphs. 18-26
  
• Wen-Lian Hsu:
  On-Line Recognition of Interval Graphs in O(m + nlog n) Time. 27-38
  
• Chiuyuan Chen, Chin-Chen Chang:
  Connected Proper Interval Graphs and the Guard Problem in Spiral Polygons. 39-47
  
• Hong-Gwa Yeh, Gerard J. Chang:
  Weighted Connected Domination and Steiner Trees in Distance-Hereditary Graphs. 48-52
  
• Sergei L. Bezrukov, Firoz Kaderali, W. Poguntke:
  On Central Spanning Trees of a Graph. 53-57
  
• Chiang Lin, Jenq-Jong Lin, Tay-Woei Shyu:
  Complete Bipartite Decompositions of Crowns, with Applications to Complete Directed Graphs. 58-66
  
• 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
  
• Michel Deza, Tayuan Huang:
  Complementary l₁-Graphs and Related Combinatorial Structures. 74-90
  

Combinatorial Optimization

• Komei Fukuda, Alain Prodon:
  Double Description Method Revisited. 91-111
  
• Antoine Deza, Michel Deza, Komei Fukuda:
  On Skeletons, Diameters and Volumes of Metric Polyhedra. 112-128
  
• Yves Caseau, François Laburthe:
  Improving Branch and Bound for Jobshop Scheduling with Constraint Propagation. 129-149
  
• Bettina Klinz, Gerhard J. Woeginger:
  A New Efficiently Solvable Special Case of the Three-Dimensional Axial Bottleneck Assignment Problem. 150-162
  
• Jihad Mohamad Jaam:
  Ramsey Numbers by Stochastic Algorithms with New Heuristics. 163-181
  
• Fouad B. Chedid:
  On the Hybrid Neural Network Model for Solving Optimization Problems. 182-193
  
• Marc Demange, Vangelis Th. Paschos:
  Constructive - Non-constructive Approximation and Maximum Independent Set Problem. 194-207
  
• Takashi Takabatake:
  Weakly Greedy Algorithm and Pair-Delta-Matroids. 208-217
  
• Karina Marcus, András Sebö:
  On Integer Multiflows and Metric Packings in Matroids. 218-233
  

Selected Topics

• T. C. Hu, J. David Morgenthaler:
  Optimum Alphabetic Binary Trees. 234-243
  
• Patrick Solé, Jean-Pierre Tillich:
  Block Codes for Dyadic Phase Shift Keying. 244-262
  
• Bruno Patrou:
  Zigzag Codes and Z-Free Hulls. 263-274
  
• Vincent Bouchitté, Abdelmajid Hilali, Roland Jégou, Jean-Xavier Rampon:
  Contiguity Orders. 275-287
  
• József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger:
  Worst-Case Analysis for On-Line Data Compression. 288-300
  
• Jean-Claude Bermond, Takako Kodate, Stephane Perennes:
  Gossiping in Cayley Graphs by Packets. 301-315
  
• 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
  

Parallel and Distributed Computing

• Fouzia Moussouni, Christian Lavault:
  N-Cube String Matching Algorithm with Long Texts. 328-340
  
• Håkan Lennerstad, Lars Lundberg:
  Combinatorics for Multiprocessor Scheduling Optimization and Oter Contexts in Computer Architecture. 341-347
  
• Reinhardt Euler, Laurent Lemarchand:
  Some Applications of Combinatorial Optimization in Parallel Computing. 348-366
  
• Evripidis Bampis, Yannis Manoussakis, Ioannis Milis:
  On the Parallel Complexity of the Alternating Hamiltonian Cycle Problem. 367-377
  
• Rossella Petreschi, Andrea Sterbini:
  Threshold Graphs and Synchronization Protocols. 378-395
  
• Ioannis Milis:
  Task Assignment in Distributed Systems Using Network Flow Methods. 396-405
  
• Dritan Nace, Jacques Carlier:
  Distributed Rerouting in DCS Mesh Networks. 406-415
  

Last update Thu May 24 04:15:02 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page