| End-Vertices of AT-free Bigraphs
|
2020 |
Gorzny, Jan |
| Computational Complexity Characterization of Protecting Elections from Bribery
|
2020 |
Chen, Lin |
| How Hard Is Completeness Reasoning for Conjunctive Queries?
|
2020 |
Liu, Xianmin |
| Seamless Interpolation Between Contraction Hierarchies and Hub Labels for Fast and Space-Efficient Shortest Path Queries in Road Networks
|
2020 |
Funke, Stefan |
| Imbalance Parameterized by Twin Cover Revisited
|
2020 |
Misra, Neeldhara |
| Access Structure Hiding Secret Sharing from Novel Set Systems and Vector Families
|
2020 |
Sehrawat, D. Vipin Singh |
| Power of Decision Trees with Monotone Queries
|
2020 |
Amireddy, Prashanth |
| A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs
|
2020 |
Beyer, Stephan |
| Uniqueness of DP-Nash Subgraphs and D-sets in Weighted Graphs of Netflix Games
|
2020 |
Gutin, Gregory |
| Computational Complexity of Synchronization Under Regular Commutative Constraints
|
2020 |
Hoffmann, Stefan |
| Approximate Set Union via Approximate Randomization
|
2020 |
Fu, Bin |
| Even Better Fixed-Parameter Algorithms for Bicluster Editing
|
2020 |
Lafond, Manuel |
| Fixed Parameter Tractability of Graph Deletion Problems over Data Streams
|
2020 |
Bishnu, Arijit |
| 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 |
Tag hinzufügen