| 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 |
| 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 |
| Cause I’m a Genial Imprecise Point: Outlier Detection for Uncertain Data
|
2021 |
Keikha, Vahideh |
| On the Intersections of Non-homotopic Loops
|
2021 |
Blažej, Václav |
| The Connected Domination Number of Grids
|
2021 |
Srinivasan, Adarsh |
| Experimental Evaluation of a Local Search Approximation Algorithm for the Multiway Cut Problem
|
2021 |
Bloch-Hansen, Andrew |
| Algorithmic Analysis of Priority-Based Bin Packing
|
2021 |
Wojciechowski, Piotr |
| Recursive Methods for Some Problems in Coding and Random Permutations
|
2021 |
Ganesan, Ghurumuruhan |
| Lexicographic Product of Digraphs and Related Boundary-Type Sets
|
2021 |
Changat, Manoj |
Tag hinzufügen