| Token Sliding on Graphs of Girth Five
|
2022 |
Bartier, Valentin |
| Disjoint Compatibility via Graph Classes
|
2022 |
Aichholzer, Oswin |
| Recognition of Linear and Star Variants of Leaf Powers is in P
|
2022 |
Benjamin, Bergougnoux |
| Polychromatic Colorings of Unions of Geometric Hypergraphs
|
2022 |
Chekan, Vera |
| Parameterized Complexity of Weighted Multicut in Trees
|
2022 |
Galby, Esther |
| The Complexity of Contracting Bipartite Graphs into Small Cycles
|
2022 |
Krithika, R. |
| Polynomial-Delay and Polynomial-Space Enumeration of Large Maximal Matchings
|
2022 |
Kobayashi, Yasuaki |
| Classifying Subset Feedback Vertex Set for H-Free Graphs
|
2022 |
Paesani, Giacomo |
| Parameterized Complexity of Graph Planarity with Restricted Cyclic Orders
|
2022 |
Liotta, Giuseppe |
| Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts
|
2022 |
Brand, Cornelius |
| Finding k-Secluded Trees Faster
|
2022 |
Donkers, Huib |
| Kernelization for Feedback Vertex Set via Elimination Distance to a Forest
|
2022 |
Dekker, David |
| The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs
|
2022 |
Goeßmann, Ina |
| Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs
|
2022 |
Martin, Barnaby |
| Linearizing Partial Search Orders
|
2022 |
Scheffler, Robert |
| Minimal Roman Dominating Functions: Extensions and Enumeration
|
2022 |
Abu-Khzam, Faisal N. |
| Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable (Extended Abstract)
|
2022 |
Arvind, Vikraman |
| Twin-Width and Transductions of Proper k-Mixed-Thin Graphs
|
2022 |
Balabán, Jakub |
| An Algorithmic Framework for Locally Constrained Homomorphisms
|
2022 |
Bulteau, Laurent |
| Generalized k-Center: Distinguishing Doubling and Highway Dimension
|
2022 |
Feldmann, Andreas Emil |
Tag hinzufügen