| Approaching Optimal Duplicate Detection in a Sliding Window
|
2020 |
Géraud-Stewart, Rémi |
| On the Enumeration of Minimal Non-pairwise Compatibility Graphs
|
2020 |
Azam, Naveed Ahmed |
| Election Control Through Social Influence with Unknown Preferences
|
2020 |
Mehrizi, Mohammad Abouei |
| On the Area Requirements of Planar Greedy Drawings of Triconnected Planar Graphs
|
2020 |
Lozzo, Giordano Da |
| An Improved Bregman k-means++ Algorithm via Local Search
|
2020 |
Tian, Xiaoyun |
| On Measures of Space over Real and Complex Numbers
|
2020 |
Prakash, Om |
| Approximation Algorithms for the Lower-Bounded k-Median and Its Generalizations
|
2020 |
Han, Lu |
| Visibility Polygon Queries Among Dynamic Polygonal Obstacles in Plane
|
2020 |
Agrawal, Sanjana |
| Path-Monotonic Upward Drawings of Graphs
|
2020 |
Hong, Seok-Hee |
| Quantum Speedup for the Minimum Steiner Tree Problem
|
2020 |
Miyamoto, Masayuki |
| Approximation Algorithms for Car-Sharing Problems
|
2020 |
Luo, Kelin |
| Tight Approximation for the Minimum Bottleneck Generalized Matching Problem
|
2020 |
Mestre, Julián |
| Subspace Approximation with Outliers
|
2020 |
Deshpande, Amit |
| Bounded-Degree Spanners in the Presence of Polygonal Obstacles
|
2020 |
Renssen, André van |
| Coding with Noiseless Feedback over the Z-Channel
|
2020 |
Deppe, Christian |
| Local Routing in a Tree Metric 1-Spanner
|
2020 |
Brankovic, Milutin |
| W[1]-Hardness of the k-Center Problem Parameterized by the Skeleton Dimension
|
2020 |
Blum, Johannes |
| Constructing Independent Spanning Trees in Alternating Group Networks
|
2020 |
Huang, Jie-Fu |
| Computing a Maximum Clique in Geometric Superclasses of Disk Graphs
|
2020 |
Grelier, Nicolas |
| Realization Problems on Reachability Sequences
|
2020 |
Dippel, Matthew |
Tag hinzufügen