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

Contact Representations of Planar Graphs: Extending a Partial Representation is Hard

Graph-Theoretic Concepts in Computer Science, 2014, Vol.8747, p.139-151

2014

Volltextzugriff (PDF)

On the Number of Connected Sets in Bounded Degree Graphs

Graph-Theoretic Concepts in Computer Science, 2014, Vol.8747, p.336-347

2014

Volltextzugriff (PDF)

DMVP: Foremost Waypoint Coverage of Time-Varying Graphs

Graph-Theoretic Concepts in Computer Science, 2014, Vol.8747, p.29-41

2014

Volltextzugriff (PDF)

Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract)

Graph-Theoretic Concepts in Computer Science, 2014, Vol.8747, p.1-14

2014

Volltextzugriff (PDF)

Distributedly Testing Cycle-Freeness

Graph-Theoretic Concepts in Computer Science, 2014, Vol.8747, p.15-28

2014

Volltextzugriff (PDF)

Minimum Spanning Tree Verification Under Uncertainty

Graph-Theoretic Concepts in Computer Science, 2014, Vol.8747, p.164-175

2014

Volltextzugriff (PDF)

Independent Set Reconfiguration in Cographs

Graph-Theoretic Concepts in Computer Science, 2014, Vol.8747, p.105-116

2014

Volltextzugriff (PDF)

Boxicity and Separation Dimension

Graph-Theoretic Concepts in Computer Science, 2014, Vol.8747, p.81-92

2014

Volltextzugriff (PDF)

The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results

Graph-Theoretic Concepts in Computer Science, 2014, Vol.8747, p.372-383

2014

Volltextzugriff (PDF)

Parameterized Edge Hamiltonicity

Graph-Theoretic Concepts in Computer Science, 2014, Vol.8747, p.348-359

2014

Volltextzugriff (PDF)

Between Treewidth and Clique-Width

Graph-Theoretic Concepts in Computer Science, 2014, Vol.8747, p.396-407

2014

Volltextzugriff (PDF)

Parameterized Algorithms for Graph Partitioning Problems

Graph-Theoretic Concepts in Computer Science, 2014, Vol.8747, p.384-395

2014

Volltextzugriff (PDF)

Vertex Contact Graphs of Paths on a Grid

Graph-Theoretic Concepts in Computer Science, 2014, Vol.8747, p.56-68

2014

Volltextzugriff (PDF)

Maximal Induced Matchings in Triangle-Free Graphs

Graph-Theoretic Concepts in Computer Science, 2014, Vol.8747, p.93-104

2014

Volltextzugriff (PDF)

A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs

Graph-Theoretic Concepts in Computer Science, 2014, Vol.8747, p.408-419

2014

Volltextzugriff (PDF)

Hadwiger Number of Graphs with Small Chordality

Graph-Theoretic Concepts in Computer Science, 2014, Vol.8747, p.201-213

2014

Volltextzugriff (PDF)

Towards the Hanani-Tutte Theorem for Clustered Graphs

Graph-Theoretic Concepts in Computer Science, 2014, Vol.8747, p.176-188

2014

Volltextzugriff (PDF)

Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs

Graph-Theoretic Concepts in Computer Science, 2014, Vol.8747, p.238-249

2014

Volltextzugriff (PDF)

Polynomial Time Recognition of Squares of Ptolemaic Graphs and 3-sun-free Split Graphs

Graph-Theoretic Concepts in Computer Science, 2014, Vol.8747, p.360-371

2014

Volltextzugriff (PDF)

Linear Rank-Width of Distance-Hereditary Graphs

Graph-Theoretic Concepts in Computer Science, 2014, Vol.8747, p.42-55

2014

Volltextzugriff (PDF)

Induced Disjoint Paths in Circular-Arc Graphs in Linear Time

Graph-Theoretic Concepts in Computer Science, 2014, Vol.8747, p.225-237

2014

Volltextzugriff (PDF)

Graph-TSP from Steiner Cycles

Graph-Theoretic Concepts in Computer Science, 2014, Vol.8747, p.312-323

2014

Volltextzugriff (PDF)

End-Vertices of Graph Search Algorithms

Algorithms and Complexity, 2015, Vol.9079, p.300-312

2015

Volltextzugriff (PDF)

A Characterization of Mixed Unit Interval Graphs

Graph-Theoretic Concepts in Computer Science, 2014, Vol.8747, p.324-335

2014

Volltextzugriff (PDF)

On Set Expansion Problems and the Small Set Expansion Conjecture

Graph-Theoretic Concepts in Computer Science, 2014, Vol.8747, p.189-200

2014

Volltextzugriff (PDF)

1 – 25 von 42

Menü

Weitere Dienste

Einstellungen

Contact Representations of Planar Graphs: Extending a Partial Representation is Hard

On the Number of Connected Sets in Bounded Degree Graphs

DMVP: Foremost Waypoint Coverage of Time-Varying Graphs

Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract)

Distributedly Testing Cycle-Freeness

Minimum Spanning Tree Verification Under Uncertainty

Independent Set Reconfiguration in Cographs

Boxicity and Separation Dimension

The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results

Parameterized Edge Hamiltonicity

Between Treewidth and Clique-Width

Parameterized Algorithms for Graph Partitioning Problems

Vertex Contact Graphs of Paths on a Grid

Maximal Induced Matchings in Triangle-Free Graphs

A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs

Hadwiger Number of Graphs with Small Chordality

Towards the Hanani-Tutte Theorem for Clustered Graphs

Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs

Polynomial Time Recognition of Squares of Ptolemaic Graphs and 3-sun-free Split Graphs

Linear Rank-Width of Distance-Hereditary Graphs

Induced Disjoint Paths in Circular-Arc Graphs in Linear Time

Graph-TSP from Steiner Cycles

End-Vertices of Graph Search Algorithms

A Characterization of Mixed Unit Interval Graphs

On Set Expansion Problems and the Small Set Expansion Conjecture

Aktive Filter

Suchergebnisse filtern