UB Paderborn / Katalog / Suche / in CDI

Computing directed Steiner path covers

Journal of combinatorial optimization, 2022-03, Vol.43 (2), p.402-431

2022

Volltextzugriff (PDF)

Characteristics of the Blitzortung.org Lightning Location Catalog in Japan

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

2023

Volltextzugriff (PDF)

A note on the complexity of k-metric dimension

Applied mathematics and computation, 2023-11, Vol.457, p.128204, Article 128204

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)

Minimizing the number of max-power users in ad-hoc wireless networks with minimum node degree requirements

Information processing letters, 2018-08, Vol.136, p.25-29

2018

Volltextzugriff (PDF)

Directed Pathwidth and Palletizers

Combinatorial Optimization and Applications, p.31-44

Volltextzugriff (PDF)

Shapley ratings in brain networks

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

2007

Volltextzugriff (PDF)

The Neighborhood Broadcast Problem in Wireless Ad Hoc Sensor Networks

International journal on applications of graph theory in wireless ad hoc networks and sensor networks, 2017-03, Vol.9 (1), p.1-22

2017

Volltextzugriff (PDF)

Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms

OR Spectrum, 2019-06, Vol.41 (2), p.581-611

2019

Volltextzugriff (PDF)

The Fault-Tolerant Metric Dimension of Cographs

Fundamentals of Computation Theory, p.350-364

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)

The NLC-width and clique-width for powers of graphs of bounded tree-width

Discrete Applied Mathematics, 2009-02, Vol.157 (4), p.583-595

2009

Volltextzugriff (PDF)

On the complexity of the FIFO stack-up problem

Mathematical methods of operations research (Heidelberg, Germany), 2016-02, Vol.83 (1), p.33-52

2016

Volltextzugriff (PDF)

Line graphs of bounded clique-width

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

2007

Volltextzugriff (PDF)

Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract)

SOFSEM 2020: Theory and Practice of Computer Science, p.556-565

Volltextzugriff (PDF)

k-NLC graphs and polynomial algorithms

Discrete Applied Mathematics, 1994-10, Vol.54 (2), p.251-266

Wanke, Egon

1994

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)

Metric Dimension for Gabriel Unit Disk Graphs Is NP-Complete

Algorithms for Sensor Systems, p.90-92

Volltextzugriff (PDF)

Deducing logical relationships between spatially registered cortical parcellations under conditions of uncertainty

Neural networks, 2008-10, Vol.21 (8), p.1132-1145

2008

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)

On Module-Composed Graphs

Graph-Theoretic Concepts in Computer Science, p.166-177

Volltextzugriff (PDF)

Minimizing NLC-Width is NP-Complete

Graph-Theoretic Concepts in Computer Science, 2005, p.69-80

2005

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

Computing directed Steiner path covers

Characteristics of the Blitzortung.org Lightning Location Catalog in Japan

A note on the complexity of k-metric dimension

Directed NLC-width

A linear time algorithm for metric dimension of cactus block graphs

Criteria for optimizing cortical hierarchies with continuous ranges

Minimizing the number of max-power users in ad-hoc wireless networks with minimum node degree requirements

Directed Pathwidth and Palletizers

Shapley ratings in brain networks

The Neighborhood Broadcast Problem in Wireless Ad Hoc Sensor Networks

Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms

The Fault-Tolerant Metric Dimension of Cographs

Vertex disjoint paths on clique-width bounded graphs

The NLC-width and clique-width for powers of graphs of bounded tree-width

On the complexity of the FIFO stack-up problem

Line graphs of bounded clique-width

Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract)

k-NLC graphs and polynomial algorithms

Optimization of cortical hierarchies with continuous scales and ranges

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

Metric Dimension for Gabriel Unit Disk Graphs Is NP-Complete

Deducing logical relationships between spatially registered cortical parcellations under conditions of uncertainty

A local characterization of bounded clique-width for line graphs

On Module-Composed Graphs

Minimizing NLC-Width is NP-Complete

Aktive Filter

Suchergebnisse filtern