| 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. |
| 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 |
Tag hinzufügen