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

New parameterized algorithms for the edge dominating set problem

Theoretical computer science, 2013-11, Vol.511, p.147-158

2013

Volltextzugriff (PDF)

Efficient algorithms for Roman domination on some classes of graphs

Discrete Applied Mathematics, 2008-11, Vol.156 (18), p.3400-3415

2008

Volltextzugriff (PDF)

Treewidth: Computations and Approximations

Kloks, Ton

1994

Volltextzugriff (PDF)

A Guide to Graph Algorithms

1, 2022

Volltextzugriff (PDF)

Complexity of paired domination in AT-free and planar graphs

Theoretical computer science, 2022-09, Vol.930, p.53-62

2022

Volltextzugriff (PDF)

Finding and counting small induced subgraphs efficiently

Information processing letters, 2000-05, Vol.74 (3), p.115-121

2000

Volltextzugriff (PDF)

Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs

Journal of algorithms, 1996-09, Vol.21 (2), p.358-402

1996

Volltextzugriff (PDF)

Semitotal Domination on AT-Free Graphs and Circle Graphs

Algorithms and Discrete Applied Mathematics, 2021, Vol.12601, p.55-65

2021

Volltextzugriff (PDF)

On treewidth and minimum fill-in of asteroidal triple-free graphs

Theoretical computer science, 1997-04, Vol.175 (2), p.309-335

1997

Volltextzugriff (PDF)

A note on the geodetic number and the Steiner number of AT-free graphs

Theoretical computer science, 2021-01, Vol.854, p.131-135

2021

Volltextzugriff (PDF)

Computing the branchwidth of interval graphs

Discrete Applied Mathematics, 2005-01, Vol.145 (2), p.266-275

2005

Volltextzugriff (PDF)

The combinatorics of N.G. de Bruijn

Indagationes mathematicae, 2013-11, Vol.24 (4), p.939-970

2013

Volltextzugriff (PDF)

On retracts, absolute retracts, and foldings in cographs

Optimization letters, 2018-05, Vol.12 (3), p.535-549

2018

Volltextzugriff (PDF)

Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences

Journal of combinatorial theory. Series B, 2009-09, Vol.99 (5), p.733-800

2009

Volltextzugriff (PDF)

On efficient absorbant conjecture in generalized De Bruijn digraphs

International journal of computer mathematics, 2017-05, Vol.94 (5), p.922-932

2017

Volltextzugriff (PDF)

Edge-clique covers of the tensor product

Theoretical computer science, 2015-11, Vol.607, p.68-74

2015

Volltextzugriff (PDF)

Complexity of Paired Domination in AT-free and Planar Graphs

Algorithms and Discrete Applied Mathematics, 2022, Vol.13179, p.65-77

2022

Volltextzugriff (PDF)

Treewidth and pathwidth of permutation graphs

SIAM journal on discrete mathematics, 1995-11, Vol.8 (4), p.606-616

1995

Volltextzugriff (PDF)

Measuring the vulnerability for classes of intersection graphs

Discrete Applied Mathematics, 1997-08, Vol.77 (3), p.259-270

1997

Volltextzugriff (PDF)

On maximum independent set of categorical product and ultimate categorical ratios of graphs

Theoretical computer science, 2015-07, Vol.588, p.81-95

2015

Volltextzugriff (PDF)

Approximating the Bandwidth for Asteroidal Triple-Free Graphs

Journal of algorithms, 1999-07, Vol.32 (1), p.41-57

1999

Volltextzugriff (PDF)

On the complexity of the black-and-white coloring problem on some classes of perfect graphs

Theoretical computer science, 2014-05, Vol.532, p.51-63

2014

Volltextzugriff (PDF)

Block-graph width

Theoretical computer science, 2011-05, Vol.412 (23), p.2496-2502

2011

Volltextzugriff (PDF)

On the Grundy number of Cameron graphs

Electronic notes in discrete mathematics, 2017-12, Vol.63, p.503-516

2017

Volltextzugriff (PDF)

Fixed-parameter complexity of λ-labelings

Discrete Applied Mathematics, 2001, Vol.113 (1), p.59-72

2001

Volltextzugriff (PDF)

1 – 25 von 119

Menü

Weitere Dienste

Einstellungen

New parameterized algorithms for the edge dominating set problem

Efficient algorithms for Roman domination on some classes of graphs

Treewidth: Computations and Approximations

A Guide to Graph Algorithms

Complexity of paired domination in AT-free and planar graphs

Finding and counting small induced subgraphs efficiently

Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs

Semitotal Domination on AT-Free Graphs and Circle Graphs

On treewidth and minimum fill-in of asteroidal triple-free graphs

A note on the geodetic number and the Steiner number of AT-free graphs

Computing the branchwidth of interval graphs

The combinatorics of N.G. de Bruijn

On retracts, absolute retracts, and foldings in cographs

Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences

On efficient absorbant conjecture in generalized De Bruijn digraphs

Edge-clique covers of the tensor product

Complexity of Paired Domination in AT-free and Planar Graphs

Treewidth and pathwidth of permutation graphs

Measuring the vulnerability for classes of intersection graphs

On maximum independent set of categorical product and ultimate categorical ratios of graphs

Approximating the Bandwidth for Asteroidal Triple-Free Graphs

On the complexity of the black-and-white coloring problem on some classes of perfect graphs

Block-graph width

On the Grundy number of Cameron graphs

Fixed-parameter complexity of λ-labelings

Suchergebnisse filtern