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...

Quasipolynomial Multicut-mimicking Networks and Kernels for Multiway Cut Problems

ACM transactions on algorithms, 2022-04, Vol.18 (2), p.1-19

Wahlström, Magnus

2022

Volltextzugriff (PDF)

Representative Sets and Irrelevant Vertices: New Tools for Kernelization

Journal of the ACM, 2020-06, Vol.67 (3), p.1-50

2020

Volltextzugriff (PDF)

Half-integrality, LP-branching, and FPT Algorithms

SIAM journal on computing, 2016-01, Vol.45 (4), p.1377-1411

2016

Volltextzugriff (PDF)

Parameterized Pre-Coloring Extension and List Coloring Problems

SIAM journal on discrete mathematics, 2021-01, Vol.35 (1), p.575-596

2021

Volltextzugriff (PDF)

On Problems as Hard as CNF-SAT

ACM transactions on algorithms, 2016-06, Vol.12 (3), p.1-24

2016

Volltextzugriff (PDF)

Component Order Connectivity in Directed Graphs

Algorithmica, 2022-09, Vol.84 (9), p.2767-2784

2022

Volltextzugriff (PDF)

Directed Multicut is W[1]-hard, Even for Four Terminal Pairs

ACM transactions on computation theory, 2018-06, Vol.10 (3), p.1-18

2018

Volltextzugriff (PDF)

The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems

ACM transactions on computation theory, 2022-03, Vol.14 (1), p.1-54

2022

Volltextzugriff (PDF)

Rural postman parameterized by the number of components of required edges

Journal of computer and system sciences, 2017-02, Vol.83 (1), p.121-131

2017

Volltextzugriff (PDF)

Multi-budgeted Directed Cuts

Algorithmica, 2020-08, Vol.82 (8), p.2135-2155

2020

Volltextzugriff (PDF)

Sparsification of SAT and CSP Problems via Tractable Extensions

ACM transactions on computation theory, 2020-06, Vol.12 (2), p.1-29

2020

Volltextzugriff (PDF)

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

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

2018

Volltextzugriff (PDF)

On Weighted Graph Separation Problems and Flow Augmentation

SIAM journal on discrete mathematics, 2024-01, Vol.38 (1), p.170-189

2024

Volltextzugriff (PDF)

Alternative parameterizations of Metric Dimension

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

2020

Volltextzugriff (PDF)

Preference swaps for the stable matching problem

Theoretical computer science, 2023-01, Vol.940, p.222-230

2023

Volltextzugriff (PDF)

Many-visits TSP revisited

Journal of computer and system sciences, 2022-03, Vol.124, p.112-128

2022

Volltextzugriff (PDF)

The power of primitive positive definitions with polynomially many variables

Journal of logic and computation, 2017, Vol.27 (5), p.exw005

2017

Volltextzugriff (PDF)

k-distinct in- and out-branchings in digraphs

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

2018

Volltextzugriff (PDF)

Flow-augmentation II: Undirected Graphs

ACM transactions on algorithms, 2024-03, Vol.20 (2), p.1-26, Article 12

2024

Volltextzugriff (PDF)

p-Edge/vertex-connected vertex cover: Parameterized and approximation algorithms

Journal of computer and system sciences, 2023-05, Vol.133, p.23-40

2023

Volltextzugriff (PDF)

Directed flow-augmentation

Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, 2022, p.938-947

2022

Volltextzugriff (PDF)

r -Simple k -Path and Related Problems Parameterized by k / r

ACM transactions on algorithms, 2021-01, Vol.17 (1), p.1-64

2021

Volltextzugriff (PDF)

Randomized Contractions Meet Lean Decompositions

ACM transactions on algorithms, 2021-01, Vol.17 (1), p.1-30

2021

Volltextzugriff (PDF)

Path-contractions, edge deletions and connectivity preservation

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

2019

Volltextzugriff (PDF)

Chinese Postman Problem on edge-colored multigraphs

Discrete Applied Mathematics, 2017-01, Vol.217, p.196-202

2017

Volltextzugriff (PDF)

1 – 25 von 158

Menü

Weitere Dienste

Einstellungen

Quasipolynomial Multicut-mimicking Networks and Kernels for Multiway Cut Problems

Representative Sets and Irrelevant Vertices: New Tools for Kernelization

Half-integrality, LP-branching, and FPT Algorithms

Parameterized Pre-Coloring Extension and List Coloring Problems

On Problems as Hard as CNF-SAT

Component Order Connectivity in Directed Graphs

Directed Multicut is W[1]-hard, Even for Four Terminal Pairs

The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems

Rural postman parameterized by the number of components of required edges

Multi-budgeted Directed Cuts

Sparsification of SAT and CSP Problems via Tractable Extensions

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

On Weighted Graph Separation Problems and Flow Augmentation

Alternative parameterizations of Metric Dimension

Preference swaps for the stable matching problem

Many-visits TSP revisited

The power of primitive positive definitions with polynomially many variables

k-distinct in- and out-branchings in digraphs

Flow-augmentation II: Undirected Graphs

p-Edge/vertex-connected vertex cover: Parameterized and approximation algorithms

Directed flow-augmentation

r -Simple k -Path and Related Problems Parameterized by k / r

Randomized Contractions Meet Lean Decompositions

Path-contractions, edge deletions and connectivity preservation

Chinese Postman Problem on edge-colored multigraphs

Suchergebnisse filtern