| Parameterized Inapproximability of Independent Set in H-Free Graphs
|
2020 |
Dvorak, Pavel |
| Treewidth Versus Clique Number in Graph Classes with a Forbidden Structure
|
2020 |
Dallard, Clément |
| Degree Distribution for Duplication-Divergence Graphs: Large Deviations
|
2020 |
Frieze, Alan |
| Finding Large Matchings in 1-Planar Graphs of Minimum Degree 3
|
2020 |
Biedl, Therese |
| Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width
|
2020 |
Benjamin, Bergougnoux |
| Combinatorial Bounds for Conflict-Free Coloring on Open Neighborhoods
|
2020 |
Bhyravarapu, Sriram |
| Edge Elimination and Weighted Graph Classes
|
2020 |
Beisegel, Jesse |
| Plattenbauten: Touching Rectangles in Space
|
2020 |
Felsner, Stefan |
| Recognizing k-Clique Extendible Orderings
|
2020 |
Francis, Mathew |
| Linear-Time Recognition of Double-Threshold Graphs
|
2020 |
Kobayashi, Yusuke |
| Bitonic st-Orderings for Upward Planar Graphs: The Variable Embedding Setting
|
2020 |
Angelini, Patrizio |
| Inserting One Edge into a Simple Drawing Is Hard
|
2020 |
Arroyo, Alan |
| 2.5-Connectivity: Unique Components, Critical Graphs, and Applications
|
2020 |
Heinrich, Irene |
| Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space
|
2020 |
Nederlof, Jesper |
| Clique-Width of Point Configurations
|
2020 |
Cagirict, Onur |
| On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings
|
2020 |
Belmonte, Rémy |
| Knot Diagrams of Treewidth Two
|
2020 |
Bodlaender, Hans L. |
| On Finding Balanced Bicliques via Matchings
|
2020 |
Chalermsook, Parinya |
| Drawing Graphs as Spanners
|
2020 |
Aichholzer, Oswin |
| Stable Structure on Safe Set Problems in Vertex-Weighted Graphs II — Recognition and Complexity
|
2020 |
Fujita, Shinya |
Tag hinzufügen