| 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. |
| Geometric Planar Networks on Bichromatic Points
|
2020 |
Bandyapadhyay, Sayan |
| A-Convexity Number and 4-Number of Graphs and Graph Products
|
2020 |
Anand, Bijo S. |
| Indicated Coloring of Complete Expansion and Lexicographic Product of Graphs
|
2020 |
Francis, P. |
| Ramsey Numbers for Line Graphs
|
2020 |
Abbasi, Huzaifa |
| On Cartesian Products of Signed Graphs
|
2020 |
Lajou, Dimitri |
| List Distinguishing Number of pth Power of Hypercube and Cartesian Powers of a Graph
|
2020 |
Chandran, L. Sunil |
| On the Minimum Satisfiability Problem
|
2020 |
Arif, Umair |
| Waiting for Trains: Complexity Results
|
2020 |
Tauer, Bjoern |
| New Algorithms and Bounds for Halving Pseudolines
|
2020 |
Bereg, Sergey |
| Complexity of Restricted Variant of Star Colouring
|
2020 |
Shalu, M. A. |
Tag hinzufügen