UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Characteristics of the Blitzortung.org Lightning Location Catalog in Japan

Atmosphere, 2023-10, Vol.14 (10), p.1507

2023

Volltextzugriff (PDF)

Directed NLC-width

Theoretical computer science, 2016-02, Vol.616, p.1-17

2016

Volltextzugriff (PDF)

A linear time algorithm for metric dimension of cactus block graphs

Theoretical computer science, 2016-05, Vol.630, p.43-62

2016

Volltextzugriff (PDF)

Criteria for optimizing cortical hierarchies with continuous ranges

Frontiers in neuroinformatics, 2010-03, Vol.4, p.7-7

2010

Volltextzugriff (PDF)

Shapley ratings in brain networks

Frontiers in neuroinformatics, 2007-11, Vol.1, p.2-2

2007

Volltextzugriff (PDF)

Vertex disjoint paths on clique-width bounded graphs

Theoretical computer science, 2006-08, Vol.359 (1-3), p.188-199

2006

Volltextzugriff (PDF)

Line graphs of bounded clique-width

Discrete mathematics, 2007-10, Vol.307 (22), p.2734-2754

2007

Volltextzugriff (PDF)

An algorithm for finding maximal common subtopologies in a set of protein structures

Journal of computational biology, 1996, Vol.3 (2), p.289-306

1996

Volltextzugriff (PDF)

Optimization of cortical hierarchies with continuous scales and ranges

NeuroImage (Orlando, Fla.), 2009-08, Vol.47 (2), p.611-617

2009

Volltextzugriff (PDF)

On the relationship between NLC-width and linear NLC-width

Theoretical computer science, 2005-11, Vol.347 (1), p.76-89

2005

Volltextzugriff (PDF)

A local characterization of bounded clique-width for line graphs

Discrete mathematics, 2007-03, Vol.307 (6), p.756-759

2007

Volltextzugriff (PDF)

Deciding Clique-Width for Graphs of Bounded Tree-Width

Journal of graph algorithms and applications, 2003, Vol.7 (2), p.141-180

2003

Volltextzugriff (PDF)

The complexity of connectivity problems on context-free graph languages

Journal of computer and system sciences, 1994-08, Vol.49 (1), p.57-82

Wanke, Egon

1994

Volltextzugriff (PDF)

Algorithms for graph problems on BNLC structured graphs

Information and computation, 1991-09, Vol.94 (1), p.93-122

Wanke, Egon

1991

Volltextzugriff (PDF)

The Bounded Degree Problem for eNCE Graph Grammars

Information and computation, 1997-05, Vol.135 (1), p.15-35

1997

Volltextzugriff (PDF)

On the Decidability of Certain Integer Subgraph Problems on Context-Free Graph Languages

Information and computation, 1994, Vol.113 (1), p.26-49

Wanke, E.

1994

Volltextzugriff (PDF)

Emptiness Problems of eNCE Graph Languages

Journal of computer and system sciences, 1995-12, Vol.51 (3), p.472-485

1995

Volltextzugriff (PDF)

1 – 17 von 17

Menü

Weitere Dienste

Einstellungen

Characteristics of the Blitzortung.org Lightning Location Catalog in Japan

Directed NLC-width

A linear time algorithm for metric dimension of cactus block graphs

Criteria for optimizing cortical hierarchies with continuous ranges

Shapley ratings in brain networks

Vertex disjoint paths on clique-width bounded graphs

Line graphs of bounded clique-width

An algorithm for finding maximal common subtopologies in a set of protein structures

Optimization of cortical hierarchies with continuous scales and ranges

On the relationship between NLC-width and linear NLC-width

A local characterization of bounded clique-width for line graphs

Deciding Clique-Width for Graphs of Bounded Tree-Width

The complexity of connectivity problems on context-free graph languages

Algorithms for graph problems on BNLC structured graphs

The Bounded Degree Problem for eNCE Graph Grammars

On the Decidability of Certain Integer Subgraph Problems on Context-Free Graph Languages

Emptiness Problems of eNCE Graph Languages

Aktive Filter

Suchergebnisse filtern