UB Paderborn / Katalog / Suche / in CDI

A linear-time algorithm for finding tree-decompositions of small treewidth

SIAM journal on computing, 1996-12, Vol.25 (6), p.1305-1317

BODLAENDER, H. L

1996

Link zum Volltext

Verfügbarkeit prüfen

Linear-processor NC algorithms for planar directed graphs. I: Strongly connected components

SIAM journal on computing, 1993-06, Vol.22 (3), p.431-459

Kao, Ming-Yang

1993

Link zum Volltext

Verfügbarkeit prüfen

The complexity of multiterminal cuts

SIAM journal on computing, 1994-08, Vol.23 (4), p.864-894

1994

Link zum Volltext

Verfügbarkeit prüfen

On-line planarity testing

SIAM journal on computing, 1996-10, Vol.25 (5), p.956-997

1996

Link zum Volltext

Verfügbarkeit prüfen

Spectral Gap Amplification

SIAM journal on computing, 2013-01, Vol.42 (2), p.593-610

2013

Link zum Volltext

Verfügbarkeit prüfen

Diagnosis of ${t / {(t + 1)}}$-Diagnosable Systems

SIAM journal on computing, 1994-10, Vol.23 (5), p.895-905

1994

Link zum Volltext

Verfügbarkeit prüfen

Fully dynamic algorithms for 2-edge connectivity

SIAM journal on computing, 1992-12, Vol.21 (6), p.1047-1069

1992

Link zum Volltext

Verfügbarkeit prüfen

O(M.N) algorithms for the recognition and isomorphism problems on circular-arc graphs

SIAM journal on computing, 1995-06, Vol.24 (3), p.411-439

Hsu, Wen Lian

1995

Link zum Volltext

Verfügbarkeit prüfen

On finding the rectangular duals of planar triangular graphs

SIAM journal on computing, 1993-12, Vol.22 (6), p.1218-1226

He, Xin

1993

Link zum Volltext

Verfügbarkeit prüfen

Efficient Parallel Algorithms for Chordal Graphs

SIAM journal on computing, 1996-08, Vol.25 (4), p.797

Klein, Philip N

1996

Link zum Volltext

Verfügbarkeit prüfen

Floor-planning by graph dualization: 2-concave rectilinear modules

SIAM journal on computing, 1993-06, Vol.22 (3), p.500-526

1993

Link zum Volltext

Verfügbarkeit prüfen

Scan-first search and sparse certificates: an improved parallel algorithm for k-vertex connectivity

SIAM journal on computing, 1993-02, Vol.22 (1), p.157-174

1993

Link zum Volltext

Verfügbarkeit prüfen

Finding a smallest augmentation to biconnect a graph

SIAM journal on computing, 1993-10, Vol.22 (5), p.889-912

1993

Link zum Volltext

Verfügbarkeit prüfen

On embedding a graph in the grid with the minimum number of bends

SIAM journal on computing, 1987-06, Vol.16 (3), p.421-444

TAMASSIA, R

1987

Link zum Volltext

Verfügbarkeit prüfen

Maintaining the 3-edge-connected components of a graph on-line

SIAM journal on computing, 1993-02, Vol.22 (1), p.11-28

1993

Link zum Volltext

Verfügbarkeit prüfen

Linear-time representation algorithms for proper circular-arc graphs and proper interval graphs

SIAM journal on computing, 1996-04, Vol.25 (2), p.390-403

1996

Link zum Volltext

Verfügbarkeit prüfen

Flow in planar graphs with multiple sources and sinks

SIAM journal on computing, 1995-10, Vol.24 (5), p.1002-1017

1995

Link zum Volltext

Verfügbarkeit prüfen

Partitioning planar graphs

SIAM journal on computing, 1992-04, Vol.21 (2), p.203-215

1992

Link zum Volltext

Verfügbarkeit prüfen

Identifying the minimal transversals of a hypergraph and related problems

SIAM journal on computing, 1995-12, Vol.24 (6), p.1278-1304

1995

Link zum Volltext

Verfügbarkeit prüfen

Constructing arrangements of lines and hyperplanes with applications

SIAM journal on computing, 1986-05, Vol.15 (2), p.341-363

1986

Link zum Volltext

Verfügbarkeit prüfen

Simple and fast algorithms for linear and integer programs with two variables per inequality

SIAM journal on computing, 1994-12, Vol.23 (6), p.1179-1192

1994

Link zum Volltext

Verfügbarkeit prüfen

Laying out graphs using queues

SIAM journal on computing, 1992-10, Vol.21 (5), p.927-958

1992

Link zum Volltext

Verfügbarkeit prüfen

Upward planar drawing of single-source acyclic digraphs

SIAM journal on computing, 1996-04, Vol.25 (2), p.291-311

1996

Link zum Volltext

Verfügbarkeit prüfen

Integer linear programs and local search for max-cut

SIAM journal on computing, 1995-08, Vol.24 (4), p.822-839

POLJAK, S

1995

Link zum Volltext

Verfügbarkeit prüfen

Finding regular simple paths in graph databases

SIAM journal on computing, 1995-12, Vol.24 (6), p.1235-1258

1995

Link zum Volltext

Verfügbarkeit prüfen

Menü

Weitere Dienste

Einstellungen

A linear-time algorithm for finding tree-decompositions of small treewidth

Linear-processor NC algorithms for planar directed graphs. I: Strongly connected components

The complexity of multiterminal cuts

On-line planarity testing

Spectral Gap Amplification

Diagnosis of ${t / {(t + 1)}}$-Diagnosable Systems

Fully dynamic algorithms for 2-edge connectivity

O(M.N) algorithms for the recognition and isomorphism problems on circular-arc graphs

On finding the rectangular duals of planar triangular graphs

Efficient Parallel Algorithms for Chordal Graphs

Floor-planning by graph dualization: 2-concave rectilinear modules

Scan-first search and sparse certificates: an improved parallel algorithm for k-vertex connectivity

Finding a smallest augmentation to biconnect a graph

On embedding a graph in the grid with the minimum number of bends

Maintaining the 3-edge-connected components of a graph on-line

Linear-time representation algorithms for proper circular-arc graphs and proper interval graphs

Flow in planar graphs with multiple sources and sinks

Partitioning planar graphs

Identifying the minimal transversals of a hypergraph and related problems

Constructing arrangements of lines and hyperplanes with applications

Simple and fast algorithms for linear and integer programs with two variables per inequality

Laying out graphs using queues

Upward planar drawing of single-source acyclic digraphs

Integer linear programs and local search for max-cut

Finding regular simple paths in graph databases

Aktive Filter

Suchergebnisse filtern