| Approximation Algorithms for Cost-Robust Discrete Minimization Problems Based on Their LP-Relaxations
|
2020 |
Elbassioni, Khaled |
| Probabilistically Faulty Searching on a Half-Line: (Extended Abstract)
|
2020 |
Bonato, Anthony |
| Query Minimization Under Stochastic Uncertainty
|
2020 |
Chaplick, Steven |
| Suffix Trees, DAWGs and CDAWGs for Forward and Backward Tries
|
2020 |
Inenaga, Shunsuke |
| Towards a Definitive Measure of Repetitiveness
|
2020 |
Kociumaka, Tomasz |
| Shortest Rectilinear Path Queries to Rectangles in a Rectangular Domain
|
2020 |
Kim, Mincheol |
| On the Collection of Fringe Subtrees in Random Binary Trees
|
2020 |
Benkner, Louisa Seelbach |
| Binary Decision Diagrams: From Tree Compaction to Sampling
|
2020 |
Clément, Julien |
| On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number
|
2020 |
Blair, Jean R. S. |
| Dynamically Optimal Self-adjusting Single-Source Tree Networks
|
2020 |
Avin, Chen |
| Tight Bounds on Sensitivity and Block Sensitivity of Some Classes of Transitive Functions
|
2020 |
Chaubal, Siddhesh |
| On Symmetry and Initialization for Neural Networks
|
2020 |
Nachum, Ido |
| Lower Bounds for Max-Cut via Semidefinite Programming
|
2020 |
Carlson, Charles |
| On Minimal-Perimeter Lattice Animals
|
2020 |
Barequet, Gill |
| A Method to Prove the Nonrationality of Some Combinatorial Generating Functions
|
2020 |
Bóna, Miklós |
| On Some Subclasses of Split B1-EPG Graphs
|
2020 |
Deniz, Zakir |
| Near-Linear Time Algorithm for Approximate Minimum Degree Spanning Trees
|
2020 |
Duan, Ran |
| Maximizing Happiness in Graphs of Bounded Clique-Width
|
2020 |
Bliznets, Ivan |
| Batched Predecessor and Sorting with Size-Priced Information in External Memory
|
2020 |
Bender, Michael A. |
| An Ω(n3) Lower Bound on the Number of Cell Crossings for Weighted Shortest Paths in 3-Dimensional Polyhedral Structures
|
2020 |
Bauernöppel, Frank |
Tag hinzufügen