| Guarding Quadrangulations and Stacked Triangulations with Edges
|
2020 |
Jungeblut, Paul |
| Graph Isomorphism Restricted by Lists
|
2020 |
Klavik, Pavel |
| Clique-Width: Harnessing the Power of Atoms
|
2020 |
Dabrowski, Konrad K. |
| Well-Partitioned Chordal Graphs: Obstruction Set and Disjoint Paths
|
2020 |
Ahn, Jungho |
| Universal Geometric Graphs
|
2020 |
Frati, Fabrizio |
| Feedback Edge Sets in Temporal Graphs
|
2020 |
Haag, Roman |
| Computing Subset Transversals in H-Free Graphs
|
2020 |
Brettell, Nick |
| On Flips in Planar Matchings
|
2020 |
Milich, Marcel |
| Strong Cliques in Diamond-Free Graphs
|
2020 |
Chiarelli, Nina |
| Characterization and Linear-Time Recognition of Paired Threshold Graphs
|
2020 |
Cao, Yixin |
| The Linear Arboricity Conjecture for 3-Degenerate Graphs
|
2020 |
Basavaraju, Manu |
| 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 |
| Weighted Additive Spanners
|
2020 |
Ahmed, Reyan |
| Combinatorial Bounds for Conflict-Free Coloring on Open Neighborhoods
|
2020 |
Bhyravarapu, Sriram |
Tag hinzufügen