| 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 |
| A Heuristic Approach to the Treedepth Decomposition Problem for Large Graphs
|
2021 |
Swat, Sylwester |
| A Linear-Time Parameterized Algorithm for Computing the Width ofa DAG
|
2021 |
Caceres, Manuel |
| Beyond Helly Graphs: The Diameter Problem on Absolute Retracts
|
2021 |
Ducoffe, Guillaume |
| The Graphs of Stably Matchable Pairs
|
2021 |
Eppstein, David |
| Labeling Schemes for Deterministic Radio Multi-broadcast
|
2021 |
Krisko, Colin |
| 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 |
Tag hinzufügen