UB Paderborn / Katalog / Suche / in CDI

1 – 25 von 25

Sortiert nach

A Color-Avoiding Approach to Subgraph Counting in Bounded Expansion Classes

Algorithmica, 2023-08, Vol.85 (8), p.2318-2347

2023

Link zum Volltext

Verfügbarkeit prüfen

Exploring neighborhoods in large metagenome assembly graphs using spacegraphcats reveals hidden sequence diversity

Genome Biology, 2020-07, Vol.21 (1), p.164-164, Article 164

2020

Link zum Volltext

Verfügbarkeit prüfen

Longitudinal Comparison of Constant Artifacts in Optical Coherence Tomography Angiography in Patients with Posterior Uveitis Compared to Healthy Subjects

Journal of clinical medicine, 2022-09, Vol.11 (18), p.5376

2022

Link zum Volltext

Verfügbarkeit prüfen

Width, Depth, and Space: Tradeoffs between Branching and Dynamic Programming

Algorithms, 2018-07, Vol.11 (7), p.98

2018

Link zum Volltext

Verfügbarkeit prüfen

Characterising bounded expansion by neighbourhood complexity

European journal of combinatorics, 2019-01, Vol.75, p.152-168

2019

Link zum Volltext

Verfügbarkeit prüfen

Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials

Journal of computer and system sciences, 2018-08, Vol.95, p.69-85

2018

Link zum Volltext

Verfügbarkeit prüfen

Alternative parameterizations of Metric Dimension

Theoretical computer science, 2020-02, Vol.806, p.133-143

2020

Link zum Volltext

Verfügbarkeit prüfen

k-distinct in- and out-branchings in digraphs

Journal of computer and system sciences, 2018-08, Vol.95, p.86-97

2018

Link zum Volltext

Verfügbarkeit prüfen

Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs

Journal of computer and system sciences, 2019-11, Vol.105, p.199-241

2019

Link zum Volltext

Verfügbarkeit prüfen

Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions

ACM transactions on algorithms, 2016-02, Vol.12 (2), p.1-41

2016

Link zum Volltext

Verfügbarkeit prüfen

Kernelization using structural parameters on sparse graph classes

Journal of computer and system sciences, 2017-03, Vol.84, p.219-242

2017

Link zum Volltext

Verfügbarkeit prüfen

Path-contractions, edge deletions and connectivity preservation

Journal of computer and system sciences, 2019-05, Vol.101, p.1-20

2019

Link zum Volltext

Verfügbarkeit prüfen

Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness

The ACM journal of experimental algorithmics, 2019-12, Vol.24 (1), p.1-34

2019

Link zum Volltext

Verfügbarkeit prüfen

Practical algorithms for MSO model-checking on tree-decomposable graphs

Computer science review, 2014-11, Vol.13-14, p.39-74

2014

Link zum Volltext

Verfügbarkeit prüfen

Harmless Sets in Sparse Classes

Combinatorial Algorithms, p.299-312

Link zum Volltext

Verfügbarkeit prüfen

Hyperbolicity, degeneracy, and expansion of random intersection graphs

Internet mathematics, 2017-01

2017

Link zum Volltext

Verfügbarkeit prüfen

Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions

Automata, Languages, and Programming, p.613-624

Link zum Volltext

Verfügbarkeit prüfen

A Faster Parameterized Algorithm for Treedepth

Automata, Languages, and Programming, p.931-942

Link zum Volltext

Verfügbarkeit prüfen

Kernelization Using Structural Parameters on Sparse Graph Classes

Algorithms – ESA 2013, p.529-540

Link zum Volltext

Verfügbarkeit prüfen

Hyperbolicity, Degeneracy, and Expansion of Random Intersection Graphs

Algorithms and Models for the Web Graph, p.29-41

Link zum Volltext

Verfügbarkeit prüfen

Air-Indexing on Error Prone Communication Channels

Database Systems for Advanced Applications, p.505-519

Link zum Volltext

Verfügbarkeit prüfen

Hierarchical Clustering for Real-Time Stream Data with Noise

Scientific and Statistical Database Management, p.405-413

Link zum Volltext

Verfügbarkeit prüfen

Finite Integer Index of Pathwidth and Treewidth

Parameterized and Exact Computation, 2014, Vol.8894, p.258-269

2014

Link zum Volltext

Verfügbarkeit prüfen

Asymptotic Analysis of Equivalences and Core-Structures in Kronecker-Style Graph Models

2016 IEEE 16th International Conference on Data Mining (ICDM), 2016, p.829-834

2016

Link zum Volltext
IEEE_Xplore

Optoacoustic biomarkers of lipids, hemorrhage and inflammation in carotid atherosclerosis

Frontiers in cardiovascular medicine, 2023, Vol.10, p.1210032-1210032

2023

Link zum Volltext

Verfügbarkeit prüfen

1 – 25 von 25

Suche als RSS-Feed

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(23)
Mit Volltextzugriff
(25)

Publikationsform

Sprache

Englisch
(25)

Erscheinungsjahr

n.n

Thema

Science & Technology
(20)
Computer Science
(17)
Technology
(17)
Computer Science, Theory & Methods
(16)
Algorithms
(6)
Computer Science, Hardware & Architecture
(5)
Mathematics
(5)
Physical Sciences
(5)
Computer Science, Information Systems
(4)
Mathematics, Applied
(4)
Parameterized Complexity
(4)
Bounded Expansion
(3)
Decomposition
(3)
Fixed-Parameter Tractable
(3)
Graphs
(3)
Sparse Graphs
(3)
Treedepth
(3)
Algorithmic Meta-Theorems
(2)
Computer Science, Software Engineering
(2)
Constants
(2)

15 weitere anzeigen...

Weniger anzeigen...

Menü

Weitere Dienste

Einstellungen

A Color-Avoiding Approach to Subgraph Counting in Bounded Expansion Classes

Exploring neighborhoods in large metagenome assembly graphs using spacegraphcats reveals hidden sequence diversity

Longitudinal Comparison of Constant Artifacts in Optical Coherence Tomography Angiography in Patients with Posterior Uveitis Compared to Healthy Subjects

Width, Depth, and Space: Tradeoffs between Branching and Dynamic Programming

Characterising bounded expansion by neighbourhood complexity

Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials

Alternative parameterizations of Metric Dimension

k-distinct in- and out-branchings in digraphs

Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs

Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions

Kernelization using structural parameters on sparse graph classes

Path-contractions, edge deletions and connectivity preservation

Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness

Practical algorithms for MSO model-checking on tree-decomposable graphs

Harmless Sets in Sparse Classes

Hyperbolicity, degeneracy, and expansion of random intersection graphs

Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions

A Faster Parameterized Algorithm for Treedepth

Kernelization Using Structural Parameters on Sparse Graph Classes

Hyperbolicity, Degeneracy, and Expansion of Random Intersection Graphs

Air-Indexing on Error Prone Communication Channels

Hierarchical Clustering for Real-Time Stream Data with Noise

Finite Integer Index of Pathwidth and Treewidth

Asymptotic Analysis of Equivalences and Core-Structures in Kronecker-Style Graph Models

Optoacoustic biomarkers of lipids, hemorrhage and inflammation in carotid atherosclerosis

Suchergebnisse filtern