| On the Existence of EFX Allocations
|
2022 |
Chaudhury, Bhaskar Ray |
| Approximating Subset Sum Ratio via Subset Sum Computations
|
2022 |
Alonistiotis, Giannis |
| An Adjacency Labeling Scheme Based on a Decomposition of Trees into Caterpillars
|
2022 |
Banerijee, Avah |
| Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex Resolution
|
2022 |
Bekos, Michael A. |
| Space-Efficient B Trees via Load-Balancing
|
2022 |
I, Tomohiro |
| Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings
|
2022 |
Mieno, Takuya |
| Linear Time Construction of Indexable Elastic Founder Graphs
|
2022 |
Rizzo, Nicola |
| Lower Bounds for Restricted Schemes in the Two-Adaptive Bitprobe Model
|
2022 |
Aggarwal, Sreshth |
| Faster Algorithm for Finding Maximum 1-Restricted Simple 2-Matchings
|
2022 |
Artamonov, Stepan |
| Lower Bounds on the Performance of Online Algorithms for Relaxed Packing Problems
|
2022 |
Balogh, János |
| Tukey Depth Histograms
|
2022 |
Bertschinger, Daniel |
| On the Intractability Landscape of Digraph Intersection Representations
|
2022 |
Caucchiolo, Andrea |
| The RED-BLUE SEPARATION Problem on Graphs
|
2022 |
Dev, Subhadeep Ranjan |
| Harmless Sets in Sparse Classes
|
2022 |
Drange, Pål Grønås |
| Using Edge Contractions and Vertex Deletions to Reduce the Independence Number and the Clique Number
|
2022 |
Lucke, Felicia |
| On Relative Clique Number of Triangle-Free Planar Colored Mixed Graphs
|
2022 |
Nandi, Soumen |
| On Critical Node Problems with Vulnerable Vertices
|
2022 |
Schestag, Jannik |
| Winner Determination Algorithms for Graph Games with Matching Structures
|
2022 |
Yoshiwatari, Kanae |
| l-Extendability of Independent Sets
|
2022 |
Bergé, Pierre |
| List Covering of Regular Multigraphs
|
2022 |
Bok, Jan |
Tag hinzufügen