| Almost Linear Time Algorithms for Minsum K-Sink Problems on Dynamic Flow Path Networks
|
2020 |
Higashikawa, Yuya |
| Two-Stage Pricing Strategy with Price Discount in Online Social Networks
|
2020 |
Yuan, He |
| On Unit Read-Once Resolutions and Copy Complexity
|
2020 |
Wojciechowski, P. |
| Mechanism Design for Facility Location Games with Candidate Locations
|
2020 |
Tang, Zhongzheng |
| Fractional Maker-Breaker Resolving Game
|
2020 |
Yi, Eunjeong |
| Novel Algorithms for Maximum DS Decomposition
|
2020 |
Chen, Shengminjie |
| Data Sensing with Limited Mobile Sensors in Sweep Coverage
|
2020 |
Nie, Zixiong |
| Trip-Vehicle Assignment Algorithms for Ride-Sharing
|
2020 |
Li, Songhua |
| Inductive Graph Invariants and Algorithmic Applications
|
2020 |
Subramanian, C. R. |
| FISSION: A Practical Algorithm for Computing Minimum Balanced Node Separators
|
2020 |
Blum, Johannes |
| A Sub-linear Time Algorithm for Approximating k-Nearest-Neighbor with Full Quality Guarantee
|
2020 |
Ma, Hengzhao |
| Energy-Constrained Drone Delivery Scheduling
|
2020 |
Papa, Rafael |
| Matched Participants Maximization Based on Social Spread
|
2020 |
Rao, Guoyao |
| Mixed-Case Community Detection Problem in Social Networks
|
2020 |
Zhang, Yapu |
| The Small Set Vertex Expansion Problem
|
2020 |
Maity, Soumen |
| An Improved Exact Algorithm for the Exact Satisfiability Problem
|
2020 |
Hoi, Gordon |
| On the Complexity of Some Facet-Defining Inequalities of the QAP-Polytope
|
2020 |
Aurora, Pawan |
| Hardness of Segment Cover, Contiguous SAT and Visibility with Uncertain Obstacles
|
2020 |
Alipour, Sharareh |
| Vertex Fault-Tolerant Spanners for Weighted Points in Polygonal Domains
|
2020 |
Inkulu, R. |
| Competitive Analysis for Two Variants of Online Metric Matching Problem
|
2020 |
Itoh, Toshiya |
Tag hinzufügen