| Block Elimination Distance
|
2021 |
Diner, Öznur Yasar |
| FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More
|
2021 |
Jansen, Bart M. P. |
| Disjoint Stable Matchings in Linear Time
|
2021 |
Ganesh, Aadityan |
| The Complexity of Gerrymandering over Graphs: Paths and Trees
|
2021 |
Bentert, Matthias |
| On Morphing 1-Planar Drawings
|
2021 |
Angelini, Patrizio |
| Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on Graphs
|
2021 |
Fomin, Fedor V. |
| On Additive Spanners in Weighted Graphs with Local Error
|
2021 |
Ahmed, Reyan |
| On 3-Coloring of (2P4, C5)-Free Graphs
|
2021 |
Jelinek, Vit |
| Preventing Small (s,t)-Cuts by Protecting Edges
|
2021 |
Grüttemeier, Niels |
| Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set
|
2021 |
Donkers, Huib |
| Odd Cycle Transversal in Mixed Graphs
|
2021 |
Das, Avinandan |
| Completion to Chordal Distance-Hereditary Graphs: A Quartic Vertex-Kernel
|
2021 |
Crespelle, Christophe |
| Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality
|
2021 |
Rymar, Maciej |
| The Largest Connected Subgraph Game
|
2021 |
Bensmail, Julien |
| Parameterized Complexity of BANDwIDTH of Caterpillars and WEIGHTED PATH EMULATION
|
2021 |
Bodlaender, Hans L. |
| Complementation in T-perfect Graphs
|
2021 |
Cao, Yixin |
| On Subgraph Complementation to H-free Graphs
|
2021 |
Antony, Dhanyamol |
| The Perfect Matching Cut Problem Revisited
|
2021 |
Le, Van Bang |
| Feedback Vertex Set on Hamiltonian Graphs
|
2021 |
Cavallaro, Dario |
| The Dynamic Complexity of Acyclic Hypergraph Homomorophisms
|
2021 |
Vortmeier, Nils |
Tag hinzufügen