| Problems Hard for Treewidth but Easy for Stable Gonality
|
2022 |
Bodlaender, Hans L. |
| s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs
|
2022 |
Chakraborty, Dibyayan |
| On the Minimum Cycle Cover Problem on Graphs with Bounded Co-degeneracy
|
2022 |
Duarte, Gabriel L. |
| Bounding Threshold Dimension: Realizing Graphic Boolean Functions as the AND of Majority Gates
|
2022 |
Francis, Mathew C. |
| On the Lossy Kernelization for Connected Treedepth Deletion Set
|
2022 |
Eiben, Eduard |
| Bounding Twin-Width for Bounded-Treewidth Graphs, Planar Graphs, and Bipartite Graphs
|
2022 |
Jacob, Hugo |
| Computing List Homomorphisms in Geometric Intersection Graphs
|
2022 |
Kisfaludi-Bak, Sandor |
| On Anti-stochastic Properties of Unlabeled Graphs
|
2022 |
Kiselev, Sergei |
| Algorithmic Aspects of Small Quasi-Kernels
|
2022 |
Langlois, Hèléne |
| Minimum Weight Euclidean (1 + g)-Spanners
|
2022 |
Tóth, Csaba D. |
| 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 |
Tag hinzufügen