UB Paderborn / Katalog / Suche / in CDI

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on computer science logic (csl) and the twenty-ninth annual acm/ieee symposium on logic in computer science (lics), 2014, p.1-10

2014

Link zum Volltext

Verfügbarkeit prüfen

Matching Connectivity: On the Structure of Graphs with Perfect Matchings

Electronic notes in discrete mathematics, 2017-08, Vol.61, p.505-511

2017

Link zum Volltext

Verfügbarkeit prüfen

Majority Colourings of Digraphs

The Electronic journal of combinatorics, 2017-05, Vol.24 (2)

2017

Link zum Volltext

Verfügbarkeit prüfen

1 – 25 von 149

Suche als RSS-Feed

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(68)
Mit Volltextzugriff
(145)

Publikationsform

1 weiteren anzeigen...

Weniger anzeigen...

Sprache

Erscheinungsjahr

n.n

Thema

Science & Technology
(70)
Technology
(53)
Computer Science
(50)
Computer Science, Theory & Methods
(47)
Mathematics
(22)
Logic
(16)
Physical Sciences
(16)
Literature: History & Criticism
(15)
Applied Sciences
(14)
Computer Science; Control Theory; Systems
(14)
Exact Sciences And Technology
(14)
Theoretical Computing
(12)
Science & Technology - Other Topics
(11)
Life Sciences & Biomedicine
(9)
Mathematics, Applied
(9)
Polynomials
(9)
Algorithms
(7)
Male
(6)
Animals
(5)
British And Irish Literature
(5)

15 weitere anzeigen...

Weniger anzeigen...

Menü

Weitere Dienste

Einstellungen

Deciding First-Order Properties of Nowhere Dense Graphs

Digraph measures: Kelly decompositions, games, and orderings

On the Parameterized Intractability of Monadic Second-Order Logic

Model-Checking on Ordered Structures

Lower Bounds for the Complexity of Monadic Second-Order Logic

An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem

Excluding a planar matching minor in bipartite graphs

Complexity and monotonicity results for domination games

Deciding first-order properties of nowhere dense graphs

Coloring and Covering Nowhere Dense Graphs

Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes

DAG-width is PSPACE-complete

First-Order and Monadic Second-Order Model-Checking on Ordered Structures

Digraph decompositions and monotonicity in digraph searching

Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes

First-Order Interpretations of Bounded Expansion Classes

Routing with congestion in acyclic digraphs

The dag-width of directed graphs

Directed elimination games

Quantitative Monadic Second-Order Logic

Graph operations on parity games and polynomial-time algorithms

E. Grädel, P.G. Kolaitis, L. Libkin, M. Marx, J. Spencer, M.Y. Vardi, Y. Venema and S. Weinstein. Finite model theory and its applications. Texts in Theoretical Computer Science. Springer, Berlin, 2007, xiii + 437 pp

On Hanf-equivalence and the number of embeddings of small induced subgraphs

Matching Connectivity: On the Structure of Graphs with Perfect Matchings

Majority Colourings of Digraphs

Suchergebnisse filtern