| Online Bin Packing with Overload Cost
|
2021 |
Luo, Kelin |
| New Variants of Perfect Non-crossing Matchings
|
2021 |
Mantas, Ioannis |
| Axiomatic Characterization of the Median Function of a Block Graph
|
2021 |
Changat, Manoj |
| On Coupon Coloring of Cartesian Product of Some Graphs
|
2021 |
Francis, P. |
| Cut Vertex Transit Functions of Hypergraphs
|
2021 |
Changat, Manoj |
| On Degree Sequences and Eccentricities in Pseudoline Arrangement Graphs
|
2021 |
Das, Sandip |
| Chromatic Bounds for the Subclasses of $$pK_2$$-Free Graphs
|
2021 |
Prashant, Athmakoori |
| Achieving Positive Rates with Predetermined Dictionaries
|
2021 |
Ganesan, Ghurumuruhan |
| Failure and Communication in a Synchronized Multi-drone System
|
2021 |
Bereg, Sergey |
| 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 |
| 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 |
Tag hinzufügen