Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=1120

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

Equitable and m-bounded coloring of split graphs
Bor-Liang Chen, Ming-Tat Ko, Ko-Wei Lih
Lecture Notes in Computer Science 1120, 1996, pp. 1-5
Four coloring for a subset of maximal planar graphs with minimum degree five
Philippe Rolland
Lecture Notes in Computer Science 1120, 1996, pp. 6-17
Enumeration algorithm for the edge coloring problem on bipartite graphs
Yasuko Matsui, Tomomi Matsui
Lecture Notes in Computer Science 1120, 1996, pp. 18-26
On-line recognition of interval graphs in O(m + n\log n) time
Wen-Lian Hsu
Lecture Notes in Computer Science 1120, 1996, pp. 27-38
Connected proper interval graphs and the guard problem in spiral polygons
Chiuyuan Chen, Chin-Chen Chang
Lecture Notes in Computer Science 1120, 1996, pp. 39-47
Weighted connected domination and Steiner trees in distance-hereditary graphs
Hong-Gwa Yeh, Gerard J. Chang
Lecture Notes in Computer Science 1120, 1996, pp. 48-52
On central spanning trees of a graph
S. Bezrukov, F. Kaderali, W. Poguntke
Lecture Notes in Computer Science 1120, 1996, pp. 53-57
Complete bipartite decompositions of crowns, with applications to complete directed graphs
Chiang Lin, Jenq-Jong Lin, Tay-Woei Shyu
Lecture Notes in Computer Science 1120, 1996, pp. 58-66
Finding an antidirected Hamiltonian path starting with a forward arc from a given vertex of a tournament
E. Bampis, P. Hell, Y. Manoussakis, M. Rosenfeld
Lecture Notes in Computer Science 1120, 1996, pp. 67-73
Complementary l_1-graphs and related combinatorial structures
Michel Deza, Tayuan Huang
Lecture Notes in Computer Science 1120, 1996, pp. 74-90
Double description method revisited
Komei Fukuda, Alain Prodon
Lecture Notes in Computer Science 1120, 1996, pp. 91-111
On skeletons, diameters and volumes of metric polyhedra
Antoine Deza, Michel Deza, Komei Fukuda
Lecture Notes in Computer Science 1120, 1996, pp. 112-128
Improving branch and bound for jobshop scheduling with constraint propagation
Yves Caseau, François Laburthe
Lecture Notes in Computer Science 1120, 1996, pp. 129-149
A new efficiently solvable special case of the three-dimensional axial bottleneck assignment problem
Bettina Klinz, Gerhard J. Woeginger
Lecture Notes in Computer Science 1120, 1996, pp. 150-162
Ramsey numbers by stochastic algorithms with new heuristics
Jihad Jaam
Lecture Notes in Computer Science 1120, 1996, pp. 163-181
On the hybrid neural network model for solving optimization problems
Fouad B. Chedid
Lecture Notes in Computer Science 1120, 1996, pp. 182-193
Constructive - non-constructive approximation and maximum independent set problem
Marc Demange, Vangelis Th. Paschos
Lecture Notes in Computer Science 1120, 1996, pp. 194-207
Weakly greedy algorithm and pair-delta-matroids
Takashi Takabatake
Lecture Notes in Computer Science 1120, 1996, pp. 208-217
On integer multiflows and metric packings in matroids
Karina Marcus, András Sebŏ
Lecture Notes in Computer Science 1120, 1996, pp. 218-233
Optimum alphabetic binary trees
T.C. Hu, J.D. Morgenthaler
Lecture Notes in Computer Science 1120, 1996, pp. 234-243
Block codes for dyadic phase shift keying
Patrick Solé, Jean-Pierre Tillich
Lecture Notes in Computer Science 1120, 1996, pp. 244-262
Zigzag codes and Z-free hulls
Bruno Patrou
Lecture Notes in Computer Science 1120, 1996, pp. 263-274
Contiguity orders
Vincent Bouchitté, Abdelmajid Hilali, Roland Jégou, Jean-Xavier Rampon
Lecture Notes in Computer Science 1120, 1996, pp. 275-287
Worst-case analysis for on-line data compression
József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger
Lecture Notes in Computer Science 1120, 1996, pp. 288-300
Gossiping in Cayley graphs by packets
Jean-Claude Bermond, Takako Kodate, Stéphane Pérennes
Lecture Notes in Computer Science 1120, 1996, pp. 301-315

Seiten 1 2 >