| 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 |
| 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 |
| Linearizable Special Cases of the Quadratic Shortest Path Problem
|
2021 |
Cela, Eranda |
| Bears with Hats and Independence Polynomials
|
2021 |
Blažej, Václav |
| Acyclic, Star, and Injective Colouring: Bounding the Diameter
|
2021 |
Brause, Christoph |
| On Fair Covering and Hitting Problems.
|
2021 |
Bandyapadhyay, Sayan |
| On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem
|
2021 |
Mannens, Isja |
Tag hinzufügen