| Linear-Time Algorithms for Eliminating Claws in Graphs
|
2020 |
Bonomo-Braberman, Flavia |
| A New Lower Bound for the Eternal Vertex Cover Number of Graphs
|
2020 |
Babu, Jasine |
| Deep Specification Mining with Attention
|
2020 |
Cao, Zhi |
| An Optimal Lower Bound for Hierarchical Universal Solutions for TSP on the Plane
|
2020 |
Eades, Patrick |
| Shortest Watchman Tours in Simple Polygons Under Rotated Monotone Visibility
|
2020 |
Nilsson, Bengt J. |
| k-Critical Graphs in Ps-Free Graphs
|
2020 |
Cameron, Kathie |
| New Symmetry-less ILP Formulation for the Classical One Dimensional Bin-Packing Problem
|
2020 |
Salem, Khadija Hadj |
| On the Restricted 1-Steiner Tree Problem
|
2020 |
Bose, Prosenjit |
| Parallelized Maximization of Nonsubmodular Function Subject to a Cardinality Constraint
|
2020 |
Zhang, Hongxiang |
| Approximating Maximum Acyclic Matchings by Greedy and Local Search Strategies
|
2020 |
Baste, Julien |
| On the Complexity of Directed Intersection Representation of DAGs
|
2020 |
Caucchiolo, Andrea |
| Mixing of Markov Chains for Independent Sets on Chordal Graphs with Bounded Separators
|
2020 |
Bezáková, Ivona |
| 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 |
Tag hinzufügen