Sommaire

Contraction and treewidth lower bounds.

Bodlaender, Hans L. ; Wolle, Thomas ; Koster, Arie M.C.A.

Full (PDF)
p. 5-49

The Electronic Library of Mathematics
Distributing unit size workload packages in heterogeneous networks.

Elsässer, Robert ; Monien, Burkhard ; Schamberger, Stefan

Full (PDF)
p. 51-68

The Electronic Library of Mathematics
Finding dominators in practice.

Georgiadis, Loukas ; Tarjan, Robert E. ; Werneck, Renato F.

Full (PDF)
p. 69-94

The Electronic Library of Mathematics
Collective tree spanners and routing in AT-free related graphs.

Dragan, Feodor F. ; Yan, Chenyu ; Corneil, Derek G.

Full (PDF)
p. 97-122

The Electronic Library of Mathematics
A factor-two approximation algorithm for two-dimensional phase unwrapping.

Bar-Yehuda, Reuven ; Yavneh, Irad

Full (PDF)
p. 123-139

The Electronic Library of Mathematics
Orthogonal hypergraph drawing for improved visibility.

Eschbach, Thomas ; Guenther, Wolfgang ; Becker, Bernd

Full (PDF)
p. 141-157

The Electronic Library of Mathematics
A survey of the algorithmic properties of simplicial, upper bound and middle graphs.

Cheston, Grant A. ; Jap, Tjoen Seng

Full (PDF)
p. 159-190

The Electronic Library of Mathematics
Computing communities in large networks using random walks.

Pons, Pascal ; Latapy, Matthieu

Full (PDF)
p. 191-218

The Electronic Library of Mathematics
Algorithms and experiments for the Webgraph.

Donato, Debora ; Laura, Luigi ; Leonardi, Stefano ; Meyer, Ulrich ; Millozzi, Stefano ; Sibeyn, Jop F.

Full (PDF)
p. 219-236

The Electronic Library of Mathematics
A multilevel algorithm for the minimum 2-sum problem.

Safro, Ilya ; Ron, Dorit ; Brandt, Achi

Full (PDF)
p. 237-258

The Electronic Library of Mathematics
Upward planar drawings and switch-regularity heuristics.

Didimo, Walter

Full (PDF)
p. 259-285

The Electronic Library of Mathematics
Drawing Kn in three dimensions with one bend per edge.

Devillers, Olivier ; Everett, Hazel ; Lazard, Sylvain ; Pentcheva, Maria ; Wismath, Stephen

Full (PDF)
p. 287-295

The Electronic Library of Mathematics
On the approximation of min split-coloring and min cocoloring.

Demange, Marc ; Ekim, Tinaz ; De Werra, Dominique

Full (PDF)
p. 297-315

The Electronic Library of Mathematics
NP-completeness of the planar separator problems.

Fukuyama, Junichiro

Full (PDF)
p. 317-328

The Electronic Library of Mathematics
Efficient drawing of RNA secondary structure.

Auber, David ; Delest, Maylis ; Domenger, Jean-Philippe ; Dulucq, Serge

Full (PDF)
p. 329-351

The Electronic Library of Mathematics
Planar embeddability of the vertices of a graph using a fixed point set is NP-hard.

Cabello, Sergio

Full (PDF)
p. 353-363

The Electronic Library of Mathematics
Small stretch spanners on dynamic graphs.

Ausiello, Giorgio ; Franciosa, Paolo G. ; Italiano, Giuseppe F.

Full (PDF)
p. 365-385

The Electronic Library of Mathematics
A new algorithm for finding minimal cycle-breaking sets of turns in a graph.

Levitin, Lev ; Karpovsky, Mark ; Mustafa, Mehmet ; Zakrevski, Lev

Full (PDF)
p. 387-420

The Electronic Library of Mathematics