E-LIB Suche - Ergebnisse für: Siebertz, Sebastian

1

Data Reduction for Directed Feedback Vertex Set on Graphs W..:

, In: Lecture Notes in Computer Science; SOFSEM 2024: Theory and Practice of Computer Science,

Dirks, Jona ; Gerhard, Enna ; Grobler, Mario.. - p. 183-197 , 2024

2

Discrepancy and sparsity:

Grobler, Mario ; Jiang, Yiting ; Ossona de Mendez, Patrice..
Journal of Combinatorial Theory, Series B. 169 (2024) - p. 96-133 , 2024

Link: https://doi.org/10.1016/..

3

Descriptive complexity of learning

Aachen, RWTH Aachen University, 2023

Bergerem, Steffen van , 2023

Link: https://nbn-resolving.de..

4

Fine-Grained Parameterized Algorithms on Width Parameters a..:

Hegerfeld, Falko , 2023

Link: https://nbn-resolving.de..

5

First-Order Model Checking on Structurally Sparse Graph Cla..:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,

Dreier, Jan ; Mählmann, Nikolas ; Siebertz, Sebastian - p. 567-580 , 2023

Link: https://dl.acm.org/doi/1..

6

Token Sliding on Graphs of Girth Five:

Bartier, Valentin ; Bousquet, Nicolas ; Hanna, Jihad..
Algorithmica. 86 (2023) 2 - p. 638-655 , 2023

Link: https://doi.org/10.1007/..

7

First-Order Logic with Connectivity Operators:

Schirrmacher, Nicole ; Siebertz, Sebastian ; Vigny, Alexandre
ACM Transactions on Computational Logic. , 2023

Link: https://doi.org/10.1145/..

8

Preface:

Král, Daniel ; Pilipczuk, Michał ; Siebertz, Sebastian.
European Journal of Combinatorics. , 2023

Link: https://doi.org/10.1016/..

9

Modulo-counting first-order logic on bounded expansion clas..:

Nešetřil, Jaroslav ; Ossona de Mendez, Patrice ; Siebertz, Sebastian
Discrete Mathematics. , 2023

Link: https://doi.org/10.1016/..

10

Distributed domination on sparse graph classes:

Heydt, Ozan ; Kublenz, Simeon ; Ossona de Mendez, Patrice..
European Journal of Combinatorics. , 2023

Link: https://doi.org/10.1016/..

11

On the Parameterized Complexity of Reconfiguration of Conne..:

Lokshtanov, Daniel ; Mouawad, Amer E. ; Panolan, Fahad.
Algorithmica. 84 (2022) 2 - p. 482-509 , 2022

Link: https://doi.org/10.1007/..

12

Local Planar Domination Revisited:

, In: Structural Information and Communication Complexity; Lecture Notes in Computer Science,

Heydt, Ozan ; Siebertz, Sebastian ; Vigny, Alexandre - p. 154-173 , 2022

Link: https://doi.org/10.1007/..

13

Transducing paths in graph classes with unbounded shrubdept:

Ossona de Mendez, Patrice ; Pilipczuk, Michał ; Siebertz, Sebastian
European Journal of Combinatorics. , 2022

Link: https://doi.org/10.1016/..

14

Token Sliding on Graphs of Girth Five:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,

Bartier, Valentin ; Bousquet, Nicolas ; Hanna, Jihad.. - p. 56-69 , 2022

Link: https://doi.org/10.1007/..

15

Classes of graphs with low complexity: The case of classes ..:

Nešetřil, Jaroslav ; Ossona de Mendez, Patrice ; Rabinovich, Roman.
European Journal of Combinatorics. 91 (2021) - p. 103223 , 2021

Link: https://doi.org/10.1016/..