On Structural Parameterizations of Load Coloring

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International Conference on Algorithms and Discrete Applied Mathematics (7. : 2021 : Online) Algorithms and discrete applied mathematics
1. Verfasser: Reddy, I. Vinod (VerfasserIn)
Format: UnknownFormat
Sprache:eng
Veröffentlicht: 2021
Schlagworte:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Titel Jahr Verfasser
Approximation Algorithms for Orthogonal Line Centers 2021 Das, Arun Kumar
Burning Grids and Intervals 2021 Gupta, Arya Tanmay
Semitotal Domination on AT-Free Graphs and Circle Graphs 2021 Kloks, Ton
On Parameterized Complexity of Liquid Democracy 2021 Dey, Palash
One-Sided Discrete Terrain Guarding and Chordal Graphs 2021 Prahlad Narasimhan, Kasthurirangan
Cops and Robber on Butterflies and Solid Grids 2021 Akhtar, Sheikh Shakil
On Algorithms to Find p-ordering 2021 Gulati, Aditya
b-Coloring of Some Powers of Hypercubes 2021 Francis, P.
Minimum Consistent Subset of Simple Graph Classes 2021 Dey, Sanjana
On Structural Parameterizations of Load Coloring 2021 Reddy, I. Vinod
A Worst-Case Optimal Algorithm to Compute the Minkowski Sum of Convex Polytopes 2021 Das, Sandip
On cd-Coloring of Trees and Co-bipartite Graphs 2021 Shalu, M. A.
On the Connectivity and the Diameter of Betweenness-Uniform Graphs 2021 Hartman, David
Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products 2021 Kowaluk, Mirosław
Balanced Connected Graph Partition 2021 Jana, Satyabrata
Template-Driven Rainbow Coloring of Proper Interval Graphs 2021 Chandran, L. Sunil
Scheduling Trains with Small Stretch on a Unidirectional Line 2021 Garg, Apoorv
Algorithmic Aspects of Total Roman and Total Double Roman Domination in Graphs 2021 Padamutham, Chakradhar
Acyclic Coloring Parameterized by Directed Clique-Width 2021 Gurski, Frank
Parameterized Complexity of Locally Minimal Defensive Alliances 2021 Gaikwad, Ajinkya
Alle Artikel auflisten