| Approximating Modular Decomposition Is Hard
|
2020 |
Habib, Michel |
| Monitoring the Edges of a Graph Using Distances
|
2020 |
Foucaud, Florent |
| Hardness Results of Global Total k-Domination Problem in Graphs
|
2020 |
Panda, B. S. |
| Hardness and Approximation for the Geodetic Set Problem in Some Graph Classes
|
2020 |
Chakraborty, Dibyayan |
| Weak Roman Bondage Number of a Graph
|
2020 |
Pushpam, P. Roushini Leely |
| Self-centeredness of Generalized Petersen Graphs
|
2020 |
Singh, Priyanka |
| Arbitrary Pattern Formation by Opaque Fat Robots with Lights
|
2020 |
Bose, Kaustav |
| On the Parameterized Complexity of Spanning Trees with Small Vertex Covers
|
2020 |
Kaur, Chamanvir |
| Algorithms for Radon Partitions with Tolerance
|
2020 |
Bereg, Sergey |
| Planar Projections of Graphs
|
2020 |
Aravind, N. R. |
| Complexity of Restricted Variant of Star Colouring
|
2020 |
Shalu, M. A. |
| Partitioning Cographs into Two Forests and One Independent Set
|
2020 |
Hell, Pavol |
| The Lexicographic Method for the Threshold Cover Problem. .
|
2020 |
Francis, Mathew C. |
| Vertex-Edge Domination in Unit Disk Graphs
|
2020 |
Jena, Sangram K. |
| Maximum Weighted Edge Biclique Problem on Bipartite Graphs
|
2020 |
Pandey, Arti |
| On the Geodetic and Hull Numbers of Shadow Graphs
|
2020 |
Chandran, S. V. Ullas |
| Smallest C2/+1-Critical Graphs of Odd-Girth 2k +1 Laurent Beaudou, Florent Foucaud, and Reza Naserasr
|
2020 |
Beaudou, Laurent |
| The Relative Oriented Clique Number of Triangle-Free Planar Graphs Is 10
|
2020 |
Das, Soura Sena |
| Oriented Diameter of Star Graphs
|
2020 |
Kumar, K. S. Ajish |
| 0-1 Timed Matching in Bipartite Temporal Graphs
|
2020 |
Mandal, Subhrangsu |
Tag hinzufügen